frontiers / 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

used by 0 · replayed by 2 producers

e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null

Evidence atom

back to sources

{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_0b6f6f791a2f7f7a"}

id: vea_6b2f35cd9b893a9a
frontier: Erdős problems frontier
source: vs_0415be137585fd1a
finding: vf_d72bce755ab746a2

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #366 has status 'verifiable'. Statement: Are there any $2$-full $n$ such that $n+1$ is $3$-full? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A060355.

source binding

source-bound

cap_61973ee16b553d57 · vc_0b6f6f791a2f7f7a

vs_0415be137585fd1a

review context

unverified

2 events

3 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_0b6f6f791a2f7f7a"}

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_9b344b34621f0af8

caveats

No caveats recorded.

Review, event, and evaluation records

events

vev_0055e02d43c85bbffinding.asserted
Candidate claim vc_0b6f6f791a2f7f7a imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
vev_b7c7d804b4d78879finding.noted
External corroboration of frontier difficulty: AlphaProof Nexus (DeepMind, arXiv 2605.22763, May 2026) attempted Erdős #366 (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_634d7cbf44b97f28finding.add
Candidate claim vc_0b6f6f791a2f7f7a imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_64e8591f24f2f4affinding.note
External corroboration of frontier difficulty: AlphaProof Nexus (DeepMind, arXiv 2605.22763, May 2026) attempted Erdős #366 (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
vpr_cb2ddace35c54789finding.note
SEMANTIC-EDGE DRAFT -> Erdos #364 (vf_15e987c69ec8a2d4) [related, confidence 0.8]: 366 (a 2-full n with 3-full n+1) is the adjacent-pair analogue of 364's nonexistence of three consecutive 2-full numbers, both reducing to gaps between powerful numbers. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
pending_review · agent:semantic-edge-extractor · 2026-06-10

evaluations

No evaluation rows are attached.

computational

open_question

cap_61973ee16b553d57 · vc_0b6f6f791a2f7f7a

2 events

Review, event, and evaluation records

Search Vela