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_4224b89b470af895"}
- id
- vea_0db3cd0ac376a035
- frontier
- Erdős problems frontier
- source
- vs_d3413376be4e39c3
- finding
- vf_deaf2ac437f1ff60
finding binding
boundopen_question
Erdős Problem #52 remains OPEN. Statement: Let $A$ be a finite set of integers. Is it true that for every $\epsilon>0$ $\max( \lvert A+A\rvert,\lvert AA\rvert)\gg_\epsilon \lvert A\rvert^{2-\epsilon}?$ Topics: number theory, additive combinatorics. Erdős prize: $250. Statement is machine-verified in Lean (formal-conjectures). OEIS: A263996.
source binding
source-boundcap_61973ee16b553d57 · vc_4224b89b470af895
vs_d3413376be4e39c3
review context
unverified1 events
1 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_4224b89b470af895"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_2983f38bcd2b6ae3
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_a1a6eb0580138e54finding.assertedCandidate claim vc_4224b89b470af895 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_c5144978fdd01114finding.addCandidate claim vc_4224b89b470af895 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.