From c1077927aac934dda476d112aa79c7e60fd7e4cb Mon Sep 17 00:00:00 2001
From: "github-actions[bot]"
<41898282+github-actions[bot]@users.noreply.github.com>
Date: Mon, 7 Sep 2026 03:03:55 +0000
Subject: [PATCH 1/2] chore(catalog): scheduled auto-regenerate
Refresh COURSE_CATALOG.generated.{json,md} + CATALOG-STATUS markers.
Catalog is owned by automation; agents must not regenerate it on feature branches (see .claude/rules/catalog-pr-hygiene.md, #2433, #10136).
---
COURSE_CATALOG.generated.json | 1718 ++++++++++-------
COURSE_CATALOG.generated.md | 1142 +++++------
MyIA.AI.Notebooks/GameTheory/README.md | 6 +-
MyIA.AI.Notebooks/GenAI/README.md | 6 +-
MyIA.AI.Notebooks/ML/README.md | 6 +-
MyIA.AI.Notebooks/Probas/README.md | 6 +-
.../QuantConnect/Python/README.md | 6 +-
MyIA.AI.Notebooks/QuantConnect/README.md | 6 +-
MyIA.AI.Notebooks/README.md | 6 +-
MyIA.AI.Notebooks/RL/README.md | 6 +-
MyIA.AI.Notebooks/Search/README.md | 6 +-
MyIA.AI.Notebooks/Sudoku/README.md | 6 +-
docs/archive/reference/HEALTH_DASHBOARD.md | 37 +-
docs/curriculum/genai.md | 19 +-
docs/curriculum/ia-classique.md | 124 +-
docs/curriculum/recherche.md | 233 +--
docs/curriculum/trading.md | 126 +-
17 files changed, 1916 insertions(+), 1543 deletions(-)
diff --git a/COURSE_CATALOG.generated.json b/COURSE_CATALOG.generated.json
index 2ae0be6b12..a6ee29393c 100644
--- a/COURSE_CATALOG.generated.json
+++ b/COURSE_CATALOG.generated.json
@@ -359,6 +359,36 @@
"requires_wsl": true,
"executable_locally": false
},
+ {
+ "path": "GameTheory/GameTheory-02c-Travelers-Dilemma.ipynb",
+ "title": "GameTheory-02c-Travelers-Dilemma",
+ "serie": "GameTheory",
+ "sous_serie": "",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "2b766abf6",
+ "executed_at": "2026-09-07T04:48:18+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "30min",
+ "owner_logique": "po-2024",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 32,
+ "cells_code": 8,
+ "cells_markdown": 24,
+ "cells_with_outputs": 8,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "GameTheory/GameTheory-03-Topology2x2-Csharp.ipynb",
"title": "GameTheory-3 : Topologie des Jeux 2×2 — Twin C# (classification ordinale from-scratch)",
@@ -394,7 +424,7 @@
"title": "GameTheory-03-Topology2x2",
"serie": "GameTheory",
"sous_serie": "",
- "kernel": "Python (GameTheory WSL + OpenSpiel)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
@@ -694,7 +724,7 @@
"title": "GameTheory-04-NashEquilibrium",
"serie": "GameTheory",
"sous_serie": "",
- "kernel": "Python (GameTheory WSL + OpenSpiel)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
@@ -703,15 +733,15 @@
"last_success_sha": "6b97c987c",
"executed_at": "2026-08-30T09:10:19+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
+ "duree_estimee": "30min",
"owner_logique": "po-2024",
"last_validation": "2026-08-30",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#13313, #13385",
- "cells_total": 50,
- "cells_code": 22,
- "cells_markdown": 28,
- "cells_with_outputs": 15,
+ "cells_total": 36,
+ "cells_code": 14,
+ "cells_markdown": 22,
+ "cells_with_outputs": 8,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -809,6 +839,36 @@
"requires_wsl": false,
"executable_locally": false
},
+ {
+ "path": "GameTheory/GameTheory-04d-Marchandage-Asymetrique.ipynb",
+ "title": "GameTheory-04d-Marchandage-Asymetrique",
+ "serie": "GameTheory",
+ "sous_serie": "",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "036a7a564",
+ "executed_at": "2026-09-06T23:13:27+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "30min",
+ "owner_logique": "po-2024",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 19,
+ "cells_code": 10,
+ "cells_markdown": 9,
+ "cells_with_outputs": 9,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "GameTheory/GameTheory-04e-Reflective-Oracles.ipynb",
"title": "GameTheory 04e — Oracles réflexifs, décision causale et équilibre de Nash",
@@ -874,7 +934,7 @@
"title": "GameTheory-05-ZeroSum-Minimax",
"serie": "GameTheory",
"sous_serie": "",
- "kernel": "Python (GameTheory WSL + OpenSpiel)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
@@ -888,9 +948,9 @@
"last_validation": "2026-08-23",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#11840, #12241",
- "cells_total": 33,
+ "cells_total": 38,
"cells_code": 14,
- "cells_markdown": 19,
+ "cells_markdown": 24,
"cells_with_outputs": 7,
"cells_without_outputs": 0,
"requires_api": false,
@@ -1204,7 +1264,7 @@
"title": "GameTheory 8 - Jeux Combinatoires",
"serie": "GameTheory",
"sous_serie": "",
- "kernel": "Python (GameTheory WSL + OpenSpiel)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
@@ -1294,7 +1354,7 @@
"title": "GameTheory 8c - Jeux Combinatoires : Approfondissement Python",
"serie": "GameTheory",
"sous_serie": "",
- "kernel": "Python (GameTheory WSL + OpenSpiel)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
@@ -2069,6 +2129,36 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "GameTheory/GameTheory-15e-Coalition-Power-SMT.ipynb",
+ "title": "GameTheory-15e — Pouvoir coalitionnel : calcul, SMT borné et preuve",
+ "serie": "GameTheory",
+ "sous_serie": "",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "5dc0b1635",
+ "executed_at": "2026-09-06T15:05:52+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "30min",
+ "owner_logique": "po-2024",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 30,
+ "cells_code": 11,
+ "cells_markdown": 19,
+ "cells_with_outputs": 8,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "GameTheory/GameTheory-16-MechanismDesign-Csharp.ipynb",
"title": "GameTheory-16-MechanismDesign (C#)",
@@ -2104,7 +2194,7 @@
"title": "GameTheory-16 : Théorie des Mécanismes et Principe de Revelation",
"serie": "GameTheory",
"sous_serie": "",
- "kernel": "Python (GameTheory WSL + OpenSpiel)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
@@ -3228,10 +3318,10 @@
"last_validation": "2026-08-23",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#12128, #12131",
- "cells_total": 38,
- "cells_code": 15,
+ "cells_total": 39,
+ "cells_code": 16,
"cells_markdown": 23,
- "cells_with_outputs": 10,
+ "cells_with_outputs": 11,
"cells_without_outputs": 0,
"requires_api": true,
"requires_gpu": true,
@@ -5053,7 +5143,7 @@
"last_success_sha": "1960782c5",
"executed_at": "2026-08-22T14:57:33+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "30min",
+ "duree_estimee": "45min",
"owner_logique": "po-2025",
"last_validation": "2026-08-22",
"last_validator": "jsboige@gmail.com",
@@ -5063,8 +5153,8 @@
"cells_markdown": 13,
"cells_with_outputs": 5,
"cells_without_outputs": 0,
- "requires_api": true,
- "requires_gpu": false,
+ "requires_api": false,
+ "requires_gpu": true,
"requires_cloud": false,
"requires_wsl": false,
"executable_locally": false
@@ -5148,10 +5238,10 @@
"last_validation": "2026-09-05",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#13581, #14431",
- "cells_total": 35,
- "cells_code": 15,
- "cells_markdown": 20,
- "cells_with_outputs": 15,
+ "cells_total": 37,
+ "cells_code": 16,
+ "cells_markdown": 21,
+ "cells_with_outputs": 16,
"cells_without_outputs": 0,
"requires_api": true,
"requires_gpu": false,
@@ -5309,6 +5399,36 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "GenAI/Integrations-DotNet/Aspire/09-Aspire-Harness-CopilotSdk.ipynb",
+ "title": "Aspire : le harness Copilot SDK — CopilotClient, session, SessionEvent en C#",
+ "serie": "GenAI",
+ "sous_serie": "Integrations-DotNet",
+ "kernel": ".NET (C#)",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "251d43b83",
+ "executed_at": "2026-09-06T04:30:57+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 29,
+ "cells_code": 11,
+ "cells_markdown": 18,
+ "cells_with_outputs": 6,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "GenAI/Integrations-DotNet/CopilotSDK/01-GitHub-Copilot-SDK-Binding.ipynb",
"title": "GitHub Copilot SDK en C# : binding, streaming, Scrutor",
@@ -5418,9 +5538,9 @@
"last_validation": "2026-08-29",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#12127, #13434",
- "cells_total": 23,
+ "cells_total": 27,
"cells_code": 11,
- "cells_markdown": 12,
+ "cells_markdown": 16,
"cells_with_outputs": 7,
"cells_without_outputs": 1,
"requires_api": true,
@@ -6510,8 +6630,8 @@
"executable_locally": false
},
{
- "path": "GenAI/PostTraining/PT_11_grpo_qwen35_rlvr.ipynb",
- "title": "PT-11 — GRPO + RLVR sur Qwen3.5-0.8B : la série PostTraining quitte le toy env",
+ "path": "GenAI/PostTraining/PT_11a_grpo_qwen35_rlvr.ipynb",
+ "title": "PT-11a — GRPO + RLVR sur Qwen3.5-0.8B : la série PostTraining quitte le toy env",
"serie": "GenAI",
"sous_serie": "PostTraining",
"kernel": "Python 3 (coursia-ml-training)",
@@ -6520,14 +6640,14 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "273905b51",
- "executed_at": "2026-08-28T15:07:29+02:00",
+ "last_success_sha": "e119f18fc",
+ "executed_at": "2026-09-05T20:39:42+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-28",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11112, #13343",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
"cells_total": 29,
"cells_code": 13,
"cells_markdown": 16,
@@ -6540,8 +6660,8 @@
"executable_locally": false
},
{
- "path": "GenAI/PostTraining/PT_11_grpo_qwen_rlvr_on_verifiers.ipynb",
- "title": "PT-11 — RLVR sur VRAI LLM (Qwen3.5-0.8B) + rewardspy.watch ONLINE + Z3 Tier-1 verifier",
+ "path": "GenAI/PostTraining/PT_11b_grpo_qwen_rlvr_on_verifiers.ipynb",
+ "title": "PT-11b — RLVR sur VRAI LLM (Qwen3.5-0.8B) + rewardspy.watch ONLINE + Z3 Tier-1 verifier",
"serie": "GenAI",
"sous_serie": "PostTraining",
"kernel": "Python (coursia-ml-training)",
@@ -6550,14 +6670,14 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "86e5ff7dc",
- "executed_at": "2026-08-23T15:12:36+02:00",
+ "last_success_sha": "e119f18fc",
+ "executed_at": "2026-09-05T20:39:42+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-23",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11271, #12028",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
"cells_total": 36,
"cells_code": 16,
"cells_markdown": 20,
@@ -6570,28 +6690,28 @@
"executable_locally": false
},
{
- "path": "GenAI/PostTraining/PT_11b_multiseed_qwen35_4x100.ipynb",
- "title": "PT-11b — RLVR multi-seed sur Qwen3.5-0.8B (4 seeds × 100 steps)",
+ "path": "GenAI/PostTraining/PT_11c_grpo_qwen17_rlvr.ipynb",
+ "title": "PT-11c — RLVR sur Qwen3-1.7B/2B (cran au-dessus de 0.8B)",
"serie": "GenAI",
"sous_serie": "PostTraining",
- "kernel": "Python (coursia-ml-training)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "ALPHA",
"editorial": "ALPHA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "59f7f79fa",
- "executed_at": "2026-08-31T19:49:56+02:00",
+ "last_success_sha": "f806550e0",
+ "executed_at": "2026-09-03T23:05:26+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-31",
- "last_validator": "jessynoo@gmail.com",
- "issue_pr_associee": "#13589, #13606",
- "cells_total": 38,
- "cells_code": 17,
- "cells_markdown": 21,
- "cells_with_outputs": 14,
+ "last_validation": "2026-09-03",
+ "last_validator": "jsboige@gmail.com",
+ "issue_pr_associee": "#13891, #14272",
+ "cells_total": 34,
+ "cells_code": 15,
+ "cells_markdown": 19,
+ "cells_with_outputs": 12,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": true,
@@ -6600,28 +6720,28 @@
"executable_locally": false
},
{
- "path": "GenAI/PostTraining/PT_11c_grpo_qwen17_rlvr.ipynb",
- "title": "PT-11c — RLVR sur Qwen3-1.7B/2B (cran au-dessus de 0.8B)",
+ "path": "GenAI/PostTraining/PT_11d_multiseed_qwen35_4x100.ipynb",
+ "title": "PT-11d — RLVR multi-seed sur Qwen3.5-0.8B (4 seeds × 100 steps)",
"serie": "GenAI",
"sous_serie": "PostTraining",
- "kernel": "Python 3",
+ "kernel": "Python (coursia-ml-training)",
"status": "READY",
"maturity": "ALPHA",
"editorial": "ALPHA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "f806550e0",
- "executed_at": "2026-09-03T23:05:26+02:00",
+ "last_success_sha": "e119f18fc",
+ "executed_at": "2026-09-05T20:39:42+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-09-03",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#13891, #14272",
- "cells_total": 34,
- "cells_code": 15,
- "cells_markdown": 19,
- "cells_with_outputs": 12,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 38,
+ "cells_code": 17,
+ "cells_markdown": 21,
+ "cells_with_outputs": 14,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": true,
@@ -10428,10 +10548,10 @@
"last_validation": "2026-08-31",
"last_validator": "jessynoo@gmail.com",
"issue_pr_associee": "#13822",
- "cells_total": 20,
- "cells_code": 7,
- "cells_markdown": 13,
- "cells_with_outputs": 6,
+ "cells_total": 25,
+ "cells_code": 9,
+ "cells_markdown": 16,
+ "cells_with_outputs": 8,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": true,
@@ -12588,9 +12708,9 @@
"last_validation": "2026-09-02",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#12422, #14338",
- "cells_total": 48,
+ "cells_total": 54,
"cells_code": 19,
- "cells_markdown": 29,
+ "cells_markdown": 35,
"cells_with_outputs": 19,
"cells_without_outputs": 0,
"requires_api": false,
@@ -12990,24 +13110,24 @@
"executable_locally": true
},
{
- "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day5-DS-Star/Lab14-Token-Usage.ipynb",
- "title": "Lab 14 : Tracabilite de la consommation — le contrat C6 rend l'usage LLM observable",
+ "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day5-DS-Star/Lab12b-Sequential-Orchestration.ipynb",
+ "title": "Lab 12b : Désignation séquentielle — le contrat C4, l'orchestrateur explicite au-dessus d'ADK",
"serie": "ML",
"sous_serie": "DataScienceWithAgents",
"kernel": "Python 3",
- "status": "READY",
+ "status": "DEMO",
"maturity": "BETA",
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "ac2e8b54c",
- "executed_at": "2026-09-05T04:11:30+02:00",
+ "last_success_sha": "f88b304e9",
+ "executed_at": "2026-09-05T14:52:08+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "30min",
"owner_logique": "po-2023",
- "last_validation": "2026-09-05",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#14690",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
"cells_total": 23,
"cells_code": 8,
"cells_markdown": 15,
@@ -13020,28 +13140,28 @@
"executable_locally": false
},
{
- "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day5-DS-Star/Lab18-Session-Persistence.ipynb",
- "title": "Lab 18: Persistance d'etat de session - une conversation qui se souvient",
+ "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day5-DS-Star/Lab12c-Agent-Handoff.ipynb",
+ "title": "Lab 12c : Handoff entre agents — le contrat C5, le transfert natif câblé et observable",
"serie": "ML",
"sous_serie": "DataScienceWithAgents",
- "kernel": "Python 3 (ipykernel)",
+ "kernel": "Python 3",
"status": "DEMO",
"maturity": "BETA",
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "4bb767e38",
- "executed_at": "2026-09-04T09:02:15+02:00",
+ "last_success_sha": "f88b304e9",
+ "executed_at": "2026-09-05T14:52:08+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "30min",
"owner_logique": "po-2023",
- "last_validation": "2026-09-04",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#14058, #14568",
- "cells_total": 27,
- "cells_code": 10,
- "cells_markdown": 17,
- "cells_with_outputs": 7,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 23,
+ "cells_code": 8,
+ "cells_markdown": 15,
+ "cells_with_outputs": 5,
"cells_without_outputs": 0,
"requires_api": true,
"requires_gpu": false,
@@ -13050,8 +13170,8 @@
"executable_locally": false
},
{
- "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day6-MLE-Star/Lab13-Web-Search-SOTA.ipynb",
- "title": "Lab 13: Web Search pour Modèles SOTA (MLE-STAR Component)",
+ "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day5-DS-Star/Lab12d-Token-Usage.ipynb",
+ "title": "Lab 12d : Tracabilite de la consommation — le contrat C6 rend l'usage LLM observable",
"serie": "ML",
"sous_serie": "DataScienceWithAgents",
"kernel": "Python 3",
@@ -13060,43 +13180,103 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "8f6f8394c",
- "executed_at": "2026-08-28T03:24:29+02:00",
+ "last_success_sha": "8c70dd66d",
+ "executed_at": "2026-09-06T15:13:09+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "30min",
"owner_logique": "po-2023",
- "last_validation": "2026-08-28",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11168, #12824",
- "cells_total": 33,
- "cells_code": 12,
- "cells_markdown": 21,
- "cells_with_outputs": 9,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 23,
+ "cells_code": 8,
+ "cells_markdown": 15,
+ "cells_with_outputs": 5,
"cells_without_outputs": 0,
- "requires_api": false,
+ "requires_api": true,
"requires_gpu": false,
"requires_cloud": false,
"requires_wsl": false,
- "executable_locally": true
+ "executable_locally": false
},
{
- "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day6-MLE-Star/Lab14-Ablation-Refinement.ipynb",
- "title": "Lab 14: Ablation et Raffinement Ciblé (MLE-STAR Component)",
+ "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day5-DS-Star/Lab12e-Session-Persistence.ipynb",
+ "title": "Lab 12e: Persistance d'etat de session - une conversation qui se souvient",
"serie": "ML",
"sous_serie": "DataScienceWithAgents",
- "kernel": "Python 3",
- "status": "READY",
- "maturity": "ALPHA",
- "editorial": "ALPHA",
+ "kernel": "Python 3 (ipykernel)",
+ "status": "DEMO",
+ "maturity": "BETA",
+ "editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "8f6f8394c",
- "executed_at": "2026-08-28T03:24:29+02:00",
+ "last_success_sha": "8c70dd66d",
+ "executed_at": "2026-09-06T15:13:09+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "30min",
"owner_logique": "po-2023",
- "last_validation": "2026-08-28",
- "last_validator": "jsboige@gmail.com",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 27,
+ "cells_code": 10,
+ "cells_markdown": 17,
+ "cells_with_outputs": 7,
+ "cells_without_outputs": 0,
+ "requires_api": true,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": false
+ },
+ {
+ "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day6-MLE-Star/Lab13-Web-Search-SOTA.ipynb",
+ "title": "Lab 13: Web Search pour Modèles SOTA (MLE-STAR Component)",
+ "serie": "ML",
+ "sous_serie": "DataScienceWithAgents",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "8f6f8394c",
+ "executed_at": "2026-08-28T03:24:29+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "30min",
+ "owner_logique": "po-2023",
+ "last_validation": "2026-08-28",
+ "last_validator": "jsboige@gmail.com",
+ "issue_pr_associee": "#11168, #12824",
+ "cells_total": 33,
+ "cells_code": 12,
+ "cells_markdown": 21,
+ "cells_with_outputs": 9,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
+ {
+ "path": "ML/DataScienceWithAgents/Track2-GoogleADK/Day6-MLE-Star/Lab14-Ablation-Refinement.ipynb",
+ "title": "Lab 14: Ablation et Raffinement Ciblé (MLE-STAR Component)",
+ "serie": "ML",
+ "sous_serie": "DataScienceWithAgents",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "ALPHA",
+ "editorial": "ALPHA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "8f6f8394c",
+ "executed_at": "2026-08-28T03:24:29+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "30min",
+ "owner_logique": "po-2023",
+ "last_validation": "2026-08-28",
+ "last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#11168, #12824",
"cells_total": 32,
"cells_code": 13,
@@ -13889,6 +14069,66 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "Probas/Applications/Percolation/Percolation-Lean.ipynb",
+ "title": "Percolation-Lean — le noyau fini de percolation, prouvé en Lean 4",
+ "serie": "Probas",
+ "sous_serie": "Applications",
+ "kernel": "Lean 4 (WSL, percolation)",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "4d810ed07",
+ "executed_at": "2026-09-06T21:44:01+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "30min",
+ "owner_logique": "po-2023",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 24,
+ "cells_code": 9,
+ "cells_markdown": 15,
+ "cells_with_outputs": 9,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
+ {
+ "path": "Probas/Applications/Percolation/Percolation-Supercritique.ipynb",
+ "title": "Percolation supercritique : le géant au-dessus du seuil",
+ "serie": "Probas",
+ "sous_serie": "Applications",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "ALPHA",
+ "editorial": "ALPHA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "8e5e000b0",
+ "executed_at": "2026-09-07T03:59:50+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "30min",
+ "owner_logique": "po-2023",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 34,
+ "cells_code": 11,
+ "cells_markdown": 23,
+ "cells_with_outputs": 8,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "Probas/DecisionTheory/Causal-Bridges/Do-Calculus-Bridge.ipynb",
"title": "Du graphe causal au do-calculus — le pont entre les quatre séries causales",
@@ -13908,9 +14148,9 @@
"last_validation": "2026-09-04",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#14463, #14514",
- "cells_total": 29,
+ "cells_total": 30,
"cells_code": 10,
- "cells_markdown": 19,
+ "cells_markdown": 20,
"cells_with_outputs": 6,
"cells_without_outputs": 0,
"requires_api": false,
@@ -14598,10 +14838,10 @@
"last_validation": "2026-08-31",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#12107, #12366",
- "cells_total": 68,
- "cells_code": 23,
- "cells_markdown": 45,
- "cells_with_outputs": 20,
+ "cells_total": 72,
+ "cells_code": 25,
+ "cells_markdown": 47,
+ "cells_with_outputs": 22,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -14669,36 +14909,6 @@
"requires_wsl": false,
"executable_locally": true
},
- {
- "path": "Probas/Infer-101.ipynb",
- "title": "Infer-101 : Introduction a Infer.NET",
- "serie": "Probas",
- "sous_serie": "",
- "kernel": ".NET (C#)",
- "status": "READY",
- "maturity": "BETA",
- "editorial": "BETA",
- "reproducibility": "EXECUTED",
- "scientific_review": "UNREVIEWED",
- "last_success_sha": "596955d1a",
- "executed_at": "2026-08-23T00:45:46+02:00",
- "forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "1h",
- "owner_logique": "po-2023",
- "last_validation": "2026-08-23",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11947, #12065",
- "cells_total": 71,
- "cells_code": 28,
- "cells_markdown": 43,
- "cells_with_outputs": 28,
- "cells_without_outputs": 0,
- "requires_api": false,
- "requires_gpu": false,
- "requires_cloud": false,
- "requires_wsl": false,
- "executable_locally": true
- },
{
"path": "Probas/Infer/Infer-1-Setup.ipynb",
"title": "Infer-1-Setup : Introduction et Installation",
@@ -15029,6 +15239,36 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "Probas/Infer/Infer-1b-Premiers-Modeles.ipynb",
+ "title": "Infer-1b : Introduction a Infer.NET",
+ "serie": "Probas",
+ "sous_serie": "Infer",
+ "kernel": ".NET (C#)",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "91d264a0b",
+ "executed_at": "2026-09-06T21:43:43+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "1h",
+ "owner_logique": "po-2023",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 71,
+ "cells_code": 28,
+ "cells_markdown": 43,
+ "cells_with_outputs": 28,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "Probas/Infer/Infer-2-Gaussian-Mixtures.ipynb",
"title": "Infer-2-Gaussian-Mixtures : Distributions Gaussiennes et Mélanges",
@@ -16056,9 +16296,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16086,9 +16326,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16146,9 +16386,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16176,9 +16416,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16206,9 +16446,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16236,9 +16476,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16266,9 +16506,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16296,9 +16536,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16326,9 +16566,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16356,9 +16596,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16416,9 +16656,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16446,9 +16686,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16476,9 +16716,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16506,9 +16746,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16536,9 +16776,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16626,9 +16866,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "READY",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16656,9 +16896,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "READY",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16686,9 +16926,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "READY",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16716,9 +16956,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "READY",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16769,6 +17009,36 @@
"requires_wsl": false,
"executable_locally": false
},
+ {
+ "path": "QuantConnect/Python/QC-Py-23c-TimesFM-Foundation-Models.ipynb",
+ "title": "QC-Py-23c — Modèles de fondation pour séries temporelles (TimesFM)",
+ "serie": "QuantConnect",
+ "sous_serie": "Python",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "da13579ca",
+ "executed_at": "2026-09-05T18:59:45+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2026",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 26,
+ "cells_code": 10,
+ "cells_markdown": 16,
+ "cells_with_outputs": 7,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": true,
+ "requires_wsl": false,
+ "executable_locally": false
+ },
{
"path": "QuantConnect/Python/QC-Py-24-Autoencoders-Anomaly.ipynb",
"title": "QC-Py-24 - Modèles Génératifs pour Anomaly Detection et Régimes",
@@ -16776,9 +17046,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16806,9 +17076,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16836,9 +17106,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "READY",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16866,9 +17136,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -16896,9 +17166,9 @@
"sous_serie": "Python",
"kernel": "Python 3",
"status": "DEMO",
- "maturity": "BETA",
+ "maturity": "DRAFT",
"editorial": "BETA",
- "reproducibility": "REPRODUCED",
+ "reproducibility": "UNTESTED",
"scientific_review": "UNREVIEWED",
"last_success_sha": "",
"executed_at": "",
@@ -17148,9 +17418,9 @@
"last_validation": "2026-09-05",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#14583, #14616",
- "cells_total": 34,
+ "cells_total": 35,
"cells_code": 13,
- "cells_markdown": 21,
+ "cells_markdown": 22,
"cells_with_outputs": 9,
"cells_without_outputs": 0,
"requires_api": false,
@@ -19338,9 +19608,9 @@
"last_validation": "2026-08-23",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#12597, #12603",
- "cells_total": 28,
+ "cells_total": 41,
"cells_code": 16,
- "cells_markdown": 12,
+ "cells_markdown": 25,
"cells_with_outputs": 13,
"cells_without_outputs": 0,
"requires_api": false,
@@ -19409,6 +19679,36 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "RL/rl_1b_bitwise_logic_synthesis.ipynb",
+ "title": "Synthese logique d'un controleur CartPole : le bitwise 4-regles",
+ "serie": "RL",
+ "sous_serie": "",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "42d9202ac",
+ "executed_at": "2026-09-06T14:09:37+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "30min",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 45,
+ "cells_code": 14,
+ "cells_markdown": 31,
+ "cells_with_outputs": 11,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "RL/rl_2_wrappers_sauvegarde_callbacks.ipynb",
"title": "Notebook 2 – Wrappers Gym, Sauvegarde/Chargement, Multiprocessing, Callbacks et Environnements Personnalisés",
@@ -19848,9 +20148,9 @@
"last_validation": "2026-09-05",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#14464, #14650",
- "cells_total": 28,
+ "cells_total": 31,
"cells_code": 12,
- "cells_markdown": 16,
+ "cells_markdown": 19,
"cells_with_outputs": 9,
"cells_without_outputs": 0,
"requires_api": false,
@@ -20238,9 +20538,9 @@
"last_validation": "2026-08-14",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#10923, #10965",
- "cells_total": 56,
+ "cells_total": 58,
"cells_code": 26,
- "cells_markdown": 30,
+ "cells_markdown": 32,
"cells_with_outputs": 21,
"cells_without_outputs": 0,
"requires_api": false,
@@ -21329,6 +21629,36 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "Search/Applications/Hybrid/App-30-OrbitalAssembly-Certificate-Audit.ipynb",
+ "title": "App-30 — Ordonnancement d'assemblage orbital",
+ "serie": "Search",
+ "sous_serie": "Applications",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "62c4ad79c",
+ "executed_at": "2026-09-07T02:55:47+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 42,
+ "cells_code": 15,
+ "cells_markdown": 27,
+ "cells_with_outputs": 15,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "Search/Applications/Hybrid/App-9-EdgeDetection.ipynb",
"title": "App-9 : Detection de bords par algorithmes génétiques",
@@ -21509,6 +21839,126 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "Search/Part1-Foundations/Search-01-StateSpace-Csharp.ipynb",
+ "title": "Search-1 : Espaces d'etats et formalisation de problemes (C# / .NET 9.0)",
+ "serie": "Search",
+ "sous_serie": "Part1-Foundations",
+ "kernel": ".NET (C#)",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 52,
+ "cells_code": 18,
+ "cells_markdown": 34,
+ "cells_with_outputs": 17,
+ "cells_without_outputs": 1,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
+ {
+ "path": "Search/Part1-Foundations/Search-01-StateSpace.ipynb",
+ "title": "Search-1 : Espaces d'etats et formulation de problemes",
+ "serie": "Search",
+ "sous_serie": "Part1-Foundations",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 52,
+ "cells_code": 19,
+ "cells_markdown": 33,
+ "cells_with_outputs": 14,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
+ {
+ "path": "Search/Part1-Foundations/Search-02-Uninformed-Csharp.ipynb",
+ "title": "Search-02-Uninformed (C#) : Algorithmes de Recherche Non Informée",
+ "serie": "Search",
+ "sous_serie": "Part1-Foundations",
+ "kernel": ".NET (C#)",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 40,
+ "cells_code": 15,
+ "cells_markdown": 25,
+ "cells_with_outputs": 15,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
+ {
+ "path": "Search/Part1-Foundations/Search-02-Uninformed.ipynb",
+ "title": "Search-02-Uninformed : Algorithmes de Recherche Non Informee",
+ "serie": "Search",
+ "sous_serie": "Part1-Foundations",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "1h",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 77,
+ "cells_code": 34,
+ "cells_markdown": 43,
+ "cells_with_outputs": 24,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "Search/Part1-Foundations/Search-02b-NetworkX-Csharp.ipynb",
"title": "Search-02b : Théorie des Graphes avec NetworkX (C#)",
@@ -21599,6 +22049,66 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "Search/Part1-Foundations/Search-03-Informed-Csharp.ipynb",
+ "title": "Search-03-Informed (C#) : Recherche Informée",
+ "serie": "Search",
+ "sous_serie": "Part1-Foundations",
+ "kernel": ".NET (C#)",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "35be38fac",
+ "executed_at": "2026-09-07T01:53:42+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 35,
+ "cells_code": 18,
+ "cells_markdown": 17,
+ "cells_with_outputs": 18,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
+ {
+ "path": "Search/Part1-Foundations/Search-03-Informed.ipynb",
+ "title": "Search-03-Informed : Algorithmes de Recherche Informée",
+ "serie": "Search",
+ "sous_serie": "Part1-Foundations",
+ "kernel": "Python 3",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "35be38fac",
+ "executed_at": "2026-09-07T01:53:42+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2025",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 75,
+ "cells_code": 27,
+ "cells_markdown": 48,
+ "cells_with_outputs": 23,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "Search/Part1-Foundations/Search-03b-PatternDatabases-Csharp.ipynb",
"title": "Search-03b (C#) — Bases de données de motifs (Pattern Databases) pour le 15-puzzle",
@@ -21810,28 +22320,28 @@
"executable_locally": false
},
{
- "path": "Search/Part1-Foundations/Search-09b-SpuriousMinima.ipynb",
- "title": "Search-09b : Minima fallacieux — le paysage de la relaxation SDP factorisée",
+ "path": "Search/Part1-Foundations/Search-04-LocalSearch-Csharp.ipynb",
+ "title": "Search-04-LocalSearch (C#) : Recherche Locale et Métaheuristiques",
"serie": "Search",
"sous_serie": "Part1-Foundations",
- "kernel": "Python 3",
+ "kernel": ".NET (C#)",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "dd3a4b5dc",
- "executed_at": "2026-09-01T04:45:59+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "15min",
+ "duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-09-01",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#13797",
- "cells_total": 15,
- "cells_code": 7,
- "cells_markdown": 8,
- "cells_with_outputs": 6,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 34,
+ "cells_code": 13,
+ "cells_markdown": 21,
+ "cells_with_outputs": 13,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -21840,8 +22350,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-09c-CombinatorialDiscrepancy.ipynb",
- "title": "Search-09c — Discrépance combinatoire : colorier ±1 sans déséquilibrer",
+ "path": "Search/Part1-Foundations/Search-04-LocalSearch.ipynb",
+ "title": "Search-04-LocalSearch : Recherche Locale et métaheuristiques",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -21850,48 +22360,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "9ec1d6423",
- "executed_at": "2026-09-04T02:20:19+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "15min",
+ "duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-09-04",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#14480",
- "cells_total": 21,
- "cells_code": 7,
- "cells_markdown": 14,
- "cells_with_outputs": 4,
- "cells_without_outputs": 0,
- "requires_api": false,
- "requires_gpu": false,
- "requires_cloud": false,
- "requires_wsl": false,
- "executable_locally": true
- },
- {
- "path": "Search/Part1-Foundations/Search-09d-Lean-Discrepancy-Komlos.ipynb",
- "title": "Search-09d — Discrépance combinatoire : la couche formelle (Komlós, Bansal–Jiang 2025)",
- "serie": "Search",
- "sous_serie": "Part1-Foundations",
- "kernel": "Lean 4 (WSL)",
- "status": "READY",
- "maturity": "BETA",
- "editorial": "BETA",
- "reproducibility": "EXECUTED",
- "scientific_review": "UNREVIEWED",
- "last_success_sha": "c302340f7",
- "executed_at": "2026-09-04T04:10:45+02:00",
- "forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
- "owner_logique": "po-2025",
- "last_validation": "2026-09-04",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11703, #14552",
- "cells_total": 39,
- "cells_code": 15,
- "cells_markdown": 24,
- "cells_with_outputs": 14,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 62,
+ "cells_code": 23,
+ "cells_markdown": 39,
+ "cells_with_outputs": 19,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -21900,8 +22380,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-1-StateSpace-Csharp.ipynb",
- "title": "Search-1 : Espaces d'etats et formalisation de problemes (C# / .NET 9.0)",
+ "path": "Search/Part1-Foundations/Search-05-GeneticAlgorithms-Csharp.ipynb",
+ "title": "Search-05-GeneticAlgorithms-Csharp : Algorithmes Génétiques en C#",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -21910,19 +22390,19 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "9bb9e8aa9",
- "executed_at": "2026-08-16T10:06:19+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-16",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11197, #11198, #11205",
- "cells_total": 52,
- "cells_code": 18,
- "cells_markdown": 34,
- "cells_with_outputs": 17,
- "cells_without_outputs": 1,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 29,
+ "cells_code": 13,
+ "cells_markdown": 16,
+ "cells_with_outputs": 13,
+ "cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
"requires_cloud": false,
@@ -21930,8 +22410,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-1-StateSpace.ipynb",
- "title": "Search-1 : Espaces d'etats et formulation de problemes",
+ "path": "Search/Part1-Foundations/Search-05-GeneticAlgorithms.ipynb",
+ "title": "Search-5 : Algorithmes génétiques",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -21940,18 +22420,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "9bb9e8aa9",
- "executed_at": "2026-08-16T10:06:19+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
+ "duree_estimee": "1h",
"owner_logique": "po-2025",
- "last_validation": "2026-08-16",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11197, #11198, #11205",
- "cells_total": 52,
- "cells_code": 19,
- "cells_markdown": 33,
- "cells_with_outputs": 14,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 81,
+ "cells_code": 33,
+ "cells_markdown": 48,
+ "cells_with_outputs": 28,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -21960,8 +22440,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-10-SymbolicAutomata-Csharp.ipynb",
- "title": "Search-10 (C#) : Automates Finis Classiques — jumeau .NET (tranche 1)",
+ "path": "Search/Part1-Foundations/Search-06-AdversarialSearch-Csharp.ipynb",
+ "title": "Search-6 — Recherche adversariale (jeux à somme nulle) — jumeau .NET",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -21970,18 +22450,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "e43c01587",
- "executed_at": "2026-08-29T03:32:26+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-29",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11840, #13357",
- "cells_total": 42,
- "cells_code": 15,
- "cells_markdown": 27,
- "cells_with_outputs": 15,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 23,
+ "cells_code": 10,
+ "cells_markdown": 13,
+ "cells_with_outputs": 10,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -21990,8 +22470,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-10-SymbolicAutomata.ipynb",
- "title": "Search-10 : Automates Symboliques avec Z3",
+ "path": "Search/Part1-Foundations/Search-06-AdversarialSearch.ipynb",
+ "title": "Search-06-AdversarialSearch : Recherche Adversariale",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -22000,18 +22480,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "708121a88",
- "executed_at": "2026-08-14T18:41:14+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-14",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#10923, #10965",
- "cells_total": 81,
- "cells_code": 24,
- "cells_markdown": 57,
- "cells_with_outputs": 19,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 44,
+ "cells_code": 16,
+ "cells_markdown": 28,
+ "cells_with_outputs": 10,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22020,8 +22500,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-11-Metaheuristics-Csharp.ipynb",
- "title": "Search-11 (C#) : Métaheuristiques — Optimisation par essaim, recuit et evolution",
+ "path": "Search/Part1-Foundations/Search-07-MCTS-And-Beyond-Csharp.ipynb",
+ "title": "Search-07-MCTS-And-Beyond (C#) : Monte Carlo Tree Search et Extensions",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -22030,18 +22510,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "57274b113",
- "executed_at": "2026-08-19T04:39:55+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-19",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11112, #11597",
- "cells_total": 35,
- "cells_code": 18,
- "cells_markdown": 17,
- "cells_with_outputs": 18,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 46,
+ "cells_code": 17,
+ "cells_markdown": 29,
+ "cells_with_outputs": 17,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22050,8 +22530,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-11-Metaheuristics.ipynb",
- "title": "Search-11-métaheuristiques : Optimisation avec MEALPy",
+ "path": "Search/Part1-Foundations/Search-07-MCTS-And-Beyond.ipynb",
+ "title": "Search-07-MCTS-And-Beyond : Monte Carlo Tree Search et Extensions",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -22060,18 +22540,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "59f7f79fa",
- "executed_at": "2026-08-31T19:49:56+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-31",
- "last_validator": "jessynoo@gmail.com",
- "issue_pr_associee": "#13589, #13606",
- "cells_total": 52,
- "cells_code": 21,
- "cells_markdown": 31,
- "cells_with_outputs": 17,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 43,
+ "cells_code": 16,
+ "cells_markdown": 27,
+ "cells_with_outputs": 11,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22080,8 +22560,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-11b-Metaheuristiques-Deep-Part2.ipynb",
- "title": "Search-11b (Part 2) : Particle Swarm Optimization (C# / .NET) — Tranche 2 : PSO",
+ "path": "Search/Part1-Foundations/Search-08-DancingLinks-Csharp.ipynb",
+ "title": "Search-08-DancingLinks-Csharp : L'algorithme X et Dancing Links de Knuth en C#",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -22090,48 +22570,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "7e90a21b6",
- "executed_at": "2026-08-04T07:09:28+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "30min",
+ "duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-04",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#8056, #9274",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
"cells_total": 22,
- "cells_code": 9,
- "cells_markdown": 13,
- "cells_with_outputs": 9,
- "cells_without_outputs": 0,
- "requires_api": false,
- "requires_gpu": false,
- "requires_cloud": false,
- "requires_wsl": false,
- "executable_locally": true
- },
- {
- "path": "Search/Part1-Foundations/Search-11b-Metaheuristiques-Deep-Part3.ipynb",
- "title": "Search-11b-Métaheuristiques-Deep-Part3 : Artificial Bee Colony (ABC) from-scratch",
- "serie": "Search",
- "sous_serie": "Part1-Foundations",
- "kernel": ".NET (C#)",
- "status": "READY",
- "maturity": "BETA",
- "editorial": "BETA",
- "reproducibility": "EXECUTED",
- "scientific_review": "UNREVIEWED",
- "last_success_sha": "7e90a21b6",
- "executed_at": "2026-08-04T07:09:28+02:00",
- "forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "30min",
- "owner_logique": "po-2025",
- "last_validation": "2026-08-04",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#8056, #9274",
- "cells_total": 24,
- "cells_code": 9,
- "cells_markdown": 15,
- "cells_with_outputs": 9,
+ "cells_code": 10,
+ "cells_markdown": 12,
+ "cells_with_outputs": 10,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22140,28 +22590,28 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-11b-Metaheuristiques-Deep-Part4.ipynb",
- "title": "Search-11b-Métaheuristiques-Deep-Part4 : Benchmark Comparatif (capstone)",
+ "path": "Search/Part1-Foundations/Search-08-DancingLinks.ipynb",
+ "title": "Search-08-DancingLinks : L'algorithme X et Dancing Links de Knuth",
"serie": "Search",
"sous_serie": "Part1-Foundations",
- "kernel": ".NET (C#)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "7e90a21b6",
- "executed_at": "2026-08-04T07:09:28+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "30min",
+ "duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-04",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#8056, #9274",
- "cells_total": 23,
- "cells_code": 9,
- "cells_markdown": 14,
- "cells_with_outputs": 9,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 60,
+ "cells_code": 21,
+ "cells_markdown": 39,
+ "cells_with_outputs": 17,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22170,8 +22620,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-11b-Metaheuristiques-Deep.ipynb",
- "title": "Search-11b : Métaheuristiques d'optimisation (C# / .NET) — Tranche 1 : Recuit simulé",
+ "path": "Search/Part1-Foundations/Search-09-LinearProgramming-Csharp.ipynb",
+ "title": "Search-9 : Programmation Linéaire et Simplexe (C# / .NET)",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -22180,18 +22630,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "7e90a21b6",
- "executed_at": "2026-08-04T07:09:28+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "30min",
+ "duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-04",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#8056, #9274",
- "cells_total": 19,
- "cells_code": 8,
- "cells_markdown": 11,
- "cells_with_outputs": 8,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 28,
+ "cells_code": 11,
+ "cells_markdown": 17,
+ "cells_with_outputs": 11,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22200,8 +22650,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-17-Empirical-Algorithm-Selection.ipynb",
- "title": "Search-17 — Sélection empirique d'algorithmes : deux terrains — Sudoku et Puissance 4",
+ "path": "Search/Part1-Foundations/Search-09-LinearProgramming.ipynb",
+ "title": "Search-09-LinearProgramming : Programmation Lineaire et Simplexe",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -22210,18 +22660,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "53989f977",
- "executed_at": "2026-09-01T20:59:46+02:00",
+ "last_success_sha": "a0cf4d9a2",
+ "executed_at": "2026-09-06T17:06:13+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-09-01",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#13754, #13833",
- "cells_total": 91,
- "cells_code": 27,
- "cells_markdown": 64,
- "cells_with_outputs": 24,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 47,
+ "cells_code": 18,
+ "cells_markdown": 29,
+ "cells_with_outputs": 13,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22230,11 +22680,11 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-2-Uninformed-Csharp.ipynb",
- "title": "Search-2-Uninformed (C#) : Algorithmes de Recherche Non Informée",
+ "path": "Search/Part1-Foundations/Search-09b-SpuriousMinima.ipynb",
+ "title": "Search-09b : Minima fallacieux — le paysage de la relaxation SDP factorisée",
"serie": "Search",
"sous_serie": "Part1-Foundations",
- "kernel": ".NET (C#)",
+ "kernel": "Python 3",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
@@ -22243,75 +22693,15 @@
"last_success_sha": "dd3a4b5dc",
"executed_at": "2026-09-01T04:45:59+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
+ "duree_estimee": "15min",
"owner_logique": "po-2025",
"last_validation": "2026-09-01",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#13797",
- "cells_total": 40,
- "cells_code": 15,
- "cells_markdown": 25,
- "cells_with_outputs": 15,
- "cells_without_outputs": 0,
- "requires_api": false,
- "requires_gpu": false,
- "requires_cloud": false,
- "requires_wsl": false,
- "executable_locally": true
- },
- {
- "path": "Search/Part1-Foundations/Search-2-Uninformed.ipynb",
- "title": "Search-2-Uninformed : Algorithmes de Recherche Non Informee",
- "serie": "Search",
- "sous_serie": "Part1-Foundations",
- "kernel": "Python 3",
- "status": "READY",
- "maturity": "BETA",
- "editorial": "BETA",
- "reproducibility": "EXECUTED",
- "scientific_review": "UNREVIEWED",
- "last_success_sha": "59f7f79fa",
- "executed_at": "2026-08-31T19:49:56+02:00",
- "forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "1h",
- "owner_logique": "po-2025",
- "last_validation": "2026-08-31",
- "last_validator": "jessynoo@gmail.com",
- "issue_pr_associee": "#13589, #13606",
- "cells_total": 77,
- "cells_code": 34,
- "cells_markdown": 43,
- "cells_with_outputs": 24,
- "cells_without_outputs": 0,
- "requires_api": false,
- "requires_gpu": false,
- "requires_cloud": false,
- "requires_wsl": false,
- "executable_locally": true
- },
- {
- "path": "Search/Part1-Foundations/Search-3-Informed-Csharp.ipynb",
- "title": "Search-3-Informed (C#) : Recherche Informée",
- "serie": "Search",
- "sous_serie": "Part1-Foundations",
- "kernel": ".NET (C#)",
- "status": "READY",
- "maturity": "BETA",
- "editorial": "BETA",
- "reproducibility": "EXECUTED",
- "scientific_review": "UNREVIEWED",
- "last_success_sha": "56886c61e",
- "executed_at": "2026-09-03T13:58:22+02:00",
- "forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
- "owner_logique": "po-2025",
- "last_validation": "2026-09-03",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#14061, #13797, #14448",
- "cells_total": 35,
- "cells_code": 18,
- "cells_markdown": 17,
- "cells_with_outputs": 18,
+ "cells_total": 15,
+ "cells_code": 7,
+ "cells_markdown": 8,
+ "cells_with_outputs": 6,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22320,8 +22710,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-3-Informed.ipynb",
- "title": "Search-3-Informed : Algorithmes de Recherche Informée",
+ "path": "Search/Part1-Foundations/Search-09c-CombinatorialDiscrepancy.ipynb",
+ "title": "Search-09c — Discrépance combinatoire : colorier ±1 sans déséquilibrer",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -22330,18 +22720,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "e2e283189",
- "executed_at": "2026-08-29T09:28:02+02:00",
+ "last_success_sha": "9ec1d6423",
+ "executed_at": "2026-09-04T02:20:19+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
+ "duree_estimee": "15min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-29",
+ "last_validation": "2026-09-04",
"last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#12465, #12512",
- "cells_total": 72,
- "cells_code": 26,
- "cells_markdown": 46,
- "cells_with_outputs": 22,
+ "issue_pr_associee": "#14480",
+ "cells_total": 21,
+ "cells_code": 7,
+ "cells_markdown": 14,
+ "cells_with_outputs": 4,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22350,58 +22740,28 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-4-LocalSearch-Csharp.ipynb",
- "title": "Search-4-LocalSearch (C#) : Recherche Locale et Métaheuristiques",
+ "path": "Search/Part1-Foundations/Search-09d-Lean-Discrepancy-Komlos.ipynb",
+ "title": "Search-09d — Discrépance combinatoire : la couche formelle (Komlós, Bansal–Jiang 2025)",
"serie": "Search",
"sous_serie": "Part1-Foundations",
- "kernel": ".NET (C#)",
+ "kernel": "Lean 4 (WSL)",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "0df85d511",
- "executed_at": "2026-09-02T20:49:54+02:00",
+ "last_success_sha": "c302340f7",
+ "executed_at": "2026-09-04T04:10:45+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-09-02",
+ "last_validation": "2026-09-04",
"last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#14037",
- "cells_total": 34,
- "cells_code": 13,
- "cells_markdown": 21,
- "cells_with_outputs": 13,
- "cells_without_outputs": 0,
- "requires_api": false,
- "requires_gpu": false,
- "requires_cloud": false,
- "requires_wsl": false,
- "executable_locally": true
- },
- {
- "path": "Search/Part1-Foundations/Search-4-LocalSearch.ipynb",
- "title": "Search-4-LocalSearch : Recherche Locale et métaheuristiques",
- "serie": "Search",
- "sous_serie": "Part1-Foundations",
- "kernel": "Python 3",
- "status": "READY",
- "maturity": "BETA",
- "editorial": "BETA",
- "reproducibility": "EXECUTED",
- "scientific_review": "UNREVIEWED",
- "last_success_sha": "59f7f79fa",
- "executed_at": "2026-08-31T19:49:56+02:00",
- "forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
- "owner_logique": "po-2025",
- "last_validation": "2026-08-31",
- "last_validator": "jessynoo@gmail.com",
- "issue_pr_associee": "#13589, #13606",
- "cells_total": 62,
- "cells_code": 23,
- "cells_markdown": 39,
- "cells_with_outputs": 19,
+ "issue_pr_associee": "#11703, #14552",
+ "cells_total": 39,
+ "cells_code": 15,
+ "cells_markdown": 24,
+ "cells_with_outputs": 14,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22410,8 +22770,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-5-GeneticAlgorithms-Csharp.ipynb",
- "title": "Search-5-GeneticAlgorithms-Csharp : Algorithmes Génétiques en C#",
+ "path": "Search/Part1-Foundations/Search-10-SymbolicAutomata-Csharp.ipynb",
+ "title": "Search-10 (C#) : Automates Finis Classiques — jumeau .NET (tranche 1)",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -22420,18 +22780,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "708121a88",
- "executed_at": "2026-08-14T18:41:14+02:00",
+ "last_success_sha": "e43c01587",
+ "executed_at": "2026-08-29T03:32:26+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
- "owner_logique": "po-2025",
- "last_validation": "2026-08-14",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#10923, #10965",
- "cells_total": 29,
- "cells_code": 13,
- "cells_markdown": 16,
- "cells_with_outputs": 13,
+ "owner_logique": "po-2025",
+ "last_validation": "2026-08-29",
+ "last_validator": "jsboige@gmail.com",
+ "issue_pr_associee": "#11840, #13357",
+ "cells_total": 42,
+ "cells_code": 15,
+ "cells_markdown": 27,
+ "cells_with_outputs": 15,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22440,8 +22800,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-5-GeneticAlgorithms.ipynb",
- "title": "Search-5 : Algorithmes génétiques",
+ "path": "Search/Part1-Foundations/Search-10-SymbolicAutomata.ipynb",
+ "title": "Search-10 : Automates Symboliques avec Z3",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -22450,18 +22810,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "59f7f79fa",
- "executed_at": "2026-08-31T19:49:56+02:00",
+ "last_success_sha": "708121a88",
+ "executed_at": "2026-08-14T18:41:14+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "1h",
+ "duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-31",
- "last_validator": "jessynoo@gmail.com",
- "issue_pr_associee": "#13589, #13606",
+ "last_validation": "2026-08-14",
+ "last_validator": "jsboige@gmail.com",
+ "issue_pr_associee": "#10923, #10965",
"cells_total": 81,
- "cells_code": 33,
- "cells_markdown": 48,
- "cells_with_outputs": 28,
+ "cells_code": 24,
+ "cells_markdown": 57,
+ "cells_with_outputs": 19,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22470,8 +22830,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-6-AdversarialSearch-Csharp.ipynb",
- "title": "Search-6 — Recherche adversariale (jeux à somme nulle) — jumeau .NET",
+ "path": "Search/Part1-Foundations/Search-11-Metaheuristics-Csharp.ipynb",
+ "title": "Search-11 (C#) : Métaheuristiques — Optimisation par essaim, recuit et evolution",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -22480,18 +22840,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "9ec1d6423",
- "executed_at": "2026-09-04T02:20:19+02:00",
+ "last_success_sha": "57274b113",
+ "executed_at": "2026-08-19T04:39:55+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-09-04",
+ "last_validation": "2026-08-19",
"last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#14480",
- "cells_total": 23,
- "cells_code": 10,
- "cells_markdown": 13,
- "cells_with_outputs": 10,
+ "issue_pr_associee": "#11112, #11597",
+ "cells_total": 35,
+ "cells_code": 18,
+ "cells_markdown": 17,
+ "cells_with_outputs": 18,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22500,8 +22860,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-6-AdversarialSearch.ipynb",
- "title": "Search-6-AdversarialSearch : Recherche Adversariale",
+ "path": "Search/Part1-Foundations/Search-11-Metaheuristics.ipynb",
+ "title": "Search-11-métaheuristiques : Optimisation avec MEALPy",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -22518,39 +22878,9 @@
"last_validation": "2026-08-31",
"last_validator": "jessynoo@gmail.com",
"issue_pr_associee": "#13589, #13606",
- "cells_total": 44,
- "cells_code": 16,
- "cells_markdown": 28,
- "cells_with_outputs": 10,
- "cells_without_outputs": 0,
- "requires_api": false,
- "requires_gpu": false,
- "requires_cloud": false,
- "requires_wsl": false,
- "executable_locally": true
- },
- {
- "path": "Search/Part1-Foundations/Search-7-MCTS-And-Beyond-Csharp.ipynb",
- "title": "Search-7-MCTS-And-Beyond (C#) : Monte Carlo Tree Search et Extensions",
- "serie": "Search",
- "sous_serie": "Part1-Foundations",
- "kernel": ".NET (C#)",
- "status": "READY",
- "maturity": "BETA",
- "editorial": "BETA",
- "reproducibility": "EXECUTED",
- "scientific_review": "UNREVIEWED",
- "last_success_sha": "912a466ee",
- "executed_at": "2026-08-17T21:58:14+02:00",
- "forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
- "owner_logique": "po-2025",
- "last_validation": "2026-08-17",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#9434, #11485",
- "cells_total": 46,
- "cells_code": 17,
- "cells_markdown": 29,
+ "cells_total": 52,
+ "cells_code": 21,
+ "cells_markdown": 31,
"cells_with_outputs": 17,
"cells_without_outputs": 0,
"requires_api": false,
@@ -22560,28 +22890,28 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-7-MCTS-And-Beyond.ipynb",
- "title": "Search-7-MCTS-And-Beyond : Monte Carlo Tree Search et Extensions",
+ "path": "Search/Part1-Foundations/Search-11b-Metaheuristiques-Deep-Part2.ipynb",
+ "title": "Search-11b (Part 2) : Particle Swarm Optimization (C# / .NET) — Tranche 2 : PSO",
"serie": "Search",
"sous_serie": "Part1-Foundations",
- "kernel": "Python 3",
+ "kernel": ".NET (C#)",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "912a466ee",
- "executed_at": "2026-08-17T21:58:14+02:00",
+ "last_success_sha": "7e90a21b6",
+ "executed_at": "2026-08-04T07:09:28+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
+ "duree_estimee": "30min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-17",
+ "last_validation": "2026-08-04",
"last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#9434, #11485",
- "cells_total": 43,
- "cells_code": 16,
- "cells_markdown": 27,
- "cells_with_outputs": 11,
+ "issue_pr_associee": "#8056, #9274",
+ "cells_total": 22,
+ "cells_code": 9,
+ "cells_markdown": 13,
+ "cells_with_outputs": 9,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22590,8 +22920,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-8-DancingLinks-Csharp.ipynb",
- "title": "Search-8-DancingLinks-Csharp : L'algorithme X et Dancing Links de Knuth en C#",
+ "path": "Search/Part1-Foundations/Search-11b-Metaheuristiques-Deep-Part3.ipynb",
+ "title": "Search-11b-Métaheuristiques-Deep-Part3 : Artificial Bee Colony (ABC) from-scratch",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -22600,18 +22930,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "708121a88",
- "executed_at": "2026-08-14T18:41:14+02:00",
+ "last_success_sha": "7e90a21b6",
+ "executed_at": "2026-08-04T07:09:28+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
+ "duree_estimee": "30min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-14",
+ "last_validation": "2026-08-04",
"last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#10923, #10965",
- "cells_total": 22,
- "cells_code": 10,
- "cells_markdown": 12,
- "cells_with_outputs": 10,
+ "issue_pr_associee": "#8056, #9274",
+ "cells_total": 24,
+ "cells_code": 9,
+ "cells_markdown": 15,
+ "cells_with_outputs": 9,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22620,28 +22950,28 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-8-DancingLinks.ipynb",
- "title": "Search-8-DancingLinks : L'algorithme X et Dancing Links de Knuth",
+ "path": "Search/Part1-Foundations/Search-11b-Metaheuristiques-Deep-Part4.ipynb",
+ "title": "Search-11b-Métaheuristiques-Deep-Part4 : Benchmark Comparatif (capstone)",
"serie": "Search",
"sous_serie": "Part1-Foundations",
- "kernel": "Python 3",
+ "kernel": ".NET (C#)",
"status": "READY",
"maturity": "BETA",
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "e43c01587",
- "executed_at": "2026-08-29T03:32:26+02:00",
+ "last_success_sha": "7e90a21b6",
+ "executed_at": "2026-08-04T07:09:28+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
+ "duree_estimee": "30min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-29",
+ "last_validation": "2026-08-04",
"last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#11840, #13357",
- "cells_total": 60,
- "cells_code": 21,
- "cells_markdown": 39,
- "cells_with_outputs": 17,
+ "issue_pr_associee": "#8056, #9274",
+ "cells_total": 23,
+ "cells_code": 9,
+ "cells_markdown": 14,
+ "cells_with_outputs": 9,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22650,8 +22980,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-9-LinearProgramming-Csharp.ipynb",
- "title": "Search-9 : Programmation Linéaire et Simplexe (C# / .NET)",
+ "path": "Search/Part1-Foundations/Search-11b-Metaheuristiques-Deep.ipynb",
+ "title": "Search-11b : Métaheuristiques d'optimisation (C# / .NET) — Tranche 1 : Recuit simulé",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": ".NET (C#)",
@@ -22660,18 +22990,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "59f7f79fa",
- "executed_at": "2026-08-31T19:49:56+02:00",
+ "last_success_sha": "7e90a21b6",
+ "executed_at": "2026-08-04T07:09:28+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "45min",
+ "duree_estimee": "30min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-31",
- "last_validator": "jessynoo@gmail.com",
- "issue_pr_associee": "#13589, #13606",
- "cells_total": 28,
- "cells_code": 11,
- "cells_markdown": 17,
- "cells_with_outputs": 11,
+ "last_validation": "2026-08-04",
+ "last_validator": "jsboige@gmail.com",
+ "issue_pr_associee": "#8056, #9274",
+ "cells_total": 19,
+ "cells_code": 8,
+ "cells_markdown": 11,
+ "cells_with_outputs": 8,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -22680,8 +23010,8 @@
"executable_locally": true
},
{
- "path": "Search/Part1-Foundations/Search-9-LinearProgramming.ipynb",
- "title": "Search-9-LinearProgramming : Programmation Lineaire et Simplexe",
+ "path": "Search/Part1-Foundations/Search-11c-Empirical-Algorithm-Selection.ipynb",
+ "title": "Search-11c — Sélection empirique d'algorithmes : deux terrains — Sudoku et Puissance 4",
"serie": "Search",
"sous_serie": "Part1-Foundations",
"kernel": "Python 3",
@@ -22690,18 +23020,18 @@
"editorial": "BETA",
"reproducibility": "EXECUTED",
"scientific_review": "UNREVIEWED",
- "last_success_sha": "ec3e817c1",
- "executed_at": "2026-08-04T00:39:59+02:00",
+ "last_success_sha": "c5dc1efc0",
+ "executed_at": "2026-09-06T10:58:25+02:00",
"forensic_category": "A_ALL_EXEC_OK",
"duree_estimee": "45min",
"owner_logique": "po-2025",
- "last_validation": "2026-08-04",
- "last_validator": "jsboige@gmail.com",
- "issue_pr_associee": "#8052, #9140",
- "cells_total": 47,
- "cells_code": 18,
- "cells_markdown": 29,
- "cells_with_outputs": 13,
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 91,
+ "cells_code": 27,
+ "cells_markdown": 64,
+ "cells_with_outputs": 24,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -23568,9 +23898,9 @@
"last_validation": "2026-08-31",
"last_validator": "jessynoo@gmail.com",
"issue_pr_associee": "#13589, #13606",
- "cells_total": 25,
+ "cells_total": 29,
"cells_code": 11,
- "cells_markdown": 14,
+ "cells_markdown": 18,
"cells_with_outputs": 11,
"cells_without_outputs": 0,
"requires_api": false,
@@ -24013,15 +24343,15 @@
"last_success_sha": "53f6d3d67",
"executed_at": "2026-09-02T04:56:01+02:00",
"forensic_category": "A_ALL_EXEC_OK",
- "duree_estimee": "30min",
+ "duree_estimee": "45min",
"owner_logique": "po-2025",
"last_validation": "2026-09-02",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#13777, #13959",
- "cells_total": 21,
- "cells_code": 9,
- "cells_markdown": 12,
- "cells_with_outputs": 9,
+ "cells_total": 24,
+ "cells_code": 10,
+ "cells_markdown": 14,
+ "cells_with_outputs": 10,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -24048,10 +24378,10 @@
"last_validation": "2026-09-05",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#14642",
- "cells_total": 29,
- "cells_code": 12,
- "cells_markdown": 17,
- "cells_with_outputs": 12,
+ "cells_total": 32,
+ "cells_code": 13,
+ "cells_markdown": 19,
+ "cells_with_outputs": 13,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -25055,6 +25385,36 @@
"requires_wsl": false,
"executable_locally": true
},
+ {
+ "path": "Sudoku/Sudoku-12b-Z3-Linq2Z3-Csharp.ipynb",
+ "title": "Sudoku 12b : Linq2Z3 — l'histoire d'un binding, de 81 propriétés aux tableaux imbriqués",
+ "serie": "Sudoku",
+ "sous_serie": "",
+ "kernel": ".NET (C#)",
+ "status": "READY",
+ "maturity": "BETA",
+ "editorial": "BETA",
+ "reproducibility": "EXECUTED",
+ "scientific_review": "UNREVIEWED",
+ "last_success_sha": "d6416bdc7",
+ "executed_at": "2026-09-07T01:08:21+02:00",
+ "forensic_category": "A_ALL_EXEC_OK",
+ "duree_estimee": "45min",
+ "owner_logique": "po-2023",
+ "last_validation": "",
+ "last_validator": "",
+ "issue_pr_associee": "",
+ "cells_total": 37,
+ "cells_code": 15,
+ "cells_markdown": 22,
+ "cells_with_outputs": 15,
+ "cells_without_outputs": 0,
+ "requires_api": false,
+ "requires_gpu": false,
+ "requires_cloud": false,
+ "requires_wsl": false,
+ "executable_locally": true
+ },
{
"path": "Sudoku/Sudoku-13-SymbolicAutomata-Csharp.ipynb",
"title": "Sudoku-13 : Le Sudoku comme Regex Symbolique - l'échelle Conway -> BREX/Rex -> RE#",
@@ -25377,9 +25737,9 @@
"last_validation": "2026-08-07",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#9805",
- "cells_total": 21,
+ "cells_total": 22,
"cells_code": 9,
- "cells_markdown": 12,
+ "cells_markdown": 13,
"cells_with_outputs": 6,
"cells_without_outputs": 0,
"requires_api": false,
@@ -25390,7 +25750,7 @@
},
{
"path": "Sudoku/Sudoku-19-Lean-Propagation.ipynb",
- "title": "Sudoku-7b — Soundness de la propagation de contraintes (companion formel natif)",
+ "title": "Sudoku-19 — Soundness de la propagation de contraintes (companion formel natif)",
"serie": "Sudoku",
"sous_serie": "",
"kernel": "Lean 4 (WSL)",
@@ -28047,10 +28407,10 @@
"last_validation": "2026-08-17",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#11112, #11363",
- "cells_total": 33,
- "cells_code": 14,
- "cells_markdown": 19,
- "cells_with_outputs": 14,
+ "cells_total": 37,
+ "cells_code": 16,
+ "cells_markdown": 21,
+ "cells_with_outputs": 16,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -28077,10 +28437,10 @@
"last_validation": "2026-08-29",
"last_validator": "jessynoo@gmail.com",
"issue_pr_associee": "#12368, #12875",
- "cells_total": 58,
- "cells_code": 20,
- "cells_markdown": 38,
- "cells_with_outputs": 20,
+ "cells_total": 62,
+ "cells_code": 22,
+ "cells_markdown": 40,
+ "cells_with_outputs": 22,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -28437,9 +28797,9 @@
"last_validation": "2026-09-01",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#13762, #13813",
- "cells_total": 30,
+ "cells_total": 39,
"cells_code": 14,
- "cells_markdown": 16,
+ "cells_markdown": 25,
"cells_with_outputs": 13,
"cells_without_outputs": 0,
"requires_api": true,
@@ -28797,9 +29157,9 @@
"last_validation": "2026-08-14",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#10488, #10677",
- "cells_total": 26,
+ "cells_total": 34,
"cells_code": 13,
- "cells_markdown": 13,
+ "cells_markdown": 21,
"cells_with_outputs": 13,
"cells_without_outputs": 0,
"requires_api": false,
@@ -31470,7 +31830,7 @@
"cells_total": 37,
"cells_code": 13,
"cells_markdown": 24,
- "cells_with_outputs": 9,
+ "cells_with_outputs": 10,
"cells_without_outputs": 0,
"requires_api": false,
"requires_gpu": false,
@@ -32697,9 +33057,9 @@
"last_validation": "2026-08-07",
"last_validator": "jsboige@gmail.com",
"issue_pr_associee": "#4667, #9919",
- "cells_total": 27,
+ "cells_total": 31,
"cells_code": 12,
- "cells_markdown": 15,
+ "cells_markdown": 19,
"cells_with_outputs": 10,
"cells_without_outputs": 0,
"requires_api": false,
diff --git a/COURSE_CATALOG.generated.md b/COURSE_CATALOG.generated.md
index 7d65ee22d7..cd2ef63edb 100644
--- a/COURSE_CATALOG.generated.md
+++ b/COURSE_CATALOG.generated.md
@@ -1,26 +1,26 @@
# CoursIA Notebook Catalog
-Generated: 2026-09-05 07:53
-Total notebooks: 1111
+Generated: 2026-09-07 03:03
+Total notebooks: 1123
## Status Summary
-- **READY**: 941
-- **DEMO**: 168
+- **READY**: 951
+- **DEMO**: 170
- **RESEARCH**: 0
- **BROKEN**: 2
## Maturity Summary
- **PRODUCTION**: 0
-- **BETA**: 1004
+- **BETA**: 991
- **TEMPLATE**: 4
-- **ALPHA**: 56
-- **DRAFT**: 47
+- **ALPHA**: 57
+- **DRAFT**: 71
## By Series
-### GenAI (214 notebooks) — BROKEN:2, DEMO:106, READY:106 | ALPHA:19, BETA:180, DRAFT:12, TEMPLATE:3
+### GenAI (215 notebooks) — BROKEN:2, DEMO:106, READY:107 | ALPHA:19, BETA:181, DRAFT:12, TEMPLATE:3
| # | Notebook | Kernel | Status | Maturity | Duration | Owner |
|---|----------|--------|--------|----------|----------|-------|
@@ -93,7 +93,7 @@ Total notebooks: 1111
| 67 | Educational Content Generation - GenAI | Python 3 | DEMO | BETA | 30min | po-2025 |
| 68 | Creative Workflows - GenAI | Python 3 | DEMO | BETA | 30min | po-2025 |
| 69 | Production Integration - GenAI | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 70 | Génération d’un patron de point de croix à partir… | Python 3 | DEMO | ALPHA | 30min | po-2025 |
+| 70 | Génération d’un patron de point de croix à partir… | Python 3 | DEMO | ALPHA | 45min | po-2025 |
| 71 | Aspire : orchestrer notre pile GenAI en C# | .NET (C#) | READY | BETA | 45min | po-2025 |
| 72 | Aspire : orchestrer la pile GenAI réelle du… | .NET (C#) | READY | BETA | 45min | po-2025 |
| 73 | Aspire 3 : Observabilite .NET moderne — Serilog,… | .NET (C#) | READY | BETA | 45min | po-2025 |
@@ -102,144 +102,145 @@ Total notebooks: 1111
| 76 | Aspire : garde-fous du code d'agent — l'analyseur… | .NET (C#) | READY | ALPHA | 45min | po-2025 |
| 77 | Aspire : le routeur MultiConnector — vetting en… | .NET (C#) | READY | BETA | 45min | po-2025 |
| 78 | Aspire : l'asynchrone aux frontieres natives -… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 79 | GitHub Copilot SDK en C# : binding, streaming,… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 80 | EF Core : des requêtes vérifiées à la compilation | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 81 | Configurer et interroger des chatbots — le chatbot… | Python 3 | READY | DRAFT | 15min | po-2025 |
-| 82 | Les fichiers du chatbot — une memoire ephemere par… | Python 3 | DEMO | DRAFT | 30min | po-2025 |
-| 83 | L'assistant de l'editeur — la quatrieme face du… | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 84 | Joindre un fichier au chatbot — ignore, annote, ou… | Python 3 (coursia-sae) | DEMO | BETA | 30min | po-2025 |
-| 85 | Mesurer la dérive d'un copilot — le gate par étape… | Python 3 | READY | BETA | 30min | po-2025 |
-| 86 | Obtenir des données structurées — la case json, le… | Python 3 | READY | BETA | 30min | po-2025 |
-| 87 | Parler au chatbot en visiteur — la face navigateur… | Python 3 | READY | DRAFT | 30min | po-2025 |
-| 88 | Administrer les formulaires par l'API — le… | Python 3 | READY | DRAFT | 30min | po-2025 |
-| 89 | Auditer un formulaire conditionnel — l'état que… | Python 3 | READY | DRAFT | 30min | po-2025 |
-| 90 | Ingestion RAG d'un corpus long structure | Python 3 | READY | BETA | 30min | po-2025 |
-| 91 | Séparer les environnements de vecteurs | Python 3 | READY | BETA | 30min | po-2025 |
-| 92 | Auditer un serveur MCP qu'on n'a pas ecrit | Python 3 | DEMO | BETA | 15min | po-2025 |
-| 93 | Le serveur MCP et son autorisation — OAuth de bout… | Python 3 | DEMO | DRAFT | 45min | po-2025 |
-| 94 | Consommer vs exposer le MCP — les deux sens du fil | Python 3 | READY | BETA | 30min | po-2025 |
-| 95 | Piloter WordPress par MCP — le serveur, pas l'API… | Python 3 | READY | DRAFT | 30min | po-2025 |
-| 96 | Brancher plusieurs providers — environnements et… | Python 3 | DEMO | DRAFT | 30min | po-2025 |
-| 97 | Choisir le modèle derrière son chatbot — une… | Python 3 (ipykernel) | DEMO | BETA | 30min | po-2025 |
-| 98 | Presenter AI Engine par son API — instance jetable… | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 99 | Parcours QA — ce que l'API ne voit pas | Python 3 | DEMO | ALPHA | 30min | po-2025 |
-| 100 | Auditer la conformite visuelle — ce que le smoke… | Python 3 | READY | BETA | 30min | po-2025 |
-| 101 | Parcours QA-OWUI — Notebook chapeau de la mission | Python 3 | READY | ALPHA | 15min | po-2025 |
-| 102 | Module 01 — Découverte de Playwright & Open WebUI | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
-| 103 | Module 02 — Navigation & Authentification | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
-| 104 | Module 03 — Chat & Streaming LLM | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
-| 105 | Module 04 — RAG, Outils MCP & Fonctionnalités… | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
-| 106 | Module 05 — Multi-tenant, API Testing & CI/CD | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
-| 107 | Module 06 — Tester les nouveautés v0.10 (« l'ère… | Python 3 | READY | BETA | 30min | po-2025 |
-| 108 | Différencier plusieurs assistants — mesurer ce… | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 109 | PT-01 — Introduction et vue d'ensemble | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 110 | PT-02 — Supervised Fine-Tuning baseline (SFT) | coursia-ml-training | DEMO | BETA | 45min | po-2025 |
-| 111 | PT-03 — Direct Préférence Optimization (DPO) | Python 3 | READY | ALPHA | 45min | po-2025 |
-| 112 | PT-04 — Group Relative Policy Optimization (GRPO) | coursia-ml-training | DEMO | ALPHA | 45min | po-2025 |
-| 113 | PT-05 — Reinforcement Learning with Verifiable… | coursia-ml-training | READY | BETA | 45min | po-2025 |
-| 114 | PT-06 — Evaluation Comparative du Post-Training | coursia-ml-training | READY | BETA | 30min | po-2025 |
-| 115 | PT-07 — Détecter le reward hacking avec rewardspy | Python 3 | READY | BETA | 15min | po-2025 |
-| 116 | PT-08 — GRPO from scratch : la mécanique du signal… | Python 3 (coursia-ml-training) | READY | BETA | 45min | po-2025 |
-| 117 | PT-09 — RLOO (REINFORCE Leave-One-Out) from… | coursia-ml-training | READY | BETA | 30min | po-2025 |
-| 118 | PT-10 — GAE from scratch : pourquoi un mini-critic… | Python 3 (ipykernel) | READY | BETA | 45min | po-2025 |
-| 119 | PT-11 — GRPO + RLVR sur Qwen3.5-0.8B : la série… | Python 3 (coursia-ml-training) | READY | BETA | 45min | po-2025 |
-| 120 | PT-11 — RLVR sur VRAI LLM (Qwen3.5-0.8B) +… | Python (coursia-ml-training) | READY | BETA | 45min | po-2025 |
-| 121 | PT-11b — RLVR multi-seed sur Qwen3.5-0.8B (4 seeds… | Python (coursia-ml-training) | READY | ALPHA | 45min | po-2025 |
+| 79 | Aspire : le harness Copilot SDK — CopilotClient,… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 80 | GitHub Copilot SDK en C# : binding, streaming,… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 81 | EF Core : des requêtes vérifiées à la compilation | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 82 | Configurer et interroger des chatbots — le chatbot… | Python 3 | READY | DRAFT | 15min | po-2025 |
+| 83 | Les fichiers du chatbot — une memoire ephemere par… | Python 3 | DEMO | DRAFT | 30min | po-2025 |
+| 84 | L'assistant de l'editeur — la quatrieme face du… | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 85 | Joindre un fichier au chatbot — ignore, annote, ou… | Python 3 (coursia-sae) | DEMO | BETA | 30min | po-2025 |
+| 86 | Mesurer la dérive d'un copilot — le gate par étape… | Python 3 | READY | BETA | 30min | po-2025 |
+| 87 | Obtenir des données structurées — la case json, le… | Python 3 | READY | BETA | 30min | po-2025 |
+| 88 | Parler au chatbot en visiteur — la face navigateur… | Python 3 | READY | DRAFT | 30min | po-2025 |
+| 89 | Administrer les formulaires par l'API — le… | Python 3 | READY | DRAFT | 30min | po-2025 |
+| 90 | Auditer un formulaire conditionnel — l'état que… | Python 3 | READY | DRAFT | 30min | po-2025 |
+| 91 | Ingestion RAG d'un corpus long structure | Python 3 | READY | BETA | 30min | po-2025 |
+| 92 | Séparer les environnements de vecteurs | Python 3 | READY | BETA | 30min | po-2025 |
+| 93 | Auditer un serveur MCP qu'on n'a pas ecrit | Python 3 | DEMO | BETA | 15min | po-2025 |
+| 94 | Le serveur MCP et son autorisation — OAuth de bout… | Python 3 | DEMO | DRAFT | 45min | po-2025 |
+| 95 | Consommer vs exposer le MCP — les deux sens du fil | Python 3 | READY | BETA | 30min | po-2025 |
+| 96 | Piloter WordPress par MCP — le serveur, pas l'API… | Python 3 | READY | DRAFT | 30min | po-2025 |
+| 97 | Brancher plusieurs providers — environnements et… | Python 3 | DEMO | DRAFT | 30min | po-2025 |
+| 98 | Choisir le modèle derrière son chatbot — une… | Python 3 (ipykernel) | DEMO | BETA | 30min | po-2025 |
+| 99 | Presenter AI Engine par son API — instance jetable… | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 100 | Parcours QA — ce que l'API ne voit pas | Python 3 | DEMO | ALPHA | 30min | po-2025 |
+| 101 | Auditer la conformite visuelle — ce que le smoke… | Python 3 | READY | BETA | 30min | po-2025 |
+| 102 | Parcours QA-OWUI — Notebook chapeau de la mission | Python 3 | READY | ALPHA | 15min | po-2025 |
+| 103 | Module 01 — Découverte de Playwright & Open WebUI | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
+| 104 | Module 02 — Navigation & Authentification | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
+| 105 | Module 03 — Chat & Streaming LLM | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
+| 106 | Module 04 — RAG, Outils MCP & Fonctionnalités… | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
+| 107 | Module 05 — Multi-tenant, API Testing & CI/CD | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
+| 108 | Module 06 — Tester les nouveautés v0.10 (« l'ère… | Python 3 | READY | BETA | 30min | po-2025 |
+| 109 | Différencier plusieurs assistants — mesurer ce… | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 110 | PT-01 — Introduction et vue d'ensemble | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 111 | PT-02 — Supervised Fine-Tuning baseline (SFT) | coursia-ml-training | DEMO | BETA | 45min | po-2025 |
+| 112 | PT-03 — Direct Préférence Optimization (DPO) | Python 3 | READY | ALPHA | 45min | po-2025 |
+| 113 | PT-04 — Group Relative Policy Optimization (GRPO) | coursia-ml-training | DEMO | ALPHA | 45min | po-2025 |
+| 114 | PT-05 — Reinforcement Learning with Verifiable… | coursia-ml-training | READY | BETA | 45min | po-2025 |
+| 115 | PT-06 — Evaluation Comparative du Post-Training | coursia-ml-training | READY | BETA | 30min | po-2025 |
+| 116 | PT-07 — Détecter le reward hacking avec rewardspy | Python 3 | READY | BETA | 15min | po-2025 |
+| 117 | PT-08 — GRPO from scratch : la mécanique du signal… | Python 3 (coursia-ml-training) | READY | BETA | 45min | po-2025 |
+| 118 | PT-09 — RLOO (REINFORCE Leave-One-Out) from… | coursia-ml-training | READY | BETA | 30min | po-2025 |
+| 119 | PT-10 — GAE from scratch : pourquoi un mini-critic… | Python 3 (ipykernel) | READY | BETA | 45min | po-2025 |
+| 120 | PT-11a — GRPO + RLVR sur Qwen3.5-0.8B : la série… | Python 3 (coursia-ml-training) | READY | BETA | 45min | po-2025 |
+| 121 | PT-11b — RLVR sur VRAI LLM (Qwen3.5-0.8B) +… | Python (coursia-ml-training) | READY | BETA | 45min | po-2025 |
| 122 | PT-11c — RLVR sur Qwen3-1.7B/2B (cran au-dessus de… | Python 3 | READY | ALPHA | 45min | po-2025 |
-| 123 | PT-12 — Crédit différé multi-step : GAE-λ sur un… | Coursia ML Training | READY | ALPHA | 45min | po-2025 |
-| 124 | PT-13 — Les trois biais du loss GRPO et leurs… | Coursia ML Training | READY | ALPHA | 45min | po-2025 |
-| 125 | Hands-On Grounding — Qdrant en mémoire | Python 3 | READY | BETA | 30min | po-2025 |
-| 126 | 02 — Retrieval avancé : HyDE, reranking et… | Python 3 | READY | BETA | 30min | po-2025 |
-| 127 | Embeddings from scratch — word2vec skip-gram, la… | Python 3 | READY | BETA | 30min | po-2025 |
-| 128 | Tokenisation from scratch — l'unité de compte de… | Python (coursia-ml-training) | READY | ALPHA | 30min | po-2025 |
-| 129 | Stockage vectoriel réel — persistance, index ANN… | Python (coursia-ml-training) | READY | BETA | 30min | po-2025 |
-| 130 | RAG 05b — Mode serveur Qdrant : compromis… | Python 3 | READY | BETA | 30min | po-2025 |
-| 131 | 06 — Kernel Memory in-process : la couche… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 132 | RAG 07 — Kernel Memory Python : ingestion,… | Python 3 (ipykernel) | READY | BETA | 45min | po-2025 |
-| 133 | RAG 08 — Kernel Memory et la recherche hybride :… | Python 3 | READY | BETA | 45min | po-2025 |
-| 134 | RAG 09 — Au-delà du texte : le plafond multimodal… | Python 3 | READY | BETA | 45min | po-2025 |
-| 135 | SK-1-Fundamentals : Introduction a Semantic Kernel | Python 3 | READY | BETA | 30min | po-2025 |
-| 136 | SK-2-Functions : Function Calling, Memory et… | Python 3 | READY | BETA | 30min | po-2025 |
-| 137 | SK-3-Agents : Agent Framework Semantic Kernel | Python 3 | READY | BETA | 15min | po-2025 |
-| 138 | SK-4-Filters : Filtres et Observabilite | Python 3 | READY | BETA | 30min | po-2025 |
-| 139 | SK-5-VectorStores : RAG avec Qdrant | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 140 | SK-6-ProcessFramework : Workflows et Orchestration | Python 3 | READY | BETA | 30min | po-2025 |
-| 141 | SK-7-MultiModal : Images, Audio et Vision | Python 3 | READY | BETA | 30min | po-2025 |
-| 142 | SK-8-MCP : Model Context Protocol et Integration | Python 3 | READY | BETA | 30min | po-2025 |
-| 143 | SK-9-Building-CLR : Interoperabilite Python/.NET… | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 144 | SK-10-NotebookMaker : Système Multi-Agents pour… | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 145 | Conception Automatique de Notebook par Agents IA | Python 3 | DEMO | DRAFT | 45min | po-2025 |
-| 146 | Conception Automatique de Notebook par Agents IA | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 147 | Projet Createur de Mail personnalise | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 148 | Notebook de travail — Titanic: exploration,… | Python 3 | READY | BETA | 15min | po-2025 |
-| 149 | Notebook de travail | Python 3 | BROKEN | TEMPLATE | 15min | po-2025 |
-| 150 | Notebook de conception de Notebook | .NET (C#) | DEMO | BETA | 45min | po-2025 |
-| 151 | Notebook de travail | .NET (C#) | READY | TEMPLATE | 30min | po-2025 |
-| 152 | Notebook de travail | .NET (C#) | BROKEN | TEMPLATE | 30min | po-2025 |
-| 153 | Jeu de devinette : Père Fouras vs Laurent Jalabert | .NET (C#) | DEMO | DRAFT | 30min | po-2025 |
-| 154 | Jeu de devinette : Père Fouras vs Laurent Jalabert | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 155 | 10. Hébergement Local de Modèles Génératifs | Python 3 | READY | BETA | 45min | po-2025 |
-| 156 | 10b. Mécanique d'inférence LLM : construire et… | Python 3 | READY | BETA | 30min | po-2025 |
-| 157 | 10c. Stratégies pour contextes longs — budget de… | Python 3 | READY | BETA | 45min | po-2025 |
-| 158 | 10d. TensorSharp : pilote d'inférence LLM native… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 159 | 10e. LLamaSharp : bake-off binding .NET de… | Python 3 | READY | BETA | 30min | po-2025 |
-| 160 | 10f. ONNX Runtime GenAI : jambe finale du bake-off… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 161 | 11. Quantization | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 162 | 12. Test Time Scaling | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 163 | 13. Orchestration agentique du test-time scaling | Python 3 | READY | BETA | 45min | po-2025 |
-| 164 | 13b — Évaluation d'agents : succès, coût, ablation… | Python 3 (coursia2) | READY | BETA | 30min | po-2025 |
-| 165 | 14. Memoire persistante pour le test-time scaling | Python 3 | READY | BETA | 30min | po-2025 |
-| 166 | 15. Tree-of-Thoughts sur de vrais problemes de… | Python 3 | READY | BETA | 30min | po-2025 |
-| 167 | 16. Scaling du test-time compute (Snell 2024) | Python 3 | READY | BETA | 30min | po-2025 |
-| 168 | 17. Modèles a raisonnement natif vs scaling du… | Python 3 | READY | BETA | 30min | po-2025 |
-| 169 | 18. Plugins Semantic Kernel pour le test-time… | Python 3 | READY | BETA | 30min | po-2025 |
-| 170 | 19. Orchestration et tâches planifiées avec Open… | Python 3 | READY | BETA | 30min | po-2025 |
-| 171 | 1. Introduction a l'IA generative avec l'API… | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 172 | 20. OWUI Native API v0.9.6 — introspection REST et… | Python 3 | READY | BETA | 30min | po-2025 |
-| 173 | 21. Fine-tuning LoRA / QLoRA — Adapter un LLM sans… | Python (coursia-ml-training) | READY | DRAFT | 45min | po-2025 |
-| 174 | 22 — Évaluer les sorties générées : BLEU, ROUGE,… | Python 3 | READY | BETA | 45min | po-2025 |
-| 175 | TAL — du mot aux dépendances : le pipeline… | Python 3 (coursia-ml-training) | READY | BETA | 30min | po-2025 |
-| 176 | 2. Prompt Engineering : Techniques Avancées | Python 3 | DEMO | ALPHA | 45min | po-2025 |
-| 177 | 3. Structured Outputs : Sorties JSON Garanties | Python 3 | READY | BETA | 30min | po-2025 |
-| 178 | Function Calling : Connecter les LLMs au Monde… | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 179 | 5. RAG Modern - Retrieval Augmented Generation | Python 3 | READY | BETA | 45min | po-2025 |
-| 180 | PDF et Web Search : Sources Documentaires avec… | Python 3 | READY | BETA | 30min | po-2025 |
-| 181 | Code Interpreter : Exécution de Code avec OpenAI | Python 3 | READY | BETA | 30min | po-2025 |
-| 182 | 8. Reasoning Models | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 183 | 9. Production Patterns | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 184 | 9b. Prompt Security & Red-Teaming sur notre stack… | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 185 | Claude CLI - Les Bases | Python 3 | READY | BETA | 45min | po-2025 |
-| 186 | Claude CLI - Gestion des Sessions | Python 3 | READY | BETA | 45min | po-2025 |
-| 187 | Claude CLI - References et Contexte | Python 3 | READY | BETA | 45min | po-2025 |
-| 188 | Claude CLI - Agents et Subagents | Python 3 | READY | BETA | 30min | po-2025 |
-| 189 | Claude CLI - Automatisation Avancee | Python 3 | READY | BETA | 45min | po-2025 |
-| 190 | Claude Code via Claudish | Python 3 | READY | BETA | 15min | po-2025 |
-| 191 | CSharpRepl attache a un process .NET vivant | .NET (C#) | READY | ALPHA | 1h | po-2025 |
-| 192 | Garde-fous Roslyn pour le code genere par agent | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 193 | Opérations de Base sur les Videos | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 194 | Bonus Slideshow Vidéo - Générateur de Slideshow… | Python 3 | READY | DRAFT | 5min | po-2025 |
-| 195 | GPT-5 Video Understanding - Comprehension Video… | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 196 | Qwen2.5-VL Video Analysis - Comprehension Video… | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 197 | Video Enhancement - Real-ESRGAN et Interpolation… | Python 3 | DEMO | ALPHA | 45min | po-2025 |
-| 198 | AnimateDiff - Introduction a la Generation… | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 199 | HunyuanVideo | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 200 | LTX-Video - Generation Video Rapide et Legere | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 201 | Wan 2.1/2.2 - Generation Video Multilingue | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 202 | SVD - Stable Video Diffusion (Image-to-Video) | Python 3 | DEMO | ALPHA | 45min | po-2025 |
-| 203 | LTX-2 - Generation Audiovisuelle Conjointe (Video… | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 204 | MiniMax H3 (Hailuo 3.0) — Architecture, capacités…… | Python 3 | DEMO | BETA | 15min | po-2025 |
-| 205 | CogVideoX - Generation Video depuis Texte (Open… | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 206 | Comparaison Multi-Modèles de Generation Video | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 207 | Orchestration de Pipelines Video | Python 3 | DEMO | ALPHA | 45min | po-2025 |
-| 208 | ComfyUI - Workflows Video via API | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 209 | Generation de Videos Educatives | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 210 | Workflows Video Creatifs | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 211 | Sora API - Generation Video Cloud | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 212 | Pipeline Video de Production | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 213 | MiniMax H3 (Hailuo) — Génération vidéo par le… | Python 3 | DEMO | BETA | 30min | po-2025 |
-| 214 | MiniMax video-01 (v1) — Service cloud generation… | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 123 | PT-11d — RLVR multi-seed sur Qwen3.5-0.8B (4 seeds… | Python (coursia-ml-training) | READY | ALPHA | 45min | po-2025 |
+| 124 | PT-12 — Crédit différé multi-step : GAE-λ sur un… | Coursia ML Training | READY | ALPHA | 45min | po-2025 |
+| 125 | PT-13 — Les trois biais du loss GRPO et leurs… | Coursia ML Training | READY | ALPHA | 45min | po-2025 |
+| 126 | Hands-On Grounding — Qdrant en mémoire | Python 3 | READY | BETA | 30min | po-2025 |
+| 127 | 02 — Retrieval avancé : HyDE, reranking et… | Python 3 | READY | BETA | 30min | po-2025 |
+| 128 | Embeddings from scratch — word2vec skip-gram, la… | Python 3 | READY | BETA | 30min | po-2025 |
+| 129 | Tokenisation from scratch — l'unité de compte de… | Python (coursia-ml-training) | READY | ALPHA | 30min | po-2025 |
+| 130 | Stockage vectoriel réel — persistance, index ANN… | Python (coursia-ml-training) | READY | BETA | 30min | po-2025 |
+| 131 | RAG 05b — Mode serveur Qdrant : compromis… | Python 3 | READY | BETA | 30min | po-2025 |
+| 132 | 06 — Kernel Memory in-process : la couche… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 133 | RAG 07 — Kernel Memory Python : ingestion,… | Python 3 (ipykernel) | READY | BETA | 45min | po-2025 |
+| 134 | RAG 08 — Kernel Memory et la recherche hybride :… | Python 3 | READY | BETA | 45min | po-2025 |
+| 135 | RAG 09 — Au-delà du texte : le plafond multimodal… | Python 3 | READY | BETA | 45min | po-2025 |
+| 136 | SK-1-Fundamentals : Introduction a Semantic Kernel | Python 3 | READY | BETA | 30min | po-2025 |
+| 137 | SK-2-Functions : Function Calling, Memory et… | Python 3 | READY | BETA | 30min | po-2025 |
+| 138 | SK-3-Agents : Agent Framework Semantic Kernel | Python 3 | READY | BETA | 15min | po-2025 |
+| 139 | SK-4-Filters : Filtres et Observabilite | Python 3 | READY | BETA | 30min | po-2025 |
+| 140 | SK-5-VectorStores : RAG avec Qdrant | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 141 | SK-6-ProcessFramework : Workflows et Orchestration | Python 3 | READY | BETA | 30min | po-2025 |
+| 142 | SK-7-MultiModal : Images, Audio et Vision | Python 3 | READY | BETA | 30min | po-2025 |
+| 143 | SK-8-MCP : Model Context Protocol et Integration | Python 3 | READY | BETA | 30min | po-2025 |
+| 144 | SK-9-Building-CLR : Interoperabilite Python/.NET… | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 145 | SK-10-NotebookMaker : Système Multi-Agents pour… | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 146 | Conception Automatique de Notebook par Agents IA | Python 3 | DEMO | DRAFT | 45min | po-2025 |
+| 147 | Conception Automatique de Notebook par Agents IA | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 148 | Projet Createur de Mail personnalise | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 149 | Notebook de travail — Titanic: exploration,… | Python 3 | READY | BETA | 15min | po-2025 |
+| 150 | Notebook de travail | Python 3 | BROKEN | TEMPLATE | 15min | po-2025 |
+| 151 | Notebook de conception de Notebook | .NET (C#) | DEMO | BETA | 45min | po-2025 |
+| 152 | Notebook de travail | .NET (C#) | READY | TEMPLATE | 30min | po-2025 |
+| 153 | Notebook de travail | .NET (C#) | BROKEN | TEMPLATE | 30min | po-2025 |
+| 154 | Jeu de devinette : Père Fouras vs Laurent Jalabert | .NET (C#) | DEMO | DRAFT | 30min | po-2025 |
+| 155 | Jeu de devinette : Père Fouras vs Laurent Jalabert | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 156 | 10. Hébergement Local de Modèles Génératifs | Python 3 | READY | BETA | 45min | po-2025 |
+| 157 | 10b. Mécanique d'inférence LLM : construire et… | Python 3 | READY | BETA | 30min | po-2025 |
+| 158 | 10c. Stratégies pour contextes longs — budget de… | Python 3 | READY | BETA | 45min | po-2025 |
+| 159 | 10d. TensorSharp : pilote d'inférence LLM native… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 160 | 10e. LLamaSharp : bake-off binding .NET de… | Python 3 | READY | BETA | 30min | po-2025 |
+| 161 | 10f. ONNX Runtime GenAI : jambe finale du bake-off… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 162 | 11. Quantization | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 163 | 12. Test Time Scaling | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 164 | 13. Orchestration agentique du test-time scaling | Python 3 | READY | BETA | 45min | po-2025 |
+| 165 | 13b — Évaluation d'agents : succès, coût, ablation… | Python 3 (coursia2) | READY | BETA | 30min | po-2025 |
+| 166 | 14. Memoire persistante pour le test-time scaling | Python 3 | READY | BETA | 30min | po-2025 |
+| 167 | 15. Tree-of-Thoughts sur de vrais problemes de… | Python 3 | READY | BETA | 30min | po-2025 |
+| 168 | 16. Scaling du test-time compute (Snell 2024) | Python 3 | READY | BETA | 30min | po-2025 |
+| 169 | 17. Modèles a raisonnement natif vs scaling du… | Python 3 | READY | BETA | 30min | po-2025 |
+| 170 | 18. Plugins Semantic Kernel pour le test-time… | Python 3 | READY | BETA | 30min | po-2025 |
+| 171 | 19. Orchestration et tâches planifiées avec Open… | Python 3 | READY | BETA | 30min | po-2025 |
+| 172 | 1. Introduction a l'IA generative avec l'API… | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 173 | 20. OWUI Native API v0.9.6 — introspection REST et… | Python 3 | READY | BETA | 30min | po-2025 |
+| 174 | 21. Fine-tuning LoRA / QLoRA — Adapter un LLM sans… | Python (coursia-ml-training) | READY | DRAFT | 45min | po-2025 |
+| 175 | 22 — Évaluer les sorties générées : BLEU, ROUGE,… | Python 3 | READY | BETA | 45min | po-2025 |
+| 176 | TAL — du mot aux dépendances : le pipeline… | Python 3 (coursia-ml-training) | READY | BETA | 30min | po-2025 |
+| 177 | 2. Prompt Engineering : Techniques Avancées | Python 3 | DEMO | ALPHA | 45min | po-2025 |
+| 178 | 3. Structured Outputs : Sorties JSON Garanties | Python 3 | READY | BETA | 30min | po-2025 |
+| 179 | Function Calling : Connecter les LLMs au Monde… | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 180 | 5. RAG Modern - Retrieval Augmented Generation | Python 3 | READY | BETA | 45min | po-2025 |
+| 181 | PDF et Web Search : Sources Documentaires avec… | Python 3 | READY | BETA | 30min | po-2025 |
+| 182 | Code Interpreter : Exécution de Code avec OpenAI | Python 3 | READY | BETA | 30min | po-2025 |
+| 183 | 8. Reasoning Models | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 184 | 9. Production Patterns | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 185 | 9b. Prompt Security & Red-Teaming sur notre stack… | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 186 | Claude CLI - Les Bases | Python 3 | READY | BETA | 45min | po-2025 |
+| 187 | Claude CLI - Gestion des Sessions | Python 3 | READY | BETA | 45min | po-2025 |
+| 188 | Claude CLI - References et Contexte | Python 3 | READY | BETA | 45min | po-2025 |
+| 189 | Claude CLI - Agents et Subagents | Python 3 | READY | BETA | 30min | po-2025 |
+| 190 | Claude CLI - Automatisation Avancee | Python 3 | READY | BETA | 45min | po-2025 |
+| 191 | Claude Code via Claudish | Python 3 | READY | BETA | 15min | po-2025 |
+| 192 | CSharpRepl attache a un process .NET vivant | .NET (C#) | READY | ALPHA | 1h | po-2025 |
+| 193 | Garde-fous Roslyn pour le code genere par agent | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 194 | Opérations de Base sur les Videos | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 195 | Bonus Slideshow Vidéo - Générateur de Slideshow… | Python 3 | READY | DRAFT | 5min | po-2025 |
+| 196 | GPT-5 Video Understanding - Comprehension Video… | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 197 | Qwen2.5-VL Video Analysis - Comprehension Video… | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 198 | Video Enhancement - Real-ESRGAN et Interpolation… | Python 3 | DEMO | ALPHA | 45min | po-2025 |
+| 199 | AnimateDiff - Introduction a la Generation… | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 200 | HunyuanVideo | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 201 | LTX-Video - Generation Video Rapide et Legere | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 202 | Wan 2.1/2.2 - Generation Video Multilingue | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 203 | SVD - Stable Video Diffusion (Image-to-Video) | Python 3 | DEMO | ALPHA | 45min | po-2025 |
+| 204 | LTX-2 - Generation Audiovisuelle Conjointe (Video… | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 205 | MiniMax H3 (Hailuo 3.0) — Architecture, capacités…… | Python 3 | DEMO | BETA | 15min | po-2025 |
+| 206 | CogVideoX - Generation Video depuis Texte (Open… | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 207 | Comparaison Multi-Modèles de Generation Video | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 208 | Orchestration de Pipelines Video | Python 3 | DEMO | ALPHA | 45min | po-2025 |
+| 209 | ComfyUI - Workflows Video via API | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 210 | Generation de Videos Educatives | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 211 | Workflows Video Creatifs | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 212 | Sora API - Generation Video Cloud | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 213 | Pipeline Video de Production | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 214 | MiniMax H3 (Hailuo) — Génération vidéo par le… | Python 3 | DEMO | BETA | 30min | po-2025 |
+| 215 | MiniMax video-01 (v1) — Service cloud generation… | Python 3 | DEMO | BETA | 30min | po-2025 |
-### Search (147 notebooks) — READY:147 | ALPHA:10, BETA:131, DRAFT:6
+### Search (148 notebooks) — READY:148 | ALPHA:10, BETA:132, DRAFT:6
| # | Notebook | Kernel | Status | Maturity | Duration | Owner |
|---|----------|--------|--------|----------|----------|-------|
@@ -291,107 +292,108 @@ Total notebooks: 1111
| 46 | App-27 — Sparse index tracking | Python 3 | READY | BETA | 30min | po-2025 |
| 47 | App-28 — Learning to branch | Python 3 | READY | BETA | 30min | po-2025 |
| 48 | App-29 — Équilibrage de chaîne d'assemblage… | Python 3 | READY | BETA | 30min | po-2025 |
-| 49 | App-9 : Detection de bords par algorithmes… | Python 3 | READY | BETA | 45min | po-2025 |
-| 50 | TP : Conception d'Algorithmes Génétiques avec… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 51 | App-14-ConnectFour-Adversarial-CSharp — Jumeau C#… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 52 | App-14 - Connect Four : Benchmark Adversarial… | Python 3 | READY | BETA | 45min | po-2025 |
-| 53 | App-14b : Puissance 4 -- Comparaison d'algorithmes… | Python 3 | READY | BETA | 45min | po-2025 |
-| 54 | App-14c (C#) : Puissance 4 -- Comparaison… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 55 | Search-02b : Théorie des Graphes avec NetworkX… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 56 | Search-02b-NetworkX : Algorithmes de Graphe avec… | Python 3 | READY | BETA | 45min | po-2025 |
-| 57 | Search-02c-QuikGraph : bibliotheque de graphes… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 58 | Search-03b (C#) — Bases de données de motifs… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 59 | Search-03b — Bases de données de motifs (Pattern… | Python 3 | READY | BETA | 30min | po-2025 |
-| 60 | Search-03c (C#) — Recherche à écart limité… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 61 | Search-03c — Recherche à écart limité (Limited… | Python 3 | READY | BETA | 30min | po-2025 |
-| 62 | Search-03d (C#) — Weighted A\* : recherche à… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 63 | Search-03d — Weighted A\* : recherche à… | Python 3 | READY | BETA | 15min | po-2025 |
-| 64 | Search-03e : A* et l'optimalité sous heuristique… | Python 3 | READY | BETA | 30min | po-2025 |
-| 65 | Search-09b : Minima fallacieux — le paysage de la… | Python 3 | READY | BETA | 15min | po-2025 |
-| 66 | Search-09c — Discrépance combinatoire : colorier… | Python 3 | READY | BETA | 15min | po-2025 |
-| 67 | Search-09d — Discrépance combinatoire : la couche… | Lean 4 (WSL) | READY | BETA | 45min | po-2025 |
-| 68 | Search-1 : Espaces d'etats et formalisation de… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 69 | Search-1 : Espaces d'etats et formulation de… | Python 3 | READY | BETA | 45min | po-2025 |
-| 70 | Search-10 (C#) : Automates Finis Classiques —… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 71 | Search-10 : Automates Symboliques avec Z3 | Python 3 | READY | BETA | 45min | po-2025 |
-| 72 | Search-11 (C#) : Métaheuristiques — Optimisation… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 73 | Search-11-métaheuristiques : Optimisation avec… | Python 3 | READY | BETA | 45min | po-2025 |
-| 74 | Search-11b (Part 2) : Particle Swarm Optimization… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 75 | Search-11b-Métaheuristiques-Deep-Part3 :… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 76 | Search-11b-Métaheuristiques-Deep-Part4 : Benchmark… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 77 | Search-11b : Métaheuristiques d'optimisation (C# /… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 78 | Search-17 — Sélection empirique d'algorithmes :… | Python 3 | READY | BETA | 45min | po-2025 |
-| 79 | Search-2-Uninformed (C#) : Algorithmes de… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 80 | Search-2-Uninformed : Algorithmes de Recherche Non… | Python 3 | READY | BETA | 1h | po-2025 |
-| 81 | Search-3-Informed (C#) : Recherche Informée | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 82 | Search-3-Informed : Algorithmes de Recherche… | Python 3 | READY | BETA | 45min | po-2025 |
-| 83 | Search-4-LocalSearch (C#) : Recherche Locale et… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 84 | Search-4-LocalSearch : Recherche Locale et… | Python 3 | READY | BETA | 45min | po-2025 |
-| 85 | Search-5-GeneticAlgorithms-Csharp : Algorithmes… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 86 | Search-5 : Algorithmes génétiques | Python 3 | READY | BETA | 1h | po-2025 |
-| 87 | Search-6 — Recherche adversariale (jeux à somme… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 88 | Search-6-AdversarialSearch : Recherche… | Python 3 | READY | BETA | 45min | po-2025 |
-| 89 | Search-7-MCTS-And-Beyond (C#) : Monte Carlo Tree… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 90 | Search-7-MCTS-And-Beyond : Monte Carlo Tree Search… | Python 3 | READY | BETA | 45min | po-2025 |
-| 91 | Search-8-DancingLinks-Csharp : L'algorithme X et… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 92 | Search-8-DancingLinks : L'algorithme X et Dancing… | Python 3 | READY | BETA | 45min | po-2025 |
-| 93 | Search-9 : Programmation Linéaire et Simplexe (C#… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 94 | Search-9-LinearProgramming : Programmation… | Python 3 | READY | BETA | 45min | po-2025 |
-| 95 | CSP-1 : Fondamentaux des CSP - Version .NET… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 96 | CSP-1 : Fondamentaux des CSP | Python 3 | READY | BETA | 1h | po-2025 |
-| 97 | CSP-2 : Propagation de Contraintes et Consistance… | .NET (C#) | READY | BETA | 1h | po-2025 |
-| 98 | CSP-2 : Propagation de Contraintes et Consistance | Python 3 | READY | BETA | 45min | po-2025 |
-| 99 | CSP-3 : CSP Avancé — Contraintes globales et… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 100 | CSP-3 : CSP Avance - Contraintes globales,… | Python 3 | READY | ALPHA | 45min | po-2025 |
-| 101 | CSP-4-Scheduling-Csharp : Problèmes… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 102 | CSP-4-Scheduling : Problèmes d'Ordonnancement | Python 3 | READY | BETA | 45min | po-2025 |
-| 103 | CSP-5-Optimization-Csharp : Optimisation… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 104 | CSP-5-Optimization : Problèmes d'Optimisation… | Python 3 | READY | BETA | 45min | po-2025 |
-| 105 | CSP-6-Hybridation : Approches Hybrides Modernes… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 106 | CSP-6-Hybridation : Approches Hybrides Modernes | Python 3 | READY | BETA | 45min | po-2025 |
-| 107 | CSP-7 : Contraintes Souples avec Choco-solver | .NET (C#) | READY | BETA | 1h | po-2025 |
-| 108 | CSP-7 : Contraintes Souples - Soft CSP | Python 3 | READY | BETA | 1h | po-2025 |
-| 109 | CSP-8 : Temporels - Raisonnement sur le Temps | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 110 | CSP-8 : Temporels - Raisonnement sur le Temps | Python 3 | READY | BETA | 45min | po-2025 |
-| 111 | CSP-9-Distributed | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 112 | CSP-9-Distributed : CSP Distribués (DisCSP) | Python 3 | READY | BETA | 45min | po-2025 |
-| 113 | MGS-1 : Introduction a MetaGeneticSharp et au… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 114 | MGS-10 : Le test du biais central — un optimiseur… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
-| 115 | MGS-11 : Synergie d'iles complementaires --… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 116 | MGS-12 : Le test de l'alignement d'axes -- un… | .NET (C#) | READY | ALPHA | 45min | po-2025 |
-| 117 | MGS-13 — Visualiser les paysages dé-biaisés :… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 118 | MGS-14 — Trouver une synergie (et dire quand il… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 119 | MGS-15 : Analyse de paysage -- la corrélation… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 120 | MGS-16-AlgorithmSelection : Sélectionner le bon… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 121 | MGS-17 — Contrôle de paramètres (Parameter… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 122 | MGS-17b — Selection empirique d'algorithmes : du… | Python 3 (ipykernel) | READY | DRAFT | 30min | po-2025 |
-| 123 | MGS-18 — Banc CEC consolide : la combinaison des… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 124 | MGS-19 — Recuit simulé décomposé : l'opérateur de… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 125 | MGS-2 : Composition de métaheuristiques -- Match… | .NET (C#) | READY | ALPHA | 45min | po-2025 |
-| 126 | MGS-20 : Langage de composition pour… | Python 3 | READY | BETA | 30min | po-2025 |
-| 127 | MGS-21 : Représentation contre algorithme — la… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 128 | MGS-3 : L'Eukaryote -- sous-populations et… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 129 | MGS-4 : Le Modèle Insulaire -- populations… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 130 | MGS-5 : Construire les métaheuristiques composées… | .NET (C#) | READY | DRAFT | 45min | po-2025 |
-| 131 | MGS-6 : Benchmarks comparatifs -- l'argument… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
-| 132 | MGS-7 : TSP combinatoire -- la grammaire de… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 133 | MGS-7b : projection multi-dimensionnelle des… | .NET (C#) | READY | DRAFT | 30min | po-2025 |
-| 134 | MGS-7c : Rosenbrock (vallée étroite) + Griewank… | .NET (C#) | READY | DRAFT | 30min | po-2025 |
-| 135 | MGS-7d : Michalewicz (steep ridges) + Dixon-Price… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 136 | MGS-8 : Fitness Landscape Explorer -- voir la… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 137 | MGS-9 - Trouver l'Everest : relief reel et bassins… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 138 | MGS-22 : MGS contre mealpy — le bench croisé… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 139 | MGS-23 : DifferentialEvolution MGS contre mealpy —… | .NET (C#) | READY | BETA | 45min | po-2025 |
-| 140 | MGS-24 : SimulatedAnnealing MGS contre mealpy —… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
-| 141 | MGS-25 : WhaleOptimisation MGS contre mealpy — le… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 142 | MGS-26 : EquilibriumOptimizer MGS contre mealpy —… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
-| 143 | MGS-27 : ForensicBasedInvestigation MGS contre… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
-| 144 | MGS-28 : Bare Bones PSO MGS contre mealpy — le PSO… | .NET (C#) | READY | ALPHA | 45min | po-2025 |
-| 145 | MGS-29 : GA MGS compose "Default" contre BaseGA… | .NET (C#) | READY | BETA | 30min | po-2025 |
-| 146 | MGS-30 : Scatter Search MGS contre son ombre — la… | .NET (C#) | READY | DRAFT | 45min | po-2025 |
-| 147 | MGS-31 : Synthèse croisée MGS contre mealpy — neuf… | .NET (C#) | READY | DRAFT | 30min | po-2025 |
+| 49 | App-30 — Ordonnancement d'assemblage orbital | Python 3 | READY | BETA | 45min | po-2025 |
+| 50 | App-9 : Detection de bords par algorithmes… | Python 3 | READY | BETA | 45min | po-2025 |
+| 51 | TP : Conception d'Algorithmes Génétiques avec… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 52 | App-14-ConnectFour-Adversarial-CSharp — Jumeau C#… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 53 | App-14 - Connect Four : Benchmark Adversarial… | Python 3 | READY | BETA | 45min | po-2025 |
+| 54 | App-14b : Puissance 4 -- Comparaison d'algorithmes… | Python 3 | READY | BETA | 45min | po-2025 |
+| 55 | App-14c (C#) : Puissance 4 -- Comparaison… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 56 | Search-1 : Espaces d'etats et formalisation de… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 57 | Search-1 : Espaces d'etats et formulation de… | Python 3 | READY | BETA | 45min | po-2025 |
+| 58 | Search-02-Uninformed (C#) : Algorithmes de… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 59 | Search-02-Uninformed : Algorithmes de Recherche… | Python 3 | READY | BETA | 1h | po-2025 |
+| 60 | Search-02b : Théorie des Graphes avec NetworkX… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 61 | Search-02b-NetworkX : Algorithmes de Graphe avec… | Python 3 | READY | BETA | 45min | po-2025 |
+| 62 | Search-02c-QuikGraph : bibliotheque de graphes… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 63 | Search-03-Informed (C#) : Recherche Informée | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 64 | Search-03-Informed : Algorithmes de Recherche… | Python 3 | READY | BETA | 45min | po-2025 |
+| 65 | Search-03b (C#) — Bases de données de motifs… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 66 | Search-03b — Bases de données de motifs (Pattern… | Python 3 | READY | BETA | 30min | po-2025 |
+| 67 | Search-03c (C#) — Recherche à écart limité… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 68 | Search-03c — Recherche à écart limité (Limited… | Python 3 | READY | BETA | 30min | po-2025 |
+| 69 | Search-03d (C#) — Weighted A\* : recherche à… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 70 | Search-03d — Weighted A\* : recherche à… | Python 3 | READY | BETA | 15min | po-2025 |
+| 71 | Search-03e : A* et l'optimalité sous heuristique… | Python 3 | READY | BETA | 30min | po-2025 |
+| 72 | Search-04-LocalSearch (C#) : Recherche Locale et… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 73 | Search-04-LocalSearch : Recherche Locale et… | Python 3 | READY | BETA | 45min | po-2025 |
+| 74 | Search-05-GeneticAlgorithms-Csharp : Algorithmes… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 75 | Search-5 : Algorithmes génétiques | Python 3 | READY | BETA | 1h | po-2025 |
+| 76 | Search-6 — Recherche adversariale (jeux à somme… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 77 | Search-06-AdversarialSearch : Recherche… | Python 3 | READY | BETA | 45min | po-2025 |
+| 78 | Search-07-MCTS-And-Beyond (C#) : Monte Carlo Tree… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 79 | Search-07-MCTS-And-Beyond : Monte Carlo Tree… | Python 3 | READY | BETA | 45min | po-2025 |
+| 80 | Search-08-DancingLinks-Csharp : L'algorithme X et… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 81 | Search-08-DancingLinks : L'algorithme X et Dancing… | Python 3 | READY | BETA | 45min | po-2025 |
+| 82 | Search-9 : Programmation Linéaire et Simplexe (C#… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 83 | Search-09-LinearProgramming : Programmation… | Python 3 | READY | BETA | 45min | po-2025 |
+| 84 | Search-09b : Minima fallacieux — le paysage de la… | Python 3 | READY | BETA | 15min | po-2025 |
+| 85 | Search-09c — Discrépance combinatoire : colorier… | Python 3 | READY | BETA | 15min | po-2025 |
+| 86 | Search-09d — Discrépance combinatoire : la couche… | Lean 4 (WSL) | READY | BETA | 45min | po-2025 |
+| 87 | Search-10 (C#) : Automates Finis Classiques —… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 88 | Search-10 : Automates Symboliques avec Z3 | Python 3 | READY | BETA | 45min | po-2025 |
+| 89 | Search-11 (C#) : Métaheuristiques — Optimisation… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 90 | Search-11-métaheuristiques : Optimisation avec… | Python 3 | READY | BETA | 45min | po-2025 |
+| 91 | Search-11b (Part 2) : Particle Swarm Optimization… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 92 | Search-11b-Métaheuristiques-Deep-Part3 :… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 93 | Search-11b-Métaheuristiques-Deep-Part4 : Benchmark… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 94 | Search-11b : Métaheuristiques d'optimisation (C# /… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 95 | Search-11c — Sélection empirique d'algorithmes :… | Python 3 | READY | BETA | 45min | po-2025 |
+| 96 | CSP-1 : Fondamentaux des CSP - Version .NET… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 97 | CSP-1 : Fondamentaux des CSP | Python 3 | READY | BETA | 1h | po-2025 |
+| 98 | CSP-2 : Propagation de Contraintes et Consistance… | .NET (C#) | READY | BETA | 1h | po-2025 |
+| 99 | CSP-2 : Propagation de Contraintes et Consistance | Python 3 | READY | BETA | 45min | po-2025 |
+| 100 | CSP-3 : CSP Avancé — Contraintes globales et… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 101 | CSP-3 : CSP Avance - Contraintes globales,… | Python 3 | READY | ALPHA | 45min | po-2025 |
+| 102 | CSP-4-Scheduling-Csharp : Problèmes… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 103 | CSP-4-Scheduling : Problèmes d'Ordonnancement | Python 3 | READY | BETA | 45min | po-2025 |
+| 104 | CSP-5-Optimization-Csharp : Optimisation… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 105 | CSP-5-Optimization : Problèmes d'Optimisation… | Python 3 | READY | BETA | 45min | po-2025 |
+| 106 | CSP-6-Hybridation : Approches Hybrides Modernes… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 107 | CSP-6-Hybridation : Approches Hybrides Modernes | Python 3 | READY | BETA | 45min | po-2025 |
+| 108 | CSP-7 : Contraintes Souples avec Choco-solver | .NET (C#) | READY | BETA | 1h | po-2025 |
+| 109 | CSP-7 : Contraintes Souples - Soft CSP | Python 3 | READY | BETA | 1h | po-2025 |
+| 110 | CSP-8 : Temporels - Raisonnement sur le Temps | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 111 | CSP-8 : Temporels - Raisonnement sur le Temps | Python 3 | READY | BETA | 45min | po-2025 |
+| 112 | CSP-9-Distributed | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 113 | CSP-9-Distributed : CSP Distribués (DisCSP) | Python 3 | READY | BETA | 45min | po-2025 |
+| 114 | MGS-1 : Introduction a MetaGeneticSharp et au… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 115 | MGS-10 : Le test du biais central — un optimiseur… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
+| 116 | MGS-11 : Synergie d'iles complementaires --… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 117 | MGS-12 : Le test de l'alignement d'axes -- un… | .NET (C#) | READY | ALPHA | 45min | po-2025 |
+| 118 | MGS-13 — Visualiser les paysages dé-biaisés :… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 119 | MGS-14 — Trouver une synergie (et dire quand il… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 120 | MGS-15 : Analyse de paysage -- la corrélation… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 121 | MGS-16-AlgorithmSelection : Sélectionner le bon… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 122 | MGS-17 — Contrôle de paramètres (Parameter… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 123 | MGS-17b — Selection empirique d'algorithmes : du… | Python 3 (ipykernel) | READY | DRAFT | 30min | po-2025 |
+| 124 | MGS-18 — Banc CEC consolide : la combinaison des… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 125 | MGS-19 — Recuit simulé décomposé : l'opérateur de… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 126 | MGS-2 : Composition de métaheuristiques -- Match… | .NET (C#) | READY | ALPHA | 45min | po-2025 |
+| 127 | MGS-20 : Langage de composition pour… | Python 3 | READY | BETA | 30min | po-2025 |
+| 128 | MGS-21 : Représentation contre algorithme — la… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 129 | MGS-3 : L'Eukaryote -- sous-populations et… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 130 | MGS-4 : Le Modèle Insulaire -- populations… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 131 | MGS-5 : Construire les métaheuristiques composées… | .NET (C#) | READY | DRAFT | 45min | po-2025 |
+| 132 | MGS-6 : Benchmarks comparatifs -- l'argument… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
+| 133 | MGS-7 : TSP combinatoire -- la grammaire de… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 134 | MGS-7b : projection multi-dimensionnelle des… | .NET (C#) | READY | DRAFT | 30min | po-2025 |
+| 135 | MGS-7c : Rosenbrock (vallée étroite) + Griewank… | .NET (C#) | READY | DRAFT | 30min | po-2025 |
+| 136 | MGS-7d : Michalewicz (steep ridges) + Dixon-Price… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 137 | MGS-8 : Fitness Landscape Explorer -- voir la… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 138 | MGS-9 - Trouver l'Everest : relief reel et bassins… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 139 | MGS-22 : MGS contre mealpy — le bench croisé… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 140 | MGS-23 : DifferentialEvolution MGS contre mealpy —… | .NET (C#) | READY | BETA | 45min | po-2025 |
+| 141 | MGS-24 : SimulatedAnnealing MGS contre mealpy —… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
+| 142 | MGS-25 : WhaleOptimisation MGS contre mealpy — le… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 143 | MGS-26 : EquilibriumOptimizer MGS contre mealpy —… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
+| 144 | MGS-27 : ForensicBasedInvestigation MGS contre… | .NET (C#) | READY | ALPHA | 30min | po-2025 |
+| 145 | MGS-28 : Bare Bones PSO MGS contre mealpy — le PSO… | .NET (C#) | READY | ALPHA | 45min | po-2025 |
+| 146 | MGS-29 : GA MGS compose "Default" contre BaseGA… | .NET (C#) | READY | BETA | 30min | po-2025 |
+| 147 | MGS-30 : Scatter Search MGS contre son ombre — la… | .NET (C#) | READY | DRAFT | 45min | po-2025 |
+| 148 | MGS-31 : Synthèse croisée MGS contre mealpy — neuf… | .NET (C#) | READY | DRAFT | 30min | po-2025 |
-### ML (78 notebooks) — DEMO:5, READY:73 | ALPHA:5, BETA:72, DRAFT:1
+### ML (80 notebooks) — DEMO:7, READY:73 | ALPHA:5, BETA:74, DRAFT:1
| # | Notebook | Kernel | Status | Maturity | Duration | Owner |
|---|----------|--------|--------|----------|----------|-------|
@@ -443,36 +445,38 @@ Total notebooks: 1111
| 46 | Lab 10: Data File Analyzer (DS-STAR Component) | Python 3 | READY | BETA | 30min | po-2023 |
| 47 | Lab 11: Planner-Coder-Verifier Loop (DS-STAR Core) | Python 3 | READY | ALPHA | 45min | po-2023 |
| 48 | Lab 12: DS-STAR Workshop - Analyse Multi-Fichiers | Python 3 | READY | BETA | 45min | po-2023 |
-| 49 | Lab 14 : Tracabilite de la consommation — le… | Python 3 | READY | BETA | 30min | po-2023 |
-| 50 | Lab 18: Persistance d'etat de session - une… | Python 3 (ipykernel) | DEMO | BETA | 30min | po-2023 |
-| 51 | Lab 13: Web Search pour Modèles SOTA (MLE-STAR… | Python 3 | READY | BETA | 30min | po-2023 |
-| 52 | Lab 14: Ablation et Raffinement Ciblé (MLE-STAR… | Python 3 | READY | ALPHA | 30min | po-2023 |
-| 53 | Lab 15: Kaggle Challenge avec MLE-STAR | Python 3 | READY | BETA | 30min | po-2023 |
-| 54 | Lab 16: Data Science Agent avec GCP BigQuery | Python 3 | READY | ALPHA | 30min | po-2023 |
-| 55 | Lab 17: Projet Final - Pipeline DS-STAR Complet | Python 3 | READY | ALPHA | 45min | po-2023 |
-| 56 | ML-1 (Python) : Introduction au Machine Learning… | Python 3 | READY | BETA | 30min | po-2023 |
-| 57 | ML-1 : Introduction au Machine Learning avec… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 58 | ML-10 (Python) : l'illusion de progression en… | Python 3 | READY | BETA | 30min | po-2023 |
-| 59 | ML-11 : le Matrix Profile multidimensionnel, une… | Python 3 | READY | BETA | 45min | po-2023 |
-| 60 | ML-2 : Préparation des données et ingénierie des… | Python 3 | READY | BETA | 30min | po-2023 |
-| 61 | ML-2 : Préparation des données et ingénierie des… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 62 | ML-3 : Entraînement et AutoML | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 63 | ML-3 (Python) : Entraînement et AutoML | Python 3 | READY | BETA | 30min | po-2023 |
-| 64 | ML-4 : Évaluation des modèles (Python / sklearn) | Python 3 | READY | BETA | 30min | po-2023 |
-| 65 | ML-4 : Evaluation des modèles | .NET (C#) | READY | BETA | 2h+ | po-2023 |
-| 66 | ML-4b : Validité statistique des comparaisons de… | Python 3 | READY | BETA | 30min | po-2023 |
-| 67 | ML-5 (Python) : Prévision de séries temporelles… | Python 3 | READY | BETA | 30min | po-2023 |
-| 68 | ML-5 : Time Series Forecasting avec ML.NET | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 69 | ML-5b (Python) : Séries temporelles classiques —… | Python 3 | READY | BETA | 30min | po-2023 |
-| 70 | ML-6 (Python) : Intégration de modèles ONNX… | Python (coursia-ml-training) | READY | BETA | 30min | po-2023 |
-| 71 | ML-6 : ONNX Model Integration avec ML.NET | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 72 | ML-7 (Python) : Systèmes de recommandation par… | Python 3 | READY | BETA | 30min | po-2023 |
-| 73 | ML-7 : Systèmes de Recommandation avec ML.NET | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 74 | ML-8 (Python) : Clustering non-supervisé avec… | Python 3 | READY | BETA | 30min | po-2023 |
-| 75 | ML-8 : Clustering non-supervise avec K-Means | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 76 | ML-9 (Python) : Détection d'anomalies par PCA… | Python 3 | READY | BETA | 30min | po-2023 |
-| 77 | ML-9 : Detection d'anomalies avec Randomized PCA | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 78 | TP : Prevision des ventes d'assurance | .NET (C#) | READY | BETA | 30min | po-2023 |
+| 49 | Lab 12b : Désignation séquentielle — le contrat… | Python 3 | DEMO | BETA | 30min | po-2023 |
+| 50 | Lab 12c : Handoff entre agents — le contrat C5, le… | Python 3 | DEMO | BETA | 30min | po-2023 |
+| 51 | Lab 12d : Tracabilite de la consommation — le… | Python 3 | READY | BETA | 30min | po-2023 |
+| 52 | Lab 12e: Persistance d'etat de session - une… | Python 3 (ipykernel) | DEMO | BETA | 30min | po-2023 |
+| 53 | Lab 13: Web Search pour Modèles SOTA (MLE-STAR… | Python 3 | READY | BETA | 30min | po-2023 |
+| 54 | Lab 14: Ablation et Raffinement Ciblé (MLE-STAR… | Python 3 | READY | ALPHA | 30min | po-2023 |
+| 55 | Lab 15: Kaggle Challenge avec MLE-STAR | Python 3 | READY | BETA | 30min | po-2023 |
+| 56 | Lab 16: Data Science Agent avec GCP BigQuery | Python 3 | READY | ALPHA | 30min | po-2023 |
+| 57 | Lab 17: Projet Final - Pipeline DS-STAR Complet | Python 3 | READY | ALPHA | 45min | po-2023 |
+| 58 | ML-1 (Python) : Introduction au Machine Learning… | Python 3 | READY | BETA | 30min | po-2023 |
+| 59 | ML-1 : Introduction au Machine Learning avec… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 60 | ML-10 (Python) : l'illusion de progression en… | Python 3 | READY | BETA | 30min | po-2023 |
+| 61 | ML-11 : le Matrix Profile multidimensionnel, une… | Python 3 | READY | BETA | 45min | po-2023 |
+| 62 | ML-2 : Préparation des données et ingénierie des… | Python 3 | READY | BETA | 30min | po-2023 |
+| 63 | ML-2 : Préparation des données et ingénierie des… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 64 | ML-3 : Entraînement et AutoML | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 65 | ML-3 (Python) : Entraînement et AutoML | Python 3 | READY | BETA | 30min | po-2023 |
+| 66 | ML-4 : Évaluation des modèles (Python / sklearn) | Python 3 | READY | BETA | 30min | po-2023 |
+| 67 | ML-4 : Evaluation des modèles | .NET (C#) | READY | BETA | 2h+ | po-2023 |
+| 68 | ML-4b : Validité statistique des comparaisons de… | Python 3 | READY | BETA | 30min | po-2023 |
+| 69 | ML-5 (Python) : Prévision de séries temporelles… | Python 3 | READY | BETA | 30min | po-2023 |
+| 70 | ML-5 : Time Series Forecasting avec ML.NET | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 71 | ML-5b (Python) : Séries temporelles classiques —… | Python 3 | READY | BETA | 30min | po-2023 |
+| 72 | ML-6 (Python) : Intégration de modèles ONNX… | Python (coursia-ml-training) | READY | BETA | 30min | po-2023 |
+| 73 | ML-6 : ONNX Model Integration avec ML.NET | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 74 | ML-7 (Python) : Systèmes de recommandation par… | Python 3 | READY | BETA | 30min | po-2023 |
+| 75 | ML-7 : Systèmes de Recommandation avec ML.NET | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 76 | ML-8 (Python) : Clustering non-supervisé avec… | Python 3 | READY | BETA | 30min | po-2023 |
+| 77 | ML-8 : Clustering non-supervise avec K-Means | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 78 | ML-9 (Python) : Détection d'anomalies par PCA… | Python 3 | READY | BETA | 30min | po-2023 |
+| 79 | ML-9 : Detection d'anomalies avec Randomized PCA | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 80 | TP : Prevision des ventes d'assurance | .NET (C#) | READY | BETA | 30min | po-2023 |
### SymbolicAI (263 notebooks) — DEMO:8, READY:255 | ALPHA:6, BETA:253, DRAFT:4
@@ -742,7 +746,7 @@ Total notebooks: 1111
| 262 | Préférences et Théorie du Vote | Python 3 | READY | ALPHA | 30min | po-2024 |
| 263 | Tweety .NET - Probe Phase 1 axe 2 : initialisation… | .NET (C#) | READY | BETA | 30min | po-2024 |
-### QuantConnect (109 notebooks) — DEMO:43, READY:66 | ALPHA:12, BETA:84, DRAFT:12, TEMPLATE:1
+### QuantConnect (110 notebooks) — DEMO:43, READY:67 | ALPHA:12, BETA:61, DRAFT:36, TEMPLATE:1
| # | Notebook | Kernel | Status | Maturity | Duration | Owner |
|---|----------|--------|--------|----------|----------|-------|
@@ -751,112 +755,113 @@ Total notebooks: 1111
| 3 | M16 — HAR asymétrique débiaisé : le signal… | Python 3 | READY | BETA | 30min | po-2026 |
| 4 | M4 - DLinear-vol : entree §C du registre… | Python 3 | READY | DRAFT | 45min | po-2026 |
| 5 | QC-Py-01 : Configuration et Premier Backtest… | Python 3 | DEMO | BETA | 30min | po-2026 |
-| 6 | QC-Py-02 : QuantConnect Platform Fundamentals -… | Python 3 | DEMO | BETA | 30min | po-2026 |
-| 7 | QC-Py-03 - Data Management in QuantConnect | Python 3 | DEMO | BETA | 45min | po-2026 |
+| 6 | QC-Py-02 : QuantConnect Platform Fundamentals -… | Python 3 | DEMO | DRAFT | 30min | po-2026 |
+| 7 | QC-Py-03 - Data Management in QuantConnect | Python 3 | DEMO | DRAFT | 45min | po-2026 |
| 8 | Objectifs d'Apprentissage | Python 3 | DEMO | BETA | 1h | po-2026 |
-| 9 | Objectifs d'Apprentissage | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 10 | QC-Py-06 : Options Trading dans QuantConnect | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 11 | QC-Py-07 : Futures et Forex Trading dans… | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 12 | QC-Py-08 - Multi-Asset Portfolio Stratégies | Python 3 | DEMO | BETA | 1h | po-2026 |
-| 13 | QC-Py-09 : Types d'Ordres et Order Management dans… | Python 3 | DEMO | BETA | 1h | po-2026 |
-| 14 | Objectifs d'Apprentissage | Python 3 | DEMO | BETA | 1h | po-2026 |
-| 15 | QC-Py-11 - Indicateurs Techniques dans… | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 16 | QC-Py-12 - Backtesting et Analyse de Performance | Python 3 | DEMO | BETA | 1h30 | po-2026 |
+| 9 | Objectifs d'Apprentissage | Python 3 | DEMO | DRAFT | 45min | po-2026 |
+| 10 | QC-Py-06 : Options Trading dans QuantConnect | Python 3 | DEMO | DRAFT | 45min | po-2026 |
+| 11 | QC-Py-07 : Futures et Forex Trading dans… | Python 3 | DEMO | DRAFT | 45min | po-2026 |
+| 12 | QC-Py-08 - Multi-Asset Portfolio Stratégies | Python 3 | DEMO | DRAFT | 1h | po-2026 |
+| 13 | QC-Py-09 : Types d'Ordres et Order Management dans… | Python 3 | DEMO | DRAFT | 1h | po-2026 |
+| 14 | Objectifs d'Apprentissage | Python 3 | DEMO | DRAFT | 1h | po-2026 |
+| 15 | QC-Py-11 - Indicateurs Techniques dans… | Python 3 | DEMO | DRAFT | 45min | po-2026 |
+| 16 | QC-Py-12 - Backtesting et Analyse de Performance | Python 3 | DEMO | DRAFT | 1h30 | po-2026 |
| 17 | QC-Py-12b - Validité du backtest et signification… | Python 3 | READY | BETA | 30min | po-2026 |
-| 18 | QC-Py-13 - Alpha Models et Algorithm Framework | Python 3 | DEMO | BETA | 1h | po-2026 |
-| 19 | QC-Py-14 - Portfolio Construction et Exécution… | Python 3 | DEMO | BETA | 1h | po-2026 |
-| 20 | Objectifs d'Apprentissage | Python 3 | DEMO | BETA | 1h30 | po-2026 |
-| 21 | QC-Py-16 - Alternative Data dans QuantConnect | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 22 | Objectifs d'Apprentissage | Python 3 | DEMO | BETA | 1h | po-2026 |
+| 18 | QC-Py-13 - Alpha Models et Algorithm Framework | Python 3 | DEMO | DRAFT | 1h | po-2026 |
+| 19 | QC-Py-14 - Portfolio Construction et Exécution… | Python 3 | DEMO | DRAFT | 1h | po-2026 |
+| 20 | Objectifs d'Apprentissage | Python 3 | DEMO | DRAFT | 1h30 | po-2026 |
+| 21 | QC-Py-16 - Alternative Data dans QuantConnect | Python 3 | DEMO | DRAFT | 45min | po-2026 |
+| 22 | Objectifs d'Apprentissage | Python 3 | DEMO | DRAFT | 1h | po-2026 |
| 23 | QC-Py-18 - Feature Engineering pour Machine… | Python 3 | DEMO | ALPHA | 1h | po-2026 |
| 24 | Objectifs d'Apprentissage | Python 3 | READY | BETA | 1h | po-2026 |
-| 25 | Objectifs d'Apprentissage | Python 3 | READY | BETA | 1h | po-2026 |
-| 26 | QC-Py-21 - Portfolio Optimization avec Machine… | Python 3 | READY | BETA | 1h | po-2026 |
-| 27 | Objectifs d'Apprentissage | Python 3 | READY | BETA | 1h | po-2026 |
-| 28 | QC-Py-23 — State Space Models pour Séries… | Python 3 | READY | BETA | 45min | po-2026 |
+| 25 | Objectifs d'Apprentissage | Python 3 | READY | DRAFT | 1h | po-2026 |
+| 26 | QC-Py-21 - Portfolio Optimization avec Machine… | Python 3 | READY | DRAFT | 1h | po-2026 |
+| 27 | Objectifs d'Apprentissage | Python 3 | READY | DRAFT | 1h | po-2026 |
+| 28 | QC-Py-23 — State Space Models pour Séries… | Python 3 | READY | DRAFT | 45min | po-2026 |
| 29 | QC-Py-23b - PatchTST et iTransformer pour… | Python 3 | READY | BETA | 45min | po-2026 |
-| 30 | QC-Py-24 - Modèles Génératifs pour Anomaly… | Python 3 | DEMO | BETA | 1h | po-2026 |
-| 31 | Objectifs d'Apprentissage | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 32 | Objectifs d'Apprentissage | Python 3 | READY | BETA | 45min | po-2026 |
-| 33 | QC-Py-27 - Production Deployment | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 34 | QC-Py-28 - Market Regime Detection | Python 3 | DEMO | BETA | 1h | po-2026 |
-| 35 | QC-Py-30 - LSTM Training Multi-Asset (GPU) | Python 3 | READY | BETA | 45min | po-2026 |
-| 36 | QC-Py-31 - Transformer Encoder Multi-Asset (GPU) | Python 3 | READY | ALPHA | 45min | po-2026 |
-| 37 | QC-Py-32 - Reinforcement Learning DQN pour le… | Python 3 | READY | BETA | 45min | po-2026 |
-| 38 | QC-Py-33 - Reinforcement Learning PPO pour le… | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 39 | QC-Py-34 - SAC et A2C : Comparaison d'Agents RL… | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 40 | QC-Py-35 - Reinforcement Learning pour la… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
-| 41 | QC-Py-40 : Paper Trading Binance - Mean Reversion… | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 42 | QC-Py-41 : Paper Trading IBKR - SP500 Momentum | Python 3 | DEMO | BETA | 45min | po-2026 |
-| 43 | QC-Py-Cloud-01 : Analyse de Sentiment FinBERT sur… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
-| 44 | QC-Py-Cloud-02 : Classification de Texte et… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
-| 45 | QC-Py-Cloud-03 : Parite de Risque (Risk Parity) | Python 3 | READY | BETA | 30min | po-2026 |
-| 46 | QC-Py-Cloud-03b — Risk Parity Composite… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
-| 47 | QC-Py-Cloud-04 — Mean Reversion on Sector ETFs | Python 3 | DEMO | DRAFT | 15min | po-2026 |
-| 48 | QC-Py-Cloud-05 : Prevision par Reseau de Neurones… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
-| 49 | QC-Py-Cloud-06 — PCA Statistical Arbitrage Mean… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
-| 50 | QC-Py-Cloud-07 — Temporal CNN Direction Prediction | Python 3 | DEMO | DRAFT | 15min | po-2026 |
-| 51 | Value Factor Z-Score — Sélection multi-facteurs… | Python 3 | DEMO | BETA | 15min | po-2026 |
-| 52 | Option Wheel — Le paradoxe du win-rate eleve | Python 3 | DEMO | BETA | 15min | po-2026 |
-| 53 | QC-Py-Cloud-10 : Reinforcement Learning - DQN… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
-| 54 | QC-Py-Cloud-11 — Regime Switching : Momentum in… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
-| 55 | QC-Py-Cloud-12 — Sector Rotation & Multi-Asset… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
-| 56 | QC-Py-Cloud-13 -- Volatility Targeting : Risk… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
-| 57 | QC-Py-Cloud-14 — Dual Momentum : Asset Sélection… | Python 3 | READY | BETA | 15min | po-2026 |
-| 58 | Workflow : Téléchargement et gestion des datasets | Python 3 | READY | ALPHA | 45min | po-2026 |
-| 59 | Le critere de Kelly — compagnon Python du lake… | Python 3 | DEMO | BETA | 30min | po-2026 |
-| 60 | Kelly — compagnon natif (kernel Lean 4) | Lean 4 (WSL) | READY | BETA | 45min | po-2026 |
-| 61 | Research QuantBook: Adaptive Asset Allocation | Python 3 | READY | BETA | 45min | po-2026 |
-| 62 | Research QuantBook: All-Weather Portfolio | Python 3 | READY | BETA | 30min | po-2026 |
-| 63 | Alpha Correlation Analysis | Python 3 | READY | BETA | 45min | po-2026 |
-| 64 | Research QuantBook: BTC ML Enhanced | Python 3 | READY | BETA | 45min | po-2026 |
-| 65 | Initializing environment | .NET (C#) | DEMO | DRAFT | 1h30 | po-2026 |
-| 66 | Research QuantBook: Multi-Channel ZigZag Crypto | Python 3 | READY | BETA | 45min | po-2026 |
-| 67 | Research QuantBook: Deep Learning LSTM pour SPY | Python 3 | READY | BETA | 45min | po-2026 |
-| 68 | Research QuantBook: DualMomentum (Antonacci) | Python 3 | READY | BETA | 30min | po-2026 |
-| 69 | Research QuantBook: Dual Momentum No TLT | Python 3 | READY | BETA | 45min | po-2026 |
-| 70 | Research QuantBook: EMA-Cross Alpha Model | Python 3 | READY | BETA | 30min | po-2026 |
-| 71 | Research QuantBook: EMA Cross Equity | Python 3 | READY | BETA | 45min | po-2026 |
-| 72 | Research QuantBook: EMA Crossover SPY Index | Python 3 | READY | BETA | 45min | po-2026 |
-| 73 | Research QuantBook: Multi-Stock EMA Crossover | Python 3 | READY | BETA | 45min | po-2026 |
-| 74 | Research QuantBook: ETF Pairs Trading | Python 3 | READY | BETA | 45min | po-2026 |
-| 75 | Research QuantBook: Fama-French Factor ETF… | Python 3 | READY | BETA | 45min | po-2026 |
-| 76 | Research QuantBook: ForexCarry (G10 FX Momentum) | Python 3 | READY | BETA | 45min | po-2026 |
-| 77 | Research QuantBook: Framework Composite EMA-Trend | Python 3 | READY | BETA | 30min | po-2026 |
-| 78 | Research QuantBook: Framework Composite FamaFrench… | Python 3 | READY | BETA | 30min | po-2026 |
-| 79 | Research QuantBook: Framework Composite Momentum +… | Python 3 | READY | BETA | 30min | po-2026 |
-| 80 | Framework Composite TrendWeather - Research | Python 3 | READY | BETA | 45min | po-2026 |
-| 81 | Research QuantBook: FuturesTrend (Donchian… | Python 3 | READY | BETA | 30min | po-2026 |
-| 82 | Research QuantBook: ML Classification… | Python 3 | READY | BETA | 45min | po-2026 |
-| 83 | ML Deep Learning - LSTM/GRU pour Trading | Python 3 | READY | ALPHA | 45min | po-2026 |
-| 84 | Research QuantBook: ML-Enhanced Pairs Trading | Python 3 | READY | BETA | 45min | po-2026 |
-| 85 | Research QuantBook: ML Ensemble | Python 3 | READY | BETA | 45min | po-2026 |
-| 86 | Research QuantBook: ML Feature Engineering | Python 3 | READY | BETA | 45min | po-2026 |
-| 87 | ML Random Forest - Classification pour Trading | Python 3 | READY | ALPHA | 45min | po-2026 |
-| 88 | Research QuantBook: ML Regression | Python 3 | READY | BETA | 45min | po-2026 |
-| 89 | ML SVM - Support Vector Machine pour Trading | Python 3 | READY | ALPHA | 45min | po-2026 |
-| 90 | ML Text Classification for Trading | Python 3 | READY | ALPHA | 45min | po-2026 |
-| 91 | ML XGBoost - Gradient Boosting pour Trading | Python 3 | READY | BETA | 45min | po-2026 |
-| 92 | Research QuantBook: Mean Reversion (Sector ETFs) | Python 3 | READY | BETA | 30min | po-2026 |
-| 93 | Research QuantBook: MomentumStrategy (Sector ETF… | Python 3 | READY | BETA | 30min | po-2026 |
-| 94 | Research QuantBook: Equity Multi-Layer EMA + ML… | Python 3 | READY | BETA | 45min | po-2026 |
-| 95 | Research QuantBook: Option Wheel Strategy | Python 3 | READY | BETA | 45min | po-2026 |
-| 96 | Research QuantBook: Options Wheel Tech Stocks | Python 3 | READY | BETA | 30min | po-2026 |
-| 97 | Research QuantBook: Covered Call Strategy | Python 3 | READY | BETA | 45min | po-2026 |
-| 98 | Research QuantBook: PairsTrading (Statistical… | Python 3 | READY | BETA | 30min | po-2026 |
-| 99 | Portfolio Hybride IBKR (50%) + Binance (50%) —… | Python 3 | READY | DRAFT | 30min | po-2026 |
-| 100 | Research QuantBook: RL Portfolio Allocation | Python 3 | READY | BETA | 45min | po-2026 |
-| 101 | Research QuantBook: RegimeSwitching Alpha Model | Python 3 | READY | BETA | 45min | po-2026 |
-| 102 | runner | Python 3 | DEMO | DRAFT | 15min | po-2026 |
-| 103 | Research QuantBook: RiskParity (Inverse-Volatility… | Python 3 | READY | BETA | 30min | po-2026 |
-| 104 | Research QuantBook: Sector-Momentum (Dual… | Python 3 | READY | BETA | 30min | po-2026 |
-| 105 | Research QuantBook: Trend Following Competition | Python 3 | READY | BETA | 30min | po-2026 |
-| 106 | Research QuantBook: TrendStocks Alpha Model | Python 3 | READY | BETA | 30min | po-2026 |
-| 107 | Research QuantBook: TurnOfMonth (Calendar Anomaly) | Python 3 | READY | BETA | 30min | po-2026 |
-| 108 | Research QuantBook: VIX-TermStructure (Short… | Python 3 | READY | BETA | 45min | po-2026 |
-| 109 | Top-4 Sharpe > 0.5 Stratégies: OOS Deep-Dive… | Python 3 | READY | BETA | 15min | po-2026 |
+| 30 | QC-Py-23c — Modèles de fondation pour séries… | Python 3 | READY | BETA | 45min | po-2026 |
+| 31 | QC-Py-24 - Modèles Génératifs pour Anomaly… | Python 3 | DEMO | DRAFT | 1h | po-2026 |
+| 32 | Objectifs d'Apprentissage | Python 3 | DEMO | DRAFT | 45min | po-2026 |
+| 33 | Objectifs d'Apprentissage | Python 3 | READY | DRAFT | 45min | po-2026 |
+| 34 | QC-Py-27 - Production Deployment | Python 3 | DEMO | DRAFT | 45min | po-2026 |
+| 35 | QC-Py-28 - Market Regime Detection | Python 3 | DEMO | DRAFT | 1h | po-2026 |
+| 36 | QC-Py-30 - LSTM Training Multi-Asset (GPU) | Python 3 | READY | BETA | 45min | po-2026 |
+| 37 | QC-Py-31 - Transformer Encoder Multi-Asset (GPU) | Python 3 | READY | ALPHA | 45min | po-2026 |
+| 38 | QC-Py-32 - Reinforcement Learning DQN pour le… | Python 3 | READY | BETA | 45min | po-2026 |
+| 39 | QC-Py-33 - Reinforcement Learning PPO pour le… | Python 3 | DEMO | BETA | 45min | po-2026 |
+| 40 | QC-Py-34 - SAC et A2C : Comparaison d'Agents RL… | Python 3 | DEMO | BETA | 45min | po-2026 |
+| 41 | QC-Py-35 - Reinforcement Learning pour la… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
+| 42 | QC-Py-40 : Paper Trading Binance - Mean Reversion… | Python 3 | DEMO | BETA | 45min | po-2026 |
+| 43 | QC-Py-41 : Paper Trading IBKR - SP500 Momentum | Python 3 | DEMO | BETA | 45min | po-2026 |
+| 44 | QC-Py-Cloud-01 : Analyse de Sentiment FinBERT sur… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
+| 45 | QC-Py-Cloud-02 : Classification de Texte et… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
+| 46 | QC-Py-Cloud-03 : Parite de Risque (Risk Parity) | Python 3 | READY | BETA | 30min | po-2026 |
+| 47 | QC-Py-Cloud-03b — Risk Parity Composite… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
+| 48 | QC-Py-Cloud-04 — Mean Reversion on Sector ETFs | Python 3 | DEMO | DRAFT | 15min | po-2026 |
+| 49 | QC-Py-Cloud-05 : Prevision par Reseau de Neurones… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
+| 50 | QC-Py-Cloud-06 — PCA Statistical Arbitrage Mean… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
+| 51 | QC-Py-Cloud-07 — Temporal CNN Direction Prediction | Python 3 | DEMO | DRAFT | 15min | po-2026 |
+| 52 | Value Factor Z-Score — Sélection multi-facteurs… | Python 3 | DEMO | BETA | 15min | po-2026 |
+| 53 | Option Wheel — Le paradoxe du win-rate eleve | Python 3 | DEMO | BETA | 15min | po-2026 |
+| 54 | QC-Py-Cloud-10 : Reinforcement Learning - DQN… | Python 3 | DEMO | ALPHA | 30min | po-2026 |
+| 55 | QC-Py-Cloud-11 — Regime Switching : Momentum in… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
+| 56 | QC-Py-Cloud-12 — Sector Rotation & Multi-Asset… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
+| 57 | QC-Py-Cloud-13 -- Volatility Targeting : Risk… | Python 3 | DEMO | DRAFT | 15min | po-2026 |
+| 58 | QC-Py-Cloud-14 — Dual Momentum : Asset Sélection… | Python 3 | READY | BETA | 15min | po-2026 |
+| 59 | Workflow : Téléchargement et gestion des datasets | Python 3 | READY | ALPHA | 45min | po-2026 |
+| 60 | Le critere de Kelly — compagnon Python du lake… | Python 3 | DEMO | BETA | 30min | po-2026 |
+| 61 | Kelly — compagnon natif (kernel Lean 4) | Lean 4 (WSL) | READY | BETA | 45min | po-2026 |
+| 62 | Research QuantBook: Adaptive Asset Allocation | Python 3 | READY | BETA | 45min | po-2026 |
+| 63 | Research QuantBook: All-Weather Portfolio | Python 3 | READY | BETA | 30min | po-2026 |
+| 64 | Alpha Correlation Analysis | Python 3 | READY | BETA | 45min | po-2026 |
+| 65 | Research QuantBook: BTC ML Enhanced | Python 3 | READY | BETA | 45min | po-2026 |
+| 66 | Initializing environment | .NET (C#) | DEMO | DRAFT | 1h30 | po-2026 |
+| 67 | Research QuantBook: Multi-Channel ZigZag Crypto | Python 3 | READY | BETA | 45min | po-2026 |
+| 68 | Research QuantBook: Deep Learning LSTM pour SPY | Python 3 | READY | BETA | 45min | po-2026 |
+| 69 | Research QuantBook: DualMomentum (Antonacci) | Python 3 | READY | BETA | 30min | po-2026 |
+| 70 | Research QuantBook: Dual Momentum No TLT | Python 3 | READY | BETA | 45min | po-2026 |
+| 71 | Research QuantBook: EMA-Cross Alpha Model | Python 3 | READY | BETA | 30min | po-2026 |
+| 72 | Research QuantBook: EMA Cross Equity | Python 3 | READY | BETA | 45min | po-2026 |
+| 73 | Research QuantBook: EMA Crossover SPY Index | Python 3 | READY | BETA | 45min | po-2026 |
+| 74 | Research QuantBook: Multi-Stock EMA Crossover | Python 3 | READY | BETA | 45min | po-2026 |
+| 75 | Research QuantBook: ETF Pairs Trading | Python 3 | READY | BETA | 45min | po-2026 |
+| 76 | Research QuantBook: Fama-French Factor ETF… | Python 3 | READY | BETA | 45min | po-2026 |
+| 77 | Research QuantBook: ForexCarry (G10 FX Momentum) | Python 3 | READY | BETA | 45min | po-2026 |
+| 78 | Research QuantBook: Framework Composite EMA-Trend | Python 3 | READY | BETA | 30min | po-2026 |
+| 79 | Research QuantBook: Framework Composite FamaFrench… | Python 3 | READY | BETA | 30min | po-2026 |
+| 80 | Research QuantBook: Framework Composite Momentum +… | Python 3 | READY | BETA | 30min | po-2026 |
+| 81 | Framework Composite TrendWeather - Research | Python 3 | READY | BETA | 45min | po-2026 |
+| 82 | Research QuantBook: FuturesTrend (Donchian… | Python 3 | READY | BETA | 30min | po-2026 |
+| 83 | Research QuantBook: ML Classification… | Python 3 | READY | BETA | 45min | po-2026 |
+| 84 | ML Deep Learning - LSTM/GRU pour Trading | Python 3 | READY | ALPHA | 45min | po-2026 |
+| 85 | Research QuantBook: ML-Enhanced Pairs Trading | Python 3 | READY | BETA | 45min | po-2026 |
+| 86 | Research QuantBook: ML Ensemble | Python 3 | READY | BETA | 45min | po-2026 |
+| 87 | Research QuantBook: ML Feature Engineering | Python 3 | READY | BETA | 45min | po-2026 |
+| 88 | ML Random Forest - Classification pour Trading | Python 3 | READY | ALPHA | 45min | po-2026 |
+| 89 | Research QuantBook: ML Regression | Python 3 | READY | BETA | 45min | po-2026 |
+| 90 | ML SVM - Support Vector Machine pour Trading | Python 3 | READY | ALPHA | 45min | po-2026 |
+| 91 | ML Text Classification for Trading | Python 3 | READY | ALPHA | 45min | po-2026 |
+| 92 | ML XGBoost - Gradient Boosting pour Trading | Python 3 | READY | BETA | 45min | po-2026 |
+| 93 | Research QuantBook: Mean Reversion (Sector ETFs) | Python 3 | READY | BETA | 30min | po-2026 |
+| 94 | Research QuantBook: MomentumStrategy (Sector ETF… | Python 3 | READY | BETA | 30min | po-2026 |
+| 95 | Research QuantBook: Equity Multi-Layer EMA + ML… | Python 3 | READY | BETA | 45min | po-2026 |
+| 96 | Research QuantBook: Option Wheel Strategy | Python 3 | READY | BETA | 45min | po-2026 |
+| 97 | Research QuantBook: Options Wheel Tech Stocks | Python 3 | READY | BETA | 30min | po-2026 |
+| 98 | Research QuantBook: Covered Call Strategy | Python 3 | READY | BETA | 45min | po-2026 |
+| 99 | Research QuantBook: PairsTrading (Statistical… | Python 3 | READY | BETA | 30min | po-2026 |
+| 100 | Portfolio Hybride IBKR (50%) + Binance (50%) —… | Python 3 | READY | DRAFT | 30min | po-2026 |
+| 101 | Research QuantBook: RL Portfolio Allocation | Python 3 | READY | BETA | 45min | po-2026 |
+| 102 | Research QuantBook: RegimeSwitching Alpha Model | Python 3 | READY | BETA | 45min | po-2026 |
+| 103 | runner | Python 3 | DEMO | DRAFT | 15min | po-2026 |
+| 104 | Research QuantBook: RiskParity (Inverse-Volatility… | Python 3 | READY | BETA | 30min | po-2026 |
+| 105 | Research QuantBook: Sector-Momentum (Dual… | Python 3 | READY | BETA | 30min | po-2026 |
+| 106 | Research QuantBook: Trend Following Competition | Python 3 | READY | BETA | 30min | po-2026 |
+| 107 | Research QuantBook: TrendStocks Alpha Model | Python 3 | READY | BETA | 30min | po-2026 |
+| 108 | Research QuantBook: TurnOfMonth (Calendar Anomaly) | Python 3 | READY | BETA | 30min | po-2026 |
+| 109 | Research QuantBook: VIX-TermStructure (Short… | Python 3 | READY | BETA | 45min | po-2026 |
+| 110 | Top-4 Sharpe > 0.5 Stratégies: OOS Deep-Dive… | Python 3 | READY | BETA | 15min | po-2026 |
-### GameTheory (93 notebooks) — DEMO:1, READY:92 | ALPHA:3, BETA:88, DRAFT:2
+### GameTheory (96 notebooks) — DEMO:1, READY:95 | ALPHA:3, BETA:91, DRAFT:2
| # | Notebook | Kernel | Status | Maturity | Duration | Owner |
|---|----------|--------|--------|----------|----------|-------|
@@ -866,95 +871,98 @@ Total notebooks: 1111
| 4 | GameTheory-2 (Part 2) : Support Enumeration —… | Python 3 | READY | BETA | 30min | po-2024 |
| 5 | GameTheory-02-NormalForm | Python 3 | READY | BETA | 45min | po-2024 |
| 6 | GameTheory 2b - Formalisation Lean : Definitions… | Lean 4 (WSL) | READY | BETA | 45min | po-2024 |
-| 7 | GameTheory-3 : Topologie des Jeux 2×2 — Twin C#… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 8 | GameTheory-03-Topology2x2 | Python (GameTheory WSL +… | READY | BETA | 45min | po-2024 |
-| 9 | GameTheory-3a — Chemins de swaps : à quelle… | Python 3 | READY | BETA | 30min | po-2024 |
-| 10 | GameTheory 3b : Chambres, murs, codimension — les… | Python 3 (ipykernel) | READY | BETA | 30min | po-2024 |
-| 11 | GameTheory-3c — Le joueur LLM dans le tableau… | Python 3 | DEMO | BETA | 30min | po-2024 |
-| 12 | GameTheory-03d — Biens publics non-lineaires :… | Python 3 | READY | BETA | 15min | po-2024 |
-| 13 | GameTheory 3e : Meta-Actions Tarifees -- l'agent… | Python 3 | READY | BETA | 30min | po-2024 |
-| 14 | GameTheory 3f : Le Parcours Complet -- du jeu… | Python 3 | READY | BETA | 30min | po-2024 |
-| 15 | GameTheory-03g — De 576 à 144 : dériver le… | Python 3 | READY | BETA | 30min | po-2024 |
-| 16 | GameTheory-03h — Deux espèces de flèches : quand… | Python 3 | READY | BETA | 30min | po-2024 |
-| 17 | GameTheory-04-NashEquilibrium (C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 18 | GameTheory-04-NashEquilibrium | Python (GameTheory WSL +… | READY | BETA | 45min | po-2024 |
-| 19 | GameTheory 4b - Theoreme d'Existence de Nash… | Lean 4 (WSL) | READY | BETA | 45min | po-2024 |
-| 20 | GameTheory 4c - Théorème d'Existence de Nash (C#) | .NET (C#) | READY | ALPHA | 45min | po-2024 |
-| 21 | GameTheory 4c - Theoreme d'Existence de Nash… | Python 3 | READY | BETA | 45min | po-2024 |
-| 22 | GameTheory 04e — Oracles réflexifs, décision… | Python 3 | READY | BETA | 15min | po-2024 |
-| 23 | GameTheory-05-ZeroSum-Minimax (Twin C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 24 | GameTheory-05-ZeroSum-Minimax | Python (GameTheory WSL +… | READY | BETA | 30min | po-2024 |
-| 25 | GameTheory-5b — Théorème minimax de von Neumann… | Lean 4 (WSL) | READY | BETA | 15min | po-2024 |
-| 26 | GameTheory-6 : Évolution et Confiance — Twin C#… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 27 | GameTheory-06-EvolutionTrust | Python 3 | READY | BETA | 45min | po-2024 |
-| 28 | GameTheory-6b — Jeux répétés en Lean : le lake… | Python 3 | READY | DRAFT | 30min | po-2024 |
-| 29 | GameTheory-6c (C#) : Jeux Répétés et Théorème Folk | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 30 | GameTheory-6c : Jeux Répétés et Théorème Folk… | Python 3 | READY | BETA | 30min | po-2024 |
-| 31 | GameTheory-06d : Sympathie contre Engagement — la… | Python 3 | READY | BETA | 30min | po-2024 |
-| 32 | GameTheory-07-ExtensiveForm (Twin C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 33 | GameTheory-07-ExtensiveForm | Python 3 | READY | BETA | 45min | po-2024 |
-| 34 | GameTheory-08-CombinatorialGames (C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 35 | GameTheory 8 - Jeux Combinatoires | Python (GameTheory WSL +… | READY | BETA | 30min | po-2024 |
-| 36 | GameTheory 8b - Jeux Combinatoires en Lean | Lean 4 (WSL) | READY | BETA | 15min | po-2024 |
-| 37 | GameTheory 8c - Jeux Combinatoires :… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 38 | GameTheory 8c - Jeux Combinatoires :… | Python (GameTheory WSL +… | READY | BETA | 30min | po-2024 |
-| 39 | GameTheory 8d - Combinatorial Games natif : le… | Lean 4 (WSL) | READY | BETA | 30min | po-2024 |
-| 40 | GameTheory-09-BackwardInduction (C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 41 | GameTheory-09-BackwardInduction | Python 3 | READY | BETA | 45min | po-2024 |
-| 42 | Stackelberg : la performativité sans mystère | Python 3 | READY | BETA | 30min | po-2024 |
-| 43 | GameTheory-09c : Stackelberg Security Game —… | Python 3 | READY | BETA | 15min | po-2024 |
-| 44 | GameTheory-10 — Équilibres Parfaits de Sous-Jeux… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 45 | GameTheory-10-ForwardInduction-SPE | Python 3 | READY | BETA | 45min | po-2024 |
-| 46 | GameTheory-11-BayesianGames-Csharp | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 47 | GameTheory-11-BayesianGames | Python 3 | READY | BETA | 45min | po-2024 |
-| 48 | GameTheory-11b — Jeux Bayésiens en Lean 4… | Lean 4 (WSL) | READY | BETA | 45min | po-2024 |
-| 49 | GameTheory-12 — Jeux de Réputation (twin C# du… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 50 | GameTheory-12-ReputationGames | Python 3 | READY | BETA | 30min | po-2024 |
-| 51 | GameTheory-13 : Jeux a Information Imparfaite et… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 52 | GameTheory-13 : Jeux a Information Imparfaite et… | Python (GameTheory WSL +… | READY | BETA | 1h | po-2024 |
-| 53 | GameTheory-13b : Safe Subgame Solving -- quand le… | Python (coursia-ml-training) | READY | BETA | 30min | po-2024 |
-| 54 | GameTheory-13c : Safe Subgame Solving en C# — le… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 55 | GameTheory-13d : Optimistic Counterfactual Regret… | Python 3 | READY | BETA | 15min | po-2024 |
-| 56 | GameTheory-14 : Jeux Differentiels et Equilibres… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 57 | GameTheory-14 : Jeux Differentiels et Equilibres… | Python 3 | READY | BETA | 45min | po-2024 |
-| 58 | GameTheory-15 — Jeux Coopératifs (Twin C#) | .NET (C#) | READY | BETA | 1h | po-2024 |
-| 59 | GameTheory-15-CooperativeGames | Python 3 (ipykernel) | READY | BETA | 45min | po-2024 |
-| 60 | GameTheory 15b - Jeux Cooperatifs en Lean :… | Lean 4 (WSL) | READY | BETA | 45min | po-2024 |
-| 61 | GameTheory 15c - Jeux Cooperatifs (C# / .NET) | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 62 | GameTheory 15c - Jeux Cooperatifs Lean (Python) | Python (coursia-ml-training) | READY | BETA | 45min | po-2024 |
-| 63 | GameTheory 15d - La decomposition de Mobius sur le… | Python 3 | READY | BETA | 30min | po-2024 |
-| 64 | GameTheory-16-MechanismDesign (C#) | .NET (C#) | READY | BETA | 30min | po-2024 |
-| 65 | GameTheory-16 : Théorie des Mécanismes et Principe… | Python (GameTheory WSL +… | READY | BETA | 45min | po-2024 |
-| 66 | GameTheory-16b : Automated Mechanism Design (AMD) | Python 3 | READY | BETA | 15min | po-2024 |
-| 67 | GameTheory-16c : La dimension paiement que le… | Python 3 | READY | BETA | 15min | po-2024 |
-| 68 | GameTheory-16d — L'echange de reins : de la valeur… | Python 3 | READY | BETA | 30min | po-2024 |
-| 69 | GameTheory-17 (C#) : Multi-Agent Reinforcement… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 70 | GameTheory-17 : Apprentissage par Renforcement… | Python (GameTheory WSL +… | READY | BETA | 30min | po-2024 |
-| 71 | Information asymétrique : types privés,… | Python 3 | READY | BETA | 30min | po-2024 |
-| 72 | Le marché des lemons : le certificat formel… | Lean 4 (WSL) | READY | BETA | 30min | po-2024 |
-| 73 | Du marché au bilan : le pont théorie des jeux… | Python 3 | READY | BETA | 30min | po-2024 |
-| 74 | Screening, signal et anticipation : les trois… | Lean 4 (WSL) | READY | BETA | 30min | po-2024 |
-| 75 | GameTheory-18 : Open Games et Lentilles -- la… | Python 3 (ipykernel) | READY | BETA | 30min | po-2024 |
-| 76 | GameTheory-18b : Casser la composition — où la… | Python 3 | READY | BETA | 30min | po-2024 |
-| 77 | GameTheory-19 : L'abstraction a dette mesurable | Python 3 | READY | BETA | 15min | po-2024 |
-| 78 | GameTheory 24 : Le chemin minimal, témoin… | Python 3 | READY | DRAFT | 45min | po-2024 |
-| 79 | GameTheory 24b : Le temoin d'impossibilite | Python 3 | READY | BETA | 30min | po-2024 |
-| 80 | GameTheory-25 — Loi II, seconde jambe :… | Python 3 | READY | BETA | 30min | po-2024 |
-| 81 | GameTheory-26 — Ensembles limites :… | Python 3 | READY | BETA | 30min | po-2024 |
-| 82 | GameTheory-27 — L'algorithme de Kuhn-Munkres :… | Python 3 | READY | BETA | 30min | po-2024 |
-| 83 | GameTheory 27b — Le lake assignment_lean par son… | Lean 4 (WSL) | READY | BETA | 30min | po-2024 |
-| 84 | GameTheory-28 : Banc de calibration — humour,… | Python (CoursIA-2 venv) | READY | BETA | 30min | po-2024 |
-| 85 | GameTheory-28b : Banc humour — passer à l'échelle | Python 3 | READY | BETA | 30min | po-2024 |
-| 86 | SocialChoice 01 : Théorème d'impossibilité d'Arrow… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 87 | SocialChoice 01 - Theoreme d'Arrow : Preuve… | Python 3 | READY | BETA | 30min | po-2024 |
-| 88 | SocialChoice 01b - Choix Social Formel en Lean 4 | Lean 4 (WSL) | READY | ALPHA | 45min | po-2024 |
-| 89 | SocialChoice 03 : Méthodes de Vote et Paradoxes… | .NET (C#) | READY | ALPHA | 45min | po-2024 |
-| 90 | SocialChoice 03 - Méthodes de Vote et Paradoxes | Python 3 | READY | BETA | 45min | po-2024 |
-| 91 | SocialChoice 04 : Agregation Computationnelle -… | .NET (C#) | READY | BETA | 45min | po-2024 |
-| 92 | SocialChoice 04 - Agregation Computationnelle :… | Python 3 (WSL) | READY | BETA | 45min | po-2024 |
-| 93 | SocialChoice-05 : Gibbard-Satterthwaite sans… | Python 3 | READY | BETA | 15min | po-2024 |
+| 7 | GameTheory-02c-Travelers-Dilemma | Python 3 | READY | BETA | 30min | po-2024 |
+| 8 | GameTheory-3 : Topologie des Jeux 2×2 — Twin C#… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 9 | GameTheory-03-Topology2x2 | Python 3 | READY | BETA | 45min | po-2024 |
+| 10 | GameTheory-3a — Chemins de swaps : à quelle… | Python 3 | READY | BETA | 30min | po-2024 |
+| 11 | GameTheory 3b : Chambres, murs, codimension — les… | Python 3 (ipykernel) | READY | BETA | 30min | po-2024 |
+| 12 | GameTheory-3c — Le joueur LLM dans le tableau… | Python 3 | DEMO | BETA | 30min | po-2024 |
+| 13 | GameTheory-03d — Biens publics non-lineaires :… | Python 3 | READY | BETA | 15min | po-2024 |
+| 14 | GameTheory 3e : Meta-Actions Tarifees -- l'agent… | Python 3 | READY | BETA | 30min | po-2024 |
+| 15 | GameTheory 3f : Le Parcours Complet -- du jeu… | Python 3 | READY | BETA | 30min | po-2024 |
+| 16 | GameTheory-03g — De 576 à 144 : dériver le… | Python 3 | READY | BETA | 30min | po-2024 |
+| 17 | GameTheory-03h — Deux espèces de flèches : quand… | Python 3 | READY | BETA | 30min | po-2024 |
+| 18 | GameTheory-04-NashEquilibrium (C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 19 | GameTheory-04-NashEquilibrium | Python 3 | READY | BETA | 30min | po-2024 |
+| 20 | GameTheory 4b - Theoreme d'Existence de Nash… | Lean 4 (WSL) | READY | BETA | 45min | po-2024 |
+| 21 | GameTheory 4c - Théorème d'Existence de Nash (C#) | .NET (C#) | READY | ALPHA | 45min | po-2024 |
+| 22 | GameTheory 4c - Theoreme d'Existence de Nash… | Python 3 | READY | BETA | 45min | po-2024 |
+| 23 | GameTheory-04d-Marchandage-Asymetrique | Python 3 | READY | BETA | 30min | po-2024 |
+| 24 | GameTheory 04e — Oracles réflexifs, décision… | Python 3 | READY | BETA | 15min | po-2024 |
+| 25 | GameTheory-05-ZeroSum-Minimax (Twin C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 26 | GameTheory-05-ZeroSum-Minimax | Python 3 | READY | BETA | 30min | po-2024 |
+| 27 | GameTheory-5b — Théorème minimax de von Neumann… | Lean 4 (WSL) | READY | BETA | 15min | po-2024 |
+| 28 | GameTheory-6 : Évolution et Confiance — Twin C#… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 29 | GameTheory-06-EvolutionTrust | Python 3 | READY | BETA | 45min | po-2024 |
+| 30 | GameTheory-6b — Jeux répétés en Lean : le lake… | Python 3 | READY | DRAFT | 30min | po-2024 |
+| 31 | GameTheory-6c (C#) : Jeux Répétés et Théorème Folk | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 32 | GameTheory-6c : Jeux Répétés et Théorème Folk… | Python 3 | READY | BETA | 30min | po-2024 |
+| 33 | GameTheory-06d : Sympathie contre Engagement — la… | Python 3 | READY | BETA | 30min | po-2024 |
+| 34 | GameTheory-07-ExtensiveForm (Twin C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 35 | GameTheory-07-ExtensiveForm | Python 3 | READY | BETA | 45min | po-2024 |
+| 36 | GameTheory-08-CombinatorialGames (C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 37 | GameTheory 8 - Jeux Combinatoires | Python 3 | READY | BETA | 30min | po-2024 |
+| 38 | GameTheory 8b - Jeux Combinatoires en Lean | Lean 4 (WSL) | READY | BETA | 15min | po-2024 |
+| 39 | GameTheory 8c - Jeux Combinatoires :… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 40 | GameTheory 8c - Jeux Combinatoires :… | Python 3 | READY | BETA | 30min | po-2024 |
+| 41 | GameTheory 8d - Combinatorial Games natif : le… | Lean 4 (WSL) | READY | BETA | 30min | po-2024 |
+| 42 | GameTheory-09-BackwardInduction (C#) | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 43 | GameTheory-09-BackwardInduction | Python 3 | READY | BETA | 45min | po-2024 |
+| 44 | Stackelberg : la performativité sans mystère | Python 3 | READY | BETA | 30min | po-2024 |
+| 45 | GameTheory-09c : Stackelberg Security Game —… | Python 3 | READY | BETA | 15min | po-2024 |
+| 46 | GameTheory-10 — Équilibres Parfaits de Sous-Jeux… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 47 | GameTheory-10-ForwardInduction-SPE | Python 3 | READY | BETA | 45min | po-2024 |
+| 48 | GameTheory-11-BayesianGames-Csharp | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 49 | GameTheory-11-BayesianGames | Python 3 | READY | BETA | 45min | po-2024 |
+| 50 | GameTheory-11b — Jeux Bayésiens en Lean 4… | Lean 4 (WSL) | READY | BETA | 45min | po-2024 |
+| 51 | GameTheory-12 — Jeux de Réputation (twin C# du… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 52 | GameTheory-12-ReputationGames | Python 3 | READY | BETA | 30min | po-2024 |
+| 53 | GameTheory-13 : Jeux a Information Imparfaite et… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 54 | GameTheory-13 : Jeux a Information Imparfaite et… | Python (GameTheory WSL +… | READY | BETA | 1h | po-2024 |
+| 55 | GameTheory-13b : Safe Subgame Solving -- quand le… | Python (coursia-ml-training) | READY | BETA | 30min | po-2024 |
+| 56 | GameTheory-13c : Safe Subgame Solving en C# — le… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 57 | GameTheory-13d : Optimistic Counterfactual Regret… | Python 3 | READY | BETA | 15min | po-2024 |
+| 58 | GameTheory-14 : Jeux Differentiels et Equilibres… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 59 | GameTheory-14 : Jeux Differentiels et Equilibres… | Python 3 | READY | BETA | 45min | po-2024 |
+| 60 | GameTheory-15 — Jeux Coopératifs (Twin C#) | .NET (C#) | READY | BETA | 1h | po-2024 |
+| 61 | GameTheory-15-CooperativeGames | Python 3 (ipykernel) | READY | BETA | 45min | po-2024 |
+| 62 | GameTheory 15b - Jeux Cooperatifs en Lean :… | Lean 4 (WSL) | READY | BETA | 45min | po-2024 |
+| 63 | GameTheory 15c - Jeux Cooperatifs (C# / .NET) | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 64 | GameTheory 15c - Jeux Cooperatifs Lean (Python) | Python (coursia-ml-training) | READY | BETA | 45min | po-2024 |
+| 65 | GameTheory 15d - La decomposition de Mobius sur le… | Python 3 | READY | BETA | 30min | po-2024 |
+| 66 | GameTheory-15e — Pouvoir coalitionnel : calcul,… | Python 3 | READY | BETA | 30min | po-2024 |
+| 67 | GameTheory-16-MechanismDesign (C#) | .NET (C#) | READY | BETA | 30min | po-2024 |
+| 68 | GameTheory-16 : Théorie des Mécanismes et Principe… | Python 3 | READY | BETA | 45min | po-2024 |
+| 69 | GameTheory-16b : Automated Mechanism Design (AMD) | Python 3 | READY | BETA | 15min | po-2024 |
+| 70 | GameTheory-16c : La dimension paiement que le… | Python 3 | READY | BETA | 15min | po-2024 |
+| 71 | GameTheory-16d — L'echange de reins : de la valeur… | Python 3 | READY | BETA | 30min | po-2024 |
+| 72 | GameTheory-17 (C#) : Multi-Agent Reinforcement… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 73 | GameTheory-17 : Apprentissage par Renforcement… | Python (GameTheory WSL +… | READY | BETA | 30min | po-2024 |
+| 74 | Information asymétrique : types privés,… | Python 3 | READY | BETA | 30min | po-2024 |
+| 75 | Le marché des lemons : le certificat formel… | Lean 4 (WSL) | READY | BETA | 30min | po-2024 |
+| 76 | Du marché au bilan : le pont théorie des jeux… | Python 3 | READY | BETA | 30min | po-2024 |
+| 77 | Screening, signal et anticipation : les trois… | Lean 4 (WSL) | READY | BETA | 30min | po-2024 |
+| 78 | GameTheory-18 : Open Games et Lentilles -- la… | Python 3 (ipykernel) | READY | BETA | 30min | po-2024 |
+| 79 | GameTheory-18b : Casser la composition — où la… | Python 3 | READY | BETA | 30min | po-2024 |
+| 80 | GameTheory-19 : L'abstraction a dette mesurable | Python 3 | READY | BETA | 15min | po-2024 |
+| 81 | GameTheory 24 : Le chemin minimal, témoin… | Python 3 | READY | DRAFT | 45min | po-2024 |
+| 82 | GameTheory 24b : Le temoin d'impossibilite | Python 3 | READY | BETA | 30min | po-2024 |
+| 83 | GameTheory-25 — Loi II, seconde jambe :… | Python 3 | READY | BETA | 30min | po-2024 |
+| 84 | GameTheory-26 — Ensembles limites :… | Python 3 | READY | BETA | 30min | po-2024 |
+| 85 | GameTheory-27 — L'algorithme de Kuhn-Munkres :… | Python 3 | READY | BETA | 30min | po-2024 |
+| 86 | GameTheory 27b — Le lake assignment_lean par son… | Lean 4 (WSL) | READY | BETA | 30min | po-2024 |
+| 87 | GameTheory-28 : Banc de calibration — humour,… | Python (CoursIA-2 venv) | READY | BETA | 30min | po-2024 |
+| 88 | GameTheory-28b : Banc humour — passer à l'échelle | Python 3 | READY | BETA | 30min | po-2024 |
+| 89 | SocialChoice 01 : Théorème d'impossibilité d'Arrow… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 90 | SocialChoice 01 - Theoreme d'Arrow : Preuve… | Python 3 | READY | BETA | 30min | po-2024 |
+| 91 | SocialChoice 01b - Choix Social Formel en Lean 4 | Lean 4 (WSL) | READY | ALPHA | 45min | po-2024 |
+| 92 | SocialChoice 03 : Méthodes de Vote et Paradoxes… | .NET (C#) | READY | ALPHA | 45min | po-2024 |
+| 93 | SocialChoice 03 - Méthodes de Vote et Paradoxes | Python 3 | READY | BETA | 45min | po-2024 |
+| 94 | SocialChoice 04 : Agregation Computationnelle -… | .NET (C#) | READY | BETA | 45min | po-2024 |
+| 95 | SocialChoice 04 - Agregation Computationnelle :… | Python 3 (WSL) | READY | BETA | 45min | po-2024 |
+| 96 | SocialChoice-05 : Gibbard-Satterthwaite sans… | Python 3 | READY | BETA | 15min | po-2024 |
-### Sudoku (37 notebooks) — DEMO:1, READY:36 | BETA:37
+### Sudoku (38 notebooks) — DEMO:1, READY:37 | BETA:38
| # | Notebook | Kernel | Status | Maturity | Duration | Owner |
|---|----------|--------|--------|----------|----------|-------|
@@ -983,90 +991,93 @@ Total notebooks: 1111
| 23 | Notebook 11: Résolution de Sudoku avec Choco… | Python 3 | READY | BETA | 30min | po-2023 |
| 24 | Sudoku-12 : Résolution avec Z3 SMT Solver (C#) | .NET (C#) | READY | BETA | 45min | po-2023 |
| 25 | Sudoku-12-Z3-Python : Z3 SMT Solver (Python) | Python 3 | READY | BETA | 30min | po-2023 |
-| 26 | Sudoku-13 : Le Sudoku comme Regex Symbolique -… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 27 | Sudoku-13 : Le Sudoku comme Regex Symbolique —… | Python 3 | READY | BETA | 30min | po-2023 |
-| 28 | Sudoku-14 : Automates avec BDD/MDD - Approche Pure | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 29 | Sudoku-14 : Automates avec BDD/MDD - Approche Pure… | Python 3 | READY | BETA | 30min | po-2023 |
-| 30 | Résolution de Sudoku avec Infer.NET | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 31 | Sudoku-15-Infer-Python : Resolution Probabiliste… | Python 3 | READY | BETA | 45min | po-2023 |
-| 32 | Sudoku-16 : Résolution par Réseaux de Neurones | Python 3 | READY | BETA | 1h | po-2023 |
-| 33 | Notebook 17: Resolution de Sudoku avec Large… | Python 3 | DEMO | BETA | 45min | po-2023 |
-| 34 | Comparaison des Solveurs de Sudoku | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 35 | Comparaison des Solveurs de Sudoku | Python 3 | READY | BETA | 45min | po-2023 |
-| 36 | Sudoku-18b - Comparaison statistique honnête de… | Python 3 | READY | BETA | 30min | po-2023 |
-| 37 | Sudoku-7b — Soundness de la propagation de… | Lean 4 (WSL) | READY | BETA | 15min | po-2023 |
+| 26 | Sudoku 12b : Linq2Z3 — l'histoire d'un binding, de… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 27 | Sudoku-13 : Le Sudoku comme Regex Symbolique -… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 28 | Sudoku-13 : Le Sudoku comme Regex Symbolique —… | Python 3 | READY | BETA | 30min | po-2023 |
+| 29 | Sudoku-14 : Automates avec BDD/MDD - Approche Pure | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 30 | Sudoku-14 : Automates avec BDD/MDD - Approche Pure… | Python 3 | READY | BETA | 30min | po-2023 |
+| 31 | Résolution de Sudoku avec Infer.NET | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 32 | Sudoku-15-Infer-Python : Resolution Probabiliste… | Python 3 | READY | BETA | 45min | po-2023 |
+| 33 | Sudoku-16 : Résolution par Réseaux de Neurones | Python 3 | READY | BETA | 1h | po-2023 |
+| 34 | Notebook 17: Resolution de Sudoku avec Large… | Python 3 | DEMO | BETA | 45min | po-2023 |
+| 35 | Comparaison des Solveurs de Sudoku | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 36 | Comparaison des Solveurs de Sudoku | Python 3 | READY | BETA | 45min | po-2023 |
+| 37 | Sudoku-18b - Comparaison statistique honnête de… | Python 3 | READY | BETA | 30min | po-2023 |
+| 38 | Sudoku-19 — Soundness de la propagation de… | Lean 4 (WSL) | READY | BETA | 15min | po-2023 |
-### Probas (67 notebooks) — READY:67 | BETA:67
+### Probas (69 notebooks) — READY:69 | ALPHA:1, BETA:68
| # | Notebook | Kernel | Status | Maturity | Duration | Owner |
|---|----------|--------|--------|----------|----------|-------|
-| 1 | Du graphe causal au do-calculus — le pont entre… | Python 3 (coursia-ml-training) | READY | BETA | 30min | po-2023 |
-| 2 | DoWhy-1 — Exiger un estimand : l'identification… | Python 3 | READY | BETA | 30min | po-2023 |
-| 3 | DoWhy-2 — Le contrefactuel individuel : quand… | Python 3 (coursia-ml-training) | READY | BETA | 30min | po-2023 |
-| 4 | Méthodes quasi-expérimentales — identifier l'effet… | Python 3 (coursia-ml-training) | READY | BETA | 45min | po-2023 |
-| 5 | DecInfer-01-Utility-Foundations : Axiomes et… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 6 | DecInfer-02-Théorème de représentation de von… | Lean 4 (WSL) | READY | BETA | 15min | po-2023 |
-| 7 | DecInfer-03-Utility-Money : Utilite de l'Argent et… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 8 | DecInfer-04-Multi-Attribute : Utilite… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 9 | DecInfer-05-Decision-Networks : Reseaux de… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 10 | DecInfer-06-Value-Information : Valeur de… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 11 | DecInfer-07-Expert-Systems : Decisions Robustes et… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 12 | DecInfer-08-Sequential : MDPs, Bandits et POMDPs | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 13 | DecInfer-09-Preuves formelles — Indice de Gittins | Lean 4 (WSL) | READY | BETA | 30min | po-2023 |
-| 14 | DecInfer-10-Thompson-Sampling : Bandits bayesiens… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 15 | DecPyMC-1-Utility-Foundations : Axiomes et… | Python 3 | READY | BETA | 30min | po-2023 |
-| 16 | DecPyMC-10 : Ruine et capital — le processus de… | Python 3 (ipykernel) | READY | BETA | 30min | po-2023 |
-| 17 | DecPyMC-11 — Valeur de l'Information en… | Python 3 | READY | BETA | 30min | po-2023 |
-| 18 | DecPyMC-12 — Fréquence × sévérité hiérarchique :… | Python 3 | READY | BETA | 30min | po-2023 |
-| 19 | DecPyMC-2-Utility-Money : Utilite de l'Argent et… | Python 3 (ipykernel) | READY | BETA | 45min | po-2023 |
-| 20 | DecPyMC-3-Multi-Attribute : Utilite… | Python 3 | READY | BETA | 45min | po-2023 |
-| 21 | DecPyMC-4-Decision-Networks : Reseaux de Decision | Python 3 | READY | BETA | 30min | po-2023 |
-| 22 | DecPyMC-5-Valeur de l'Information | Python 3 | READY | BETA | 45min | po-2023 |
-| 23 | DecPyMC-6-Systèmes Experts et Decisions Robustes | Python 3 | READY | BETA | 45min | po-2023 |
-| 24 | DecPyMC-7-MDPs, Bandits et POMDPs | Python 3 | READY | BETA | 45min | po-2023 |
-| 25 | DecPyMC-8 — Crédibilité actuarielle de… | Python 3 (ipykernel) | READY | BETA | 30min | po-2023 |
-| 26 | DecPyMC-9 : Du risque à la prime — prime pure,… | Python 3 (ipykernel) | READY | BETA | 45min | po-2023 |
-| 27 | Infer-101 : Introduction a Infer.NET | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 28 | Infer-1-Setup : Introduction et Installation | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 29 | Infer-10-Model-Sélection : Sélection et… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 30 | Infer-11-Topic-Models : Latent Dirichlet… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 31 | 12. Modèles Hiérarchiques Bayésiens — Pooling… | .NET (C#) | READY | BETA | 30min | po-2023 |
-| 32 | Infer-13-Crowdsourcing : Agregation de Labels et… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 33 | Infer-14-Sequences : Hidden Markov Models et… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 34 | Infer-15-Recommenders : systèmes de Recommandation | .NET (C#) | READY | BETA | 1h30 | po-2023 |
-| 35 | Infer-16-Sparse-Gaussian-Process : Processus… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 36 | Infer-17 — Filtre de Kalman : systèmes dynamiques… | .NET (C#) | READY | BETA | 30min | po-2023 |
-| 37 | Infer-18 — Détection de Rupture (Change-Point) :… | .NET (C#) | READY | BETA | 30min | po-2023 |
-| 38 | Infer-19 — Analyse de survie / fiabilite… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 39 | Infer-2-Gaussian-Mixtures : Distributions… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 40 | Infer-20 — Quotients, fibres et recollement : ce… | Python 3 | READY | BETA | 30min | po-2023 |
-| 41 | Infer-2b-Debugging-Bonnes-Pratiques :… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 42 | Infer-3-Factor-Graphs : Graphes de Facteurs et… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 43 | Infer-4-Bayesian-Networks : Reseaux Bayesiens… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 44 | Infer-5-Causal-Inference : Inférence Causale et… | .NET (C#) | READY | BETA | 45min | po-2023 |
-| 45 | Infer-7-Skills-IRT : Evaluation de Competences et… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 46 | Infer-8-TrueSkill : Système de Classement et… | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 47 | Infer-9-Classification : Classification Bayesienne | .NET (C#) | READY | BETA | 1h | po-2023 |
-| 48 | PyMC-1 : Configuration et Premier Modèle | Python 3 | READY | BETA | 30min | po-2023 |
-| 49 | PyMC-2 : Distributions Gaussiennes et Mélanges | Python 3 | READY | BETA | 30min | po-2023 |
-| 50 | PyMC-3 : Graphes de Facteurs et Inference Discrete | Python 3 | READY | BETA | 30min | po-2023 |
-| 51 | PyMC-4 : Reseaux Bayesiens | Python 3 | READY | BETA | 30min | po-2023 |
-| 52 | PyMC-05-Causal-Inference : Inference Causale et… | Python 3 | READY | BETA | 30min | po-2023 |
-| 53 | PyMC-06-Debugging : Troubleshooting et Bonnes… | Python 3 | READY | BETA | 30min | po-2023 |
-| 54 | PyMC-7 : Modèles de Competences (IRT et DINA) | Python 3 | READY | BETA | 30min | po-2023 |
-| 55 | PyMC-8 : TrueSkill - Classement et Apprentissage… | Python 3 | READY | BETA | 45min | po-2023 |
-| 56 | PyMC-9 : Classification Bayesienne et Tests A/B | Python 3 | READY | BETA | 30min | po-2023 |
-| 57 | PyMC-10 : Sélection de Modèles et Comparaison… | Python 3 | READY | BETA | 45min | po-2023 |
-| 58 | PyMC-11 : Modèles de Sujets (Topic Models) et LDA | Python 3 | READY | BETA | 45min | po-2023 |
-| 59 | 12. Modèles Hiérarchiques Bayesiens -- Pooling… | Python 3 | READY | BETA | 30min | po-2023 |
-| 60 | PyMC-13 : Crowdsourcing - Agregation de Labels et… | Python 3 | READY | BETA | 45min | po-2023 |
-| 61 | PyMC-14 — Modèles de Sequences et Chaînes de… | Python 3 | READY | BETA | 45min | po-2023 |
-| 62 | PyMC-15-Recommenders : Systèmes de Recommandation… | Python 3 | READY | BETA | 45min | po-2023 |
-| 63 | PyMC-16 : Processus Gaussiens et frontières non… | Python 3 | READY | BETA | 45min | po-2023 |
-| 64 | 17. Filtre de Kalman : systèmes dynamiques… | Python 3 | READY | BETA | 30min | po-2023 |
-| 65 | 18. Detection de Rupture (Change-Point) : inferer… | Python 3 | READY | BETA | 30min | po-2023 |
-| 66 | 19. Analyse de survie / fiabilite bayesienne :… | Python 3 | READY | BETA | 30min | po-2023 |
-| 67 | Le Framework Rational Speech Act (RSA) | Python 3 | READY | BETA | 45min | po-2023 |
+| 1 | Percolation-Lean — le noyau fini de percolation,… | Lean 4 (WSL, percolation) | READY | BETA | 30min | po-2023 |
+| 2 | Percolation supercritique : le géant au-dessus du… | Python 3 | READY | ALPHA | 30min | po-2023 |
+| 3 | Du graphe causal au do-calculus — le pont entre… | Python 3 (coursia-ml-training) | READY | BETA | 30min | po-2023 |
+| 4 | DoWhy-1 — Exiger un estimand : l'identification… | Python 3 | READY | BETA | 30min | po-2023 |
+| 5 | DoWhy-2 — Le contrefactuel individuel : quand… | Python 3 (coursia-ml-training) | READY | BETA | 30min | po-2023 |
+| 6 | Méthodes quasi-expérimentales — identifier l'effet… | Python 3 (coursia-ml-training) | READY | BETA | 45min | po-2023 |
+| 7 | DecInfer-01-Utility-Foundations : Axiomes et… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 8 | DecInfer-02-Théorème de représentation de von… | Lean 4 (WSL) | READY | BETA | 15min | po-2023 |
+| 9 | DecInfer-03-Utility-Money : Utilite de l'Argent et… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 10 | DecInfer-04-Multi-Attribute : Utilite… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 11 | DecInfer-05-Decision-Networks : Reseaux de… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 12 | DecInfer-06-Value-Information : Valeur de… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 13 | DecInfer-07-Expert-Systems : Decisions Robustes et… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 14 | DecInfer-08-Sequential : MDPs, Bandits et POMDPs | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 15 | DecInfer-09-Preuves formelles — Indice de Gittins | Lean 4 (WSL) | READY | BETA | 30min | po-2023 |
+| 16 | DecInfer-10-Thompson-Sampling : Bandits bayesiens… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 17 | DecPyMC-1-Utility-Foundations : Axiomes et… | Python 3 | READY | BETA | 30min | po-2023 |
+| 18 | DecPyMC-10 : Ruine et capital — le processus de… | Python 3 (ipykernel) | READY | BETA | 30min | po-2023 |
+| 19 | DecPyMC-11 — Valeur de l'Information en… | Python 3 | READY | BETA | 30min | po-2023 |
+| 20 | DecPyMC-12 — Fréquence × sévérité hiérarchique :… | Python 3 | READY | BETA | 30min | po-2023 |
+| 21 | DecPyMC-2-Utility-Money : Utilite de l'Argent et… | Python 3 (ipykernel) | READY | BETA | 45min | po-2023 |
+| 22 | DecPyMC-3-Multi-Attribute : Utilite… | Python 3 | READY | BETA | 45min | po-2023 |
+| 23 | DecPyMC-4-Decision-Networks : Reseaux de Decision | Python 3 | READY | BETA | 30min | po-2023 |
+| 24 | DecPyMC-5-Valeur de l'Information | Python 3 | READY | BETA | 45min | po-2023 |
+| 25 | DecPyMC-6-Systèmes Experts et Decisions Robustes | Python 3 | READY | BETA | 45min | po-2023 |
+| 26 | DecPyMC-7-MDPs, Bandits et POMDPs | Python 3 | READY | BETA | 45min | po-2023 |
+| 27 | DecPyMC-8 — Crédibilité actuarielle de… | Python 3 (ipykernel) | READY | BETA | 30min | po-2023 |
+| 28 | DecPyMC-9 : Du risque à la prime — prime pure,… | Python 3 (ipykernel) | READY | BETA | 45min | po-2023 |
+| 29 | Infer-1-Setup : Introduction et Installation | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 30 | Infer-10-Model-Sélection : Sélection et… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 31 | Infer-11-Topic-Models : Latent Dirichlet… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 32 | 12. Modèles Hiérarchiques Bayésiens — Pooling… | .NET (C#) | READY | BETA | 30min | po-2023 |
+| 33 | Infer-13-Crowdsourcing : Agregation de Labels et… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 34 | Infer-14-Sequences : Hidden Markov Models et… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 35 | Infer-15-Recommenders : systèmes de Recommandation | .NET (C#) | READY | BETA | 1h30 | po-2023 |
+| 36 | Infer-16-Sparse-Gaussian-Process : Processus… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 37 | Infer-17 — Filtre de Kalman : systèmes dynamiques… | .NET (C#) | READY | BETA | 30min | po-2023 |
+| 38 | Infer-18 — Détection de Rupture (Change-Point) :… | .NET (C#) | READY | BETA | 30min | po-2023 |
+| 39 | Infer-19 — Analyse de survie / fiabilite… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 40 | Infer-1b : Introduction a Infer.NET | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 41 | Infer-2-Gaussian-Mixtures : Distributions… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 42 | Infer-20 — Quotients, fibres et recollement : ce… | Python 3 | READY | BETA | 30min | po-2023 |
+| 43 | Infer-2b-Debugging-Bonnes-Pratiques :… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 44 | Infer-3-Factor-Graphs : Graphes de Facteurs et… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 45 | Infer-4-Bayesian-Networks : Reseaux Bayesiens… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 46 | Infer-5-Causal-Inference : Inférence Causale et… | .NET (C#) | READY | BETA | 45min | po-2023 |
+| 47 | Infer-7-Skills-IRT : Evaluation de Competences et… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 48 | Infer-8-TrueSkill : Système de Classement et… | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 49 | Infer-9-Classification : Classification Bayesienne | .NET (C#) | READY | BETA | 1h | po-2023 |
+| 50 | PyMC-1 : Configuration et Premier Modèle | Python 3 | READY | BETA | 30min | po-2023 |
+| 51 | PyMC-2 : Distributions Gaussiennes et Mélanges | Python 3 | READY | BETA | 30min | po-2023 |
+| 52 | PyMC-3 : Graphes de Facteurs et Inference Discrete | Python 3 | READY | BETA | 30min | po-2023 |
+| 53 | PyMC-4 : Reseaux Bayesiens | Python 3 | READY | BETA | 30min | po-2023 |
+| 54 | PyMC-05-Causal-Inference : Inference Causale et… | Python 3 | READY | BETA | 30min | po-2023 |
+| 55 | PyMC-06-Debugging : Troubleshooting et Bonnes… | Python 3 | READY | BETA | 30min | po-2023 |
+| 56 | PyMC-7 : Modèles de Competences (IRT et DINA) | Python 3 | READY | BETA | 30min | po-2023 |
+| 57 | PyMC-8 : TrueSkill - Classement et Apprentissage… | Python 3 | READY | BETA | 45min | po-2023 |
+| 58 | PyMC-9 : Classification Bayesienne et Tests A/B | Python 3 | READY | BETA | 30min | po-2023 |
+| 59 | PyMC-10 : Sélection de Modèles et Comparaison… | Python 3 | READY | BETA | 45min | po-2023 |
+| 60 | PyMC-11 : Modèles de Sujets (Topic Models) et LDA | Python 3 | READY | BETA | 45min | po-2023 |
+| 61 | 12. Modèles Hiérarchiques Bayesiens -- Pooling… | Python 3 | READY | BETA | 30min | po-2023 |
+| 62 | PyMC-13 : Crowdsourcing - Agregation de Labels et… | Python 3 | READY | BETA | 45min | po-2023 |
+| 63 | PyMC-14 — Modèles de Sequences et Chaînes de… | Python 3 | READY | BETA | 45min | po-2023 |
+| 64 | PyMC-15-Recommenders : Systèmes de Recommandation… | Python 3 | READY | BETA | 45min | po-2023 |
+| 65 | PyMC-16 : Processus Gaussiens et frontières non… | Python 3 | READY | BETA | 45min | po-2023 |
+| 66 | 17. Filtre de Kalman : systèmes dynamiques… | Python 3 | READY | BETA | 30min | po-2023 |
+| 67 | 18. Detection de Rupture (Change-Point) : inferer… | Python 3 | READY | BETA | 30min | po-2023 |
+| 68 | 19. Analyse de survie / fiabilite bayesienne :… | Python 3 | READY | BETA | 30min | po-2023 |
+| 69 | Le Framework Rational Speech Act (RSA) | Python 3 | READY | BETA | 45min | po-2023 |
### IIT (72 notebooks) — DEMO:1, READY:71 | ALPHA:1, BETA:63, DRAFT:8
@@ -1145,7 +1156,7 @@ Total notebooks: 1111
| 71 | IIT-4. Le problème de frontière — qui décide où… | Python 3 (PyPhi/IIT) | READY | BETA | 30min | po-2025 |
| 72 | IIT-5. Les lentilles de conscience comme bancs de… | unknown | READY | BETA | 15min | po-2025 |
-### RL (24 notebooks) — DEMO:3, READY:21 | BETA:23, DRAFT:1
+### RL (25 notebooks) — DEMO:3, READY:22 | BETA:24, DRAFT:1
| # | Notebook | Kernel | Status | Maturity | Duration | Owner |
|---|----------|--------|--------|----------|----------|-------|
@@ -1157,28 +1168,29 @@ Total notebooks: 1111
| 6 | Hierarchical RL — l'Option framework de Sutton,… | Python 3 | READY | BETA | 45min | po-2025 |
| 7 | RL-15 — GRPO (Group Relative Policy Optimization)… | Python 3 | DEMO | DRAFT | 45min | po-2025 |
| 8 | Tutoriel Stable Baselines3 - Premiers pas | Python 3 | READY | BETA | 45min | po-2025 |
-| 9 | Notebook 2 – Wrappers Gym, Sauvegarde/Chargement,… | Python 3 | DEMO | BETA | 45min | po-2025 |
-| 10 | Notebook 3 – Hindsight Experience Replay (HER) :… | Python 3 | READY | BETA | 45min | po-2025 |
-| 11 | RL-4 : Bandits Manchots et le Compromis… | Python 3 | READY | BETA | 45min | po-2025 |
-| 12 | RL-5 : MDP, Programmation Dynamique et Q-Learning… | Python 3 | READY | BETA | 1h | po-2025 |
-| 13 | RL-6 : Deep Q-Network (DQN) et Policy Gradient | Python 3 | READY | BETA | 45min | po-2025 |
-| 14 | RL-6b - Actor-Critic : unir valeur et politique | Python 3 | READY | BETA | 30min | po-2025 |
-| 15 | PPO (Proximal Policy Optimization) depuis zero | Python 3 | READY | BETA | 30min | po-2025 |
-| 16 | SAC (Soft Actor-Critic) depuis zero | Python 3 | READY | BETA | 30min | po-2025 |
-| 17 | GRPO (Group Relative Policy Optimization) depuis… | Python 3 | READY | BETA | 45min | po-2025 |
-| 18 | RL-7 : Introduction a l'Apprentissage Multi-Agent | Python 3 | READY | BETA | 30min | po-2025 |
-| 19 | RL-8 : Model-Based RL — Dyna-Q et planification | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
-| 20 | RL-9 : RL offline — Behavior Cloning et erreur… | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
-| 21 | RL Post-Training — 1 : PPO pour l'alignement d'un… | Python 3 | READY | BETA | 30min | po-2025 |
-| 22 | RL Post-Training — 2 : GRPO minimal — alignement… | Python (coursia-ml-training) | READY | BETA | 45min | po-2025 |
-| 23 | RL Post-Training — 3 : Reward hacking — anatomie… | Python (coursia-ml-training) | DEMO | BETA | 45min | po-2025 |
-| 24 | RL Post-Training — 4 : DPO offline vs RL online —… | Python (coursia-ml-training) | READY | BETA | 45min | po-2025 |
+| 9 | Synthese logique d'un controleur CartPole : le… | Python 3 | READY | BETA | 30min | po-2025 |
+| 10 | Notebook 2 – Wrappers Gym, Sauvegarde/Chargement,… | Python 3 | DEMO | BETA | 45min | po-2025 |
+| 11 | Notebook 3 – Hindsight Experience Replay (HER) :… | Python 3 | READY | BETA | 45min | po-2025 |
+| 12 | RL-4 : Bandits Manchots et le Compromis… | Python 3 | READY | BETA | 45min | po-2025 |
+| 13 | RL-5 : MDP, Programmation Dynamique et Q-Learning… | Python 3 | READY | BETA | 1h | po-2025 |
+| 14 | RL-6 : Deep Q-Network (DQN) et Policy Gradient | Python 3 | READY | BETA | 45min | po-2025 |
+| 15 | RL-6b - Actor-Critic : unir valeur et politique | Python 3 | READY | BETA | 30min | po-2025 |
+| 16 | PPO (Proximal Policy Optimization) depuis zero | Python 3 | READY | BETA | 30min | po-2025 |
+| 17 | SAC (Soft Actor-Critic) depuis zero | Python 3 | READY | BETA | 30min | po-2025 |
+| 18 | GRPO (Group Relative Policy Optimization) depuis… | Python 3 | READY | BETA | 45min | po-2025 |
+| 19 | RL-7 : Introduction a l'Apprentissage Multi-Agent | Python 3 | READY | BETA | 30min | po-2025 |
+| 20 | RL-8 : Model-Based RL — Dyna-Q et planification | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
+| 21 | RL-9 : RL offline — Behavior Cloning et erreur… | Python 3 (ipykernel) | READY | BETA | 30min | po-2025 |
+| 22 | RL Post-Training — 1 : PPO pour l'alignement d'un… | Python 3 | READY | BETA | 30min | po-2025 |
+| 23 | RL Post-Training — 2 : GRPO minimal — alignement… | Python (coursia-ml-training) | READY | BETA | 45min | po-2025 |
+| 24 | RL Post-Training — 3 : Reward hacking — anatomie… | Python (coursia-ml-training) | DEMO | BETA | 45min | po-2025 |
+| 25 | RL Post-Training — 4 : DPO offline vs RL online —… | Python (coursia-ml-training) | READY | BETA | 45min | po-2025 |
## Requirements
-- **API**: 175 notebooks
-- **GPU**: 125 notebooks
-- **Cloud**: 113 notebooks
+- **API**: 176 notebooks
+- **GPU**: 126 notebooks
+- **Cloud**: 114 notebooks
- **WSL**: 76 notebooks
-- **Local**: 699 notebooks
\ No newline at end of file
+- **Local**: 708 notebooks
\ No newline at end of file
diff --git a/MyIA.AI.Notebooks/GameTheory/README.md b/MyIA.AI.Notebooks/GameTheory/README.md
index 4c1b213534..dd546d6b15 100644
--- a/MyIA.AI.Notebooks/GameTheory/README.md
+++ b/MyIA.AI.Notebooks/GameTheory/README.md
@@ -4,9 +4,9 @@
La théorie des jeux est le langage mathématique de la stratégie. Elle modélise les situations où des agents rationnels prennent des décisions dont le résultat dépend des choix des autres : enchères, négociations commerciales, élections, poker, guerre commerciale, allocation de ressources. Cette dualité entre coopération et compétition est omniprésente en économie, en sciences politiques et en informatique (mécanismes de vote, smart contracts, réseaux). Le prix Nobel d'économie a été décerné à des théoriciens des jeux à sept reprises entre 1994 et 2020 — c'est un domaine vivant et influent.
diff --git a/MyIA.AI.Notebooks/GenAI/README.md b/MyIA.AI.Notebooks/GenAI/README.md
index e91bc0acb7..dfd54702d7 100644
--- a/MyIA.AI.Notebooks/GenAI/README.md
+++ b/MyIA.AI.Notebooks/GenAI/README.md
@@ -416,7 +416,7 @@ Trois sous-dossiers complètent la série sans être des notebooks :
diff --git a/MyIA.AI.Notebooks/ML/README.md b/MyIA.AI.Notebooks/ML/README.md
index 43ba919849..9a8d68ece2 100644
--- a/MyIA.AI.Notebooks/ML/README.md
+++ b/MyIA.AI.Notebooks/ML/README.md
@@ -2,9 +2,9 @@
> **À propos des décomptes** : le marqueur `CATALOG-STATUS` ci-dessus est la **source de vérité autoritative** pour les volumes (notebooks par sous-série, maturité). Il est régénéré chaque nuit par le workflow [`catalog-cron.yml`](../../.github/workflows/catalog-cron.yml) à 03:37 UTC sur `main` (commit `[skip ci]` par `github-actions[bot]`). Si vous observez un décalage entre ce marqueur et une phrase en prose de ce README — par exemple si une sous-série a reçu de nouveaux notebooks mergés après la dernière régénération —, **fiez-vous au marqueur** ; la prose sera ré-alignée manuellement lors du prochain passage. Pour les **décomptes par kernel** (Python vs C#/.NET) au sein d'une sous-série, ce README reste autoritatif car la décomposition langagière par sous-série n'est pas dans le marqueur agrégé.
diff --git a/MyIA.AI.Notebooks/Probas/README.md b/MyIA.AI.Notebooks/Probas/README.md
index 0eeb98398f..10878f5147 100644
--- a/MyIA.AI.Notebooks/Probas/README.md
+++ b/MyIA.AI.Notebooks/Probas/README.md
@@ -2,9 +2,9 @@
> **À propos des décomptes** : le marqueur `CATALOG-STATUS` ci-dessus est la **source de vérité autoritative** pour les volumes (notebooks par sous-série, maturité). Il est régénéré chaque nuit par le workflow [`catalog-cron.yml`](../../.github/workflows/catalog-cron.yml) à 03:37 UTC sur `main` (commit `[skip ci]` par `github-actions[bot]`). Pour les **décomptes par kernel** (C#/.NET vs Python vs Lean 4) au sein d'une sous-série — c'est-à-dire la répartition **technique** par interpréteur —, ce README reste autoritatif car la décomposition langagière par sous-série n'est pas dans le marqueur agrégé ; cette granularité est documentée ici par lecture directe des `metadata.kernelspec.language` des notebooks (`28 C# + 37 Python + 2 Lean 4 = 67 ✓` au 05/09/2026). Si vous observez un décalage entre ce marqueur et une phrase en prose de ce README, **fiez-vous au marqueur** ; la prose sera ré-alignée manuellement lors du prochain passage.
diff --git a/MyIA.AI.Notebooks/QuantConnect/Python/README.md b/MyIA.AI.Notebooks/QuantConnect/Python/README.md
index c2226b3781..c4a0c39ef9 100644
--- a/MyIA.AI.Notebooks/QuantConnect/Python/README.md
+++ b/MyIA.AI.Notebooks/QuantConnect/Python/README.md
@@ -1,8 +1,8 @@
# QuantConnect Python Notebooks
diff --git a/MyIA.AI.Notebooks/QuantConnect/README.md b/MyIA.AI.Notebooks/QuantConnect/README.md
index 8bba2d87ab..de2585fe8b 100644
--- a/MyIA.AI.Notebooks/QuantConnect/README.md
+++ b/MyIA.AI.Notebooks/QuantConnect/README.md
@@ -2,9 +2,9 @@
> **Note éditoriale — counts kernels par sous-série** : Le marqueur CATALOG-STATUS agrégé ci-dessus reste **autoritatif** pour la décomposition par **sous-série** (Python / projects / ML-Training-Pipeline / kelly_lean). En revanche, pour les décomptes par **kernel** (Python vs Lean 4) **au sein** d'une sous-série — c'est-à-dire la répartition technique par interpréteur —, **ce README reste autoritatif** car la décomposition langagière par sous-série n'est pas dans le marqueur agrégé. Cette granularité est documentée ici par lecture directe des `metadata.kernelspec.language` des notebooks :
diff --git a/MyIA.AI.Notebooks/README.md b/MyIA.AI.Notebooks/README.md
index 3d8c93dda9..85382af856 100644
--- a/MyIA.AI.Notebooks/README.md
+++ b/MyIA.AI.Notebooks/README.md
@@ -10,9 +10,9 @@ Le catalogue rassemble **plusieurs centaines de notebooks pédagogiques** répar
*Marqueur auto-régénéré quotidiennement par `.github/workflows/catalog-cron.yml` (file [`COURSE_CATALOG.generated.md`](../COURSE_CATALOG.generated.md) — source de vérité sur les volumes et la maturité). Toute PR qui modifierait ce bloc est signalée par `catalog-drift.yml` (read-only, catalog-pr-hygiene R1).*
diff --git a/MyIA.AI.Notebooks/RL/README.md b/MyIA.AI.Notebooks/RL/README.md
index 346f24ce72..a0ef9c9ee1 100644
--- a/MyIA.AI.Notebooks/RL/README.md
+++ b/MyIA.AI.Notebooks/RL/README.md
@@ -4,9 +4,9 @@
> **Note éditoriale (counts)** : Le marqueur `CATALOG-STATUS` ci-dessus est autoritatif pour le compte agrégé (17 notebooks canoniques). Pour la **décomposition langagière par kernel** (`metadata.kernelspec.language`), ce README reste autoritatif car la granularité kernel n'est pas dans le marqueur agrégé ; elle est documentée ici par lecture directe des kernelspecs au 10/07/2026 :
diff --git a/MyIA.AI.Notebooks/Search/README.md b/MyIA.AI.Notebooks/Search/README.md
index cdcf648a05..aa19bdb518 100644
--- a/MyIA.AI.Notebooks/Search/README.md
+++ b/MyIA.AI.Notebooks/Search/README.md
@@ -2,9 +2,9 @@
[← Notebooks](../README.md) | [↑ ..](../README.md) | [→ SymbolicAI](../SymbolicAI/README.md)
diff --git a/MyIA.AI.Notebooks/Sudoku/README.md b/MyIA.AI.Notebooks/Sudoku/README.md
index c472b5cfb3..2fa871efce 100644
--- a/MyIA.AI.Notebooks/Sudoku/README.md
+++ b/MyIA.AI.Notebooks/Sudoku/README.md
@@ -2,9 +2,9 @@
> **Note éditoriale (counts)** : Le marqueur `CATALOG-STATUS` ci-dessus est autoritatif pour le compte agrégé (37 notebooks canoniques). Pour la **décomposition langagière par kernel** (`metadata.kernelspec.language`), ce README reste autoritatif car la granularité kernel n'est pas dans le marqueur agrégé ; elle est documentée ici par lecture directe des kernelspecs au 08/08/2026 :
diff --git a/docs/archive/reference/HEALTH_DASHBOARD.md b/docs/archive/reference/HEALTH_DASHBOARD.md
index 89be7c518e..3428d02285 100644
--- a/docs/archive/reference/HEALTH_DASHBOARD.md
+++ b/docs/archive/reference/HEALTH_DASHBOARD.md
@@ -4,40 +4,40 @@
> Ce fichier **n'est pas maintenu à la main** : il est dérivé du catalogue (acceptance #4 de #4210).
> Pour le régénérer : `python scripts/notebook_tools/generate_health_dashboard.py`.
-**1111** notebooks référencés au catalogue.
+**1123** notebooks référencés au catalogue.
## État global
| Statut | Count | % |
|--------|-------|---|
-| READY | 941 | 84.7% |
-| DEMO | 168 | 15.1% |
+| READY | 951 | 84.7% |
+| DEMO | 170 | 15.1% |
| BROKEN | 2 | 0.2% |
## Exigences d'environnement (badges)
| Exigence | Notebooks concernés |
|----------|---------------------|
-| **local** (exécutable sans GPU/cloud/WSL) | 699 |
+| **local** (exécutable sans GPU/cloud/WSL) | 708 |
| WSL requis | 76 |
-| GPU requis | 125 |
-| Cloud requis (QC / GenAI Docker) | 113 |
-| API key requise | 175 |
+| GPU requis | 126 |
+| Cloud requis (QC / GenAI Docker) | 114 |
+| API key requise | 176 |
## Distribution par série
| Série | READY | DEMO | BROKEN | Total | % READY |
|-------|-------|------|--------|-------|---------|
| CaseStudies | 6 | 0 | 0 | 6 | 100% |
-| GameTheory | 92 | 1 | 0 | 93 | 99% |
-| GenAI | 106 | 106 | 2 | 214 | 50% |
+| GameTheory | 95 | 1 | 0 | 96 | 99% |
+| GenAI | 107 | 106 | 2 | 215 | 50% |
| IIT | 71 | 1 | 0 | 72 | 99% |
-| ML | 73 | 5 | 0 | 78 | 94% |
-| Probas | 67 | 0 | 0 | 67 | 100% |
-| QuantConnect | 66 | 43 | 0 | 109 | 61% |
-| RL | 21 | 3 | 0 | 24 | 88% |
-| Search | 147 | 0 | 0 | 147 | 100% |
-| Sudoku | 36 | 1 | 0 | 37 | 97% |
+| ML | 73 | 7 | 0 | 80 | 91% |
+| Probas | 69 | 0 | 0 | 69 | 100% |
+| QuantConnect | 67 | 43 | 0 | 110 | 61% |
+| RL | 22 | 3 | 0 | 25 | 88% |
+| Search | 148 | 0 | 0 | 148 | 100% |
+| Sudoku | 37 | 1 | 0 | 38 | 97% |
| SymbolicAI | 255 | 8 | 0 | 263 | 97% |
| cross-series | 1 | 0 | 0 | 1 | 100% |
@@ -45,17 +45,17 @@
| Kernel | Count |
|--------|-------|
-| Python 3 | 715 |
-| .NET (C#) | 257 |
+| Python 3 | 730 |
+| .NET (C#) | 259 |
| Lean 4 (WSL) | 38 |
| Python 3 (ipykernel) | 33 |
| Python (coursia-ml-training) | 12 |
-| Python (GameTheory WSL + OpenSpiel) | 8 |
| Python 3 (WSL) | 7 |
| Python 3 (coursia-ml-training) | 7 |
| coursia-ml-training | 6 |
| Python 3 (PyPhi/IIT) | 5 |
| Lean 4 | 3 |
+| Python (GameTheory WSL + OpenSpiel) | 2 |
| Coursia ML Training | 2 |
| Python 3 (coursia2) | 2 |
| unknown | 2 |
@@ -65,6 +65,7 @@
| Python (dia-tts) | 1 |
| Python 3 (coursia-sae) | 1 |
| pyphi | 1 |
+| Lean 4 (WSL, percolation) | 1 |
| .venv (3.14.3) | 1 |
| .venv (3.12.3) | 1 |
| cours-ia | 1 |
diff --git a/docs/curriculum/genai.md b/docs/curriculum/genai.md
index 9e93c8914c..834e8eaa4d 100644
--- a/docs/curriculum/genai.md
+++ b/docs/curriculum/genai.md
@@ -20,9 +20,9 @@ Génération d'images (DALL-E, Stable Diffusion, Qwen, ComfyUI), synthèse vocal
| Métrique | Valeur |
|----------|--------|
-| Notebooks | 199 |
+| Notebooks | 200 |
| PRODUCTION | 0 |
-| BETA | 180 |
+| BETA | 181 |
| ALPHA | 19 |
## GenAI/00-GenAI-Environment (6 notebooks)
@@ -125,7 +125,7 @@ Génération d'images (DALL-E, Stable Diffusion, Qwen, ComfyUI), synthèse vocal
| 16 | Production Integration - GenAI | BETA | Non |
| 17 | Génération d’un patron de point de croix à partir d’une… | ALPHA | Non |
-## GenAI/Integrations-DotNet (10 notebooks)
+## GenAI/Integrations-DotNet (11 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
@@ -137,8 +137,9 @@ Génération d'images (DALL-E, Stable Diffusion, Qwen, ComfyUI), synthèse vocal
| 6 | Aspire : garde-fous du code d'agent — l'analyseur… | ALPHA | Oui |
| 7 | Aspire : le routeur MultiConnector — vetting en ligne,… | BETA | Non |
| 8 | Aspire : l'asynchrone aux frontieres natives -… | BETA | Oui |
-| 9 | GitHub Copilot SDK en C# : binding, streaming, Scrutor | BETA | Non |
-| 10 | EF Core : des requêtes vérifiées à la compilation | BETA | Oui |
+| 9 | Aspire : le harness Copilot SDK — CopilotClient,… | BETA | Oui |
+| 10 | GitHub Copilot SDK en C# : binding, streaming, Scrutor | BETA | Non |
+| 11 | EF Core : des requêtes vérifiées à la compilation | BETA | Oui |
## GenAI/Plateformes-Conversationnelles (20 notebooks)
@@ -179,10 +180,10 @@ Génération d'images (DALL-E, Stable Diffusion, Qwen, ComfyUI), synthèse vocal
| 8 | PT-08 — GRPO from scratch : la mécanique du signal de… | BETA | Non |
| 9 | PT-09 — RLOO (REINFORCE Leave-One-Out) from scratch :… | BETA | Oui |
| 10 | PT-10 — GAE from scratch : pourquoi un mini-critic ?… | BETA | Non |
-| 11 | PT-11 — GRPO + RLVR sur Qwen3.5-0.8B : la série… | BETA | Non |
-| 12 | PT-11 — RLVR sur VRAI LLM (Qwen3.5-0.8B) +… | BETA | Non |
-| 13 | PT-11b — RLVR multi-seed sur Qwen3.5-0.8B (4 seeds ×… | ALPHA | Non |
-| 14 | PT-11c — RLVR sur Qwen3-1.7B/2B (cran au-dessus de… | ALPHA | Non |
+| 11 | PT-11a — GRPO + RLVR sur Qwen3.5-0.8B : la série… | BETA | Non |
+| 12 | PT-11b — RLVR sur VRAI LLM (Qwen3.5-0.8B) +… | BETA | Non |
+| 13 | PT-11c — RLVR sur Qwen3-1.7B/2B (cran au-dessus de… | ALPHA | Non |
+| 14 | PT-11d — RLVR multi-seed sur Qwen3.5-0.8B (4 seeds ×… | ALPHA | Non |
| 15 | PT-12 — Crédit différé multi-step : GAE-λ sur un… | ALPHA | Oui |
| 16 | PT-13 — Les trois biais du loss GRPO et leurs… | ALPHA | Oui |
diff --git a/docs/curriculum/ia-classique.md b/docs/curriculum/ia-classique.md
index de07cf3d4f..5ab33478d3 100644
--- a/docs/curriculum/ia-classique.md
+++ b/docs/curriculum/ia-classique.md
@@ -20,12 +20,12 @@ Algorithmes de recherche classique, satisfaction de contraintes (CSP), résoluti
| Métrique | Valeur |
|----------|--------|
-| Notebooks | 168 |
+| Notebooks | 170 |
| PRODUCTION | 0 |
-| BETA | 168 |
+| BETA | 170 |
| ALPHA | 0 |
-## Search/Applications (53 notebooks)
+## Search/Applications (54 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
@@ -76,57 +76,58 @@ Algorithmes de recherche classique, satisfaction de contraintes (CSP), résoluti
| 45 | App-27 — Sparse index tracking | BETA | Oui |
| 46 | App-28 — Learning to branch | BETA | Oui |
| 47 | App-29 — Équilibrage de chaîne d'assemblage (SALBP) | BETA | Oui |
-| 48 | App-9 : Detection de bords par algorithmes génétiques | BETA | Oui |
-| 49 | TP : Conception d'Algorithmes Génétiques avec… | BETA | Oui |
-| 50 | App-14-ConnectFour-Adversarial-CSharp — Jumeau C# :… | BETA | Oui |
-| 51 | App-14 - Connect Four : Benchmark Adversarial Search | BETA | Oui |
-| 52 | App-14b : Puissance 4 -- Comparaison d'algorithmes IA… | BETA | Oui |
-| 53 | App-14c (C#) : Puissance 4 -- Comparaison d'algorithmes… | BETA | Oui |
+| 48 | App-30 — Ordonnancement d'assemblage orbital | BETA | Oui |
+| 49 | App-9 : Detection de bords par algorithmes génétiques | BETA | Oui |
+| 50 | TP : Conception d'Algorithmes Génétiques avec… | BETA | Oui |
+| 51 | App-14-ConnectFour-Adversarial-CSharp — Jumeau C# :… | BETA | Oui |
+| 52 | App-14 - Connect Four : Benchmark Adversarial Search | BETA | Oui |
+| 53 | App-14b : Puissance 4 -- Comparaison d'algorithmes IA… | BETA | Oui |
+| 54 | App-14c (C#) : Puissance 4 -- Comparaison d'algorithmes… | BETA | Oui |
## Search/Part1-Foundations (40 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
-| 1 | Search-02b : Théorie des Graphes avec NetworkX (C#) | BETA | Oui |
-| 2 | Search-02b-NetworkX : Algorithmes de Graphe avec… | BETA | Oui |
-| 3 | Search-02c-QuikGraph : bibliotheque de graphes pour… | BETA | Oui |
-| 4 | Search-03b (C#) — Bases de données de motifs (Pattern… | BETA | Oui |
-| 5 | Search-03b — Bases de données de motifs (Pattern… | BETA | Oui |
-| 6 | Search-03c (C#) — Recherche à écart limité (Limited… | BETA | Oui |
-| 7 | Search-03c — Recherche à écart limité (Limited… | BETA | Oui |
-| 8 | Search-03d (C#) — Weighted A\* : recherche à… | BETA | Oui |
-| 9 | Search-03d — Weighted A\* : recherche à sous-optimalité… | BETA | Oui |
-| 10 | Search-03e : A* et l'optimalité sous heuristique… | BETA | Non |
-| 11 | Search-09b : Minima fallacieux — le paysage de la… | BETA | Oui |
-| 12 | Search-09c — Discrépance combinatoire : colorier ±1… | BETA | Oui |
-| 13 | Search-09d — Discrépance combinatoire : la couche… | BETA | Oui |
-| 14 | Search-1 : Espaces d'etats et formalisation de… | BETA | Oui |
-| 15 | Search-1 : Espaces d'etats et formulation de problemes | BETA | Oui |
-| 16 | Search-10 (C#) : Automates Finis Classiques — jumeau… | BETA | Oui |
-| 17 | Search-10 : Automates Symboliques avec Z3 | BETA | Oui |
-| 18 | Search-11 (C#) : Métaheuristiques — Optimisation par… | BETA | Oui |
-| 19 | Search-11-métaheuristiques : Optimisation avec MEALPy | BETA | Oui |
-| 20 | Search-11b (Part 2) : Particle Swarm Optimization (C# /… | BETA | Oui |
-| 21 | Search-11b-Métaheuristiques-Deep-Part3 : Artificial Bee… | BETA | Oui |
-| 22 | Search-11b-Métaheuristiques-Deep-Part4 : Benchmark… | BETA | Oui |
-| 23 | Search-11b : Métaheuristiques d'optimisation (C# /… | BETA | Oui |
-| 24 | Search-11c — Sélection empirique d'algorithmes : deux… | BETA | Oui |
-| 25 | Search-02-Uninformed (C#) : Algorithmes de Recherche Non… | BETA | Oui |
-| 26 | Search-02-Uninformed : Algorithmes de Recherche Non… | BETA | Oui |
-| 27 | Search-03-Informed (C#) : Recherche Informée | BETA | Oui |
-| 28 | Search-03-Informed : Algorithmes de Recherche Informée | BETA | Oui |
-| 29 | Search-04-LocalSearch (C#) : Recherche Locale et… | BETA | Oui |
-| 30 | Search-04-LocalSearch : Recherche Locale et… | BETA | Oui |
-| 31 | Search-05-GeneticAlgorithms-Csharp : Algorithmes… | BETA | Oui |
-| 32 | Search-5 : Algorithmes génétiques | BETA | Oui |
-| 33 | Search-6 — Recherche adversariale (jeux à somme nulle)… | BETA | Oui |
-| 34 | Search-06-AdversarialSearch : Recherche Adversariale | BETA | Oui |
-| 35 | Search-07-MCTS-And-Beyond (C#) : Monte Carlo Tree Search… | BETA | Oui |
-| 36 | Search-07-MCTS-And-Beyond : Monte Carlo Tree Search et… | BETA | Oui |
-| 37 | Search-08-DancingLinks-Csharp : L'algorithme X et… | BETA | Oui |
-| 38 | Search-08-DancingLinks : L'algorithme X et Dancing Links… | BETA | Oui |
-| 39 | Search-9 : Programmation Linéaire et Simplexe (C# /… | BETA | Oui |
-| 40 | Search-09-LinearProgramming : Programmation Lineaire et… | BETA | Oui |
+| 1 | Search-1 : Espaces d'etats et formalisation de… | BETA | Oui |
+| 2 | Search-1 : Espaces d'etats et formulation de problemes | BETA | Oui |
+| 3 | Search-02-Uninformed (C#) : Algorithmes de Recherche… | BETA | Oui |
+| 4 | Search-02-Uninformed : Algorithmes de Recherche Non… | BETA | Oui |
+| 5 | Search-02b : Théorie des Graphes avec NetworkX (C#) | BETA | Oui |
+| 6 | Search-02b-NetworkX : Algorithmes de Graphe avec… | BETA | Oui |
+| 7 | Search-02c-QuikGraph : bibliotheque de graphes pour… | BETA | Oui |
+| 8 | Search-03-Informed (C#) : Recherche Informée | BETA | Oui |
+| 9 | Search-03-Informed : Algorithmes de Recherche Informée | BETA | Oui |
+| 10 | Search-03b (C#) — Bases de données de motifs (Pattern… | BETA | Oui |
+| 11 | Search-03b — Bases de données de motifs (Pattern… | BETA | Oui |
+| 12 | Search-03c (C#) — Recherche à écart limité (Limited… | BETA | Oui |
+| 13 | Search-03c — Recherche à écart limité (Limited… | BETA | Oui |
+| 14 | Search-03d (C#) — Weighted A\* : recherche à… | BETA | Oui |
+| 15 | Search-03d — Weighted A\* : recherche à sous-optimalité… | BETA | Oui |
+| 16 | Search-03e : A* et l'optimalité sous heuristique… | BETA | Non |
+| 17 | Search-04-LocalSearch (C#) : Recherche Locale et… | BETA | Oui |
+| 18 | Search-04-LocalSearch : Recherche Locale et… | BETA | Oui |
+| 19 | Search-05-GeneticAlgorithms-Csharp : Algorithmes… | BETA | Oui |
+| 20 | Search-5 : Algorithmes génétiques | BETA | Oui |
+| 21 | Search-6 — Recherche adversariale (jeux à somme nulle)… | BETA | Oui |
+| 22 | Search-06-AdversarialSearch : Recherche Adversariale | BETA | Oui |
+| 23 | Search-07-MCTS-And-Beyond (C#) : Monte Carlo Tree… | BETA | Oui |
+| 24 | Search-07-MCTS-And-Beyond : Monte Carlo Tree Search et… | BETA | Oui |
+| 25 | Search-08-DancingLinks-Csharp : L'algorithme X et… | BETA | Oui |
+| 26 | Search-08-DancingLinks : L'algorithme X et Dancing… | BETA | Oui |
+| 27 | Search-9 : Programmation Linéaire et Simplexe (C# /… | BETA | Oui |
+| 28 | Search-09-LinearProgramming : Programmation Lineaire et… | BETA | Oui |
+| 29 | Search-09b : Minima fallacieux — le paysage de la… | BETA | Oui |
+| 30 | Search-09c — Discrépance combinatoire : colorier ±1… | BETA | Oui |
+| 31 | Search-09d — Discrépance combinatoire : la couche… | BETA | Oui |
+| 32 | Search-10 (C#) : Automates Finis Classiques — jumeau… | BETA | Oui |
+| 33 | Search-10 : Automates Symboliques avec Z3 | BETA | Oui |
+| 34 | Search-11 (C#) : Métaheuristiques — Optimisation par… | BETA | Oui |
+| 35 | Search-11-métaheuristiques : Optimisation avec MEALPy | BETA | Oui |
+| 36 | Search-11b (Part 2) : Particle Swarm Optimization (C# /… | BETA | Oui |
+| 37 | Search-11b-Métaheuristiques-Deep-Part3 : Artificial Bee… | BETA | Oui |
+| 38 | Search-11b-Métaheuristiques-Deep-Part4 : Benchmark… | BETA | Oui |
+| 39 | Search-11b : Métaheuristiques d'optimisation (C# /… | BETA | Oui |
+| 40 | Search-11c — Sélection empirique d'algorithmes : deux… | BETA | Oui |
## Search/Part2-CSP (17 notebooks)
@@ -176,7 +177,7 @@ Algorithmes de recherche classique, satisfaction de contraintes (CSP), résoluti
| 20 | MGS-25 : WhaleOptimisation MGS contre mealpy — le WOA… | BETA | Oui |
| 21 | MGS-29 : GA MGS compose "Default" contre BaseGA mealpy… | BETA | Oui |
-## Sudoku (37 notebooks)
+## Sudoku (38 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
@@ -205,15 +206,16 @@ Algorithmes de recherche classique, satisfaction de contraintes (CSP), résoluti
| 23 | Notebook 11: Résolution de Sudoku avec Choco Constraint… | BETA | Oui |
| 24 | Sudoku-12 : Résolution avec Z3 SMT Solver (C#) | BETA | Oui |
| 25 | Sudoku-12-Z3-Python : Z3 SMT Solver (Python) | BETA | Oui |
-| 26 | Sudoku-13 : Le Sudoku comme Regex Symbolique -… | BETA | Oui |
-| 27 | Sudoku-13 : Le Sudoku comme Regex Symbolique — twin… | BETA | Oui |
-| 28 | Sudoku-14 : Automates avec BDD/MDD - Approche Pure | BETA | Oui |
-| 29 | Sudoku-14 : Automates avec BDD/MDD - Approche Pure… | BETA | Oui |
-| 30 | Résolution de Sudoku avec Infer.NET | BETA | Oui |
-| 31 | Sudoku-15-Infer-Python : Resolution Probabiliste avec… | BETA | Oui |
-| 32 | Sudoku-16 : Résolution par Réseaux de Neurones | BETA | Non |
-| 33 | Notebook 17: Resolution de Sudoku avec Large Language… | BETA | Non |
-| 34 | Comparaison des Solveurs de Sudoku | BETA | Oui |
+| 26 | Sudoku 12b : Linq2Z3 — l'histoire d'un binding, de 81… | BETA | Oui |
+| 27 | Sudoku-13 : Le Sudoku comme Regex Symbolique -… | BETA | Oui |
+| 28 | Sudoku-13 : Le Sudoku comme Regex Symbolique — twin… | BETA | Oui |
+| 29 | Sudoku-14 : Automates avec BDD/MDD - Approche Pure | BETA | Oui |
+| 30 | Sudoku-14 : Automates avec BDD/MDD - Approche Pure… | BETA | Oui |
+| 31 | Résolution de Sudoku avec Infer.NET | BETA | Oui |
+| 32 | Sudoku-15-Infer-Python : Resolution Probabiliste avec… | BETA | Oui |
+| 33 | Sudoku-16 : Résolution par Réseaux de Neurones | BETA | Non |
+| 34 | Notebook 17: Resolution de Sudoku avec Large Language… | BETA | Non |
| 35 | Comparaison des Solveurs de Sudoku | BETA | Oui |
-| 36 | Sudoku-18b - Comparaison statistique honnête de… | BETA | Oui |
-| 37 | Sudoku-7b — Soundness de la propagation de contraintes… | BETA | Oui |
+| 36 | Comparaison des Solveurs de Sudoku | BETA | Oui |
+| 37 | Sudoku-18b - Comparaison statistique honnête de… | BETA | Oui |
+| 38 | Sudoku-19 — Soundness de la propagation de contraintes… | BETA | Oui |
diff --git a/docs/curriculum/recherche.md b/docs/curriculum/recherche.md
index 7c836188ca..7e5d8b2ae9 100644
--- a/docs/curriculum/recherche.md
+++ b/docs/curriculum/recherche.md
@@ -20,12 +20,12 @@ Inférence probabiliste (Infer.NET, Pyro, PyMC), théorie de l'information inté
| Métrique | Valeur |
|----------|--------|
-| Notebooks | 245 |
+| Notebooks | 251 |
| PRODUCTION | 0 |
-| BETA | 241 |
-| ALPHA | 4 |
+| BETA | 246 |
+| ALPHA | 5 |
-## GameTheory (83 notebooks)
+## GameTheory (86 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
@@ -35,83 +35,86 @@ Inférence probabiliste (Infer.NET, Pyro, PyMC), théorie de l'information inté
| 4 | GameTheory-2 (Part 2) : Support Enumeration — Équilibre… | BETA | Oui |
| 5 | GameTheory-02-NormalForm | BETA | Oui |
| 6 | GameTheory 2b - Formalisation Lean : Definitions de… | BETA | Non |
-| 7 | GameTheory-3 : Topologie des Jeux 2×2 — Twin C#… | BETA | Oui |
-| 8 | GameTheory-03-Topology2x2 | BETA | Oui |
-| 9 | GameTheory-3a — Chemins de swaps : à quelle distance… | BETA | Oui |
-| 10 | GameTheory 3b : Chambres, murs, codimension — les jeux… | BETA | Oui |
-| 11 | GameTheory-3c — Le joueur LLM dans le tableau… | BETA | Non |
-| 12 | GameTheory-03d — Biens publics non-lineaires : plan de… | BETA | Oui |
-| 13 | GameTheory 3e : Meta-Actions Tarifees -- l'agent qui… | BETA | Oui |
-| 14 | GameTheory 3f : Le Parcours Complet -- du jeu nommé au… | BETA | Oui |
-| 15 | GameTheory-03g — De 576 à 144 : dériver le quotient,… | BETA | Oui |
-| 16 | GameTheory-03h — Deux espèces de flèches : quand une… | BETA | Oui |
-| 17 | GameTheory-04-NashEquilibrium (C#) | BETA | Oui |
-| 18 | GameTheory-04-NashEquilibrium | BETA | Oui |
-| 19 | GameTheory 4b - Theoreme d'Existence de Nash (Lean) | BETA | Non |
-| 20 | GameTheory 4c - Théorème d'Existence de Nash (C#) | ALPHA | Oui |
-| 21 | GameTheory 4c - Theoreme d'Existence de Nash (Python) | BETA | Non |
-| 22 | GameTheory 04e — Oracles réflexifs, décision causale et… | BETA | Oui |
-| 23 | GameTheory-05-ZeroSum-Minimax (Twin C#) | BETA | Oui |
-| 24 | GameTheory-05-ZeroSum-Minimax | BETA | Oui |
-| 25 | GameTheory-5b — Théorème minimax de von Neumann… | BETA | Non |
-| 26 | GameTheory-6 : Évolution et Confiance — Twin C#… | BETA | Oui |
-| 27 | GameTheory-06-EvolutionTrust | BETA | Oui |
-| 28 | GameTheory-6c (C#) : Jeux Répétés et Théorème Folk | BETA | Oui |
-| 29 | GameTheory-6c : Jeux Répétés et Théorème Folk (Folk… | BETA | Oui |
-| 30 | GameTheory-06d : Sympathie contre Engagement — la… | BETA | Oui |
-| 31 | GameTheory-07-ExtensiveForm (Twin C#) | BETA | Oui |
-| 32 | GameTheory-07-ExtensiveForm | BETA | Oui |
-| 33 | GameTheory-08-CombinatorialGames (C#) | BETA | Oui |
-| 34 | GameTheory 8 - Jeux Combinatoires | BETA | Oui |
-| 35 | GameTheory 8b - Jeux Combinatoires en Lean | BETA | Non |
-| 36 | GameTheory 8c - Jeux Combinatoires : Approfondissement… | BETA | Oui |
-| 37 | GameTheory 8c - Jeux Combinatoires : Approfondissement… | BETA | Oui |
-| 38 | GameTheory 8d - Combinatorial Games natif : le lake… | BETA | Non |
-| 39 | GameTheory-09-BackwardInduction (C#) | BETA | Oui |
-| 40 | GameTheory-09-BackwardInduction | BETA | Oui |
-| 41 | Stackelberg : la performativité sans mystère | BETA | Oui |
-| 42 | GameTheory-09c : Stackelberg Security Game —… | BETA | Oui |
-| 43 | GameTheory-10 — Équilibres Parfaits de Sous-Jeux et… | BETA | Oui |
-| 44 | GameTheory-10-ForwardInduction-SPE | BETA | Oui |
-| 45 | GameTheory-11-BayesianGames-Csharp | BETA | Oui |
-| 46 | GameTheory-11-BayesianGames | BETA | Oui |
-| 47 | GameTheory-11b — Jeux Bayésiens en Lean 4 (companion) | BETA | Non |
-| 48 | GameTheory-12 — Jeux de Réputation (twin C# du notebook… | BETA | Oui |
-| 49 | GameTheory-12-ReputationGames | BETA | Oui |
-| 50 | GameTheory-13 : Jeux a Information Imparfaite et CFR… | BETA | Oui |
-| 51 | GameTheory-13 : Jeux a Information Imparfaite et CFR | BETA | Non |
-| 52 | GameTheory-13b : Safe Subgame Solving -- quand le… | BETA | Oui |
-| 53 | GameTheory-13c : Safe Subgame Solving en C# — le twin… | BETA | Oui |
-| 54 | GameTheory-13d : Optimistic Counterfactual Regret… | BETA | Oui |
-| 55 | GameTheory-14 : Jeux Differentiels et Equilibres de… | BETA | Oui |
-| 56 | GameTheory-14 : Jeux Differentiels et Equilibres de… | BETA | Oui |
-| 57 | GameTheory-15 — Jeux Coopératifs (Twin C#) | BETA | Oui |
-| 58 | GameTheory-15-CooperativeGames | BETA | Oui |
-| 59 | GameTheory 15b - Jeux Cooperatifs en Lean :… | BETA | Non |
-| 60 | GameTheory 15c - Jeux Cooperatifs (C# / .NET) | BETA | Oui |
-| 61 | GameTheory 15c - Jeux Cooperatifs Lean (Python) | BETA | Oui |
-| 62 | GameTheory 15d - La decomposition de Mobius sur le… | BETA | Oui |
-| 63 | GameTheory-16-MechanismDesign (C#) | BETA | Oui |
-| 64 | GameTheory-16 : Théorie des Mécanismes et Principe de… | BETA | Oui |
-| 65 | GameTheory-16b : Automated Mechanism Design (AMD) | BETA | Oui |
-| 66 | GameTheory-16c : La dimension paiement que le designer… | BETA | Oui |
-| 67 | GameTheory-16d — L'echange de reins : de la valeur… | BETA | Oui |
-| 68 | GameTheory-17 (C#) : Multi-Agent Reinforcement Learning… | BETA | Oui |
-| 69 | GameTheory-17 : Apprentissage par Renforcement… | BETA | Oui |
-| 70 | Information asymétrique : types privés, antisélection… | BETA | Oui |
-| 71 | Le marché des lemons : le certificat formel exécuté | BETA | Non |
-| 72 | Du marché au bilan : le pont théorie des jeux théorie… | BETA | Oui |
-| 73 | Screening, signal et anticipation : les trois réponses… | BETA | Non |
-| 74 | GameTheory-18 : Open Games et Lentilles -- la… | BETA | Oui |
-| 75 | GameTheory-18b : Casser la composition — où la… | BETA | Oui |
-| 76 | GameTheory-19 : L'abstraction a dette mesurable | BETA | Oui |
-| 77 | GameTheory 24b : Le temoin d'impossibilite | BETA | Oui |
-| 78 | GameTheory-25 — Loi II, seconde jambe : synthétiser un… | BETA | Oui |
-| 79 | GameTheory-26 — Ensembles limites : Poincaré-Bendixson… | BETA | Oui |
-| 80 | GameTheory-27 — L'algorithme de Kuhn-Munkres :… | BETA | Oui |
-| 81 | GameTheory 27b — Le lake assignment_lean par son… | BETA | Non |
-| 82 | GameTheory-28 : Banc de calibration — humour, forme… | BETA | Oui |
-| 83 | GameTheory-28b : Banc humour — passer à l'échelle | BETA | Non |
+| 7 | GameTheory-02c-Travelers-Dilemma | BETA | Oui |
+| 8 | GameTheory-3 : Topologie des Jeux 2×2 — Twin C#… | BETA | Oui |
+| 9 | GameTheory-03-Topology2x2 | BETA | Oui |
+| 10 | GameTheory-3a — Chemins de swaps : à quelle distance… | BETA | Oui |
+| 11 | GameTheory 3b : Chambres, murs, codimension — les jeux… | BETA | Oui |
+| 12 | GameTheory-3c — Le joueur LLM dans le tableau… | BETA | Non |
+| 13 | GameTheory-03d — Biens publics non-lineaires : plan de… | BETA | Oui |
+| 14 | GameTheory 3e : Meta-Actions Tarifees -- l'agent qui… | BETA | Oui |
+| 15 | GameTheory 3f : Le Parcours Complet -- du jeu nommé au… | BETA | Oui |
+| 16 | GameTheory-03g — De 576 à 144 : dériver le quotient,… | BETA | Oui |
+| 17 | GameTheory-03h — Deux espèces de flèches : quand une… | BETA | Oui |
+| 18 | GameTheory-04-NashEquilibrium (C#) | BETA | Oui |
+| 19 | GameTheory-04-NashEquilibrium | BETA | Oui |
+| 20 | GameTheory 4b - Theoreme d'Existence de Nash (Lean) | BETA | Non |
+| 21 | GameTheory 4c - Théorème d'Existence de Nash (C#) | ALPHA | Oui |
+| 22 | GameTheory 4c - Theoreme d'Existence de Nash (Python) | BETA | Non |
+| 23 | GameTheory-04d-Marchandage-Asymetrique | BETA | Oui |
+| 24 | GameTheory 04e — Oracles réflexifs, décision causale et… | BETA | Oui |
+| 25 | GameTheory-05-ZeroSum-Minimax (Twin C#) | BETA | Oui |
+| 26 | GameTheory-05-ZeroSum-Minimax | BETA | Oui |
+| 27 | GameTheory-5b — Théorème minimax de von Neumann… | BETA | Non |
+| 28 | GameTheory-6 : Évolution et Confiance — Twin C#… | BETA | Oui |
+| 29 | GameTheory-06-EvolutionTrust | BETA | Oui |
+| 30 | GameTheory-6c (C#) : Jeux Répétés et Théorème Folk | BETA | Oui |
+| 31 | GameTheory-6c : Jeux Répétés et Théorème Folk (Folk… | BETA | Oui |
+| 32 | GameTheory-06d : Sympathie contre Engagement — la… | BETA | Oui |
+| 33 | GameTheory-07-ExtensiveForm (Twin C#) | BETA | Oui |
+| 34 | GameTheory-07-ExtensiveForm | BETA | Oui |
+| 35 | GameTheory-08-CombinatorialGames (C#) | BETA | Oui |
+| 36 | GameTheory 8 - Jeux Combinatoires | BETA | Oui |
+| 37 | GameTheory 8b - Jeux Combinatoires en Lean | BETA | Non |
+| 38 | GameTheory 8c - Jeux Combinatoires : Approfondissement… | BETA | Oui |
+| 39 | GameTheory 8c - Jeux Combinatoires : Approfondissement… | BETA | Oui |
+| 40 | GameTheory 8d - Combinatorial Games natif : le lake… | BETA | Non |
+| 41 | GameTheory-09-BackwardInduction (C#) | BETA | Oui |
+| 42 | GameTheory-09-BackwardInduction | BETA | Oui |
+| 43 | Stackelberg : la performativité sans mystère | BETA | Oui |
+| 44 | GameTheory-09c : Stackelberg Security Game —… | BETA | Oui |
+| 45 | GameTheory-10 — Équilibres Parfaits de Sous-Jeux et… | BETA | Oui |
+| 46 | GameTheory-10-ForwardInduction-SPE | BETA | Oui |
+| 47 | GameTheory-11-BayesianGames-Csharp | BETA | Oui |
+| 48 | GameTheory-11-BayesianGames | BETA | Oui |
+| 49 | GameTheory-11b — Jeux Bayésiens en Lean 4 (companion) | BETA | Non |
+| 50 | GameTheory-12 — Jeux de Réputation (twin C# du notebook… | BETA | Oui |
+| 51 | GameTheory-12-ReputationGames | BETA | Oui |
+| 52 | GameTheory-13 : Jeux a Information Imparfaite et CFR… | BETA | Oui |
+| 53 | GameTheory-13 : Jeux a Information Imparfaite et CFR | BETA | Non |
+| 54 | GameTheory-13b : Safe Subgame Solving -- quand le… | BETA | Oui |
+| 55 | GameTheory-13c : Safe Subgame Solving en C# — le twin… | BETA | Oui |
+| 56 | GameTheory-13d : Optimistic Counterfactual Regret… | BETA | Oui |
+| 57 | GameTheory-14 : Jeux Differentiels et Equilibres de… | BETA | Oui |
+| 58 | GameTheory-14 : Jeux Differentiels et Equilibres de… | BETA | Oui |
+| 59 | GameTheory-15 — Jeux Coopératifs (Twin C#) | BETA | Oui |
+| 60 | GameTheory-15-CooperativeGames | BETA | Oui |
+| 61 | GameTheory 15b - Jeux Cooperatifs en Lean :… | BETA | Non |
+| 62 | GameTheory 15c - Jeux Cooperatifs (C# / .NET) | BETA | Oui |
+| 63 | GameTheory 15c - Jeux Cooperatifs Lean (Python) | BETA | Oui |
+| 64 | GameTheory 15d - La decomposition de Mobius sur le… | BETA | Oui |
+| 65 | GameTheory-15e — Pouvoir coalitionnel : calcul, SMT… | BETA | Oui |
+| 66 | GameTheory-16-MechanismDesign (C#) | BETA | Oui |
+| 67 | GameTheory-16 : Théorie des Mécanismes et Principe de… | BETA | Oui |
+| 68 | GameTheory-16b : Automated Mechanism Design (AMD) | BETA | Oui |
+| 69 | GameTheory-16c : La dimension paiement que le designer… | BETA | Oui |
+| 70 | GameTheory-16d — L'echange de reins : de la valeur… | BETA | Oui |
+| 71 | GameTheory-17 (C#) : Multi-Agent Reinforcement Learning… | BETA | Oui |
+| 72 | GameTheory-17 : Apprentissage par Renforcement… | BETA | Oui |
+| 73 | Information asymétrique : types privés, antisélection… | BETA | Oui |
+| 74 | Le marché des lemons : le certificat formel exécuté | BETA | Non |
+| 75 | Du marché au bilan : le pont théorie des jeux théorie… | BETA | Oui |
+| 76 | Screening, signal et anticipation : les trois réponses… | BETA | Non |
+| 77 | GameTheory-18 : Open Games et Lentilles -- la… | BETA | Oui |
+| 78 | GameTheory-18b : Casser la composition — où la… | BETA | Oui |
+| 79 | GameTheory-19 : L'abstraction a dette mesurable | BETA | Oui |
+| 80 | GameTheory 24b : Le temoin d'impossibilite | BETA | Oui |
+| 81 | GameTheory-25 — Loi II, seconde jambe : synthétiser un… | BETA | Oui |
+| 82 | GameTheory-26 — Ensembles limites : Poincaré-Bendixson… | BETA | Oui |
+| 83 | GameTheory-27 — L'algorithme de Kuhn-Munkres :… | BETA | Oui |
+| 84 | GameTheory 27b — Le lake assignment_lean par son… | BETA | Non |
+| 85 | GameTheory-28 : Banc de calibration — humour, forme… | BETA | Oui |
+| 86 | GameTheory-28b : Banc humour — passer à l'échelle | BETA | Non |
## GameTheory/SocialChoice (8 notebooks)
@@ -200,12 +203,18 @@ Inférence probabiliste (Infer.NET, Pyro, PyMC), théorie de l'information inté
| 58 | Tete-a-tete SAE <-> J-space -- les deux lentilles du… | BETA | Non |
| 59 | ICT-Synthèse — un seul appareil de mesure, cinq… | BETA | Non |
-## Probas (2 notebooks)
+## Probas (1 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
-| 1 | Infer-1b : Introduction a Infer.NET | BETA | Oui |
-| 2 | Le Framework Rational Speech Act (RSA) | BETA | Oui |
+| 1 | Le Framework Rational Speech Act (RSA) | BETA | Oui |
+
+## Probas/Applications (2 notebooks)
+
+| # | Notebook | Maturité | Exécutable |
+|---|----------|----------|------------|
+| 1 | Percolation-Lean — le noyau fini de percolation, prouvé… | BETA | Oui |
+| 2 | Percolation supercritique : le géant au-dessus du seuil | ALPHA | Oui |
## Probas/DecisionTheory (26 notebooks)
@@ -238,7 +247,7 @@ Inférence probabiliste (Infer.NET, Pyro, PyMC), théorie de l'information inté
| 25 | DecPyMC-8 — Crédibilité actuarielle de Bühlmann–Straub… | BETA | Oui |
| 26 | DecPyMC-9 : Du risque à la prime — prime pure,… | BETA | Oui |
-## Probas/Infer (20 notebooks)
+## Probas/Infer (21 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
@@ -253,15 +262,16 @@ Inférence probabiliste (Infer.NET, Pyro, PyMC), théorie de l'information inté
| 9 | Infer-17 — Filtre de Kalman : systèmes dynamiques… | BETA | Oui |
| 10 | Infer-18 — Détection de Rupture (Change-Point) :… | BETA | Oui |
| 11 | Infer-19 — Analyse de survie / fiabilite bayesienne :… | BETA | Oui |
-| 12 | Infer-2-Gaussian-Mixtures : Distributions Gaussiennes… | BETA | Oui |
-| 13 | Infer-20 — Quotients, fibres et recollement : ce qui… | BETA | Oui |
-| 14 | Infer-2b-Debugging-Bonnes-Pratiques : Troubleshooting… | BETA | Oui |
-| 15 | Infer-3-Factor-Graphs : Graphes de Facteurs et… | BETA | Oui |
-| 16 | Infer-4-Bayesian-Networks : Reseaux Bayesiens… | BETA | Oui |
-| 17 | Infer-5-Causal-Inference : Inférence Causale et… | BETA | Oui |
-| 18 | Infer-7-Skills-IRT : Evaluation de Competences et… | BETA | Oui |
-| 19 | Infer-8-TrueSkill : Système de Classement et… | BETA | Oui |
-| 20 | Infer-9-Classification : Classification Bayesienne | BETA | Oui |
+| 12 | Infer-1b : Introduction a Infer.NET | BETA | Oui |
+| 13 | Infer-2-Gaussian-Mixtures : Distributions Gaussiennes… | BETA | Oui |
+| 14 | Infer-20 — Quotients, fibres et recollement : ce qui… | BETA | Oui |
+| 15 | Infer-2b-Debugging-Bonnes-Pratiques : Troubleshooting… | BETA | Oui |
+| 16 | Infer-3-Factor-Graphs : Graphes de Facteurs et… | BETA | Oui |
+| 17 | Infer-4-Bayesian-Networks : Reseaux Bayesiens… | BETA | Oui |
+| 18 | Infer-5-Causal-Inference : Inférence Causale et… | BETA | Oui |
+| 19 | Infer-7-Skills-IRT : Evaluation de Competences et… | BETA | Oui |
+| 20 | Infer-8-TrueSkill : Système de Classement et… | BETA | Oui |
+| 21 | Infer-9-Classification : Classification Bayesienne | BETA | Oui |
## Probas/PyMC (19 notebooks)
@@ -287,7 +297,7 @@ Inférence probabiliste (Infer.NET, Pyro, PyMC), théorie de l'information inté
| 18 | 18. Detection de Rupture (Change-Point) : inferer le… | BETA | Oui |
| 19 | 19. Analyse de survie / fiabilite bayesienne : inferer… | BETA | Oui |
-## RL (23 notebooks)
+## RL (24 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
@@ -298,19 +308,20 @@ Inférence probabiliste (Infer.NET, Pyro, PyMC), théorie de l'information inté
| 5 | RL 13 - Exploration par curiosité : Random Network… | BETA | Oui |
| 6 | Hierarchical RL — l'Option framework de Sutton, Precup… | BETA | Oui |
| 7 | Tutoriel Stable Baselines3 - Premiers pas | BETA | Oui |
-| 8 | Notebook 2 – Wrappers Gym, Sauvegarde/Chargement,… | BETA | Non |
-| 9 | Notebook 3 – Hindsight Experience Replay (HER) : du… | BETA | Oui |
-| 10 | RL-4 : Bandits Manchots et le Compromis… | BETA | Oui |
-| 11 | RL-5 : MDP, Programmation Dynamique et Q-Learning… | BETA | Oui |
-| 12 | RL-6 : Deep Q-Network (DQN) et Policy Gradient | BETA | Oui |
-| 13 | RL-6b - Actor-Critic : unir valeur et politique | BETA | Oui |
-| 14 | PPO (Proximal Policy Optimization) depuis zero | BETA | Oui |
-| 15 | SAC (Soft Actor-Critic) depuis zero | BETA | Oui |
-| 16 | GRPO (Group Relative Policy Optimization) depuis zero | BETA | Non |
-| 17 | RL-7 : Introduction a l'Apprentissage Multi-Agent | BETA | Oui |
-| 18 | RL-8 : Model-Based RL — Dyna-Q et planification | BETA | Oui |
-| 19 | RL-9 : RL offline — Behavior Cloning et erreur… | BETA | Oui |
-| 20 | RL Post-Training — 1 : PPO pour l'alignement d'un petit… | BETA | Oui |
-| 21 | RL Post-Training — 2 : GRPO minimal — alignement d'un… | BETA | Non |
-| 22 | RL Post-Training — 3 : Reward hacking — anatomie d'un… | BETA | Non |
-| 23 | RL Post-Training — 4 : DPO offline vs RL online — même… | BETA | Non |
+| 8 | Synthese logique d'un controleur CartPole : le bitwise… | BETA | Oui |
+| 9 | Notebook 2 – Wrappers Gym, Sauvegarde/Chargement,… | BETA | Non |
+| 10 | Notebook 3 – Hindsight Experience Replay (HER) : du… | BETA | Oui |
+| 11 | RL-4 : Bandits Manchots et le Compromis… | BETA | Oui |
+| 12 | RL-5 : MDP, Programmation Dynamique et Q-Learning… | BETA | Oui |
+| 13 | RL-6 : Deep Q-Network (DQN) et Policy Gradient | BETA | Oui |
+| 14 | RL-6b - Actor-Critic : unir valeur et politique | BETA | Oui |
+| 15 | PPO (Proximal Policy Optimization) depuis zero | BETA | Oui |
+| 16 | SAC (Soft Actor-Critic) depuis zero | BETA | Oui |
+| 17 | GRPO (Group Relative Policy Optimization) depuis zero | BETA | Non |
+| 18 | RL-7 : Introduction a l'Apprentissage Multi-Agent | BETA | Oui |
+| 19 | RL-8 : Model-Based RL — Dyna-Q et planification | BETA | Oui |
+| 20 | RL-9 : RL offline — Behavior Cloning et erreur… | BETA | Oui |
+| 21 | RL Post-Training — 1 : PPO pour l'alignement d'un petit… | BETA | Oui |
+| 22 | RL Post-Training — 2 : GRPO minimal — alignement d'un… | BETA | Non |
+| 23 | RL Post-Training — 3 : Reward hacking — anatomie d'un… | BETA | Non |
+| 24 | RL Post-Training — 4 : DPO offline vs RL online — même… | BETA | Non |
diff --git a/docs/curriculum/trading.md b/docs/curriculum/trading.md
index ce37770852..842ee1dd6f 100644
--- a/docs/curriculum/trading.md
+++ b/docs/curriculum/trading.md
@@ -20,12 +20,12 @@ Stratégies de trading algorithmique avec QuantConnect, pipeline ML (Transformer
| Métrique | Valeur |
|----------|--------|
-| Notebooks | 240 |
+| Notebooks | 221 |
| PRODUCTION | 0 |
-| BETA | 223 |
-| ALPHA | 17 |
+| BETA | 203 |
+| ALPHA | 18 |
-## ML/DataScienceWithAgents (54 notebooks)
+## ML/DataScienceWithAgents (56 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
@@ -76,13 +76,15 @@ Stratégies de trading algorithmique avec QuantConnect, pipeline ML (Transformer
| 45 | Lab 10: Data File Analyzer (DS-STAR Component) | BETA | Oui |
| 46 | Lab 11: Planner-Coder-Verifier Loop (DS-STAR Core) | ALPHA | Oui |
| 47 | Lab 12: DS-STAR Workshop - Analyse Multi-Fichiers | BETA | Oui |
-| 48 | Lab 14 : Tracabilite de la consommation — le contrat C6… | BETA | Non |
-| 49 | Lab 18: Persistance d'etat de session - une… | BETA | Non |
-| 50 | Lab 13: Web Search pour Modèles SOTA (MLE-STAR… | BETA | Oui |
-| 51 | Lab 14: Ablation et Raffinement Ciblé (MLE-STAR… | ALPHA | Oui |
-| 52 | Lab 15: Kaggle Challenge avec MLE-STAR | BETA | Oui |
-| 53 | Lab 16: Data Science Agent avec GCP BigQuery | ALPHA | Oui |
-| 54 | Lab 17: Projet Final - Pipeline DS-STAR Complet | ALPHA | Oui |
+| 48 | Lab 12b : Désignation séquentielle — le contrat C4,… | BETA | Non |
+| 49 | Lab 12c : Handoff entre agents — le contrat C5, le… | BETA | Non |
+| 50 | Lab 12d : Tracabilite de la consommation — le contrat… | BETA | Non |
+| 51 | Lab 12e: Persistance d'etat de session - une… | BETA | Non |
+| 52 | Lab 13: Web Search pour Modèles SOTA (MLE-STAR… | BETA | Oui |
+| 53 | Lab 14: Ablation et Raffinement Ciblé (MLE-STAR… | ALPHA | Oui |
+| 54 | Lab 15: Kaggle Challenge avec MLE-STAR | BETA | Oui |
+| 55 | Lab 16: Data Science Agent avec GCP BigQuery | ALPHA | Oui |
+| 56 | Lab 17: Projet Final - Pipeline DS-STAR Complet | ALPHA | Oui |
## ML/ML.Net (23 notebooks)
@@ -112,12 +114,18 @@ Stratégies de trading algorithmique avec QuantConnect, pipeline ML (Transformer
| 22 | ML-9 : Detection d'anomalies avec Randomized PCA | BETA | Oui |
| 23 | TP : Prevision des ventes d'assurance | BETA | Oui |
-## Probas (2 notebooks)
+## Probas (1 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
-| 1 | Infer-1b : Introduction a Infer.NET | BETA | Oui |
-| 2 | Le Framework Rational Speech Act (RSA) | BETA | Oui |
+| 1 | Le Framework Rational Speech Act (RSA) | BETA | Oui |
+
+## Probas/Applications (2 notebooks)
+
+| # | Notebook | Maturité | Exécutable |
+|---|----------|----------|------------|
+| 1 | Percolation-Lean — le noyau fini de percolation, prouvé… | BETA | Oui |
+| 2 | Percolation supercritique : le géant au-dessus du seuil | ALPHA | Oui |
## Probas/DecisionTheory (26 notebooks)
@@ -150,7 +158,7 @@ Stratégies de trading algorithmique avec QuantConnect, pipeline ML (Transformer
| 25 | DecPyMC-8 — Crédibilité actuarielle de Bühlmann–Straub… | BETA | Oui |
| 26 | DecPyMC-9 : Du risque à la prime — prime pure,… | BETA | Oui |
-## Probas/Infer (20 notebooks)
+## Probas/Infer (21 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
@@ -165,15 +173,16 @@ Stratégies de trading algorithmique avec QuantConnect, pipeline ML (Transformer
| 9 | Infer-17 — Filtre de Kalman : systèmes dynamiques… | BETA | Oui |
| 10 | Infer-18 — Détection de Rupture (Change-Point) :… | BETA | Oui |
| 11 | Infer-19 — Analyse de survie / fiabilite bayesienne :… | BETA | Oui |
-| 12 | Infer-2-Gaussian-Mixtures : Distributions Gaussiennes… | BETA | Oui |
-| 13 | Infer-20 — Quotients, fibres et recollement : ce qui… | BETA | Oui |
-| 14 | Infer-2b-Debugging-Bonnes-Pratiques : Troubleshooting… | BETA | Oui |
-| 15 | Infer-3-Factor-Graphs : Graphes de Facteurs et… | BETA | Oui |
-| 16 | Infer-4-Bayesian-Networks : Reseaux Bayesiens… | BETA | Oui |
-| 17 | Infer-5-Causal-Inference : Inférence Causale et… | BETA | Oui |
-| 18 | Infer-7-Skills-IRT : Evaluation de Competences et… | BETA | Oui |
-| 19 | Infer-8-TrueSkill : Système de Classement et… | BETA | Oui |
-| 20 | Infer-9-Classification : Classification Bayesienne | BETA | Oui |
+| 12 | Infer-1b : Introduction a Infer.NET | BETA | Oui |
+| 13 | Infer-2-Gaussian-Mixtures : Distributions Gaussiennes… | BETA | Oui |
+| 14 | Infer-20 — Quotients, fibres et recollement : ce qui… | BETA | Oui |
+| 15 | Infer-2b-Debugging-Bonnes-Pratiques : Troubleshooting… | BETA | Oui |
+| 16 | Infer-3-Factor-Graphs : Graphes de Facteurs et… | BETA | Oui |
+| 17 | Infer-4-Bayesian-Networks : Reseaux Bayesiens… | BETA | Oui |
+| 18 | Infer-5-Causal-Inference : Inférence Causale et… | BETA | Oui |
+| 19 | Infer-7-Skills-IRT : Evaluation de Competences et… | BETA | Oui |
+| 20 | Infer-8-TrueSkill : Système de Classement et… | BETA | Oui |
+| 21 | Infer-9-Classification : Classification Bayesienne | BETA | Oui |
## Probas/PyMC (19 notebooks)
@@ -205,57 +214,34 @@ Stratégies de trading algorithmique avec QuantConnect, pipeline ML (Transformer
|---|----------|----------|------------|
| 1 | M16 — HAR asymétrique débiaisé : le signal survit-il… | BETA | Non |
-## QuantConnect/Python (47 notebooks)
+## QuantConnect/Python (24 notebooks)
| # | Notebook | Maturité | Exécutable |
|---|----------|----------|------------|
| 1 | QC-Py-01 : Configuration et Premier Backtest… | BETA | Non |
-| 2 | QC-Py-02 : QuantConnect Platform Fundamentals -… | BETA | Non |
-| 3 | QC-Py-03 - Data Management in QuantConnect | BETA | Non |
-| 4 | Objectifs d'Apprentissage | BETA | Non |
+| 2 | Objectifs d'Apprentissage | BETA | Non |
+| 3 | QC-Py-12b - Validité du backtest et signification… | BETA | Non |
+| 4 | QC-Py-18 - Feature Engineering pour Machine Learning… | ALPHA | Non |
| 5 | Objectifs d'Apprentissage | BETA | Non |
-| 6 | QC-Py-06 : Options Trading dans QuantConnect | BETA | Non |
-| 7 | QC-Py-07 : Futures et Forex Trading dans QuantConnect | BETA | Non |
-| 8 | QC-Py-08 - Multi-Asset Portfolio Stratégies | BETA | Non |
-| 9 | QC-Py-09 : Types d'Ordres et Order Management dans… | BETA | Non |
-| 10 | Objectifs d'Apprentissage | BETA | Non |
-| 11 | QC-Py-11 - Indicateurs Techniques dans QuantConnect | BETA | Non |
-| 12 | QC-Py-12 - Backtesting et Analyse de Performance | BETA | Non |
-| 13 | QC-Py-12b - Validité du backtest et signification… | BETA | Non |
-| 14 | QC-Py-13 - Alpha Models et Algorithm Framework | BETA | Non |
-| 15 | QC-Py-14 - Portfolio Construction et Exécution Models | BETA | Non |
-| 16 | Objectifs d'Apprentissage | BETA | Non |
-| 17 | QC-Py-16 - Alternative Data dans QuantConnect | BETA | Non |
-| 18 | Objectifs d'Apprentissage | BETA | Non |
-| 19 | QC-Py-18 - Feature Engineering pour Machine Learning… | ALPHA | Non |
-| 20 | Objectifs d'Apprentissage | BETA | Non |
-| 21 | Objectifs d'Apprentissage | BETA | Non |
-| 22 | QC-Py-21 - Portfolio Optimization avec Machine Learning | BETA | Non |
-| 23 | Objectifs d'Apprentissage | BETA | Non |
-| 24 | QC-Py-23 — State Space Models pour Séries Temporelles… | BETA | Non |
-| 25 | QC-Py-23b - PatchTST et iTransformer pour Prevision… | BETA | Non |
-| 26 | QC-Py-24 - Modèles Génératifs pour Anomaly Detection et… | BETA | Non |
-| 27 | Objectifs d'Apprentissage | BETA | Non |
-| 28 | Objectifs d'Apprentissage | BETA | Non |
-| 29 | QC-Py-27 - Production Deployment | BETA | Non |
-| 30 | QC-Py-28 - Market Regime Detection | BETA | Non |
-| 31 | QC-Py-30 - LSTM Training Multi-Asset (GPU) | BETA | Non |
-| 32 | QC-Py-31 - Transformer Encoder Multi-Asset (GPU) | ALPHA | Non |
-| 33 | QC-Py-32 - Reinforcement Learning DQN pour le Trading | BETA | Non |
-| 34 | QC-Py-33 - Reinforcement Learning PPO pour le Trading | BETA | Non |
-| 35 | QC-Py-34 - SAC et A2C : Comparaison d'Agents RL pour le… | BETA | Non |
-| 36 | QC-Py-35 - Reinforcement Learning pour la Construction… | ALPHA | Non |
-| 37 | QC-Py-40 : Paper Trading Binance - Mean Reversion… | BETA | Non |
-| 38 | QC-Py-41 : Paper Trading IBKR - SP500 Momentum | BETA | Non |
-| 39 | QC-Py-Cloud-01 : Analyse de Sentiment FinBERT sur QC… | ALPHA | Non |
-| 40 | QC-Py-Cloud-02 : Classification de Texte et Sentiment… | ALPHA | Non |
-| 41 | QC-Py-Cloud-03 : Parite de Risque (Risk Parity) | BETA | Non |
-| 42 | QC-Py-Cloud-05 : Prevision par Reseau de Neurones (MLP) | ALPHA | Non |
-| 43 | Value Factor Z-Score — Sélection multi-facteurs… | BETA | Non |
-| 44 | Option Wheel — Le paradoxe du win-rate eleve | BETA | Non |
-| 45 | QC-Py-Cloud-10 : Reinforcement Learning - DQN Trading | ALPHA | Non |
-| 46 | QC-Py-Cloud-14 — Dual Momentum : Asset Sélection… | BETA | Non |
-| 47 | Workflow : Téléchargement et gestion des datasets | ALPHA | Non |
+| 6 | QC-Py-23b - PatchTST et iTransformer pour Prevision… | BETA | Non |
+| 7 | QC-Py-23c — Modèles de fondation pour séries… | BETA | Non |
+| 8 | QC-Py-30 - LSTM Training Multi-Asset (GPU) | BETA | Non |
+| 9 | QC-Py-31 - Transformer Encoder Multi-Asset (GPU) | ALPHA | Non |
+| 10 | QC-Py-32 - Reinforcement Learning DQN pour le Trading | BETA | Non |
+| 11 | QC-Py-33 - Reinforcement Learning PPO pour le Trading | BETA | Non |
+| 12 | QC-Py-34 - SAC et A2C : Comparaison d'Agents RL pour le… | BETA | Non |
+| 13 | QC-Py-35 - Reinforcement Learning pour la Construction… | ALPHA | Non |
+| 14 | QC-Py-40 : Paper Trading Binance - Mean Reversion… | BETA | Non |
+| 15 | QC-Py-41 : Paper Trading IBKR - SP500 Momentum | BETA | Non |
+| 16 | QC-Py-Cloud-01 : Analyse de Sentiment FinBERT sur QC… | ALPHA | Non |
+| 17 | QC-Py-Cloud-02 : Classification de Texte et Sentiment… | ALPHA | Non |
+| 18 | QC-Py-Cloud-03 : Parite de Risque (Risk Parity) | BETA | Non |
+| 19 | QC-Py-Cloud-05 : Prevision par Reseau de Neurones (MLP) | ALPHA | Non |
+| 20 | Value Factor Z-Score — Sélection multi-facteurs… | BETA | Non |
+| 21 | Option Wheel — Le paradoxe du win-rate eleve | BETA | Non |
+| 22 | QC-Py-Cloud-10 : Reinforcement Learning - DQN Trading | ALPHA | Non |
+| 23 | QC-Py-Cloud-14 — Dual Momentum : Asset Sélection… | BETA | Non |
+| 24 | Workflow : Téléchargement et gestion des datasets | ALPHA | Non |
## QuantConnect/kelly_lean (2 notebooks)
From 02ffac51bd79164f2e442f58ad7ef50bb79c7ad9 Mon Sep 17 00:00:00 2001
From: jsboige
Date: Mon, 7 Sep 2026 05:13:50 +0200
Subject: [PATCH 2/2] chore(catalog): wake checks (GITHUB_TOKEN no-event
workaround)