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_0fd032ca0aaea23c"}
- id
- vea_3000c402db3ee0d9
- frontier
- Erdős problems frontier
- source
- vs_98db70ceba3e28e0
- finding
- vf_05646653e3dfc403
finding binding
boundopen_question
Erdős Problem #539 remains OPEN. Statement: Let $h(n)$ be maximal such that, for any set $A\subseteq \mathbb{N}$ of size $n$, the set$$\left\{ \frac{a}{(a,b)}: a,b\in A\right\}$$has size at least $h(n)$. Estimate $h(n)$. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_0fd032ca0aaea23c
vs_98db70ceba3e28e0
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_0fd032ca0aaea23c"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_d74583a4674dd7c4
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_1ee6a04674cde44cfinding.assertedCandidate claim vc_0fd032ca0aaea23c imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_25730b6015b12a08finding.addCandidate claim vc_0fd032ca0aaea23c imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.