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_d101394c17a9395f"}
- id
- vea_b69abc207f13f28e
- frontier
- Erdős problems frontier
- source
- vs_feb643c1ab472228
- finding
- vf_78181fbe313966eb
finding binding
boundopen_question
Erdős Problem #1196 has status 'proved (lean)'. Statement: Is it true that, for any $x$, if $A\subset [x,\infty)$ is a primitive set of integers (so that no distinct elements of $A$ divide each other) then$$\sum_{a\in A}\frac{1}{a\log a}< 1+o(1),$$where the $o(1)$ term $\to 0$ as $x\to \infty$? - Topics: number theory, primitive sets. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_d101394c17a9395f
vs_feb643c1ab472228
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_d101394c17a9395f"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_1b5c5eda59a363c3
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_481b11e04f60ce23finding.assertedCandidate claim vc_d101394c17a9395f imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_aa7c6c53c6d5aa71finding.addCandidate claim vc_d101394c17a9395f imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.