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

e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null

Source record

back to sources

cap_61973ee16b553d57 · vc_ec033f29c9a2cb3d

id: vs_4784a00356b8531e
frontier: Erdős problems frontier
type: synthetic_report

source boundary

frontier-owned

synthetic

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

3 reviewable changes and 0 evaluations are attached through this source or its findings.

citation

external source

locator

title:cap_61973ee16b553d57 · vc_ec033f29c9a2cb3d

imported

2026-05-30T00:42:06.826507+00:00

extraction mode

artifact_to_state_import

authors

Erdős Open-Problem spine ingest

caveats

source requires human review before being treated as evidence

Bound findings

Erdős Problem #236 remains OPEN. Statement: Let $f(n)$ count the number of solutions to $n=p+2^k$ for prime $p$ and $k\geq 0$. Show that $f(n)=o(\log n)$. Topics: number theory, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A039669, A109925.
open_question · vf_c0263b896779ea89

Evidence atoms

vea_cb226cff698b7860computational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_ec033f29c9a2cb3d"}

Review, event, and evaluation records

events

vev_8a85c9becfbf4d9afinding.asserted
Candidate claim vc_ec033f29c9a2cb3d imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30

reviewable changes

vpr_821f85ae244dfa25finding.add
Candidate claim vc_ec033f29c9a2cb3d imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_8bfcdc4181d0b5c4finding.note
SEMANTIC-EDGE DRAFT -> Erdos #9 (vf_83126944775b9ae4) [related, confidence 0.85]: 236 counts representations n=p+2^k while 9 is precisely the set of odd n with zero such representations; 9 is the support of {n: f(n)=0} for 236's counting function. -- 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
vpr_f982124882b2a979finding.note
SEMANTIC-EDGE DRAFT -> Erdos #10 (vf_9f04f9669b5b7388) [related, confidence 0.75]: Both study representability of integers as a prime plus powers of 2; 10 generalizes the single power-of-2 in 236's n=p+2^k to a prime plus at most k powers of 2. -- 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.