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 #74 remains OPEN. Statement: Let $f(n)\to \infty$ possibly very slowly. Is there a graph of infinite chromatic number such that every finite subgraph on $n$ vertices can be made bipartite by deleting at most $f(n)$ edges? Topics: graph theory, chromatic number, cycles. Erdős prize: $500. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
- id
- vf_51d2512f236268a4
- frontier
- Erdős problems frontier
- version
- 1
- confidence
- 0.99
no incoming links yet
file
/frontier/erdos-problems/at/vev_9a5efe8213cf9bbcpermalink · after_hash f4248ea9e18be913…vf_51d2512f236268a4 · erdos-problems · snapshot sha256:adf5cd08914be106b09be94cb69e55449b5195f7c3e9894fc07c7fc288c446c0 · https://vela-site-next.fly.dev/frontier/erdos-problems/at/vev_9a5efe8213cf9bbcciteraw json · vf_51d2512f236268a4 (2.5 KB)
{
"assertion": {
"direction": null,
"entities": [],
"relation": null,
"text": "Erdős Problem #74 remains OPEN. Statement: Let $f(n)\\to \\infty$ possibly very slowly. Is there a graph of infinite chromatic number such that every finite subgraph on $n$ vertices can be made bipartite by deleting at most $f(n)$ edges? Topics: graph theory, chromatic number, cycles. Erdős prize: $500. 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_c63c144ac599c82e"
}
],
"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_51d2512f236268a4",
"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_c63c144ac599c82e",
"url": "https://www.erdosproblems.com/74",
"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_ff5762d9193ca43ehistory · 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
3 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_c63c144ac599c82e
authors
Erdős Open-Problem spine ingest
Source records
1Evidence atoms
1- vea_ae4686dda5655793computational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_c63c144ac599c82e"}
vs_a62ed02e580a43bf · span:0 · artifact_to_state_import
Typed links
0outgoing
No outgoing links.
incoming
No incoming links.
Review, event, and evaluation records
4events
vev_ff5762d9193ca43efinding.assertedCandidate claim vc_c63c144ac599c82e imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_0adc4aeaf1410235finding.addCandidate claim vc_c63c144ac599c82e imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_2977e64d55303a92finding.noteSEMANTIC-EDGE DRAFT -> Erdos #23 (vf_4178d989faad6623) [shares_technique, confidence 0.65]: Problem 74 defines the number of edge deletions needed to make a graph bipartite, which is precisely the quantity bounded in Problem 23's make-triangle-free-graph-bipartite result. -- 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_a659343c9027e156finding.noteSEMANTIC-EDGE DRAFT -> Erdos #75 (vf_912ea88190378ef3) [depends_on, confidence 0.6]: Problem 75 asks about subgraphs whose minimum number of edges to delete to make them bipartite is constrained, which is exactly the bipartite-edit quantity defined in Problem 74. -- 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 record targets this finding id.