erdos-problems 0.1.0 → 0.1.2

package/docs/ERDOS_PROBLEMS_PROBLEM_SCHEMA.md

@@ -10,65 +10,93 @@ The goal is:
 
 - every Erdős problem has a consistent home
 - open and solved problems use the same shape
-- dossiers can grow without changing the core schema
+- local dossier truth and upstream public truth stay explicitly separated
+- packaged CLI installs can scaffold problem workspaces from canonical artifacts immediately
 
-## Canonical File
+## Canonical Files
 
 Each problem should have:
 
 - `problems/<id>/problem.yaml`
+- `problems/<id>/STATEMENT.md`
+- `problems/<id>/REFERENCES.md`
+- `problems/<id>/EVIDENCE.md`
+- `problems/<id>/FORMALIZATION.md`
 
-## Required Fields
+Bundled upstream snapshot artifacts live in:
+
+- `data/upstream/erdosproblems/problems.yaml`
+- `data/upstream/erdosproblems/PROBLEMS_INDEX.json`
+- `data/upstream/erdosproblems/SYNC_MANIFEST.json`
+
+## Canonical Truth Split
+
+### External public truth
+
+Tracked, not rewritten by us:
+
+- upstream structured repo: `teorth/erdosproblems`
+- upstream data file: `data/problems.yaml`
+- public presentation site: `erdosproblems.com`
+
+### Local atlas truth
+
+Authored by this repo:
+
+- `problems/<id>/problem.yaml`
+- local dossier markdown files alongside it
+
+### Local research truth
+
+For active harnessed problems:
+
+- route state
+- evidence
+- formalization status
+- checkpoints and generated reports
+
+## Example Canonical Problem YAML
 
 ```yaml
 problem_id: "857"
+display_name: "Erdos Problem #857"
 title: "Sunflower Conjecture"
 source:
   site: "erdosproblems.com"
   url: "https://www.erdosproblems.com/857"
   external_id: "857"
+upstream:
+  repo: "https://github.com/teorth/erdosproblems"
+  data_file: "data/problems.yaml"
+  number: "857"
 status:
   site_status: "open"
+  site_badge: "OPEN"
   repo_status: "active"
+  upstream_status: "open"
+  upstream_last_update: "2025-08-31"
+cluster: "sunflower"
+prize:
+  display: "no"
+related_problems:
+  - "20"
+  - "536"
+  - "856"
 family_tags:
   - "sunflower"
   - "extremal-set-theory"
-problem_type:
-  kind: "open_problem"
+harness:
+  depth: "deep"
 statement:
-  short: "Normalized problem statement"
+  short: "Bound the weak sunflower number m(n,k) by C(k)^n."
   normalized_md_path: "STATEMENT.md"
 references_path: "REFERENCES.md"
 evidence_path: "EVIDENCE.md"
 formalization_path: "FORMALIZATION.md"
-```
-
-## Recommended Fields
-
-```yaml
-display_name: "Erdos Problem #857"
-aliases:
-  - "weak sunflower problem"
-related_problems:
-  - "20"
-  - "536"
-  - "856"
-prize:
-  amount_usd: null
-  note: null
-domain_tags:
-  - "combinatorics"
-  - "set-systems"
-cluster: "sunflower"
-repo_links:
-  dossier_dir: "problems/857"
-  checkpoints_dir: "problems/857/CHECKPOINTS"
-  pack: "sunflower"
 formalization:
   status: "active"
-  lean_modules:
-    - "SunflowerLean/Obstruction.lean"
-    - "SunflowerLean/ObstructionExport.lean"
+  upstream_state: "no"
+  upstream_last_update: "2025-08-31"
 research_state:
   open_problem: true
   active_route: "anchored_selector_linearization"
@@ -76,9 +104,27 @@ research_state:
   problem_solved: false
 ```
 
+## Required Fields
+
+- `problem_id`
+- `display_name`
+- `title`
+- `source`
+- `upstream`
+- `status`
+- `cluster`
+- `family_tags`
+- `harness.depth`
+- `statement.short`
+- `statement.normalized_md_path`
+- `references_path`
+- `evidence_path`
+- `formalization_path`
+- `formalization.status`
+
 ## Status Vocabulary
 
-### `site_status`
+### `status.site_status`
 
 Allowed values:
 
@@ -87,9 +133,7 @@ Allowed values:
 - `partial`
 - `unknown`
 
-This reflects the public source.
-
-### `repo_status`
+### `status.repo_status`
 
 Allowed values:
 
@@ -99,98 +143,39 @@ Allowed values:
 - `solved_locally`
 - `historical`
 
-This reflects our local posture.
-
-### `research_state`
-
-For deep-harness problems only:
-
-- `open_problem`
-- `active_route`
-- `route_breakthrough`
-- `problem_solved`
+### `harness.depth`
 
