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_1bb7b38e3f40d8ad"}
- id
- vea_f056894a9dc0bb7a
- frontier
- Erdős problems frontier
- source
- vs_992ea207680397bd
- finding
- vf_5dfd5a994314c632
finding binding
boundopen_question
Erdős Problem #624 remains OPEN. Statement: Let $X$ be a finite set of size $n$ and $H(n)$ be such that there is a function $f:\{A : A\subseteq X\}\to X$ so that for every $Y\subseteq X$ with $\lvert Y\rvert \geq H(n)$ we have $\left\{ f(A) : A\subseteq Y\right\}=X$. Prove that $H(n)-\log_2 n \to \infty$. Topics: combinatorics. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_1bb7b38e3f40d8ad
vs_992ea207680397bd
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_1bb7b38e3f40d8ad"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_d8529f5ab45ffa3e
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_7426c3f4768a58b2finding.assertedCandidate claim vc_1bb7b38e3f40d8ad imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_0d5110957e6954cefinding.addCandidate claim vc_1bb7b38e3f40d8ad imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.