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_1b99fe942b591ec0"}
- id
- vea_a14e75d813b80023
- frontier
- Erdős problems frontier
- source
- vs_f901299da9c2e7c5
- finding
- vf_30e78fa94c9ad0eb
finding binding
boundopen_question
Erdős Problem #107 has status 'falsifiable'. Statement: Let $f(n)$ be minimal such that any $f(n)$ points in $ℝ^2$, no three on a line, contain $n$ points which form the vertices of a convex $n$-gon. Prove that $f(n) = 2^{n-2} + 1$. Topics: geometry, convex. Erdős prize: $500. Statement is machine-verified in Lean (formal-conjectures). OEIS: A000051.
source binding
source-boundcap_61973ee16b553d57 · vc_1b99fe942b591ec0
vs_f901299da9c2e7c5
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_1b99fe942b591ec0"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_6654fa76ee41e8a4
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_63a9d5df5e973efffinding.assertedCandidate claim vc_1b99fe942b591ec0 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_dbcc9441899a6be2finding.addCandidate claim vc_1b99fe942b591ec0 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.