erdos-problems 0.1.7 → 0.1.8

package/problems/5/EVIDENCE.md

@@ -0,0 +1,10 @@
+# Evidence
+
+- This dossier was seeded for Erdos Problem #5 from a pull bundle.
+- Upstream record included: yes
+- Site snapshot included: yes
+- Repo status at seed time: cataloged
+- Harness depth at seed time: dossier
+
+Next maintainer step:
+- replace the seed placeholders with a curated statement, references, evidence notes, and formalization plan.

package/problems/5/FORMALIZATION.md

@@ -0,0 +1,8 @@
+# Formalization
+
+- Local status: planned
+- Upstream formalized state: no
+- Upstream formalized last update: 2025-08-31
+
+Seed note:
+- this file was created automatically from a pull bundle and should be upgraded as local formal work begins.

package/problems/5/REFERENCES.md

@@ -0,0 +1,9 @@
+# References
+
+- Public problem page:
+  - <https://www.erdosproblems.com/5>
+- Upstream structured data:
+  - <https://github.com/teorth/erdosproblems>
+  - `data/problems.yaml`
+- Site summary snapshot was present in the pull bundle at seed time.
+- A literature lane bundle was available during seeding.

package/problems/5/ROUTES.md

@@ -0,0 +1,14 @@
+# Routes
+
+## Status Ladder
+
+- Open problem: yes
+- Active route: seed_route_pending
+- Route breakthrough: no
+- Problem solved: no
+
+## Starter route notes
+
+- Current seeded route placeholder for problem 5: `seed_route_pending`
+- Treat this as a workspace-level route marker until a curated route tree is written.
+- Keep route progress separate from global problem status.

package/problems/5/STATEMENT.md

@@ -0,0 +1,21 @@
+# Problem 5 Statement
+
+Source: <https://www.erdosproblems.com/5>
+
+Normalized focus:
+- Let $C\geq 0$. Is there an infinite sequence of $n_i$ such that\[\lim_{i\to \infty}\frac{p_{n_i+1}-p_{n_i}}{\log n_i}=C?\]
+- Seeded with filtered statement candidates from the public site snapshot
+
+Statement candidates:
+- Let $C\geq 0$. Is there an infinite sequence of $n_i$ such that\[\lim_{i\to \infty}\frac{p_{n_i+1}-p_{n_i}}{\log n_i}=C?\]
+- Let $S$ be the set of limit points of $(p_{n+1}-p_n)/\log n$. This problem asks whether $S=[0,\infty]$. Although this conjecture remains unproven, a lot is known about $S$. Some highlights:
+- - $\infty\in S$ by Westzynthius' result [We31] on large prime gaps,
+- - Erdős [Er55] and Ricci [Ri56] independently showed that $S$ has positive Lebesgue measure,
+
+Public-site preview:
+- OPEN
+- This is open, and cannot be resolved with a finite computation.
+- Let $C\geq 0$. Is there an infinite sequence of $n_i$ such that\[\lim_{i\to \infty}\frac{p_{n_i+1}-p_{n_i}}{\log n_i}=C?\]
+- #5 : [Er55c] [Er57] [Er61] [Er65b] [Er85c] [Er90] [Er97c]
+- number theory |
+- primes

package/problems/5/problem.yaml

@@ -0,0 +1,43 @@
+problem_id: "5"
+display_name: "Erdos Problem #5"
+title: "Erdos Problem #5"
+source:
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/5
+  external_id: "5"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "5"
+provenance:
+  seeded_at: 2026-03-26T04:41:25.800Z
+  seeded_from:
+    kind: pull_bundle
+    upstream_record_included: true
+    site_snapshot_included: true
+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
+  - primes
+harness:
+  depth: dossier
+statement:
+  short: Let $C\geq 0$. Is there an infinite sequence of $n_i$ such
+    that\[\lim_{i\to \infty}\frac{p_{n_i+1}-p_{n_i}}{\log n_i}=C?\]
+  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

package/problems/6/AGENT_START.md

@@ -0,0 +1,17 @@
+# Agent Start
+
+Fast start:
+- `erdos problem show 6`
+- `erdos workspace show`
+- `erdos preflight`
+- `erdos continuation use route`
+- `erdos checkpoints sync`
+
+Working assumptions:
+- Open problem: yes
+- Active route: seed_route_pending
+- Repo status: cataloged
+- Harness depth: dossier
+
+First honest move:
+- tighten the local dossier for problem 6 against its pull bundle, references, and upstream provenance before widening claims.

package/problems/6/CHECKPOINT_NOTES.md

@@ -0,0 +1,11 @@
+# Checkpoint Notes
+
+- Problem: 6
+- Repo status: cataloged
+- Harness depth: dossier
+
+Checkpoint prompts:
+- What changed in the active route since the last honest checkpoint?
+- Which claim level is justified right now: Exact, Verified, Heuristic, or Conjecture?
+- Which upstream/public truth changed, if any?
+- Which artifact or literature bundle should the next agent read first?