-This lets us preserve the sunflower ladder without forcing it onto every problem.
-
-## Supporting Files
-
-### `STATEMENT.md`
-
-Contains:
-
-- normalized statement
-- source attribution
-- concise context
-
-### `REFERENCES.md`
+Allowed values:
 
-Contains:
+- `deep`
+- `dossier`
 
-- literature references
-- source links
-- related problem links
+### `formalization.status`
 
-### `EVIDENCE.md`
+Repo-local examples:
 
-Contains:
+- `active`
+- `planned`
+- `statement-formalized`
+- `site-proved-lean`
+- `unstarted`
 
-- verified constructions
-- theorem checkpoints
-- computational artifacts
-- failed-path summaries
+## Upstream Sync Artifacts
 
-### `FORMALIZATION.md`
+The sync commands should produce:
 
-Contains:
+- raw upstream YAML snapshot
+- normalized JSON index keyed by problem number
+- sync manifest with commit SHA, timestamp, and hash
+- markdown diff report comparing locally seeded problems to upstream state
 
-- Lean status
-- code paths
-- verification hooks
-- outstanding gaps
+## Scaffold Contract
 
-## Example: Problem 857
+`erdos scaffold problem <id>` should create a workspace-ready bundle containing:
 
-```yaml
-problem_id: "857"
-display_name: "Erdos Problem #857"
-title: "Sunflower Conjecture"
-aliases:
-  - "weak sunflower problem"
-source:
-  site: "erdosproblems.com"
-  url: "https://www.erdosproblems.com/857"
-  external_id: "857"
-status:
-  site_status: "open"
-  repo_status: "active"
-family_tags:
-  - "sunflower"
-  - "extremal-set-theory"
-domain_tags:
-  - "combinatorics"
-  - "set-systems"
-problem_type:
-  kind: "open_problem"
-cluster: "sunflower"
-related_problems:
-  - "20"
-  - "536"
-  - "856"
-statement:
-  short: "Bound the weak sunflower number m(n,k) by C(k)^n."
-  normalized_md_path: "STATEMENT.md"
-references_path: "REFERENCES.md"
-evidence_path: "EVIDENCE.md"
-formalization_path: "FORMALIZATION.md"
-formalization:
-  status: "active"
-  lean_modules:
-    - "SunflowerLean/Obstruction.lean"
-    - "SunflowerLean/ObstructionExport.lean"
-research_state:
-  open_problem: true
-  active_route: "anchored_selector_linearization"
-  route_breakthrough: true
-  problem_solved: false
-```
+- copied canonical local dossier files
+- canonical local `problem.yaml`
+- upstream record snapshot for that problem when available
+- generated artifact index for agent consumption
 
+This makes a fresh npm-installed CLI immediately useful to an agentic workflow.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "erdos-problems",
-  "version": "0.1.0",
+  "version": "0.1.2",
   "description": "CLI atlas and staged research harness for Paul Erdos problems.",
   "type": "module",
   "bin": {
@@ -10,6 +10,7 @@
     "README.md",
     "LICENSE",
     "bin",
+    "data",
     "docs",
     "packs",
     "problems",
@@ -26,5 +27,8 @@
     "research",
     "sunflower"
   ],
+  "dependencies": {
+    "yaml": "^2.8.3"
+  },
   "license": "MIT"
 }

package/problems/1008/EVIDENCE.md

@@ -0,0 +1,4 @@
+# Problem 1008 Evidence
+
+- Historical solved entry.
+- Site records the problem as `PROVED (LEAN)`.

package/problems/1008/FORMALIZATION.md

@@ -0,0 +1,5 @@
+# Problem 1008 Formalization
+
+- Site badge: `PROVED (LEAN)`
+- Site also says: `Formalised statement? No`
+- Local interpretation: the solved status has Lean-verified proof metadata on the site, but we have not yet imported the supporting formal artifacts here.

package/problems/1008/REFERENCES.md

@@ -0,0 +1,5 @@
+# Problem 1008 References
+
+- Source page: <https://www.erdosproblems.com/1008>
+- Site badge: `PROVED (LEAN)`
+- Source credits Conlon, Fox, and Sudakov for the first affirmative proof.

package/problems/1008/STATEMENT.md

@@ -0,0 +1,9 @@
+# Problem 1008 Statement
+
+Source: <https://www.erdosproblems.com/1008>
+
+Normalized focus:
+- C4-free subgraphs inside dense graphs
+
+Core question:
+- Does every graph with `m` edges contain a C4-free subgraph with at least a constant multiple of `m^(2/3)` edges?

package/problems/1008/problem.yaml

