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_51cbe83cec3ecf98"}
- id
- vea_4f4155f52298bdfa
- frontier
- Erdős problems frontier
- source
- vs_77787ab057ca48bc
- finding
- vf_560e7b894c20c2ca
finding binding
boundopen_question
Erdős Problem #789 remains OPEN. Statement: Let $h(n)$ be maximal such that if $A\subseteq \mathbb{Z}$ with $\lvert A\rvert=n$ then there is $B\subseteq A$ with $\lvert B\rvert \geq h(n)$ such that if $a_1+\cdots+a_r=b_1+\cdots+b_s$ with $a_i,b_i\in B$ then $r=s$. Estimate $h(n)$. Topics: additive combinatorics. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_51cbe83cec3ecf98
vs_77787ab057ca48bc
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_51cbe83cec3ecf98"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_7524db546e5f8dfd
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_db1e6b605e8eb47ffinding.assertedCandidate claim vc_51cbe83cec3ecf98 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_c4d7ca319030db7afinding.addCandidate claim vc_51cbe83cec3ecf98 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.