record state
frontier-ownedfrontiers / 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
Finding bundle
back to stateErdős Problem #489 remains OPEN. Statement: Let $A\subseteq \mathbb{N}$ be a set such that $\lvert A\cap [1,x]\rvert=o(x^{1/2})$. Let $B=\{ n\geq 1 : a\nmid n\textrm{ for all }a\in A\}$. If $B=\{b_1 < b_2 < \cdots\}$ then is it true that $$\lim_{x \to \infty} \frac{1}{x}\sum_{b_i < x}(b_{i+1}-b_i)^2$$ exists (and is finite)? For example, when $A=\{p^2: p\textrm{ prime}\}$ then $B$ is the set of squarefree numbers, and the existence of this limit was proved by Erdős. See also [208]. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
- id
- vf_2c6d3c9f87b43ccd
- frontier
- Erdős problems frontier
- version
- 1
- confidence
- 0.99
no incoming links yet
file
/frontier/erdos-problems/at/vev_cb7c269ae2ffb3b4permalink · after_hash 931561888c436376…vf_2c6d3c9f87b43ccd · erdos-problems · snapshot sha256:adf5cd08914be106b09be94cb69e55449b5195f7c3e9894fc07c7fc288c446c0 · https://vela-site-next.fly.dev/frontier/erdos-problems/at/vev_cb7c269ae2ffb3b4citeraw json · vf_2c6d3c9f87b43ccd (2.7 KB)
{
"assertion": {
"direction": null,
"entities": [],
"relation": null,
"text": "Erdős Problem #489 remains OPEN. Statement: Let $A\\subseteq \\mathbb{N}$ be a set such that $\\lvert A\\cap [1,x]\\rvert=o(x^{1/2})$. Let $B=\\{ n\\geq 1 : a\\nmid n\\textrm{ for all }a\\in A\\}$. If $B=\\{b_1 < b_2 < \\cdots\\}$ then is it true that $$\\lim_{x \\to \\infty} \\frac{1}{x}\\sum_{b_i < x}(b_{i+1}-b_i)^2$$ exists (and is finite)? For example, when $A=\\{p^2: p\\textrm{ prime}\\}$ then $B$ is the set of squarefree numbers, and the existence of this limit was proved by Erdős. See also [208]. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.",
"type": "open_question"
},
"conditions": {
"age_group": null,
"cell_type": null,
"clinical_trial": false,
"concentration_range": null,
"duration": null,
"human_data": false,
"in_vitro": false,
"in_vivo": false,
"species_unverified": [],
"species_verified": [],
"text": "Agent-imported candidate claim; scope requires review."
},
"confidence": {
"basis": "agent-imported candidate claim; reviewer acceptance required",
"extraction_confidence": 0.7,
"kind": "frontier_epistemic",
"method": "expert_judgment",
"score": 0.99
},
"created": "2026-05-30T00:42:06.826507+00:00",
"evidence": {
"effect_size": null,
"evidence_spans": [
{
"artifact_id": "va_9bc926d75e4e3881",
"artifact_packet_id": "cap_61973ee16b553d57",
"candidate_claim_id": "vc_894bfe319d3806af"
}
],
"method": "ScienceClaw-shaped artifact packet import",
"model_system": "agent artifact packet",
"p_value": null,
"replicated": false,
"replication_count": null,
"sample_size": null,
"species": null,
"type": "computational"
},
"flags": {
"contested": false,
"declining": false,
"gap": false,
"gravity_well": false,
"negative_space": false,
"retracted": false
},
"id": "vf_2c6d3c9f87b43ccd",
"links": [],
"previous_version": null,
"provenance": {
"authors": [
{
"name": "Erdős Open-Problem spine ingest",
"orcid": null
}
],
"citation_count": null,
"doi": null,
"extraction": {
"extracted_at": "2026-05-30T00:42:06.826507+00:00",
"extractor_version": "vela/0.691.0",
"method": "artifact_to_state_import",
"model": "agent:erdos-spine-ingest",
"model_version": null
},
"journal": null,
"openalex_id": null,
"pmc": null,
"pmid": null,
"publisher": "artifact packet",
"review": {
"corrections": [],
"reviewed": false,
"reviewed_at": null,
"reviewer": null
},
"source_type": "model_output",
"title": "cap_61973ee16b553d57 · vc_894bfe319d3806af",
"url": "https://www.erdosproblems.com/489",
"year": null
},
"updated": null,
"version": 1
}Unsealed — 0 attachment(s) on record, awaiting independent verification.
0 attachments · 0 distinct checker actors · 0 methods
blame · custody trail
vev_cb7c269ae2ffb3b4history · 1 event
finding statement
finding typeopen_question
No entity list is declared.
evidence
source-bound1 atoms
computational · ScienceClaw-shaped artifact packet import · agent artifact packet
proof impact
packet context1 events
2 reviewable changes and 0 evaluation records are attached to this finding id.
evidence
method
ScienceClaw-shaped artifact packet import
evidence type
computational
system
agent artifact packet
evidence spans
span recorded
conditions
- species_unverified
- species_verified
- text
- Agent-imported candidate claim; scope requires review.
provenance
source title
cap_61973ee16b553d57 · vc_894bfe319d3806af
authors
Erdős Open-Problem spine ingest
Source records
1Evidence atoms
1- vea_6e1fc013cd2ec4c1computational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_894bfe319d3806af"}
vs_9824de0f244944b1 · span:0 · artifact_to_state_import
Typed links
0outgoing
No outgoing links.
incoming
No incoming links.
Review, event, and evaluation records
3events
vev_cb7c269ae2ffb3b4finding.assertedCandidate claim vc_894bfe319d3806af imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_690ae23d1ab947ecfinding.noteSEMANTIC-EDGE DRAFT -> Erdos #488 (vf_29c8b747d0aa12af) [related, confidence 0.68]: 489's set of integers not divisible by any element of A is the exact complement of 488's set B of multiples of a finite set A, so both study the density behavior of the same multiples/non-multiples dichotomy. -- 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_f2051201b80545cffinding.addCandidate claim vc_894bfe319d3806af imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation record targets this finding id.