@@ -0,0 +1,37 @@
+problem_id: "1008"
+display_name: "Erdos Problem #1008"
+title: C4-Free Subgraph Density Problem
+source:
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/1008
+  external_id: "1008"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "1008"
+status:
+  site_status: solved
+  site_badge: PROVED (LEAN)
+  repo_status: historical
+  upstream_status: proved (Lean)
+  upstream_last_update: 2026-01-17
+cluster: graph-theory
+prize:
+  display: no
+related_problems: []
+family_tags:
+  - graph-theory
+  - cycles
+harness:
+  depth: dossier
+statement:
+  short: Determine whether every graph with m edges contains a C4-free subgraph
+    with a constant multiple of m^(2/3) edges.
+  normalized_md_path: STATEMENT.md
+references_path: REFERENCES.md
+evidence_path: EVIDENCE.md
+formalization_path: FORMALIZATION.md
+formalization:
+  status: site-proved-lean
+  upstream_state: no
+  upstream_last_update: 2025-09-10

package/problems/18/EVIDENCE.md

@@ -0,0 +1,4 @@
+# Problem 18 Evidence
+
+- Atlas-only entry for now.
+- No local theorem harness or computational evidence has been attached yet.

package/problems/18/FORMALIZATION.md

@@ -0,0 +1,5 @@
+# Problem 18 Formalization
+
+- Site reports: `Formalised statement? Yes`
+- Local repo status: dossier only
+- Next step: link the referenced formal statement source into the dossier.

package/problems/18/REFERENCES.md

@@ -0,0 +1,6 @@
+# Problem 18 References
+
+- Source page: <https://www.erdosproblems.com/18>
+- Site badge: `OPEN`
+- Tags on source: `number theory`, `divisors`, `factorials`
+- Site notes a $250 reward and records the page as formally stated.

package/problems/18/STATEMENT.md

@@ -0,0 +1,12 @@
+# Problem 18 Statement
+
+Source: <https://www.erdosproblems.com/18>
+
+Normalized focus:
+- practical numbers
+- divisor-sum efficiency parameter `h(m)`
+- factorial specialization `h(n!)`
+
+Core question:
+- Are there infinitely many practical `m` with `h(m) < (log log m)^{O(1)}`?
+- Is `h(n!) < n^{o(1)}` or even `h(n!) < (log n)^{O(1)}`?

package/problems/18/problem.yaml

@@ -0,0 +1,38 @@
+problem_id: "18"
+display_name: "Erdos Problem #18"
+title: Practical Numbers Divisor-Sum Efficiency
+source:
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/18
+  external_id: "18"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "18"
+status:
+  site_status: open
+  site_badge: OPEN
+  repo_status: cataloged
+  upstream_status: open
+  upstream_last_update: 2025-08-31
+cluster: number-theory
+prize:
+  display: no
+related_problems: []
+family_tags:
+  - number-theory
+  - divisors
+  - factorials
+harness:
+  depth: dossier
+statement:
+  short: Study whether infinitely many practical numbers admit polylogarithmic
+    divisor-sum efficiency, and whether h(n!) is polylogarithmic.
+  normalized_md_path: STATEMENT.md
+references_path: REFERENCES.md
+evidence_path: EVIDENCE.md
+formalization_path: FORMALIZATION.md
+formalization:
+  status: statement-formalized
+  upstream_state: yes
+  upstream_last_update: 2026-03-15

package/problems/20/problem.yaml

@@ -1,16 +1,38 @@
 problem_id: "20"
 display_name: "Erdos Problem #20"
-title: "Strong Sunflower Problem"
+title: Strong Sunflower Problem
 source:
-  site: "erdosproblems.com"
-  url: "https://www.erdosproblems.com/20"
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/20
   external_id: "20"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "20"
 status:
-  site_status: "open"
-  repo_status: "active"
-cluster: "sunflower"
+  site_status: open
+  site_badge: OPEN
+  repo_status: active
+  upstream_status: open
+  upstream_last_update: 2025-08-31
+cluster: sunflower
+prize:
+  display: $1000
 related_problems:
   - "857"
 family_tags:
-  - "sunflower"
-  - "uniform-families"
+  - sunflower
+  - uniform-families
+harness:
+  depth: deep
+statement:
+  short: Determine the strong sunflower threshold for k-uniform set systems, with
+    the k=3 lane as the immediate active frontier.
+  normalized_md_path: STATEMENT.md
+references_path: REFERENCES.md
+evidence_path: EVIDENCE.md
+formalization_path: FORMALIZATION.md
+formalization:
+  status: active
+  upstream_state: yes
+  upstream_last_update: 2025-08-31

package/problems/536/problem.yaml

@@ -1,16 +1,38 @@
 problem_id: "536"
 display_name: "Erdos Problem #536"
