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_63cbd8ba15d97ace"}
- id
- vea_1f0157e3f6cf3428
- frontier
- Erdős problems frontier
- source
- vs_59a7c036203eafa5
- finding
- vf_800736a11cac0a13
finding binding
boundtheoretical
Erdős Problem #888 is SOLVED. Statement: What is the size of the largest subset `A` of `{1,...,n}` such that if `a ≤ b ≤ c ≤ d ∈ A` and `abcd` square then `ad=bc` Topics: number theory, squares. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A387584.
source binding
source-boundcap_61973ee16b553d57 · vc_63cbd8ba15d97ace
vs_59a7c036203eafa5
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_63cbd8ba15d97ace"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_a507383511ba9dce
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_2c15221dc0ab6843finding.assertedCandidate claim vc_63cbd8ba15d97ace imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_32ec1dfe50020a45finding.addCandidate claim vc_63cbd8ba15d97ace imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.