frontiers / 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

used by 0 · replayed by 2 producers

e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null

Source record

back to sources

cap_61973ee16b553d57 · vc_63cbd8ba15d97ace

id: vs_59a7c036203eafa5
frontier: Erdős problems frontier
type: synthetic_report

source boundary

frontier-owned

synthetic

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

1 reviewable changes and 0 evaluations are attached through this source or its findings.

citation

external source

locator

title:cap_61973ee16b553d57 · vc_63cbd8ba15d97ace

imported

2026-05-30T00:42:06.826507+00:00

extraction mode

artifact_to_state_import

authors

Erdős Open-Problem spine ingest

caveats

source requires human review before being treated as evidence

Bound findings

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.
theoretical · vf_800736a11cac0a13

Evidence atoms

vea_1f0157e3f6cf3428computational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_63cbd8ba15d97ace"}

Review, event, and evaluation records

events

vev_2c15221dc0ab6843finding.asserted
Candidate claim vc_63cbd8ba15d97ace imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30

reviewable changes

vpr_32ec1dfe50020a45finding.add
Candidate claim vc_63cbd8ba15d97ace imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30

evaluations

No evaluation rows are attached.