{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WP4JJ26N3KSE3ZQTZQHDTYL7AH","short_pith_number":"pith:WP4JJ26N","schema_version":"1.0","canonical_sha256":"b3f894ebcddaa44de613cc0e39e17f01e505f23e8e32bcf4910a9dccb90bbff7","source":{"kind":"arxiv","id":"1306.6202","version":2},"attestation_state":"computed","paper":{"title":"A solution to the 2/3 conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Talbot, Rahil Baber","submitted_at":"2013-06-26T11:05:13Z","abstract_excerpt":"We prove a vertex domination conjecture of Erd\\H os, Faudree, Gould, Gy\\'arf\\'as, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours there exists a set of at most three vertices which have at least 2n/3 neighbours in one of the colours. Our proof makes extensive use of the ideas presented in \"A New Bound for the 2/3 Conjecture\" by Kr\\'al', Liu, Sereni, Whalen, and Yilma."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.6202","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-26T11:05:13Z","cross_cats_sorted":[],"title_canon_sha256":"8738b2bec0c1d82d8c3ebbc72f2e9df377a5332fe2c0291978bb3f7698341540","abstract_canon_sha256":"8d342203b8fc561413c4bdf2673388e7ee491f06cd32bfc3cb7770d3d3ce7741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:43.571780Z","signature_b64":"1k8lIfIFG4jF1M0v0y30uoRiDNpCiadJATqz1uVmwE9EUOEADBJfh289NeujN3i3mOjncFFZksYhh0uQBhSHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3f894ebcddaa44de613cc0e39e17f01e505f23e8e32bcf4910a9dccb90bbff7","last_reissued_at":"2026-05-18T02:57:43.571265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:43.571265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A solution to the 2/3 conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Talbot, Rahil Baber","submitted_at":"2013-06-26T11:05:13Z","abstract_excerpt":"We prove a vertex domination conjecture of Erd\\H os, Faudree, Gould, Gy\\'arf\\'as, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours there exists a set of at most three vertices which have at least 2n/3 neighbours in one of the colours. Our proof makes extensive use of the ideas presented in \"A New Bound for the 2/3 Conjecture\" by Kr\\'al', Liu, Sereni, Whalen, and Yilma."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6202","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.6202","created_at":"2026-05-18T02:57:43.571365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6202v2","created_at":"2026-05-18T02:57:43.571365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6202","created_at":"2026-05-18T02:57:43.571365+00:00"},{"alias_kind":"pith_short_12","alias_value":"WP4JJ26N3KSE","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WP4JJ26N3KSE3ZQT","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WP4JJ26N","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH","json":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH.json","graph_json":"https://pith.science/api/pith-number/WP4JJ26N3KSE3ZQTZQHDTYL7AH/graph.json","events_json":"https://pith.science/api/pith-number/WP4JJ26N3KSE3ZQTZQHDTYL7AH/events.json","paper":"https://pith.science/paper/WP4JJ26N"},"agent_actions":{"view_html":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH","download_json":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH.json","view_paper":"https://pith.science/paper/WP4JJ26N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6202&json=true","fetch_graph":"https://pith.science/api/pith-number/WP4JJ26N3KSE3ZQTZQHDTYL7AH/graph.json","fetch_events":"https://pith.science/api/pith-number/WP4JJ26N3KSE3ZQTZQHDTYL7AH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH/action/storage_attestation","attest_author":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH/action/author_attestation","sign_citation":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH/action/citation_signature","submit_replication":"https://pith.science/pith/WP4JJ26N3KSE3ZQTZQHDTYL7AH/action/replication_record"}},"created_at":"2026-05-18T02:57:43.571365+00:00","updated_at":"2026-05-18T02:57:43.571365+00:00"}