package/problems/6/EVIDENCE.md

@@ -0,0 +1,10 @@
+# Evidence
+
+- This dossier was seeded for Erdos Problem #6 from a pull bundle.
+- Upstream record included: yes
+- Site snapshot included: yes
+- Repo status at seed time: cataloged
+- Harness depth at seed time: dossier
+
+Next maintainer step:
+- replace the seed placeholders with a curated statement, references, evidence notes, and formalization plan.

package/problems/6/FORMALIZATION.md

@@ -0,0 +1,8 @@
+# Formalization
+
+- Local status: planned
+- Upstream formalized state: yes
+- Upstream formalized last update: 2025-09-18
+
+Seed note:
+- this file was created automatically from a pull bundle and should be upgraded as local formal work begins.

package/problems/6/REFERENCES.md

@@ -0,0 +1,9 @@
+# References
+
+- Public problem page:
+  - <https://www.erdosproblems.com/6>
+- Upstream structured data:
+  - <https://github.com/teorth/erdosproblems>
+  - `data/problems.yaml`
+- Site summary snapshot was present in the pull bundle at seed time.
+- A literature lane bundle was available during seeding.

package/problems/6/ROUTES.md

@@ -0,0 +1,14 @@
+# Routes
+
+## Status Ladder
+
+- Open problem: yes
+- Active route: seed_route_pending
+- Route breakthrough: no
+- Problem solved: no
+
+## Starter route notes
+
+- Current seeded route placeholder for problem 6: `seed_route_pending`
+- Treat this as a workspace-level route marker until a curated route tree is written.
+- Keep route progress separate from global problem status.

package/problems/6/STATEMENT.md

@@ -0,0 +1,21 @@
+# Problem 6 Statement
+
+Source: <https://www.erdosproblems.com/6>
+
+Normalized focus:
+- Let $d_n=p_{n+1}-p_n$. Are there infinitely many $n$ such that $d_n<d_{n+1}<d_{n+2}$?
+- Seeded with filtered statement candidates from the public site snapshot
+
+Statement candidates:
+- Let $d_n=p_{n+1}-p_n$. Are there infinitely many $n$ such that $d_n<d_{n+1}<d_{n+2}$?
+- Conjectured by Erdős and Turán [ErTu48] . Shockingly Erdős offered \$25000 for a disproof of this, but as he comments, it 'is certainly true'. (In [Er85c] he goes further and offers 'all the money I can earn, beg, borrow or steal for [a disproof]'.)
+- Indeed, the answer is yes, as proved by Banks, Freiberg, and Turnage-Butterbaugh [BFT15] with an application of the Maynard-Tao machinery concerning bounded gaps between primes [Ma15] . They in fact prove that, for any $m\geq 1$, there are infinitely many $n$ such that\[d_n<d_{n+1}<\cdots <d_{n+m}\]and infinitely many $n$ such that\[d_n> d_{n+1}>\cdots >d_{n+m}.\]This is discussed in problem A11 of Guy's collection [Gu04] .
+- This page was last edited 28 September 2025. View history
+
+Public-site preview:
+- PROVED
+- This has been solved in the affirmative.
+- - $100
+- Let $d_n=p_{n+1}-p_n$. Are there infinitely many $n$ such that $d_n<d_{n+1}<d_{n+2}$?
+- #6 : [Er55c] [Er57] [Er61] [Er65b] [Er77c] [Er79] [Er79d] [ErGr80] [Er85c] [Er90]
+- number theory |

package/problems/6/problem.yaml

@@ -0,0 +1,43 @@
+problem_id: "6"
+display_name: "Erdos Problem #6"
+title: "Erdos Problem #6"
+source:
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/6
+  external_id: "6"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "6"
+provenance:
+  seeded_at: 2026-03-26T04:41:26.097Z
+  seeded_from:
+    kind: pull_bundle
+    upstream_record_included: true
+    site_snapshot_included: true
+status:
+  site_status: proved
+  site_badge: PROVED
+  repo_status: cataloged
+  upstream_status: proved
+  upstream_last_update: 2025-08-31
+cluster: number-theory
+prize:
+  display: $100
+related_problems: []
+family_tags:
+  - number-theory
+  - primes
+harness:
+  depth: dossier
+statement:
+  short: Let $d_n=p_{n+1}-p_n$. Are there infinitely many $n$ such that
+    $d_n<d_{n+1}<d_{n+2}$?
+  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-09-18

package/problems/7/AGENT_START.md

