Upload 9 files

.gitattributes

@@ -60,3 +60,5 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 *.webm filter=lfs diff=lfs merge=lfs -text
 ready.jsonl filter=lfs diff=lfs merge=lfs -text
 train.jsonl filter=lfs diff=lfs merge=lfs -text
+dsl_specification.pdf filter=lfs diff=lfs merge=lfs -text
+generation_pipeline.pdf filter=lfs diff=lfs merge=lfs -text

CHANGELOG.md

@@ -1,5 +1,36 @@
 # Changelog — Math Corpus
 
+## v2.1.1 — 2026-05-03
+
+**Version:** 2.1.1 · **Previous release:** 2.0.3 (2026-04-19)
+
+Incremental release: new documentation, per-OL solver statistics, and a small amount of additional problems.
+
+### Documentation
+
+- `generation_pipeline.pdf` — overview of the end-to-end problem generation pipeline (graph synthesis → enrichment → text rendering → LLM rewrite → solver verification).
+- `dsl_specification.pdf` — formal specification of the CG-Python DSL used to express computation graphs.
+
+### Statistics
+
+- New chart `solve_rate_by_ol.png` — per-`olympiad_level` solve composition for a 9-model capability ladder (top-left = strongest, bottom-right = weakest). Stacked bars show `correct.strict` vs wrong; cells with fewer than 30 attempts are faded as not significant. Embedded in the README inside the LLM Solvers section.
+
+### Data growth (vs 2.0.3)
+
+The corpus grew by **+321 problems** (59,165 → 59,486, +0.5%) — distributed proportionally across domains.
+
+|  | 2.0.3 | 2.1.1 | Δ |
+|---|---:|---:|---:|
+| Total problems | 59,165 | 59,486 | +321 |
+| NT | 39,800 | 39,959 | +159 |
+| ALG | 5,685 | 5,774 | +89 |
+| COMB | 10,999 | 11,054 | +55 |
+| GEOM | 2,681 | 2,699 | +18 |
+| Total LLM solver attempts | 233,227 | 252,773 | +19,546 |
+| Total strict-correct solutions | 113,366 | 117,945 | +4,579 |
+
+Lemma catalog (88) and template count are unchanged.
+
 ## v2.0.3 — 2026-04-19
 
 **Version:** 2.0.3 · **Previous stable release:** 1.1.2.18 (2026-02-15)

README.md

@@ -15,10 +15,10 @@ configs:
 
 # Olympiad Math Corpus
 
-**Version:** v2.0.4<br>
-**Release date:** 2026-04-19
+**Version:** v2.1.1<br>
+**Release date:** 2026-05-03
 
-**59,165** synthetically generated olympiad-style math problems with verified integer answers and formal computation graphs.
+**59,486** synthetically generated olympiad-style math problems with verified integer answers and formal computation graphs.
 
 ## Loading
 
@@ -42,10 +42,10 @@ Domains are classified by graph structure, not by problem text.
 
 | Domain | Count | % | Description |
 |--------|------:|--:|-------------|
-| NT | 39,800 | 67.3% | Number theory |
-| COMB | 10,999 | 18.6% | Combinatorics |
-| ALG | 5,685 | 9.6% | Algebra |
-| GEOM | 2,681 | 4.5% | Geometry |
+| NT | 39,959 | 67.2% | Number theory |
+| COMB | 11,054 | 18.6% | Combinatorics |
+| ALG | 5,774 | 9.7% | Algebra |
+| GEOM | 2,699 | 4.5% | Geometry |
 
 ## Files
 
@@ -53,12 +53,12 @@ The release ships the full dataset in both **Parquet** and **JSONL** formats. `l
 
 | File | Records | Description |
 |------|--------:|-------------|
-| `ready.parquet` | 59,165 | Full dataset, Parquet (used by `load_dataset` / HF viewer) |
-| `ready.jsonl` | 59,165 | Full dataset, JSONL (same records; for direct streaming) |
-| `ready_sample_10.jsonl` | 10 | Random sample for inspection (JSONL) |
+| `ready.parquet` | 59,486 | Full dataset, Parquet (used by `load_dataset` / HF viewer) |
+| `ready.jsonl` | 59,486 | Full dataset, JSONL (same records; for direct streaming) |
+| `ready_sample_50.jsonl` | 50 | Stratified sample for inspection (JSONL) |
 | `lemmas_used.jsonl` | 88 | Lemmas used in the dataset (id, name, description, counts) |
 
-`ready_sample_10.jsonl` contains 10 randomly selected problems for quick inspection. Train/validation/test splits are intentionally left to the consumer — the dataset ships as a single shuffled file.
+`ready_sample_50.jsonl` contains 50 problems sampled stratified by `olympiad_level`: allocations follow the dataset's OL distribution proportionally (largest-remainder method), with at least one problem from every non-empty OL. Train/validation/test splits are intentionally left to the consumer — the dataset ships as a single shuffled file.
 
 ---
 
@@ -161,7 +161,7 @@ The release ships the full dataset in both **Parquet** and **JSONL** formats. `l
 
 ### `lemma_applicability`
 
