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_47e829dedc60986c"}
- id
- vea_d111178a45a6abc2
- frontier
- Erdős problems frontier
- source
- vs_ad5ebf656a25b154
- finding
- vf_935cc2b5848ffe43
finding binding
boundopen_question
Erdős Problem #826 remains OPEN. Statement: Are there infinitely many $n$ such that, for all $k\geq 1$ $$ \tau(n + k) \ll k? $$ Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_47e829dedc60986c
vs_ad5ebf656a25b154
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_47e829dedc60986c"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_ef75439900762f12
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_70e8d89f507daf2dfinding.assertedCandidate claim vc_47e829dedc60986c imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_8381e257676394edfinding.addCandidate claim vc_47e829dedc60986c imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.