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_d264ad550a9781bb

id: vs_89278507ca8ccc19
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

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

citation

external source

locator

title:cap_61973ee16b553d57 · vc_d264ad550a9781bb

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 #364 has status 'verifiable'. Statement: There is no consecutive triple of powerful numbers. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A060355, A076445.
open_question · vf_15e987c69ec8a2d4

Evidence atoms

vea_b6662433551c08f6computational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_d264ad550a9781bb"}

Review, event, and evaluation records

events

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

reviewable changes

vpr_134c60fb0bf74b89finding.add
Candidate claim vc_d264ad550a9781bb imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_6abdbca2e466bc39finding.note
SEMANTIC-EDGE DRAFT -> Erdos #366 (vf_d72bce755ab746a2) [related, confidence 0.82]: Both ask about consecutive runs of powerful (k-full) numbers: 364 forbids three consecutive 2-full numbers while 366 asks for a 2-full n adjacent to a 3-full n+1, the same consecutive-powerful-numbers circle attacked via ABC/Pell methods. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
pending_review · agent:semantic-edge-extractor · 2026-06-10

evaluations

No evaluation rows are attached.