{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AHQNNBLLGAMOZUBIUIWZVYSZUT","short_pith_number":"pith:AHQNNBLL","schema_version":"1.0","canonical_sha256":"01e0d6856b3018ecd028a22d9ae259a4d98765e3bdede75e4690c3f17108cb07","source":{"kind":"arxiv","id":"1007.5400","version":1},"attestation_state":"computed","paper":{"title":"Complete and almost complete minors in double-critical 8-chromatic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Sune Pedersen","submitted_at":"2010-07-30T10:01:51Z","abstract_excerpt":"A connected $k$-chromatic graph $G$ is said to be {\\it double-critical} if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. A longstanding conjecture of Erd\\H{o}s and Lov\\'asz states that the complete graphs are the only double-critical graphs. Kawarabayashi, Pedersen and Toft [\\it{Electron. J. Combin.}, 17(1): Research Paper 87, 2010] proved that every double-critical $k$-chromatic graph with $k \\leq 7$ contains a $K_k$ minor. It remains unknown whether an arbitrary double-critical $8$-chromatic graph contains a $K_8$ minor, but in this paper we prove that any double-cri"},"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":"1007.5400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-30T10:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"637c0376d46c812e5e6dbc9f3b22188e1f5b383958735e76182593a8a6d52e12","abstract_canon_sha256":"4c0f77d2d578ee7220ec60fd2f97baf609c60b0aa62f60cb846249e1c1b20002"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:45.294044Z","signature_b64":"flvQ5F0kl8hIPEqww/oTi18Ch+X09CYA2X0TFV3H2mUC6PsRDuC4JSsWKsLhowHtOrbK6TJv89nkIw1nG82VCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01e0d6856b3018ecd028a22d9ae259a4d98765e3bdede75e4690c3f17108cb07","last_reissued_at":"2026-05-18T04:42:45.293429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:45.293429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete and almost complete minors in double-critical 8-chromatic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Sune Pedersen","submitted_at":"2010-07-30T10:01:51Z","abstract_excerpt":"A connected $k$-chromatic graph $G$ is said to be {\\it double-critical} if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. A longstanding conjecture of Erd\\H{o}s and Lov\\'asz states that the complete graphs are the only double-critical graphs. Kawarabayashi, Pedersen and Toft [\\it{Electron. J. Combin.}, 17(1): Research Paper 87, 2010] proved that every double-critical $k$-chromatic graph with $k \\leq 7$ contains a $K_k$ minor. It remains unknown whether an arbitrary double-critical $8$-chromatic graph contains a $K_8$ minor, but in this paper we prove that any double-cri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5400","kind":"arxiv","version":1},"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":"1007.5400","created_at":"2026-05-18T04:42:45.293523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.5400v1","created_at":"2026-05-18T04:42:45.293523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5400","created_at":"2026-05-18T04:42:45.293523+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHQNNBLLGAMO","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHQNNBLLGAMOZUBI","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHQNNBLL","created_at":"2026-05-18T12:26:05.355336+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/AHQNNBLLGAMOZUBIUIWZVYSZUT","json":"https://pith.science/pith/AHQNNBLLGAMOZUBIUIWZVYSZUT.json","graph_json":"https://pith.science/api/pith-number/AHQNNBLLGAMOZUBIUIWZVYSZUT/graph.json","events_json":"https://pith.science/api/pith-number/AHQNNBLLGAMOZUBIUIWZVYSZUT/events.json","paper":"https://pith.science/paper/AHQNNBLL"},"agent_actions":{"view_html":"https://pith.science/pith/AHQNNBLLGAMOZUBIUIWZVYSZUT","download_json":"https://pith.science/pith/AHQNNBLLGAMOZUBIUIWZVYSZUT.json","view_paper":"https://pith.science/paper/AHQNNBLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.5400&json=true","fetch_graph":"https://pith.science/api/pith-number/AHQNNBLLGAMOZUBIUIWZVYSZUT/graph.json","fetch_events":"https://pith.science/api/pith-number/AHQNNBLLGAMOZUBIUIWZVYSZUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHQNNBLLGAMOZUBIUIWZVYSZUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHQNNBLLGAMOZUBIUIWZVYSZUT/action/storage_attestation","attest_author":"https://pith.science/pith/AHQNNBLLGAMOZUBIUIWZVYSZUT/action/author_attestation","sign_citation":"https://pith.science/pith/AHQNNBLLGAMOZUBIUIWZVYSZUT/action/citation_signature","submit_replication":"https://pith.science/pith/AHQNNBLLGAMOZUBIUIWZVYSZUT/action/replication_record"}},"created_at":"2026-05-18T04:42:45.293523+00:00","updated_at":"2026-05-18T04:42:45.293523+00:00"}