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
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_908aaf00fff9d921"}
- id
- vea_1bf3a2b8e0e7c1f9
- frontier
- Erdős problems frontier
- source
- vs_f01af5f273c4aa19
- finding
- vf_8f3ee6c74f9e955e
finding binding
boundopen_question
Erdős Problem #272 remains OPEN. Statement: Let $N\geq 1$. What is the largest $t$ such that there are $A_1,\ldots,A_t\subseteq \{1,\ldots,N\}$ with $A_i\cap A_j$ a non-empty arithmetic progression for all $i\neq j$? Topics: additive combinatorics, arithmetic progressions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_908aaf00fff9d921
vs_f01af5f273c4aa19
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_908aaf00fff9d921"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_12123f505b7db21d
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_d4c03cb14e445240finding.assertedCandidate claim vc_908aaf00fff9d921 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_17a0fd150359b759finding.addCandidate claim vc_908aaf00fff9d921 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.