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_79327288296d7310"}
- id
- vea_c5b7835efce0d6ac
- frontier
- Erdős problems frontier
- source
- vs_bd9d9da20cf8f83c
- finding
- vf_bbc8727d595497b8
finding binding
boundopen_question
Erdős Problem #194 has status 'disproved (lean)'. Statement: Let $k\geq 3$. Must any ordering of $\mathbb{R}$ contain a monotone $k$-term arithmetic progression, that is, some $x_1 <\cdots < x_k$ which forms an increasing or decreasing $k$-term arithmetic progression? The answer is no, even for $k=3$, as shown by Ardal, Brown, and Jungić [ABJ11]. - Topics: arithmetic progressions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_79327288296d7310
vs_bd9d9da20cf8f83c
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_79327288296d7310"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_9fde5360fb82651f
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_b09042ecb5cf4e90finding.assertedCandidate claim vc_79327288296d7310 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_ac5930ce064e83ecfinding.addCandidate claim vc_79327288296d7310 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.