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_235826513ac43c38"}
- id
- vea_516d0e8b87941705
- frontier
- Erdős problems frontier
- source
- vs_5a9b7052f3a3bd06
- finding
- vf_0f29bb6c261c14ec
finding binding
boundopen_question
Erdős Problem #1 remains OPEN. Statement: If $A\subseteq\{1, ..., N\}$ with $|A| = n$ is such that the subset sums $\sum_{a\in S}a$ are distinct for all $S\subseteq A$ then $$ N \gg 2 ^ n. $$ Topics: number theory, additive combinatorics. Erdős prize: $500. Statement is machine-verified in Lean (formal-conjectures). OEIS: A276661.
source binding
source-boundcap_61973ee16b553d57 · vc_235826513ac43c38
vs_5a9b7052f3a3bd06
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_235826513ac43c38"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_4ef37b36d4f55ddc
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_bd9f63cfd3188db9finding.assertedCandidate claim vc_235826513ac43c38 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_f0d901a4637f6ce0finding.addCandidate claim vc_235826513ac43c38 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.