@@ -0,0 +1,17 @@
+# Agent Start
+
+Fast start:
+- `erdos problem show 7`
+- `erdos workspace show`
+- `erdos preflight`
+- `erdos continuation use route`
+- `erdos checkpoints sync`
+
+Working assumptions:
+- Open problem: yes
+- Active route: seed_route_pending
+- Repo status: cataloged
+- Harness depth: dossier
+
+First honest move:
+- tighten the local dossier for problem 7 against its pull bundle, references, and upstream provenance before widening claims.

package/problems/7/CHECKPOINT_NOTES.md

@@ -0,0 +1,11 @@
+# Checkpoint Notes
+
+- Problem: 7
+- Repo status: cataloged
+- Harness depth: dossier
+
+Checkpoint prompts:
+- What changed in the active route since the last honest checkpoint?
+- Which claim level is justified right now: Exact, Verified, Heuristic, or Conjecture?
+- Which upstream/public truth changed, if any?
+- Which artifact or literature bundle should the next agent read first?

package/problems/7/EVIDENCE.md

@@ -0,0 +1,10 @@
+# Evidence
+
+- This dossier was seeded for Erdos Problem #7 from a pull bundle.
+- Upstream record included: yes
+- Site snapshot included: yes
+- Repo status at seed time: cataloged
+- Harness depth at seed time: dossier
+
+Next maintainer step:
+- replace the seed placeholders with a curated statement, references, evidence notes, and formalization plan.

package/problems/7/FORMALIZATION.md

@@ -0,0 +1,8 @@
+# Formalization
+
+- Local status: planned
+- Upstream formalized state: no
+- Upstream formalized last update: 2025-08-31
+
+Seed note:
+- this file was created automatically from a pull bundle and should be upgraded as local formal work begins.

package/problems/7/REFERENCES.md

@@ -0,0 +1,9 @@
+# References
+
+- Public problem page:
+  - <https://www.erdosproblems.com/7>
+- Upstream structured data:
+  - <https://github.com/teorth/erdosproblems>
+  - `data/problems.yaml`
+- Site summary snapshot was present in the pull bundle at seed time.
+- A literature lane bundle was available during seeding.

package/problems/7/ROUTES.md

@@ -0,0 +1,14 @@
+# Routes
+
+## Status Ladder
+
+- Open problem: yes
+- Active route: seed_route_pending
+- Route breakthrough: no
+- Problem solved: no
+
+## Starter route notes
+
+- Current seeded route placeholder for problem 7: `seed_route_pending`
+- Treat this as a workspace-level route marker until a curated route tree is written.
+- Keep route progress separate from global problem status.

package/problems/7/STATEMENT.md

@@ -0,0 +1,21 @@
+# Problem 7 Statement
+
+Source: <https://www.erdosproblems.com/7>
+
+Normalized focus:
+- Open, but could be proved with a finite example.
+- Seeded with filtered statement candidates from the public site snapshot
+
+Statement candidates:
+- Open, but could be proved with a finite example.
+- Is there a distinct covering system all of whose moduli are odd?
+- Asked by Erdős and Selfridge (sometimes also with Schinzel). They also asked whether there can be a covering system such that all the moduli are odd and squarefree. The answer to this stronger question is no, proved by Balister, Bollobás, Morris, Sahasrabudhe, and Tiba [BBMST22] .
+- Hough and Nielsen [HoNi19] proved that at least one modulus must be divisible by either $2$ or $3$. A simpler proof of this fact was provided by Balister, Bollobás, Morris, Sahasrabudhe, and Tiba [BBMST22] , who also prove that if an odd covering system exists then the least common multiple of its moduli must be divisible by $9$ or $15$.
+
+Public-site preview:
+- Open, but could be proved with a finite example.
+- - $25
+- Is there a distinct covering system all of whose moduli are odd?
+- #7 : [Er57] [Er61] [Er65] [Er65b] [Er73] [ErGr80] [Er82e] [Er90] [Er95,p.166] [Er96b] [Er97] [Er97c] [Er97e]
+- number theory |
+- covering systems

package/problems/7/problem.yaml

@@ -0,0 +1,42 @@
+problem_id: "7"
+display_name: "Erdos Problem #7"
+title: "Erdos Problem #7"
+source:
+  site: erdosproblems.com
+  url: https://www.erdosproblems.com/7
+  external_id: "7"
+upstream:
+  repo: https://github.com/teorth/erdosproblems
+  data_file: data/problems.yaml
+  number: "7"
+provenance:
+  seeded_at: 2026-03-26T04:41:26.332Z
+  seeded_from:
+    kind: pull_bundle
+    upstream_record_included: true
+    site_snapshot_included: true
+status:
+  site_status: verifiable
+  site_badge: VERIFIABLE
+  repo_status: cataloged
+  upstream_status: verifiable
+  upstream_last_update: 2025-08-31
+cluster: number-theory
+prize:
+  display: no
+related_problems: []
+family_tags:
+  - number-theory
+  - covering-systems
+harness:
+  depth: dossier
+statement:
+  short: Open, but could be proved with a finite example.
+  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

