evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_be6e14708dedb6c5"}
- id
- vea_27f046dfb1ebee7c
- frontier
- Erdős problems frontier
- source
- vs_7f2d5e785737554a
- finding
- vf_84e6f2df0ac208e4
finding binding
boundopen_question
Erdős Problem #307 has status 'verifiable'. Statement: Are there two finite set of primes $P$ and $Q$ such that $$ 1 = \left( \sum_{p \in P} \frac{1}{p} \right) \left( \sum_{q \in Q} \frac{1}{q} \right) $$ ? Asked by Barbeau [Ba76]. [Ba76] Barbeau, E. J., _Computer challenge corner: Problem 477: A brute force program._ Topics: number theory, unit fractions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_be6e14708dedb6c5
vs_7f2d5e785737554a
review context
unverified2 events
2 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_be6e14708dedb6c5"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_52cc51e295a11a4b
caveats
No caveats recorded.
Review, event, and evaluation records
4events
vev_9ad3bdecad463e15finding.assertedCandidate claim vc_be6e14708dedb6c5 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
vev_d92064964a46683bfinding.notedExternal corroboration of frontier difficulty: AlphaProof Nexus (DeepMind, arXiv 2605.22763, May 2026) attempted Erdős #307 (listed in erdos_problems_attempted.txt of google-deepmind/alphaproof-nexus-results@0647711a7118) and did not solve it (9 of 242 attempted Erdős problems solved). Their Lean formalization of the statement lives in google-deepmind/formal-conjectures. Treat as evidence the open obligations here are genuine, not low-hanging.
reviewer:will-blair · 2026-06-10
reviewable changes
vpr_07fffd67f07aee75finding.addCandidate claim vc_be6e14708dedb6c5 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_6bbe68fc90489c50finding.noteExternal corroboration of frontier difficulty: AlphaProof Nexus (DeepMind, arXiv 2605.22763, May 2026) attempted Erdős #307 (listed in erdos_problems_attempted.txt of google-deepmind/alphaproof-nexus-results@0647711a7118) and did not solve it (9 of 242 attempted Erdős problems solved). Their Lean formalization of the statement lives in google-deepmind/formal-conjectures. Treat as evidence the open obligations here are genuine, not low-hanging.
applied · agent:nexus-ingest-2026-06-10 · 2026-06-10
evaluations
No evaluation rows are attached.