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_e20c6dbd0adc9cf5

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

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

citation

external source

locator

title:cap_61973ee16b553d57 · vc_e20c6dbd0adc9cf5

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 #279 remains OPEN. Statement: Let $k\geq 3$. Is there a choice of congruence classes $a_p\pmod{p}$ for every prime $p$ such that all sufficiently large integers can be written as $a_p+tp$ for some prime $p$ and integer $t\geq k$? Topics: number theory, covering systems, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
open_question · vf_a8fab4b7d1d7cb28

Evidence atoms

vea_6f21e86f13e5b32acomputational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_e20c6dbd0adc9cf5"}

Review, event, and evaluation records

events

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

reviewable changes

vpr_799071a47fcdbcb4finding.note
SEMANTIC-EDGE DRAFT -> Erdos #7 (vf_6e126f3f5046840d) [shares_technique, confidence 0.6]: Both are covering-system questions over residues; constructing the a_p mod p covering of all large integers in 279 uses the same covering-congruence machinery as building covering systems in 7. -- 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
vpr_9f288762b2e83784finding.note
SEMANTIC-EDGE DRAFT -> Erdos #273 (vf_a7288a8b21ac6798) [shares_technique, confidence 0.55]: Both ask for covering systems with prime-indexed moduli (a_p mod p in 279, moduli p-1 in 273), built via the same residue-covering constructions. -- 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
vpr_b36cb00c034f931afinding.add
Candidate claim vc_e20c6dbd0adc9cf5 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30

evaluations

No evaluation rows are attached.