{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JLIRM4EESS3TSX6GOA73VZCRCO","short_pith_number":"pith:JLIRM4EE","schema_version":"1.0","canonical_sha256":"4ad116708494b7395fc6703fbae45113b0c02a8c0726c4be59ea79d158539323","source":{"kind":"arxiv","id":"1610.00636","version":2},"attestation_state":"computed","paper":{"title":"Double-critical graph conjecture for claw-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Rolek, Zi-Xia Song","submitted_at":"2016-10-03T17:06:10Z","abstract_excerpt":"A connected graph $G$ with chromatic number $t$ is double-critical if $G \\backslash \\{x, y\\}$ is $(t - 2)$-colorable for each edge $xy \\in E(G)$. The complete graphs are the only known examples of double-critical graphs. A long-standing conjecture of Erd\\H os and Lov\\'asz from 1966, which is referred to as the Double-Critical Graph Conjecture, states that there are no other double-critical graphs. That is, if a graph $G$ with chromatic number $t$ is double-critical, then $G$ is the complete graph on $t$ vertices. This has been verified for $t \\le 5$, but remains open for $t \\ge 6$. In this pap"},"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":"1610.00636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-03T17:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"ac5822f7fa5a8af82455fb7258b2d642cde00074979b8f966dc482a854c157e7","abstract_canon_sha256":"9cf57b6479acbea05d76532d1b468a55f5add5dc0115603d748b49e0c4649928"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:33.974271Z","signature_b64":"4RKOEhHH94enPFhDrExN4oVVGSFbFzDomdq/X//TqUUaNGlf+pCn2ugGUIOzzq+Lt3iZJupFBzAquzgG/d0WCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ad116708494b7395fc6703fbae45113b0c02a8c0726c4be59ea79d158539323","last_reissued_at":"2026-05-18T00:52:33.973914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:33.973914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double-critical graph conjecture for claw-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Rolek, Zi-Xia Song","submitted_at":"2016-10-03T17:06:10Z","abstract_excerpt":"A connected graph $G$ with chromatic number $t$ is double-critical if $G \\backslash \\{x, y\\}$ is $(t - 2)$-colorable for each edge $xy \\in E(G)$. The complete graphs are the only known examples of double-critical graphs. A long-standing conjecture of Erd\\H os and Lov\\'asz from 1966, which is referred to as the Double-Critical Graph Conjecture, states that there are no other double-critical graphs. That is, if a graph $G$ with chromatic number $t$ is double-critical, then $G$ is the complete graph on $t$ vertices. This has been verified for $t \\le 5$, but remains open for $t \\ge 6$. In this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00636","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":"1610.00636","created_at":"2026-05-18T00:52:33.973970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00636v2","created_at":"2026-05-18T00:52:33.973970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00636","created_at":"2026-05-18T00:52:33.973970+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLIRM4EESS3T","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLIRM4EESS3TSX6G","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLIRM4EE","created_at":"2026-05-18T12:30:25.849896+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/JLIRM4EESS3TSX6GOA73VZCRCO","json":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO.json","graph_json":"https://pith.science/api/pith-number/JLIRM4EESS3TSX6GOA73VZCRCO/graph.json","events_json":"https://pith.science/api/pith-number/JLIRM4EESS3TSX6GOA73VZCRCO/events.json","paper":"https://pith.science/paper/JLIRM4EE"},"agent_actions":{"view_html":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO","download_json":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO.json","view_paper":"https://pith.science/paper/JLIRM4EE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00636&json=true","fetch_graph":"https://pith.science/api/pith-number/JLIRM4EESS3TSX6GOA73VZCRCO/graph.json","fetch_events":"https://pith.science/api/pith-number/JLIRM4EESS3TSX6GOA73VZCRCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/action/storage_attestation","attest_author":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/action/author_attestation","sign_citation":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/action/citation_signature","submit_replication":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/action/replication_record"}},"created_at":"2026-05-18T00:52:33.973970+00:00","updated_at":"2026-05-18T00:52:33.973970+00:00"}