package/src/commands/problem.js

@@ -127,6 +127,12 @@ function printArtifactInventory(problem, inventory, asJson) {
   for (const artifact of inventory.canonicalArtifacts) {
     console.log(`- ${artifact.label}: ${artifact.exists ? 'present' : 'missing'} (${artifact.path})`);
   }
+  if (inventory.starterArtifacts.length > 0) {
+    console.log('Starter loop artifacts:');
+    for (const artifact of inventory.starterArtifacts) {
+      console.log(`- ${artifact.label}: ${artifact.exists ? 'present' : 'missing'} (${artifact.path})`);
+    }
+  }
   if (inventory.packContext) {
     console.log(`- ${inventory.packContext.label}: ${inventory.packContext.exists ? 'present' : 'missing'} (${inventory.packContext.path})`);
   }

package/src/commands/pull.js

@@ -10,6 +10,36 @@ import { getProblemArtifactInventory, scaffoldProblem } from '../runtime/problem
 import { loadActiveUpstreamSnapshot, syncUpstream } from '../upstream/sync.js';
 import { fetchProblemSiteSnapshot } from '../upstream/site.js';
 
+function normalizeClusterLabel(rawTag) {
+  return String(rawTag ?? '')
+    .trim()
+    .toLowerCase()
+    .replace(/[^a-z0-9]+/g, '-')
+    .replace(/^-+|-+$/g, '');
+}
+
+function inferClusterFromUpstream(upstreamRecord) {
+  const normalized = Array.isArray(upstreamRecord?.tags)
+    ? upstreamRecord.tags.map(normalizeClusterLabel).filter(Boolean)
+    : [];
+  if (normalized.includes('number-theory')) {
+    return 'number-theory';
+  }
+  if (normalized.includes('graph-theory') || normalized.includes('chromatic-number')) {
+    return 'graph-theory';
+  }
+  if (normalized.includes('geometry')) {
+    return 'geometry';
+  }
+  if (normalized.includes('analysis')) {
+    return 'analysis';
+  }
+  if (normalized.includes('combinatorics') || normalized.includes('intersecting-family')) {
+    return 'combinatorics';
+  }
+  return null;
+}
+
 function parsePullArgs(args) {
   const [kind, value, ...rest] = args;
   if (!['problem', 'artifacts', 'literature'].includes(kind)) {
@@ -55,7 +85,7 @@ function buildProblemRecord(problemId, localProblem, upstreamRecord) {
     generatedAt: new Date().toISOString(),
     problemId: String(problemId),
     title: localProblem?.title ?? `Erdos Problem #${problemId}`,
-    cluster: localProblem?.cluster ?? null,
+    cluster: localProblem?.cluster ?? inferClusterFromUpstream(upstreamRecord),
     siteStatus: localProblem?.siteStatus ?? upstreamRecord?.status?.state ?? 'unknown',
     repoStatus: localProblem?.repoStatus ?? 'upstream-only',
     harnessDepth: localProblem?.harnessDepth ?? 'unseeded',

package/src/commands/sunflower.js

@@ -44,6 +44,16 @@ function printSunflowerStatus(snapshot, registryPaths) {
   console.log(`Literature focus: ${snapshot.literatureFocus.join(', ') || '(none)'}`);
   console.log(`Artifact focus: ${snapshot.artifactFocus.join(', ') || '(none)'}`);
   console.log(`Context file: ${snapshot.contextPath ?? '(none)'}`);
+  console.log(`Route packet present: ${snapshot.routePacketPresent ? 'yes' : 'no'}`);
+  if (snapshot.routePacket) {
+    console.log(`Route packet id: ${snapshot.routePacket.routePacketId ?? '(none)'}`);
+    console.log(`Route packet route: ${snapshot.routePacket.routeId ?? '(none)'}`);
+    console.log(`Route frontier claim: ${snapshot.routePacket.frontierClaim ?? '(none)'}`);
+    console.log(`Theorem module: ${snapshot.routePacket.theoremModule ?? '(none)'}`);
+  }
+  console.log(`Agent start packet: ${snapshot.agentStartPresent ? snapshot.agentStartPath : '(missing)'}`);
+  console.log(`Checkpoint packet: ${snapshot.checkpointPacketPresent ? snapshot.checkpointPacketPath : '(missing)'}`);
+  console.log(`Report packet: ${snapshot.reportPacketPresent ? snapshot.reportPacketPath : '(missing)'}`);
   console.log(`Compute lane present: ${snapshot.computeLanePresent ? 'yes' : 'no'}`);
   console.log(`Compute lane count: ${snapshot.computeLaneCount}`);
   console.log(`Compute summary: ${snapshot.computeSummary}`);