-title: "LCM Sunflower Analogue"
+title: LCM Sunflower Analogue
 source:
-  site: "erdosproblems.com"
-  url: "https://www.erdosproblems.com/536"
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/536
   external_id: "536"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "536"
 status:
-  site_status: "open"
-  repo_status: "cataloged"
-cluster: "sunflower"
+  site_status: open
+  site_badge: OPEN
+  repo_status: cataloged
+  upstream_status: open
+  upstream_last_update: 2025-08-31
+cluster: sunflower
+prize:
+  display: no
 related_problems:
   - "857"
 family_tags:
-  - "sunflower-analogue"
-  - "number-theory"
+  - sunflower-analogue
+  - number-theory
+harness:
+  depth: dossier
+statement:
+  short: Number-theoretic analogue of the sunflower problem framed through least
+    common multiples.
+  normalized_md_path: STATEMENT.md
+references_path: REFERENCES.md
+evidence_path: EVIDENCE.md
+formalization_path: FORMALIZATION.md
+formalization:
+  status: planned
+  upstream_state: yes
+  upstream_last_update: 2025-11-12

package/problems/542/EVIDENCE.md

@@ -0,0 +1,6 @@
+# Problem 542 Evidence
+
+- Historical solved entry.
+- Source reports:
+  - first question resolved affirmatively
+  - second question resolved negatively

package/problems/542/FORMALIZATION.md

@@ -0,0 +1,5 @@
+# Problem 542 Formalization
+
+- Site reports: `Formalised statement? No`
+- Local repo status: historical dossier only
+- Next step: capture a formalizable modern restatement if this cluster becomes active.

package/problems/542/REFERENCES.md

@@ -0,0 +1,5 @@
+# Problem 542 References
+
+- Source page: <https://www.erdosproblems.com/542>
+- Site badge: `SOLVED`
+- Source records the resolution by Schinzel and Szekeres and later sharpening by Chen.

package/problems/542/STATEMENT.md

@@ -0,0 +1,11 @@
+# Problem 542 Statement
+
+Source: <https://www.erdosproblems.com/542>
+
+Normalized focus:
+- subsets of `{1, ..., n}` with all pairwise least common multiples above `n`
+- reciprocal-sum control and divisor-avoidance density
+
+Core historical questions:
+- Must `sum_{a in A} 1/a <= 31/30`?
+- Must there be linearly many `m <= n` dividing no element of `A`?

package/problems/542/problem.yaml

@@ -0,0 +1,38 @@
+problem_id: "542"
+display_name: "Erdos Problem #542"
+title: LCM-Free Sets Reciprocal Sum Bound
+source:
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/542
+  external_id: "542"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "542"
+status:
+  site_status: solved
+  site_badge: SOLVED
+  repo_status: historical
+  upstream_status: solved
+  upstream_last_update: 2025-08-31
+cluster: number-theory
+prize:
+  display: no
+related_problems:
+  - "784"
+family_tags:
+  - number-theory
+  - least-common-multiple
+harness:
+  depth: dossier
+statement:
+  short: Control reciprocal sums of sets with all pairwise least common multiples
+    above n, a problem resolved by Schinzel and Szekeres.
+  normalized_md_path: STATEMENT.md
+references_path: REFERENCES.md
+evidence_path: EVIDENCE.md
+formalization_path: FORMALIZATION.md
+formalization:
+  status: unstarted
+  upstream_state: no
+  upstream_last_update: 2025-08-31

package/problems/856/problem.yaml

@@ -1,16 +1,38 @@
 problem_id: "856"
 display_name: "Erdos Problem #856"
-title: "Harmonic LCM Sunflower Analogue"
+title: Harmonic LCM Sunflower Analogue
 source:
-  site: "erdosproblems.com"
-  url: "https://www.erdosproblems.com/856"
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/856
   external_id: "856"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "856"
 status:
-  site_status: "open"
-  repo_status: "cataloged"
-cluster: "sunflower"
+  site_status: open
+  site_badge: OPEN
+  repo_status: cataloged
+  upstream_status: open
+  upstream_last_update: 2025-08-31
+cluster: sunflower
+prize:
+  display: no
 related_problems:
   - "857"
 family_tags:
-  - "sunflower-analogue"
-  - "number-theory"
+  - sunflower-analogue
+  - number-theory
+harness:
+  depth: dossier
+statement:
+  short: A harmonic or density-shaped LCM analogue whose exponents are explicitly
+    linked to progress on the weak sunflower problem.
+  normalized_md_path: STATEMENT.md
+references_path: REFERENCES.md
+evidence_path: EVIDENCE.md
+formalization_path: FORMALIZATION.md
+formalization:
+  status: planned
+  upstream_state: no
+  upstream_last_update: 2025-08-31