-List of `{lemma, status}` entries indicating whether each candidate lemma is the correct first solving step. Sorted by `lemma` for determinism. Empty list when `lemma_paths` is empty. Non-empty on 56,631 of 59,165 problems.
+List of `{lemma, status}` entries indicating whether each candidate lemma is the correct first solving step. Sorted by `lemma` for determinism. Empty list when `lemma_paths` is empty. Non-empty on 56,949 of 59,486 problems.
 
 ```json
 "lemma_applicability": [
@@ -317,18 +317,18 @@ Scoring rules: (1) wrapping a known result in trivial arithmetic does not increa
 
 | Level | Count | % | |
 |:-----:|------:|-----:|---|
-| 2 | 4,224 | 7.1% | `███▌` |
-| 3 | 10,260 | 17.3% | `████████▌` |
-| 4 | 13,649 | 23.1% | `███████████▌` |
-| 5 | 12,219 | 20.7% | `██████████` |
-| 6 | 12,442 | 21.0% | `██████████▌` |
-| 7 | 5,580 | 9.4% | `████▌` |
-| 8 | 777 | 1.3% | `▌` |
+| 2 | 4,249 | 7.1% | `███▌` |
+| 3 | 10,312 | 17.3% | `████████▌` |
+| 4 | 13,703 | 23.0% | `███████████▌` |
+| 5 | 12,269 | 20.6% | `██████████` |
+| 6 | 12,503 | 21.0% | `██████████▌` |
+| 7 | 5,642 | 9.5% | `████▌` |
+| 8 | 794 | 1.3% | `▌` |
 | 9 | 14 | 0.0% | `▏` |
 
 ### IRT Difficulty
 
-Calibrated difficulty estimate based on Item Response Theory (IRT-1PL / Rasch model). Present for 59,165 tasks attempted by at least one LLM solver.
+Calibrated difficulty estimate based on Item Response Theory (IRT-1PL / Rasch model). Present for 59,486 tasks attempted by at least one LLM solver.
 
 The Rasch model defines the probability that model *j* solves task *i* as:
 
@@ -354,18 +354,18 @@ All answers are non-negative integers in [0, 99999]. The answer distribution is
 
 | Range | Count | % | |
 |------:|------:|-----:|---|
-| 0–9,999 | 28,130 | 47.5% | `███████████████████████▌` |
-| 10,000–19,999 | 6,180 | 10.4% | `█████` |
-| 20,000–29,999 | 4,863 | 8.2% | `████` |
-| 30,000–39,999 | 4,325 | 7.3% | `███▌` |
-| 40,000–49,999 | 4,422 | 7.5% | `███▌` |
-| 50,000–59,999 | 3,744 | 6.3% | `███` |
-| 60,000–69,999 | 3,021 | 5.1% | `██▌` |
-| 70,000–79,999 | 2,143 | 3.6% | `█▌` |
-| 80,000–89,999 | 1,587 | 2.7% | `█` |
-| 90,000–99,999 | 750 | 1.3% | `▌` |
-
-The median answer is 12,045 and the mean is 23,583. The distribution is concentrated in the lower range (47.5% of answers fall in [0, 9,999]), reflecting the typical output magnitude of small integer-valued olympiad problems, but has smooth coverage across the full [0, 99,999] range without gaps. Very small values such as 0, 1, and 2 do not dominate the distribution and occur with comparable, low frequencies, so no special or degenerate cases collapse into these values.
+| 0–9,999 | 28,477 | 47.9% | `███████████████████████▌` |
+| 10,000–19,999 | 6,161 | 10.4% | `█████` |
+| 20,000–29,999 | 4,851 | 8.2% | `████` |
+| 30,000–39,999 | 4,324 | 7.3% | `███▌` |
+| 40,000–49,999 | 4,422 | 7.4% | `███▌` |
+| 50,000–59,999 | 3,752 | 6.3% | `███` |
+| 60,000–69,999 | 3,011 | 5.1% | `██▌` |
+| 70,000–79,999 | 2,138 | 3.6% | `█▌` |
+| 80,000–89,999 | 1,582 | 2.7% | `█` |
+| 90,000–99,999 | 752 | 1.3% | `▌` |
+
+The median answer is 11,741 and the mean is 1,482,189. The distribution is concentrated in the lower range (47.9% of answers fall in [0, 9,999]), reflecting the typical output magnitude of small integer-valued olympiad problems, but has smooth coverage across the full [0, 99,999] range without gaps. Very small values such as 0, 1, and 2 do not dominate the distribution and occur with comparable, low frequencies, so no special or degenerate cases collapse into these values.
 
 ### LLM Solvers
 
@@ -380,29 +380,33 @@ All models are queried with `temperature=0` and `max_completion_tokens=32768`. N
 | ID | Model | Attempted | Solved | Solve rate ¹ |
 |---:|-------|----------:|-------:|-----------:|
 | 11 | `google/gemma-2-9b-it` | 48,280 | 5,419 | 11.2% |
-| 5 | `deepseek-ai/DeepSeek-V3.2` | 40,419 | 37,966 | 93.9% |
+| 5 | `deepseek-ai/DeepSeek-V3.2` | 40,455 | 37,966 | 93.8% |
 | 8 | `mathstral` | 37,484 | 6,401 | 17.1% |
-| 17 | `meta-llama/Llama-3.3-70B-Instruct` | 28,858 | 8,209 | 28.4% |
-| 2 | `openai/gpt-oss-120b` | 24,021 | 22,134 | 92.1% |
-| 1 | `openai/gpt-oss-20b` | 21,453 | 17,533 | 81.7% |
-| 10 | `qwen2-math:7b` | 14,479 | 4,676 | 32.3% |
-| 16 | `Qwen/Qwen3-Next-80B-A3B-Thinking` | 5,378 | 4,739 | 88.1% |
-| 36 | `qwen2.5:3b-32k` | 3,880 | 1,001 | 25.8% |
+| 17 | `meta-llama/Llama-3.3-70B-Instruct` | 30,160 | 8,347 | 27.7% |
+| 2 | `openai/gpt-oss-120b` | 26,350 | 23,877 | 90.6% |
+| 1 | `openai/gpt-oss-20b` | 21,524 | 17,533 | 81.5% |
+| 36 | `qwen2.5:3b-32k` | 19,311 | 3,645 | 18.9% |
+| 10 | `qwen2-math:7b` | 14,510 | 4,676 | 32.2% |
+| 16 | `Qwen/Qwen3-Next-80B-A3B-Thinking` | 5,427 | 4,739 | 87.3% |
 | 4 | `NousResearch/Hermes-4-405B` | 3,283 | 1,293 | 39.4% |
 | 15 | `Qwen/Qwen3-Coder-480B-A35B-Instruct` | 2,078 | 1,198 | 57.7% |
 | 29 | `Qwen/Qwen3-235B-A22B-Instruct-2507` | 1,749 | 1,417 | 81.0% |
 | 3 | `Qwen/Qwen3-235B-A22B-Thinking-2507` | 1,343 | 1,268 | 94.4% |
-| 38 | `google/gemma-3-27b-it` | 522 | 112 | 21.5% |
+| 38 | `google/gemma-3-27b-it` | 819 | 166 | 20.3% |
 
 ¹ **Solve rate is not a comparable measure of model capability across rows of this table.** Each solver was run on a *different* subset of problems (cost, rate limits, and the pilot vs. continuous phase of a given model all shaped the attempt budget), so the "Attempted" column varies by more than 10× between models and the per-row solve rate is computed against a different task pool for each row. For capability comparisons that account for task difficulty, use `irt_difficulty` on the task side together with jointly-fit model skill (θ).
 
+For a per-OL view of how each model degrades with task difficulty, see the figure below. The 9 solvers are ordered on a rough capability ladder (top-left = strongest, bottom-right = weakest). For each model, attempts are grouped by `olympiad_level` (OL=2..9) and stacked: green = `correct.strict` (last `\boxed{}` matches the expected answer), red = wrong. Cells with fewer than 30 attempts are faded (not statistically significant).
+
+![Solve composition by Olympiad Level](solve_rate_by_ol.png)
+
 **Overall solver coverage:**
 
-- **Total solver attempts**: 233,227
-- **Total correct (strict)**: 113,366
-- **Tasks with ≥1 correct solution**: 58,532 (98.9%)
-- **Mean attempts / task**: 3.94
-- **Mean correct solutions / task**: 1.92
+- **Total solver attempts**: 252,773
+- **Total correct (strict)**: 117,945
+- **Tasks with ≥1 correct solution**: 58,634 (98.6%)
+- **Mean attempts / task**: 4.25
+- **Mean correct solutions / task**: 1.98
 
 Each `llm_solvers` entry:
 
@@ -438,10 +442,10 @@ Aggregate LLM correctness per problem. Derived from individual `llm_solvers` ent
 
 | Status | Label | Count |
 |:------:|-------|------:|
-| 2 | All correct | 6,897 |
-| 1 | Mixed | 51,635 |
-| 0 | All wrong | 630 |
-| null | Untested | 3 |
+| 2 | All correct | 4,194 |
+| 1 | Mixed | 54,440 |
+| 0 | All wrong | 730 |
+| null | Untested | 122 |
 
 ---
 
@@ -494,7 +498,7 @@ The dataset supports multiple training and evaluation approaches:
   author       = {Gribov, Mikhail},
   title        = {Olympiad Math Corpus},
   year         = {2026},
-  version      = {v2.0.4},
+  version      = {v2.1.1},
   publisher    = {Hugging Face},
   howpublished = {\url{https://huggingface.co/datasets/mihailgribov/olympiad_style_integer_math_problems}},
   license      = {CC BY 4.0}

dsl_specification.pdf

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0983815a3d7a1970c126aacc397f5c77d11bd79d4419b3dac06afc4f85f8970b
+size 136378

generation_pipeline.pdf

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e8cad48e7083f1cf3810b57e189db634a38a3d8586ee4fa9c8ab7b293b15da8e
+size 195579

lemmas_used.jsonl

@@ -1,88 +1,88 @@
-{"id": "LIN_FORM", "name": "linear_form_range_counting", "type": "solver_lemma", "domains": ["algebra"], "level": "olympiad", "track": "olympiad_nt", "description": "count of linear form values.", "dataset_count": 11137, "dataset_fraction": 0.1882, "dataset_as_root": 8764, "description_latex": "|\\{x \\in [a,b] : \\exists\\, k,\\; x = \\alpha + k\\beta\\}|", "added_at": "2026-01-18"}
-{"id": "B3", "name": "fixed_product_extremum", "type": "solver_lemma", "domains": ["algebra"], "level": "standard", "track": "olympiad_algebra", "description": "MinOverSet of sum with fixed product constraint.", "dataset_count": 9999, "dataset_fraction": 0.169, "dataset_as_root": 6256, "description_latex": "\\min(a + b) \\text{ s.t. } ab = N", "added_at": "2026-01-18"}
-{"id": "MAX_PRIME_BELOW", "name": "max_prime_below", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "MaxOverSet(SolutionsSet(n, And(n >= 2, n <= upper, IsPrime(n)))).", "dataset_count": 5583, "dataset_fraction": 0.0944, "dataset_as_root": 3567, "description_latex": "\\max\\{p \\le n : p \\text{ prime}\\}", "added_at": "2026-02-01"}
-{"id": "COPRIME_PAIRS", "name": "coprime_factor_pairs", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "CountOverSet({p : Exists(q, p*q=N ∧ gcd(p,q)=1 ∧ p<q)})", "dataset_count": 5229, "dataset_fraction": 0.0884, "dataset_as_root": 4301, "description_latex": "|\\{(a,b) : ab = N,\\; \\gcd(a,b)=1,\\; a < b\\}|", "added_at": "2026-01-18"}
-{"id": "MIN_PRIME_FACTOR", "name": "min_prime_factor", "type": "dataset_only", "description": "minimum prime factor of n via min divisor >= 2.", "dataset_count": 4320, "dataset_fraction": 0.073, "dataset_as_root": 2901, "description_latex": "\\min\\{p : p \\mid n,\\; p \\text{ prime}\\}", "added_at": "2026-02-07"}
-{"id": "K2", "name": "sum_totient_floor_to_triangular", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "Summation(Mul(EulerPhi(Var(k)), Floor(Div(n, Var(k)))), k, 1, n)", "dataset_count": 3602, "dataset_fraction": 0.0609, "dataset_as_root": 1631, "description_latex": "\\sum_{k=1}^{n} \\varphi(k)\\lfloor n/k \\rfloor = \\tfrac{n(n+1)}{2}", "added_at": "2026-01-18"}
-{"id": "B1", "name": "equal_variables_extremum", "type": "solver_lemma", "domains": ["algebra"], "level": "standard", "track": "olympiad_algebra", "description": "MinOverSet/MaxOverSet of symmetric expression with symmetric constraint.", "dataset_count": 3470, "dataset_fraction": 0.0586, "dataset_as_root": 2110, "description_latex": "\\min/\\max f(x,y) \\text{ s.t. symmetric constraint}", "added_at": "2026-01-18"}
-{"id": "COUNT_SUM_EQUALS", "name": "count_pairs_sum_equals_target", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "CountOverSet({(i,j) ∈ [1,a]×[1,b] : i+j=t})", "dataset_count": 3115, "dataset_fraction": 0.0526, "dataset_as_root": 1603, "description_latex": "|\\{(i,j) \\in [1,a]\\times[1,b] : i+j=t\\}|", "added_at": "2026-02-06"}
-{"id": "K3", "name": "divisor_sum_totient_to_n", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "SumOverDivisors(n, var, EulerPhi(Var(var)))", "dataset_count": 2990, "dataset_fraction": 0.0505, "dataset_as_root": 2122, "description_latex": "\\sum_{d \\mid n} \\varphi(d) = n", "added_at": "2026-01-18"}
-{"id": "COMB1", "name": "count_odd_tuples", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "CountOverSet(SolutionsSet(var, And(IsPositive, IsOdd, ..., Eq(Sum, S))))", "dataset_count": 2880, "dataset_fraction": 0.0487, "dataset_as_root": 1758, "description_latex": "|\\{x \\in \\mathbb{Z}_{>0} : x \\text{ odd},\\; \\sum = S\\}|", "added_at": "2026-01-18"}
-{"id": "COUNT_CARTESIAN", "name": "cartesian_product_cardinality", "type": "solver_lemma", "domains": ["combinatorics"], "level": "elementary", "track": "olympiad_combinatorics", "description": "CountOverSet of CartesianProduct.", "dataset_count": 2239, "dataset_fraction": 0.0378, "dataset_as_root": 1697, "description_latex": "|A \\times B| = |A| \\cdot |B|", "added_at": "2026-01-21"}
-{"id": "SUM_ARITHMETIC", "name": "sum_arithmetic", "type": "solver_lemma", "description": "Arithmetic sum: Σ_{k=0}^{n} k = n(n+1)/2", "dataset_count": 2157, "dataset_fraction": 0.0365, "dataset_as_root": 1372, "description_latex": "\\sum_{k=0}^{n-1}(a + kd) = n \\cdot a + d\\binom{n}{2}", "added_at": "2026-02-15"}
-{"id": "V8", "name": "count_odd_binomials", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "CountOverSet({k : 0 ≤ k ≤ n ∧ C(n,k) odd})", "dataset_count": 2020, "dataset_fraction": 0.0341, "dataset_as_root": 1172, "description_latex": "|\\{0 \\le k \\le n : 2 \\nmid \\binom{n}{k}\\}| = 2^{s_2(n)}", "added_at": "2026-01-18"}
-{"id": "LEMMA_BINOMIAL_ALTERNATING", "name": "binomial_alternating", "type": "spawner", "value": 0, "domains": ["COMB"], "complexity": 3, "description": "∑_{k=0}^{n} (-1)^k C(n,k) = 0 for n > 0 (inclusion-exclusion)", "dataset_count": 1813, "dataset_fraction": 0.0306, "dataset_as_root": 1094, "description_latex": "\\sum_{k=0}^{n} (-1)^k \\binom{n}{k} = [n = 0]", "added_at": "2026-01-31"}
-{"id": "VIETA_SUM", "name": "vieta_sum_of_roots", "type": "solver_lemma", "domains": ["algebra"], "level": "standard", "track": "olympiad_algebra", "description": "SumOverSet(SolutionsSet(x, Eq(polynomial, 0))) pattern.", "dataset_count": 1369, "dataset_fraction": 0.0231, "dataset_as_root": 940, "description_latex": "\\sum \\text{roots}(P) = -a_{n-1}/a_n \\text{ (Vieta)}", "added_at": "2026-02-01"}
-{"id": "C2", "name": "count_multiples_in_range", "type": "solver_lemma", "domains": ["combinatorics"], "level": "elementary", "track": "olympiad_combinatorics", "description": "CountOverSet(SolutionsSet(var, And(bounds..., Divides...)))", "dataset_count": 1108, "dataset_fraction": 0.0187, "dataset_as_root": 649, "description_latex": "|\\{x \\in [a,b] : d \\mid f(x)\\}|", "added_at": "2026-01-18"}
-{"id": "COUNT_FIB_DIVISIBLE", "name": "count_fib_divisible", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "CountOverSet(SolutionsSet(n, And(n >= 1, n <= N, Divides(d, Fib(n))))).", "dataset_count": 1085, "dataset_fraction": 0.0183, "dataset_as_root": 723, "description_latex": "|\\{1 \\le n \\le N : d \\mid F_n\\}|", "added_at": "2026-02-01"}
-{"id": "C4", "name": "count_coprime_in_range", "type": "solver_lemma", "domains": ["combinatorics"], "level": "olympiad", "track": "olympiad_combinatorics", "description": "CountOverSet(SolutionsSet(var, And(bounds..., Eq(GCD(var, m), 1))))", "dataset_count": 1078, "dataset_fraction": 0.0182, "dataset_as_root": 651, "description_latex": "|\\{x \\in [1,n] : \\gcd(x,m) = 1\\}|", "added_at": "2026-01-18"}
-{"id": "MAX_DIVISOR", "name": "max_divisor", "type": "dataset_only", "description": "largest proper divisor of n (max d | n with d < n).", "dataset_count": 1067, "dataset_fraction": 0.018, "dataset_as_root": 660, "description_latex": "\\max\\{d : d \\mid n,\\; d < n\\}", "added_at": "2026-02-07"}
-{"id": "L3c", "name": "count_div2_congruence", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "aimo_nt", "description": "CountOverSet(SolutionsSet(var, And(bounds, Congruent(var, Floor(Div(var, 2)), m))))", "dataset_count": 1060, "dataset_fraction": 0.0179, "dataset_as_root": 661, "description_latex": "|\\{x \\in [a,b] : x \\equiv \\lfloor x/2 \\rfloor \\pmod{m}\\}|", "added_at": "2026-01-18"}
-{"id": "LEMMA_MOBIUS_COPRIME", "name": "mobius_coprime", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 3, "description": "∑_{d|gcd(a,b)} μ(d) = 0 when gcd(a,b) > 1", "dataset_count": 1060, "dataset_fraction": 0.0179, "dataset_as_root": 522, "description_latex": "\\sum_{d \\mid \\gcd(a,b)} \\mu(d) = [\\gcd(a,b) = 1]", "added_at": "2026-01-31"}
-{"id": "COUNT_PRIMES", "name": "count_primes", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "CountOverSet(SolutionsSet(n, And(n >= 2, n <= upper, IsPrime(n)))).", "dataset_count": 962, "dataset_fraction": 0.0163, "dataset_as_root": 595, "description_latex": "\\pi(n) = |\\{p \\le n : p \\text{ prime}\\}|", "added_at": "2026-02-01"}
-{"id": "QF_PSD_COUNT_LEQ", "name": "qf_psd_count_leq", "type": "dataset_only", "description": "count of lattice points x in [1,M]^n with Q(x) <= K for a PSD form Q.", "dataset_count": 931, "dataset_fraction": 0.0157, "dataset_as_root": 552, "description_latex": "|\\{x \\in [1,M]^n : x^T A x \\le K\\}|"}
-{"id": "C3", "name": "count_powers_in_range", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_nt", "description": "CountOverSet(SolutionsSet(var, And(lower ≤ Pow(var,e) ≤ upper)))", "dataset_count": 921, "dataset_fraction": 0.0156, "dataset_as_root": 539, "description_latex": "|\\{x \\in [a,b] : x = k^e \\text{ for some } k\\}|", "added_at": "2026-01-18"}
-{"id": "C5", "name": "count_intersection_divides_coprime", "type": "solver_lemma", "domains": ["combinatorics"], "level": "olympiad", "track": "olympiad_combinatorics", "description": "CountOverSet(SolutionsSet(var, And(", "dataset_count": 896, "dataset_fraction": 0.0151, "dataset_as_root": 540, "description_latex": "|\\{x \\in [a,b] : \\gcd(f(x),m) = 1\\}|", "added_at": "2026-02-01"}
-{"id": "L3b", "name": "count_popcount_parity", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "aimo_nt", "description": "CountOverSet(SolutionsSet(var, And(bounds, Eq(Mod(DigitSum(var, 2), 2), k))))", "dataset_count": 886, "dataset_fraction": 0.015, "dataset_as_root": 554, "description_latex": "|\\{x \\in [a,b] : s_2(x) \\equiv k \\pmod{2}\\}|", "added_at": "2026-01-18"}
-{"id": "POLY_ORBIT_COUNT", "name": "poly_orbit_count", "type": "dataset_only", "description": "count of starting values with exact minimal period r under an iterated polynomial map mod M.", "dataset_count": 798, "dataset_fraction": 0.0135, "dataset_as_root": 755, "description_latex": "|\\{a \\in [0,N] : P^r(a) \\equiv a \\pmod{M},\\; P^k(a) \\not\\equiv a \\text{ for } 1\\le k<r\\}|"}
-{"id": "COUNT_COPRIME_GRID", "name": "count_coprime_pairs_grid", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "CountOverSet({(i,j) ∈ [1,a]×[1,b] : gcd(i,j)=1}).", "dataset_count": 788, "dataset_fraction": 0.0133, "dataset_as_root": 614, "description_latex": "|\\{(i,j) \\in [1,a]\\times[1,b] : \\gcd(i,j)=1\\}|", "added_at": "2026-02-06"}
-{"id": "QF_PSD_DISTINCT", "name": "qf_psd_distinct", "type": "dataset_only", "description": "count of distinct values of a PSD quadratic form over a bounded integer lattice.", "dataset_count": 721, "dataset_fraction": 0.0122, "dataset_as_root": 377, "description_latex": "|\\{Q(x) : x \\in [1,M]^n\\}| \\text{ for } Q(x) = x^T A x"}
-{"id": "SUM_DIVISIBLE", "name": "sum_divisible", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "SumOverSet(SolutionsSet(n, And(n >= 1, n <= N, n mod d = 0))).", "dataset_count": 713, "dataset_fraction": 0.0121, "dataset_as_root": 434, "description_latex": "\\sum_{\\substack{1 \\le k \\le n \\\\ d \\mid k}} k", "added_at": "2026-02-01"}
-{"id": "K13", "name": "valuation_product", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "MaxKDivides(Mul(a, b, ...), p)", "dataset_count": 699, "dataset_fraction": 0.0118, "dataset_as_root": 613, "description_latex": "v_p(ab) = v_p(a) + v_p(b)", "added_at": "2026-01-18"}
-{"id": "ONE_PHI_1", "name": "phi_1", "type": "spawner", "value": 1, "domains": ["NT"], "complexity": 2, "description": "phi(1) = 1", "dataset_count": 665, "dataset_fraction": 0.0112, "dataset_as_root": 320, "description_latex": "\\varphi(1) = 1", "added_at": "2026-01-29"}
-{"id": "ONE_PHI_2", "name": "phi_2", "type": "spawner", "value": 1, "domains": ["NT"], "complexity": 2, "description": "phi(2) = 1", "dataset_count": 651, "dataset_fraction": 0.011, "dataset_as_root": 273, "description_latex": "\\varphi(2) = 1", "added_at": "2026-01-29"}
-{"id": "V1", "name": "valuation_factorial_digit_sum", "type": "solver_lemma", "domains": ["number_theory"], "level": "advanced", "track": "aimo_nt", "description": "MaxKDivides(Factorial(n), p) where n is symbolic.", "dataset_count": 558, "dataset_fraction": 0.0094, "dataset_as_root": 356, "description_latex": "v_p(n!) = \\sum_{i=1}^{\\infty} \\lfloor n/p^i \\rfloor", "added_at": "2026-01-18"}
-{"id": "POLY_ORBIT_HENSEL", "name": "poly_orbit_hensel", "type": "dataset_only", "description": "count of starting values with exact minimal period r under an iterated polynomial map modulo p^k (Hensel lift).", "dataset_count": 520, "dataset_fraction": 0.0088, "dataset_as_root": 330, "description_latex": "|\\{a \\in [0,N] : P^r(a) \\equiv a \\pmod{p^k},\\; P^j(a) \\not\\equiv a \\text{ for } 1\\le j<r\\}|"}
-{"id": "SUM_GEOM", "name": "sum_geometric", "type": "solver_lemma", "description": "Geometric sum: Σ_{k=0}^{n} r^k = (r^{n+1}-1)/(r-1)", "dataset_count": 498, "dataset_fraction": 0.0084, "dataset_as_root": 247, "description_latex": "\\sum_{k=0}^{n} r^k = \\frac{r^{n+1}-1}{r-1}", "added_at": "2026-02-15"}
-{"id": "POLY4_COUNT", "name": "poly4_count", "type": "dataset_only", "description": "count of lattice points x in [1,M]^n solving F(x) = R for a quartic form F.", "dataset_count": 411, "dataset_fraction": 0.0069, "dataset_as_root": 205, "description_latex": "|\\{x \\in [1,M]^n : F(x) = R\\}|,\\; \\deg F = 4"}
-{"id": "QF_PSD_COUNT", "name": "qf_psd_count", "type": "dataset_only", "description": "count of lattice points x in [1,M]^n with Q(x) = R for a PSD quadratic form Q.", "dataset_count": 403, "dataset_fraction": 0.0068, "dataset_as_root": 215, "description_latex": "|\\{x \\in [1,M]^n : x^T A x = R\\}|"}
-{"id": "POLY3_COUNT", "name": "poly3_count", "type": "dataset_only", "description": "count of lattice points x in [1,M]^n solving F(x) = R for a cubic form F.", "dataset_count": 371, "dataset_fraction": 0.0063, "dataset_as_root": 184, "description_latex": "|\\{x \\in [1,M]^n : F(x) = R\\}|,\\; \\deg F = 3"}
-{"id": "LTE_DIFF", "name": "lte_difference", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "MaxKDivides(Sub(Pow(a, n), Pow(b, n)), p)", "dataset_count": 360, "dataset_fraction": 0.0061, "dataset_as_root": 336, "description_latex": "v_p(a^n - b^n) \\text{ (Lifting the Exponent)}", "added_at": "2026-01-20"}
-{"id": "SUM_INDEPENDENT", "name": "sum_over_cartesian_independent_var", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "SumOverSet(MapOverSet(SolutionsSet((i,j), domain=A×B), f(i)))", "dataset_count": 359, "dataset_fraction": 0.0061, "dataset_as_root": 230, "description_latex": "\\sum_{(i,j) \\in A\\times B} f(i) = |B|\\sum_{i \\in A} f(i)", "added_at": "2026-02-06"}
-{"id": "QF_PSD_ORBIT", "name": "qf_psd_orbit", "type": "dataset_only", "description": "count of unordered solutions of a symmetric PSD form Q(x) = R under variable-permutation ordering.", "dataset_count": 354, "dataset_fraction": 0.006, "dataset_as_root": 189, "description_latex": "|\\{x_1 \\le \\dots \\le x_n : x^T A x = R\\}|"}
+{"id": "LIN_FORM", "name": "linear_form_range_counting", "type": "solver_lemma", "domains": ["algebra"], "level": "olympiad", "track": "olympiad_nt", "description": "count of linear form values.", "dataset_count": 11174, "dataset_fraction": 0.1878, "dataset_as_root": 8782, "description_latex": "|\\{x \\in [a,b] : \\exists\\, k,\\; x = \\alpha + k\\beta\\}|", "added_at": "2026-01-18"}
+{"id": "B3", "name": "fixed_product_extremum", "type": "solver_lemma", "domains": ["algebra"], "level": "standard", "track": "olympiad_algebra", "description": "MinOverSet of sum with fixed product constraint.", "dataset_count": 10020, "dataset_fraction": 0.1684, "dataset_as_root": 6263, "description_latex": "\\min(a + b) \\text{ s.t. } ab = N", "added_at": "2026-01-18"}
+{"id": "MAX_PRIME_BELOW", "name": "max_prime_below", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "MaxOverSet(SolutionsSet(n, And(n >= 2, n <= upper, IsPrime(n)))).", "dataset_count": 5601, "dataset_fraction": 0.0942, "dataset_as_root": 3576, "description_latex": "\\max\\{p \\le n : p \\text{ prime}\\}", "added_at": "2026-02-01"}
+{"id": "COPRIME_PAIRS", "name": "coprime_factor_pairs", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "CountOverSet({p : Exists(q, p*q=N ∧ gcd(p,q)=1 ∧ p<q)})", "dataset_count": 5235, "dataset_fraction": 0.088, "dataset_as_root": 4306, "description_latex": "|\\{(a,b) : ab = N,\\; \\gcd(a,b)=1,\\; a < b\\}|", "added_at": "2026-01-18"}
+{"id": "MIN_PRIME_FACTOR", "name": "min_prime_factor", "type": "dataset_only", "description": "minimum prime factor of n via min divisor >= 2.", "dataset_count": 4334, "dataset_fraction": 0.0729, "dataset_as_root": 2909, "description_latex": "\\min\\{p : p \\mid n,\\; p \\text{ prime}\\}", "added_at": "2026-02-07"}
+{"id": "K2", "name": "sum_totient_floor_to_triangular", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "Summation(Mul(EulerPhi(Var(k)), Floor(Div(n, Var(k)))), k, 1, n)", "dataset_count": 3610, "dataset_fraction": 0.0607, "dataset_as_root": 1634, "description_latex": "\\sum_{k=1}^{n} \\varphi(k)\\lfloor n/k \\rfloor = \\tfrac{n(n+1)}{2}", "added_at": "2026-01-18"}
+{"id": "B1", "name": "equal_variables_extremum", "type": "solver_lemma", "domains": ["algebra"], "level": "standard", "track": "olympiad_algebra", "description": "MinOverSet/MaxOverSet of symmetric expression with symmetric constraint.", "dataset_count": 3480, "dataset_fraction": 0.0585, "dataset_as_root": 2115, "description_latex": "\\min/\\max f(x,y) \\text{ s.t. symmetric constraint}", "added_at": "2026-01-18"}
+{"id": "COUNT_SUM_EQUALS", "name": "count_pairs_sum_equals_target", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "CountOverSet({(i,j) ∈ [1,a]×[1,b] : i+j=t})", "dataset_count": 3119, "dataset_fraction": 0.0524, "dataset_as_root": 1604, "description_latex": "|\\{(i,j) \\in [1,a]\\times[1,b] : i+j=t\\}|", "added_at": "2026-02-06"}
+{"id": "K3", "name": "divisor_sum_totient_to_n", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "SumOverDivisors(n, var, EulerPhi(Var(var)))", "dataset_count": 3005, "dataset_fraction": 0.0505, "dataset_as_root": 2130, "description_latex": "\\sum_{d \\mid n} \\varphi(d) = n", "added_at": "2026-01-18"}
+{"id": "COMB1", "name": "count_odd_tuples", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "CountOverSet(SolutionsSet(var, And(IsPositive, IsOdd, ..., Eq(Sum, S))))", "dataset_count": 2884, "dataset_fraction": 0.0485, "dataset_as_root": 1760, "description_latex": "|\\{x \\in \\mathbb{Z}_{>0} : x \\text{ odd},\\; \\sum = S\\}|", "added_at": "2026-01-18"}
+{"id": "COUNT_CARTESIAN", "name": "cartesian_product_cardinality", "type": "solver_lemma", "domains": ["combinatorics"], "level": "elementary", "track": "olympiad_combinatorics", "description": "CountOverSet of CartesianProduct.", "dataset_count": 2243, "dataset_fraction": 0.0377, "dataset_as_root": 1700, "description_latex": "|A \\times B| = |A| \\cdot |B|", "added_at": "2026-01-21"}
+{"id": "SUM_ARITHMETIC", "name": "sum_arithmetic", "type": "solver_lemma", "description": "Arithmetic sum: Σ_{k=0}^{n} k = n(n+1)/2", "dataset_count": 2165, "dataset_fraction": 0.0364, "dataset_as_root": 1376, "description_latex": "\\sum_{k=0}^{n-1}(a + kd) = n \\cdot a + d\\binom{n}{2}", "added_at": "2026-02-15"}
+{"id": "V8", "name": "count_odd_binomials", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "CountOverSet({k : 0 ≤ k ≤ n ∧ C(n,k) odd})", "dataset_count": 2023, "dataset_fraction": 0.034, "dataset_as_root": 1174, "description_latex": "|\\{0 \\le k \\le n : 2 \\nmid \\binom{n}{k}\\}| = 2^{s_2(n)}", "added_at": "2026-01-18"}
+{"id": "LEMMA_BINOMIAL_ALTERNATING", "name": "binomial_alternating", "type": "spawner", "value": 0, "domains": ["COMB"], "complexity": 3, "description": "∑_{k=0}^{n} (-1)^k C(n,k) = 0 for n > 0 (inclusion-exclusion)", "dataset_count": 1817, "dataset_fraction": 0.0305, "dataset_as_root": 1096, "description_latex": "\\sum_{k=0}^{n} (-1)^k \\binom{n}{k} = [n = 0]", "added_at": "2026-01-31"}
+{"id": "VIETA_SUM", "name": "vieta_sum_of_roots", "type": "solver_lemma", "domains": ["algebra"], "level": "standard", "track": "olympiad_algebra", "description": "SumOverSet(SolutionsSet(x, Eq(polynomial, 0))) pattern.", "dataset_count": 1371, "dataset_fraction": 0.023, "dataset_as_root": 941, "description_latex": "\\sum \\text{roots}(P) = -a_{n-1}/a_n \\text{ (Vieta)}", "added_at": "2026-02-01"}
+{"id": "C2", "name": "count_multiples_in_range", "type": "solver_lemma", "domains": ["combinatorics"], "level": "elementary", "track": "olympiad_combinatorics", "description": "CountOverSet(SolutionsSet(var, And(bounds..., Divides...)))", "dataset_count": 1111, "dataset_fraction": 0.0187, "dataset_as_root": 652, "description_latex": "|\\{x \\in [a,b] : d \\mid f(x)\\}|", "added_at": "2026-01-18"}
+{"id": "COUNT_FIB_DIVISIBLE", "name": "count_fib_divisible", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "CountOverSet(SolutionsSet(n, And(n >= 1, n <= N, Divides(d, Fib(n))))).", "dataset_count": 1091, "dataset_fraction": 0.0183, "dataset_as_root": 729, "description_latex": "|\\{1 \\le n \\le N : d \\mid F_n\\}|", "added_at": "2026-02-01"}
+{"id": "C4", "name": "count_coprime_in_range", "type": "solver_lemma", "domains": ["combinatorics"], "level": "olympiad", "track": "olympiad_combinatorics", "description": "CountOverSet(SolutionsSet(var, And(bounds..., Eq(GCD(var, m), 1))))", "dataset_count": 1080, "dataset_fraction": 0.0182, "dataset_as_root": 651, "description_latex": "|\\{x \\in [1,n] : \\gcd(x,m) = 1\\}|", "added_at": "2026-01-18"}
+{"id": "LEMMA_MOBIUS_COPRIME", "name": "mobius_coprime", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 3, "description": "∑_{d|gcd(a,b)} μ(d) = 0 when gcd(a,b) > 1", "dataset_count": 1080, "dataset_fraction": 0.0182, "dataset_as_root": 529, "description_latex": "\\sum_{d \\mid \\gcd(a,b)} \\mu(d) = [\\gcd(a,b) = 1]", "added_at": "2026-01-31"}
+{"id": "MAX_DIVISOR", "name": "max_divisor", "type": "dataset_only", "description": "largest proper divisor of n (max d | n with d < n).", "dataset_count": 1069, "dataset_fraction": 0.018, "dataset_as_root": 661, "description_latex": "\\max\\{d : d \\mid n,\\; d < n\\}", "added_at": "2026-02-07"}
+{"id": "L3c", "name": "count_div2_congruence", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "aimo_nt", "description": "CountOverSet(SolutionsSet(var, And(bounds, Congruent(var, Floor(Div(var, 2)), m))))", "dataset_count": 1062, "dataset_fraction": 0.0179, "dataset_as_root": 661, "description_latex": "|\\{x \\in [a,b] : x \\equiv \\lfloor x/2 \\rfloor \\pmod{m}\\}|", "added_at": "2026-01-18"}
+{"id": "COUNT_PRIMES", "name": "count_primes", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "CountOverSet(SolutionsSet(n, And(n >= 2, n <= upper, IsPrime(n)))).", "dataset_count": 966, "dataset_fraction": 0.0162, "dataset_as_root": 596, "description_latex": "\\pi(n) = |\\{p \\le n : p \\text{ prime}\\}|", "added_at": "2026-02-01"}
+{"id": "QF_PSD_COUNT_LEQ", "name": "qf_psd_count_leq", "type": "dataset_only", "description": "count of lattice points x in [1,M]^n with Q(x) <= K for a PSD form Q.", "dataset_count": 964, "dataset_fraction": 0.0162, "dataset_as_root": 568, "description_latex": "|\\{x \\in [1,M]^n : x^T A x \\le K\\}|"}
+{"id": "C3", "name": "count_powers_in_range", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_nt", "description": "CountOverSet(SolutionsSet(var, And(lower ≤ Pow(var,e) ≤ upper)))", "dataset_count": 925, "dataset_fraction": 0.0155, "dataset_as_root": 540, "description_latex": "|\\{x \\in [a,b] : x = k^e \\text{ for some } k\\}|", "added_at": "2026-01-18"}
+{"id": "C5", "name": "count_intersection_divides_coprime", "type": "solver_lemma", "domains": ["combinatorics"], "level": "olympiad", "track": "olympiad_combinatorics", "description": "CountOverSet(SolutionsSet(var, And(", "dataset_count": 897, "dataset_fraction": 0.0151, "dataset_as_root": 541, "description_latex": "|\\{x \\in [a,b] : \\gcd(f(x),m) = 1\\}|", "added_at": "2026-02-01"}
+{"id": "L3b", "name": "count_popcount_parity", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "aimo_nt", "description": "CountOverSet(SolutionsSet(var, And(bounds, Eq(Mod(DigitSum(var, 2), 2), k))))", "dataset_count": 887, "dataset_fraction": 0.0149, "dataset_as_root": 555, "description_latex": "|\\{x \\in [a,b] : s_2(x) \\equiv k \\pmod{2}\\}|", "added_at": "2026-01-18"}
+{"id": "POLY_ORBIT_COUNT", "name": "poly_orbit_count", "type": "dataset_only", "description": "count of starting values with exact minimal period r under an iterated polynomial map mod M.", "dataset_count": 818, "dataset_fraction": 0.0138, "dataset_as_root": 774, "description_latex": "|\\{a \\in [0,N] : P^r(a) \\equiv a \\pmod{M},\\; P^k(a) \\not\\equiv a \\text{ for } 1\\le k<r\\}|"}
+{"id": "COUNT_COPRIME_GRID", "name": "count_coprime_pairs_grid", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "CountOverSet({(i,j) ∈ [1,a]×[1,b] : gcd(i,j)=1}).", "dataset_count": 790, "dataset_fraction": 0.0133, "dataset_as_root": 616, "description_latex": "|\\{(i,j) \\in [1,a]\\times[1,b] : \\gcd(i,j)=1\\}|", "added_at": "2026-02-06"}
+{"id": "QF_PSD_DISTINCT", "name": "qf_psd_distinct", "type": "dataset_only", "description": "count of distinct values of a PSD quadratic form over a bounded integer lattice.", "dataset_count": 749, "dataset_fraction": 0.0126, "dataset_as_root": 390, "description_latex": "|\\{Q(x) : x \\in [1,M]^n\\}| \\text{ for } Q(x) = x^T A x"}
+{"id": "SUM_DIVISIBLE", "name": "sum_divisible", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "SumOverSet(SolutionsSet(n, And(n >= 1, n <= N, n mod d = 0))).", "dataset_count": 716, "dataset_fraction": 0.012, "dataset_as_root": 435, "description_latex": "\\sum_{\\substack{1 \\le k \\le n \\\\ d \\mid k}} k", "added_at": "2026-02-01"}
+{"id": "K13", "name": "valuation_product", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "MaxKDivides(Mul(a, b, ...), p)", "dataset_count": 706, "dataset_fraction": 0.0119, "dataset_as_root": 618, "description_latex": "v_p(ab) = v_p(a) + v_p(b)", "added_at": "2026-01-18"}
+{"id": "ONE_PHI_1", "name": "phi_1", "type": "spawner", "value": 1, "domains": ["NT"], "complexity": 2, "description": "phi(1) = 1", "dataset_count": 674, "dataset_fraction": 0.0113, "dataset_as_root": 322, "description_latex": "\\varphi(1) = 1", "added_at": "2026-01-29"}
+{"id": "ONE_PHI_2", "name": "phi_2", "type": "spawner", "value": 1, "domains": ["NT"], "complexity": 2, "description": "phi(2) = 1", "dataset_count": 662, "dataset_fraction": 0.0111, "dataset_as_root": 277, "description_latex": "\\varphi(2) = 1", "added_at": "2026-01-29"}
+{"id": "V1", "name": "valuation_factorial_digit_sum", "type": "solver_lemma", "domains": ["number_theory"], "level": "advanced", "track": "aimo_nt", "description": "MaxKDivides(Factorial(n), p) where n is symbolic.", "dataset_count": 567, "dataset_fraction": 0.0095, "dataset_as_root": 361, "description_latex": "v_p(n!) = \\sum_{i=1}^{\\infty} \\lfloor n/p^i \\rfloor", "added_at": "2026-01-18"}
+{"id": "POLY_ORBIT_HENSEL", "name": "poly_orbit_hensel", "type": "dataset_only", "description": "count of starting values with exact minimal period r under an iterated polynomial map modulo p^k (Hensel lift).", "dataset_count": 548, "dataset_fraction": 0.0092, "dataset_as_root": 344, "description_latex": "|\\{a \\in [0,N] : P^r(a) \\equiv a \\pmod{p^k},\\; P^j(a) \\not\\equiv a \\text{ for } 1\\le j<r\\}|"}
+{"id": "SUM_GEOM", "name": "sum_geometric", "type": "solver_lemma", "description": "Geometric sum: Σ_{k=0}^{n} r^k = (r^{n+1}-1)/(r-1)", "dataset_count": 520, "dataset_fraction": 0.0087, "dataset_as_root": 256, "description_latex": "\\sum_{k=0}^{n} r^k = \\frac{r^{n+1}-1}{r-1}", "added_at": "2026-02-15"}
+{"id": "POLY4_COUNT", "name": "poly4_count", "type": "dataset_only", "description": "count of lattice points x in [1,M]^n solving F(x) = R for a quartic form F.", "dataset_count": 421, "dataset_fraction": 0.0071, "dataset_as_root": 211, "description_latex": "|\\{x \\in [1,M]^n : F(x) = R\\}|,\\; \\deg F = 4"}
+{"id": "QF_PSD_COUNT", "name": "qf_psd_count", "type": "dataset_only", "description": "count of lattice points x in [1,M]^n with Q(x) = R for a PSD quadratic form Q.", "dataset_count": 413, "dataset_fraction": 0.0069, "dataset_as_root": 218, "description_latex": "|\\{x \\in [1,M]^n : x^T A x = R\\}|"}
+{"id": "B3_CLOSEST", "name": "b3_closest", "type": "dataset_only", "description": "largest divisor of P not exceeding sqrt(P).", "dataset_count": 384, "dataset_fraction": 0.0065, "dataset_as_root": 238, "description_latex": "\\max\\{d : d \\mid P,\\; d^2 \\le P\\}"}
+{"id": "POLY3_COUNT", "name": "poly3_count", "type": "dataset_only", "description": "count of lattice points x in [1,M]^n solving F(x) = R for a cubic form F.", "dataset_count": 382, "dataset_fraction": 0.0064, "dataset_as_root": 186, "description_latex": "|\\{x \\in [1,M]^n : F(x) = R\\}|,\\; \\deg F = 3"}
+{"id": "B3_DIFF", "name": "b3_diff", "type": "dataset_only", "description": "minimum factor gap: min |x-y| with xy = P.", "dataset_count": 370, "dataset_fraction": 0.0062, "dataset_as_root": 198, "description_latex": "\\min\\{|x-y| : xy = P,\\; x,y \\ge 1\\}"}
+{"id": "LTE_DIFF", "name": "lte_difference", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "MaxKDivides(Sub(Pow(a, n), Pow(b, n)), p)", "dataset_count": 364, "dataset_fraction": 0.0061, "dataset_as_root": 340, "description_latex": "v_p(a^n - b^n) \\text{ (Lifting the Exponent)}", "added_at": "2026-01-20"}
+{"id": "SUM_INDEPENDENT", "name": "sum_over_cartesian_independent_var", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "SumOverSet(MapOverSet(SolutionsSet((i,j), domain=A×B), f(i)))", "dataset_count": 364, "dataset_fraction": 0.0061, "dataset_as_root": 235, "description_latex": "\\sum_{(i,j) \\in A\\times B} f(i) = |B|\\sum_{i \\in A} f(i)", "added_at": "2026-02-06"}
+{"id": "QF_PSD_ORBIT", "name": "qf_psd_orbit", "type": "dataset_only", "description": "count of unordered solutions of a symmetric PSD form Q(x) = R under variable-permutation ordering.", "dataset_count": 363, "dataset_fraction": 0.0061, "dataset_as_root": 191, "description_latex": "|\\{x_1 \\le \\dots \\le x_n : x^T A x = R\\}|"}
+{"id": "LEMMA_MOBIUS_SUM", "name": "mobius_sum", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 3, "description": "∑_{d|n} μ(d) = 0 for n > 1 (Möbius annihilation)", "dataset_count": 356, "dataset_fraction": 0.006, "dataset_as_root": 112, "description_latex": "\\sum_{d \\mid n} \\mu(d) = [n = 1]", "added_at": "2026-01-31"}
 {"id": "MAX_VAL", "name": "max_valuation", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "pattern for maximum valuation query.", "dataset_count": 350, "dataset_fraction": 0.0059, "dataset_as_root": 190, "description_latex": "\\max_{p^v \\mid n} v", "added_at": "2026-01-18"}
-{"id": "LEMMA_MOBIUS_SUM", "name": "mobius_sum", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 3, "description": "∑_{d|n} μ(d) = 0 for n > 1 (Möbius annihilation)", "dataset_count": 348, "dataset_fraction": 0.0059, "dataset_as_root": 110, "description_latex": "\\sum_{d \\mid n} \\mu(d) = [n = 1]", "added_at": "2026-01-31"}
-{"id": "B3_CLOSEST", "name": "b3_closest", "type": "dataset_only", "description": "largest divisor of P not exceeding sqrt(P).", "dataset_count": 343, "dataset_fraction": 0.0058, "dataset_as_root": 216, "description_latex": "\\max\\{d : d \\mid P,\\; d^2 \\le P\\}"}
-{"id": "B3_DIFF", "name": "b3_diff", "type": "dataset_only", "description": "minimum factor gap: min |x-y| with xy = P.", "dataset_count": 333, "dataset_fraction": 0.0056, "dataset_as_root": 177, "description_latex": "\\min\\{|x-y| : xy = P,\\; x,y \\ge 1\\}"}
-{"id": "QF_PSD_MIN", "name": "qf_psd_min", "type": "dataset_only", "description": "minimum of a PSD quadratic form Q(x) = x^T A x over x in [1,M]^n.", "dataset_count": 324, "dataset_fraction": 0.0055, "dataset_as_root": 161, "description_latex": "\\min_{x \\in [1,M]^n} x^T A x"}
-{"id": "V7", "name": "valuation_binomial_kummer", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "MaxKDivides(Binom(n, k), p)", "dataset_count": 313, "dataset_fraction": 0.0053, "dataset_as_root": 196, "description_latex": "v_p\\binom{n}{k} = \\frac{s_p(k) + s_p(n-k) - s_p(n)}{p-1}", "added_at": "2026-01-18"}
-{"id": "V5", "name": "min_valuation_factorial", "type": "solver_lemma", "domains": ["number_theory"], "level": "advanced", "track": "aimo_nt", "description": "MinOverSet({n : v_p(n!) >= k})", "dataset_count": 268, "dataset_fraction": 0.0045, "dataset_as_root": 160, "description_latex": "\\min\\{n \\in \\mathbb{Z}_{>0} : v_p(n!) \\ge k\\}", "added_at": "2026-01-18"}
-{"id": "K14", "name": "valuation_power", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "MaxKDivides(Pow(a, k), p)", "dataset_count": 253, "dataset_fraction": 0.0043, "dataset_as_root": 156, "description_latex": "v_p(a^k) = k \\cdot v_p(a)", "added_at": "2026-01-18"}
-{"id": "POLY_ORBIT_LEGENDRE", "name": "poly_orbit_legendre", "type": "dataset_only", "description": "count of orbits of exact period r under iterated P mod p, filtered by a Legendre-symbol sum congruence.", "dataset_count": 239, "dataset_fraction": 0.004, "dataset_as_root": 214, "description_latex": "|\\{a \\in [0,N] : \\text{period}_P(a) = r,\\; \\textstyle\\sum_{i=0}^{r-1}\\bigl(\\frac{P^i(a)}{p}\\bigr) \\equiv 0 \\pmod m\\}|"}
-{"id": "SUM_FACTOR_CARTESIAN", "name": "sum_over_cartesian_factor_product", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "SumOverSet(MapOverSet(SolutionsSet((i,j), domain=A×B), Mul(f(i), g(j))))", "dataset_count": 225, "dataset_fraction": 0.0038, "dataset_as_root": 125, "description_latex": "\\sum_{(i,j) \\in A\\times B} f(i)g(j) = \\bigl(\\sum_{i \\in A} f(i)\\bigr)\\bigl(\\sum_{j \\in B} g(j)\\bigr)", "added_at": "2026-02-06"}
-{"id": "PRODUCT_OF_SUMS", "name": "product_of_sums", "type": "dataset_only", "description": "product of two independent sums, each reducible via its own antilemma.", "dataset_count": 216, "dataset_fraction": 0.0037, "dataset_as_root": 76, "description_latex": "\\prod_i \\sum_j a_{ij} \\text{ expansion}", "added_at": "2026-02-07"}
-{"id": "POLY3_MIN", "name": "poly3_min", "type": "dataset_only", "description": "minimum of a cubic form F(x) (sum of cubes of linear forms) over x in [1,M]^n.", "dataset_count": 213, "dataset_fraction": 0.0036, "dataset_as_root": 103, "description_latex": "\\min_{x \\in [1,M]^n} F(x),\\; \\deg F = 3"}
-{"id": "ZERO_BINOM_0", "name": "binom_0", "type": "spawner", "value": 0, "domains": ["COMB"], "complexity": 2, "description": "C(n, 0) - 1 = 0", "dataset_count": 206, "dataset_fraction": 0.0035, "dataset_as_root": 5, "description_latex": "\\binom{n}{0} - 1 = 0", "added_at": "2026-01-29"}
-{"id": "ZERO_BINOM_N", "name": "binom_n", "type": "spawner", "value": 0, "domains": ["COMB"], "complexity": 2, "description": "C(n, n) - 1 = 0", "dataset_count": 205, "dataset_fraction": 0.0035, "dataset_as_root": 13, "description_latex": "\\binom{n}{n} - 1 = 0", "added_at": "2026-01-29"}
-{"id": "SUM_PRIMES", "name": "sum_primes", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "SumOverSet(SolutionsSet(n, And(n >= lower, n <= upper, IsPrime(n)))).", "dataset_count": 188, "dataset_fraction": 0.0032, "dataset_as_root": 75, "description_latex": "\\sum_{\\substack{p \\le n \\\\ p \\text{ prime}}} p", "added_at": "2026-02-06"}
-{"id": "ONE_FACTORIAL_0", "name": "factorial_0", "type": "spawner", "value": 1, "domains": ["COMB"], "complexity": 2, "description": "0! = 1", "dataset_count": 177, "dataset_fraction": 0.003, "dataset_as_root": 56, "description_latex": "0! = 1", "added_at": "2026-01-29"}
-{"id": "LEMMA_MOBIUS_SQUAREFREE", "name": "mobius_squarefree", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 3, "description": "μ(n)² = 0 when n has a square factor", "dataset_count": 176, "dataset_fraction": 0.003, "dataset_as_root": 54, "description_latex": "\\mu(n)^2 = [n \\text{ is squarefree}]", "added_at": "2026-01-31"}
-{"id": "ONE_BINOM_N", "name": "binom_n", "type": "spawner", "value": 1, "domains": ["COMB"], "complexity": 2, "description": "C(n, n) = 1", "dataset_count": 172, "dataset_fraction": 0.0029, "dataset_as_root": 31, "description_latex": "\\binom{n}{n} = 1", "added_at": "2026-01-29"}
-{"id": "ONE_BINOM_0", "name": "binom_0", "type": "spawner", "value": 1, "domains": ["COMB"], "complexity": 2, "description": "C(n, 0) = 1", "dataset_count": 168, "dataset_fraction": 0.0028, "dataset_as_root": 29, "description_latex": "\\binom{n}{0} = 1", "added_at": "2026-01-29"}
-{"id": "LEMMA_DIVISOR_PARITY", "name": "divisor_parity", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 2, "description": "τ(n) mod 2 = 0 when n is not a perfect square", "dataset_count": 145, "dataset_fraction": 0.0025, "dataset_as_root": 30, "description_latex": "\\tau(n) \\bmod 2 = [n \\text{ is a perfect square}]", "added_at": "2026-01-31"}
-{"id": "EULER_TOTIENT_SUM", "name": "euler_totient_sum", "type": "dataset_only", "description": "totient summatory function: sum of phi(k) over k = 1..n.", "dataset_count": 131, "dataset_fraction": 0.0022, "dataset_as_root": 42, "description_latex": "\\sum_{k=1}^{n} \\varphi(k)", "added_at": "2026-02-10"}
-{"id": "STARS_BARS", "name": "stars_bars", "type": "dataset_only", "description": "compositions count: number of positive integer tuples (x1,...,xk) with sum S.", "dataset_count": 116, "dataset_fraction": 0.002, "dataset_as_root": 88, "description_latex": "|\\{(x_1,\\dots,x_k) \\in \\mathbb{Z}_{\\ge 1}^k : x_1+\\dots+x_k = S\\}| = \\binom{S-1}{k-1}"}
+{"id": "QF_PSD_MIN", "name": "qf_psd_min", "type": "dataset_only", "description": "minimum of a PSD quadratic form Q(x) = x^T A x over x in [1,M]^n.", "dataset_count": 333, "dataset_fraction": 0.0056, "dataset_as_root": 164, "description_latex": "\\min_{x \\in [1,M]^n} x^T A x"}
+{"id": "V7", "name": "valuation_binomial_kummer", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "MaxKDivides(Binom(n, k), p)", "dataset_count": 320, "dataset_fraction": 0.0054, "dataset_as_root": 200, "description_latex": "v_p\\binom{n}{k} = \\frac{s_p(k) + s_p(n-k) - s_p(n)}{p-1}", "added_at": "2026-01-18"}
+{"id": "V5", "name": "min_valuation_factorial", "type": "solver_lemma", "domains": ["number_theory"], "level": "advanced", "track": "aimo_nt", "description": "MinOverSet({n : v_p(n!) >= k})", "dataset_count": 269, "dataset_fraction": 0.0045, "dataset_as_root": 160, "description_latex": "\\min\\{n \\in \\mathbb{Z}_{>0} : v_p(n!) \\ge k\\}", "added_at": "2026-01-18"}
+{"id": "POLY_ORBIT_LEGENDRE", "name": "poly_orbit_legendre", "type": "dataset_only", "description": "count of orbits of exact period r under iterated P mod p, filtered by a Legendre-symbol sum congruence.", "dataset_count": 262, "dataset_fraction": 0.0044, "dataset_as_root": 234, "description_latex": "|\\{a \\in [0,N] : \\text{period}_P(a) = r,\\; \\textstyle\\sum_{i=0}^{r-1}\\bigl(\\frac{P^i(a)}{p}\\bigr) \\equiv 0 \\pmod m\\}|"}
+{"id": "K14", "name": "valuation_power", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "MaxKDivides(Pow(a, k), p)", "dataset_count": 256, "dataset_fraction": 0.0043, "dataset_as_root": 158, "description_latex": "v_p(a^k) = k \\cdot v_p(a)", "added_at": "2026-01-18"}
+{"id": "SUM_FACTOR_CARTESIAN", "name": "sum_over_cartesian_factor_product", "type": "solver_lemma", "domains": ["combinatorics"], "level": "standard", "track": "olympiad_combinatorics", "description": "SumOverSet(MapOverSet(SolutionsSet((i,j), domain=A×B), Mul(f(i), g(j))))", "dataset_count": 229, "dataset_fraction": 0.0038, "dataset_as_root": 128, "description_latex": "\\sum_{(i,j) \\in A\\times B} f(i)g(j) = \\bigl(\\sum_{i \\in A} f(i)\\bigr)\\bigl(\\sum_{j \\in B} g(j)\\bigr)", "added_at": "2026-02-06"}
+{"id": "POLY3_MIN", "name": "poly3_min", "type": "dataset_only", "description": "minimum of a cubic form F(x) (sum of cubes of linear forms) over x in [1,M]^n.", "dataset_count": 220, "dataset_fraction": 0.0037, "dataset_as_root": 108, "description_latex": "\\min_{x \\in [1,M]^n} F(x),\\; \\deg F = 3"}
+{"id": "PRODUCT_OF_SUMS", "name": "product_of_sums", "type": "dataset_only", "description": "product of two independent sums, each reducible via its own antilemma.", "dataset_count": 218, "dataset_fraction": 0.0037, "dataset_as_root": 77, "description_latex": "\\prod_i \\sum_j a_{ij} \\text{ expansion}", "added_at": "2026-02-07"}
+{"id": "ZERO_BINOM_0", "name": "binom_0", "type": "spawner", "value": 0, "domains": ["COMB"], "complexity": 2, "description": "C(n, 0) - 1 = 0", "dataset_count": 211, "dataset_fraction": 0.0035, "dataset_as_root": 5, "description_latex": "\\binom{n}{0} - 1 = 0", "added_at": "2026-01-29"}
+{"id": "ZERO_BINOM_N", "name": "binom_n", "type": "spawner", "value": 0, "domains": ["COMB"], "complexity": 2, "description": "C(n, n) - 1 = 0", "dataset_count": 208, "dataset_fraction": 0.0035, "dataset_as_root": 14, "description_latex": "\\binom{n}{n} - 1 = 0", "added_at": "2026-01-29"}
+{"id": "SUM_PRIMES", "name": "sum_primes", "type": "solver_lemma", "domains": ["number_theory"], "level": "standard", "track": "olympiad_nt", "description": "SumOverSet(SolutionsSet(n, And(n >= lower, n <= upper, IsPrime(n)))).", "dataset_count": 193, "dataset_fraction": 0.0032, "dataset_as_root": 76, "description_latex": "\\sum_{\\substack{p \\le n \\\\ p \\text{ prime}}} p", "added_at": "2026-02-06"}
+{"id": "LEMMA_MOBIUS_SQUAREFREE", "name": "mobius_squarefree", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 3, "description": "μ(n)² = 0 when n has a square factor", "dataset_count": 181, "dataset_fraction": 0.003, "dataset_as_root": 56, "description_latex": "\\mu(n)^2 = [n \\text{ is squarefree}]", "added_at": "2026-01-31"}
+{"id": "ONE_FACTORIAL_0", "name": "factorial_0", "type": "spawner", "value": 1, "domains": ["COMB"], "complexity": 2, "description": "0! = 1", "dataset_count": 180, "dataset_fraction": 0.003, "dataset_as_root": 57, "description_latex": "0! = 1", "added_at": "2026-01-29"}
+{"id": "ONE_BINOM_N", "name": "binom_n", "type": "spawner", "value": 1, "domains": ["COMB"], "complexity": 2, "description": "C(n, n) = 1", "dataset_count": 174, "dataset_fraction": 0.0029, "dataset_as_root": 32, "description_latex": "\\binom{n}{n} = 1", "added_at": "2026-01-29"}
+{"id": "ONE_BINOM_0", "name": "binom_0", "type": "spawner", "value": 1, "domains": ["COMB"], "complexity": 2, "description": "C(n, 0) = 1", "dataset_count": 171, "dataset_fraction": 0.0029, "dataset_as_root": 29, "description_latex": "\\binom{n}{0} = 1", "added_at": "2026-01-29"}
+{"id": "LEMMA_DIVISOR_PARITY", "name": "divisor_parity", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 2, "description": "τ(n) mod 2 = 0 when n is not a perfect square", "dataset_count": 146, "dataset_fraction": 0.0025, "dataset_as_root": 30, "description_latex": "\\tau(n) \\bmod 2 = [n \\text{ is a perfect square}]", "added_at": "2026-01-31"}
+{"id": "EULER_TOTIENT_SUM", "name": "euler_totient_sum", "type": "dataset_only", "description": "totient summatory function: sum of phi(k) over k = 1..n.", "dataset_count": 133, "dataset_fraction": 0.0022, "dataset_as_root": 42, "description_latex": "\\sum_{k=1}^{n} \\varphi(k)", "added_at": "2026-02-10"}
+{"id": "STARS_BARS", "name": "stars_bars", "type": "dataset_only", "description": "compositions count: number of positive integer tuples (x1,...,xk) with sum S.", "dataset_count": 117, "dataset_fraction": 0.002, "dataset_as_root": 89, "description_latex": "|\\{(x_1,\\dots,x_k) \\in \\mathbb{Z}_{\\ge 1}^k : x_1+\\dots+x_k = S\\}| = \\binom{S-1}{k-1}"}
+{"id": "WILSON", "name": "wilson", "type": "dataset_only", "description": "Wilson's theorem: (p-1)! is congruent to -1 modulo prime p.", "dataset_count": 115, "dataset_fraction": 0.0019, "dataset_as_root": 2, "description_latex": "(p-1)! \\equiv -1 \\pmod{p}", "added_at": "2026-02-10"}
 {"id": "LTE_SUM", "name": "lte_sum", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "MaxKDivides(Sum(Pow(a, n), Pow(b, n)), p) where n is odd.", "dataset_count": 114, "dataset_fraction": 0.0019, "dataset_as_root": 86, "description_latex": "v_p(a^n + b^n) \\text{ for odd } n, \\; p \\mid a+b", "added_at": "2026-01-20"}
 {"id": "LIOUVILLE_MINUS_ONE", "name": "liouville_minus_one", "type": "dataset_only", "description": "Liouville lambda evaluates to -1 when Omega(n) is odd.", "dataset_count": 114, "dataset_fraction": 0.0019, "dataset_as_root": 43, "description_latex": "\\lambda(n) = (-1)^{\\Omega(n)} = -1 \\text{ when } \\Omega(n) \\text{ odd}", "added_at": "2026-02-10"}
-{"id": "WILSON", "name": "wilson", "type": "dataset_only", "description": "Wilson's theorem: (p-1)! is congruent to -1 modulo prime p.", "dataset_count": 112, "dataset_fraction": 0.0019, "dataset_as_root": 2, "description_latex": "(p-1)! \\equiv -1 \\pmod{p}", "added_at": "2026-02-10"}
-{"id": "IDENTITY_DIV_SELF", "name": "div_self", "type": "spawner", "value": 1, "domains": ["ARITH"], "complexity": 1, "description": "a / a = 1", "dataset_count": 110, "dataset_fraction": 0.0019, "dataset_as_root": 73, "description_latex": "a / a = 1", "added_at": "2026-02-07"}
-{"id": "LIOUVILLE_ONE", "name": "liouville_one", "type": "dataset_only", "description": "Liouville lambda evaluates to 1 when Omega(n) is even.", "dataset_count": 105, "dataset_fraction": 0.0018, "dataset_as_root": 15, "description_latex": "\\lambda(n) = (-1)^{\\Omega(n)} = 1 \\text{ when } \\Omega(n) \\text{ even}", "added_at": "2026-02-10"}
+{"id": "IDENTITY_DIV_SELF", "name": "div_self", "type": "spawner", "value": 1, "domains": ["ARITH"], "complexity": 1, "description": "a / a = 1", "dataset_count": 110, "dataset_fraction": 0.0018, "dataset_as_root": 73, "description_latex": "a / a = 1", "added_at": "2026-02-07"}
+{"id": "LIOUVILLE_ONE", "name": "liouville_one", "type": "dataset_only", "description": "Liouville lambda evaluates to 1 when Omega(n) is even.", "dataset_count": 107, "dataset_fraction": 0.0018, "dataset_as_root": 15, "description_latex": "\\lambda(n) = (-1)^{\\Omega(n)} = 1 \\text{ when } \\Omega(n) \\text{ even}", "added_at": "2026-02-10"}
 {"id": "POLY4_MIN", "name": "poly4_min", "type": "dataset_only", "description": "minimum of a quartic form F(x) (sum of 4th powers of linear forms) over x in [1,M]^n.", "dataset_count": 100, "dataset_fraction": 0.0017, "dataset_as_root": 49, "description_latex": "\\min_{x \\in [1,M]^n} F(x),\\; \\deg F = 4"}
 {"id": "IDENTITY_POW_ZERO", "name": "pow_zero", "type": "spawner", "value": 1, "domains": ["ARITH"], "complexity": 1, "description": "a^0 = 1", "dataset_count": 93, "dataset_fraction": 0.0016, "dataset_as_root": 57, "description_latex": "a^0 = 1", "added_at": "2026-02-07"}
-{"id": "BIG_OMEGA_ZERO", "name": "big_omega_zero", "type": "dataset_only", "description": "Big Omega vanishes at n = 1 (no prime factors with multiplicity).", "dataset_count": 86, "dataset_fraction": 0.0015, "dataset_as_root": 30, "description_latex": "\\Omega(1) = 0", "added_at": "2026-02-10"}
-{"id": "HALFPLANE_COUNT", "name": "halfplane_count", "type": "dataset_only", "description": "count of lattice points (x,y) in [1,Nx] x [1,Ny] under a half-plane constraint ax+by <= C.", "dataset_count": 85, "dataset_fraction": 0.0014, "dataset_as_root": 59, "description_latex": "|\\{(x,y) \\in [1,N_x]\\times[1,N_y] : ax + by \\le C\\}|"}
-{"id": "BIG_OMEGA_ONE", "name": "big_omega_one", "type": "dataset_only", "description": "Big Omega equals 1 at any prime p.", "dataset_count": 79, "dataset_fraction": 0.0013, "dataset_as_root": 11, "description_latex": "\\Omega(p) = 1", "added_at": "2026-02-10"}
-{"id": "SUM_SQUARES_IDENTITY", "name": "sum_of_squares_equals_sum_of_products", "type": "solver_lemma", "domains": ["algebra"], "level": "olympiad", "track": "olympiad_algebra", "description": "a²+b²+c² = ab+bc+ca forces a=b=c; combined with linear constraint determines unique value.", "description_latex": "a^2+b^2+c^2 = ab+bc+ca \\iff (a-b)^2+(b-c)^2+(c-a)^2=0 \\implies a=b=c", "dataset_count": 78, "dataset_fraction": 0.0013, "dataset_as_root": 44, "added_at": "2026-02-24"}
-{"id": "OMEGA_ZERO", "name": "omega_zero", "type": "dataset_only", "description": "small omega vanishes at n = 1 (no distinct prime factors).", "dataset_count": 73, "dataset_fraction": 0.0012, "dataset_as_root": 10, "description_latex": "\\omega(1) = 0", "added_at": "2026-02-10"}
-{"id": "POLY_ORBIT_LEGENDRE_COUNT", "name": "poly_orbit_legendre_count", "type": "dataset_only", "description": "count of starting values a with exact minimal period r under iterated P mod p and Legendre-sum filter.", "dataset_count": 73, "dataset_fraction": 0.0012, "dataset_as_root": 73, "description_latex": "|\\{a \\in [0,N] : \\text{period}_P(a) = r,\\; \\textstyle\\sum_{i=0}^{r-1}\\bigl(\\frac{P^i(a)}{p}\\bigr) \\equiv 0 \\pmod m\\}|"}
-{"id": "OMEGA_ONE", "name": "omega_one", "type": "dataset_only", "description": "small omega equals 1 at any prime power p^k (single distinct prime).", "dataset_count": 62, "dataset_fraction": 0.001, "dataset_as_root": 5, "description_latex": "\\omega(p) = 1", "added_at": "2026-02-10"}
+{"id": "HALFPLANE_COUNT", "name": "halfplane_count", "type": "dataset_only", "description": "count of lattice points (x,y) in [1,Nx] x [1,Ny] under a half-plane constraint ax+by <= C.", "dataset_count": 93, "dataset_fraction": 0.0016, "dataset_as_root": 64, "description_latex": "|\\{(x,y) \\in [1,N_x]\\times[1,N_y] : ax + by \\le C\\}|"}
+{"id": "BIG_OMEGA_ZERO", "name": "big_omega_zero", "type": "dataset_only", "description": "Big Omega vanishes at n = 1 (no prime factors with multiplicity).", "dataset_count": 89, "dataset_fraction": 0.0015, "dataset_as_root": 30, "description_latex": "\\Omega(1) = 0", "added_at": "2026-02-10"}
+{"id": "BIG_OMEGA_ONE", "name": "big_omega_one", "type": "dataset_only", "description": "Big Omega equals 1 at any prime p.", "dataset_count": 81, "dataset_fraction": 0.0014, "dataset_as_root": 11, "description_latex": "\\Omega(p) = 1", "added_at": "2026-02-10"}
+{"id": "SUM_SQUARES_IDENTITY", "name": "sum_of_squares_equals_sum_of_products", "type": "solver_lemma", "domains": ["algebra"], "level": "olympiad", "track": "olympiad_algebra", "description": "a²+b²+c² = ab+bc+ca forces a=b=c; combined with linear constraint determines unique value.", "description_latex": "a^2+b^2+c^2 = ab+bc+ca \\iff (a-b)^2+(b-c)^2+(c-a)^2=0 \\implies a=b=c", "dataset_count": 81, "dataset_fraction": 0.0014, "dataset_as_root": 44, "added_at": "2026-02-24"}
+{"id": "POLY_ORBIT_LEGENDRE_COUNT", "name": "poly_orbit_legendre_count", "type": "dataset_only", "description": "count of starting values a with exact minimal period r under iterated P mod p and Legendre-sum filter.", "dataset_count": 80, "dataset_fraction": 0.0013, "dataset_as_root": 80, "description_latex": "|\\{a \\in [0,N] : \\text{period}_P(a) = r,\\; \\textstyle\\sum_{i=0}^{r-1}\\bigl(\\frac{P^i(a)}{p}\\bigr) \\equiv 0 \\pmod m\\}|"}
+{"id": "OMEGA_ZERO", "name": "omega_zero", "type": "dataset_only", "description": "small omega vanishes at n = 1 (no distinct prime factors).", "dataset_count": 76, "dataset_fraction": 0.0013, "dataset_as_root": 10, "description_latex": "\\omega(1) = 0", "added_at": "2026-02-10"}
+{"id": "OMEGA_ONE", "name": "omega_one", "type": "dataset_only", "description": "small omega equals 1 at any prime power p^k (single distinct prime).", "dataset_count": 65, "dataset_fraction": 0.0011, "dataset_as_root": 5, "description_latex": "\\omega(p) = 1", "added_at": "2026-02-10"}
 {"id": "LTE_DIFF_P2", "name": "lte_difference_p2", "type": "solver_lemma", "domains": ["number_theory"], "level": "olympiad", "track": "olympiad_nt", "description": "MaxKDivides(Sub(Pow(a, n), Pow(b, n)), 2)", "dataset_count": 58, "dataset_fraction": 0.001, "dataset_as_root": 39, "description_latex": "v_2(a^n - b^n) = v_2(a-b) + v_2(a+b) + v_2(n) - 1", "added_at": "2026-01-20"}
-{"id": "ABS_INEQ", "name": "abs_ineq", "type": "dataset_only", "description": "count of integers x in [1,N] satisfying an absolute-value inequality |ax - b| <= c.", "dataset_count": 53, "dataset_fraction": 0.0009, "dataset_as_root": 32, "description_latex": "|\\{x \\in [1,N] : |ax - b| \\le c\\}|"}
-{"id": "SUM_AP", "name": "sum_ap", "type": "dataset_only", "description": "closed form for the general arithmetic-progression sum Sigma_{k=start}^{n} (a*k + b).", "dataset_count": 39, "dataset_fraction": 0.0007, "dataset_as_root": 31, "description_latex": "\\sum_{k=s}^{n} (a k + b) = a\\cdot\\tfrac{n(n+1) - s(s-1)}{2} + b(n - s + 1)"}
+{"id": "ABS_INEQ", "name": "abs_ineq", "type": "dataset_only", "description": "count of integers x in [1,N] satisfying an absolute-value inequality |ax - b| <= c.", "dataset_count": 56, "dataset_fraction": 0.0009, "dataset_as_root": 35, "description_latex": "|\\{x \\in [1,N] : |ax - b| \\le c\\}|"}
+{"id": "SUM_AP", "name": "sum_ap", "type": "dataset_only", "description": "closed form for the general arithmetic-progression sum Sigma_{k=start}^{n} (a*k + b).", "dataset_count": 40, "dataset_fraction": 0.0007, "dataset_as_root": 32, "description_latex": "\\sum_{k=s}^{n} (a k + b) = a\\cdot\\tfrac{n(n+1) - s(s-1)}{2} + b(n - s + 1)"}
 {"id": "QUADRATIC_INEQ", "name": "quadratic_ineq", "type": "dataset_only", "description": "count of integers x in [1,N] satisfying a quadratic inequality a x^2 + b x + c <= 0 with a > 0.", "dataset_count": 35, "dataset_fraction": 0.0006, "dataset_as_root": 25, "description_latex": "|\\{x \\in [1,N] : a x^2 + b x + c \\le 0\\}|"}
 {"id": "IDENTITY_MUL_ZERO", "name": "mul_zero", "type": "spawner", "value": 0, "domains": ["ARITH"], "complexity": 1, "description": "a * 0 = 0", "dataset_count": 26, "dataset_fraction": 0.0004, "dataset_as_root": 8, "description_latex": "a \\cdot 0 = 0", "added_at": "2026-02-07"}
 {"id": "IDENTITY_SUB_SELF", "name": "sub_self", "type": "spawner", "value": 0, "domains": ["ARITH"], "complexity": 1, "description": "a - a = 0", "dataset_count": 23, "dataset_fraction": 0.0004, "dataset_as_root": 8, "description_latex": "a - a = 0", "added_at": "2026-02-07"}
 {"id": "ZERO_PHI_PRIME", "name": "phi_prime", "type": "spawner", "value": 0, "domains": ["NT"], "complexity": 2, "description": "phi(p) - (p-1) = 0 for prime p", "dataset_count": 18, "dataset_fraction": 0.0003, "dataset_as_root": 7, "description_latex": "\\varphi(p) = p - 1", "added_at": "2026-01-29"}
 {"id": "IDENTITY_MOD_SELF", "name": "mod_self", "type": "spawner", "value": 0, "domains": ["ARITH"], "complexity": 1, "description": "a % a = 0", "dataset_count": 16, "dataset_fraction": 0.0003, "dataset_as_root": 2, "description_latex": "a \\bmod a = 0", "added_at": "2026-02-07"}
-{"id": "TELESCOPE", "name": "telescope", "type": "dataset_only", "description": "telescoping sum Sigma_{k=start}^{n} (f(k+1) - f(k)) collapses to f(n+1) - f(start).", "dataset_count": 3, "dataset_fraction": 0.0001, "dataset_as_root": 1, "description_latex": "\\sum_{k=s}^{n} \\bigl(f(k+1) - f(k)\\bigr) = f(n+1) - f(s)"}
+{"id": "TELESCOPE", "name": "telescope", "type": "dataset_only", "description": "telescoping sum Sigma_{k=start}^{n} (f(k+1) - f(k)) collapses to f(n+1) - f(start).", "dataset_count": 4, "dataset_fraction": 0.0001, "dataset_as_root": 2, "description_latex": "\\sum_{k=s}^{n} \\bigl(f(k+1) - f(k)\\bigr) = f(n+1) - f(s)"}
 {"id": "POLY_PREPERIOD_COUNT", "name": "poly_preperiod_count", "type": "dataset_only", "description": "count of starting values with preperiod t and exact cycle length s under iterated polynomial map mod M.", "dataset_count": 2, "dataset_fraction": 0.0, "dataset_as_root": 2, "description_latex": "|\\{a \\in [0,N] : P^{t+s}(a) \\equiv P^t(a) \\pmod{M},\\; P^{t+k}(a) \\not\\equiv P^t(a) \\text{ for } 1\\le k<s\\}|"}

ready.jsonl

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:858474f58142efedda198b7b81a3326b98b9351584aebfa1b153d0db6c12fe20
-size 166614563
+oid sha256:319b8845d32432f84edcf3f94e59d055ae63b921f8b400379aa6aa0d6c79d5f3
+size 171356564

ready.parquet

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:1f0351f2e18383bdad10dcc68faa8c2ae48d1b44dc70ffe6c80ac6c135b32b1a
-size 16051240
+oid sha256:b7c38077a93b4ba90549c9f5489a994398ea8a40fe2bfaa9e5a933e5e3f5e398
+size 16405185