{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GCLRHIEFQ4TBYHCOMMLCP2AHD5","short_pith_number":"pith:GCLRHIEF","canonical_record":{"source":{"id":"1210.7349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-27T17:12:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9a90bd0bdf4c27038bcb9c8f11e6c203ae089b9d64a0448022d9ccb986b6783d","abstract_canon_sha256":"02c621c77e0702ff86293b9eb8fe1c7860eb77ca5ba8b21c8601d954e02eec23"},"schema_version":"1.0"},"canonical_sha256":"309713a08587261c1c4e631627e8071f40b04a35d7d8b132d01e512c1379d3a3","source":{"kind":"arxiv","id":"1210.7349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7349","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7349v1","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7349","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"GCLRHIEFQ4TB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GCLRHIEFQ4TBYHCO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GCLRHIEF","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GCLRHIEFQ4TBYHCOMMLCP2AHD5","target":"record","payload":{"canonical_record":{"source":{"id":"1210.7349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-27T17:12:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9a90bd0bdf4c27038bcb9c8f11e6c203ae089b9d64a0448022d9ccb986b6783d","abstract_canon_sha256":"02c621c77e0702ff86293b9eb8fe1c7860eb77ca5ba8b21c8601d954e02eec23"},"schema_version":"1.0"},"canonical_sha256":"309713a08587261c1c4e631627e8071f40b04a35d7d8b132d01e512c1379d3a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:10.382331Z","signature_b64":"tl8FJWGVrIkf9hrK6aj4TgLN54sPk1cy7GMLLZFyfNdrm03zQFAfnUY1iTZ2YFZ0hSJ77n4mB8wBSybBCapqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"309713a08587261c1c4e631627e8071f40b04a35d7d8b132d01e512c1379d3a3","last_reissued_at":"2026-05-18T03:42:10.381516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:10.381516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.7349","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NXN5PRrTCW3nlvao1/bPPL3oQg07nQivKEjx+NV+zsurrUPU/qb1JA8ZoDgZj76uOnDfYf3j4H++RElFw9neDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:22:52.900150Z"},"content_sha256":"d559d99a1686591de1a86e18058e0a416f9f3c15b0d9f28fd4dada7bcd1c3952","schema_version":"1.0","event_id":"sha256:d559d99a1686591de1a86e18058e0a416f9f3c15b0d9f28fd4dada7bcd1c3952"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GCLRHIEFQ4TBYHCOMMLCP2AHD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge-colouring seven-regular planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Katherine Edwards, Ken-ichi Kawarabayashi, Maria Chudnovsky, Paul Seymour","submitted_at":"2012-10-27T17:12:37Z","abstract_excerpt":"A conjecture due to the fourth author states that every $d$-regular planar multigraph can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d = 3$ this is the four-colour theorem, and the conjecture has been proved for all $d\\le 8$, by various authors. In particular, two of us proved it when $d=7$; and then three of us proved it when $d=8$. The methods used for the latter give a proof in the $d=7$ case that is simpler than the original, and we present it here."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7349","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeAfTVEyf8GuVSWf+nisookhzzpLRP7cdxB8whtHcug58N+2/68ykOnR7eSepghLsIyDLUM529lQ7DKKCo/oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:22:52.900526Z"},"content_sha256":"391a2525296251252c5833e7a38606b54e019d1f57fde922153ae43791422c8f","schema_version":"1.0","event_id":"sha256:391a2525296251252c5833e7a38606b54e019d1f57fde922153ae43791422c8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCLRHIEFQ4TBYHCOMMLCP2AHD5/bundle.json","state_url":"https://pith.science/pith/GCLRHIEFQ4TBYHCOMMLCP2AHD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCLRHIEFQ4TBYHCOMMLCP2AHD5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T03:22:52Z","links":{"resolver":"https://pith.science/pith/GCLRHIEFQ4TBYHCOMMLCP2AHD5","bundle":"https://pith.science/pith/GCLRHIEFQ4TBYHCOMMLCP2AHD5/bundle.json","state":"https://pith.science/pith/GCLRHIEFQ4TBYHCOMMLCP2AHD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCLRHIEFQ4TBYHCOMMLCP2AHD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GCLRHIEFQ4TBYHCOMMLCP2AHD5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"02c621c77e0702ff86293b9eb8fe1c7860eb77ca5ba8b21c8601d954e02eec23","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-27T17:12:37Z","title_canon_sha256":"9a90bd0bdf4c27038bcb9c8f11e6c203ae089b9d64a0448022d9ccb986b6783d"},"schema_version":"1.0","source":{"id":"1210.7349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7349","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7349v1","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7349","created_at":"2026-05-18T03:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"GCLRHIEFQ4TB","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GCLRHIEFQ4TBYHCO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GCLRHIEF","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:391a2525296251252c5833e7a38606b54e019d1f57fde922153ae43791422c8f","target":"graph","created_at":"2026-05-18T03:42:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A conjecture due to the fourth author states that every $d$-regular planar multigraph can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d = 3$ this is the four-colour theorem, and the conjecture has been proved for all $d\\le 8$, by various authors. In particular, two of us proved it when $d=7$; and then three of us proved it when $d=8$. The methods used for the latter give a proof in the $d=7$ case that is simpler than the original, and we present it here.","authors_text":"Katherine Edwards, Ken-ichi Kawarabayashi, Maria Chudnovsky, Paul Seymour","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-27T17:12:37Z","title":"Edge-colouring seven-regular planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7349","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d559d99a1686591de1a86e18058e0a416f9f3c15b0d9f28fd4dada7bcd1c3952","target":"record","created_at":"2026-05-18T03:42:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"02c621c77e0702ff86293b9eb8fe1c7860eb77ca5ba8b21c8601d954e02eec23","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-27T17:12:37Z","title_canon_sha256":"9a90bd0bdf4c27038bcb9c8f11e6c203ae089b9d64a0448022d9ccb986b6783d"},"schema_version":"1.0","source":{"id":"1210.7349","kind":"arxiv","version":1}},"canonical_sha256":"309713a08587261c1c4e631627e8071f40b04a35d7d8b132d01e512c1379d3a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"309713a08587261c1c4e631627e8071f40b04a35d7d8b132d01e512c1379d3a3","first_computed_at":"2026-05-18T03:42:10.381516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:10.381516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tl8FJWGVrIkf9hrK6aj4TgLN54sPk1cy7GMLLZFyfNdrm03zQFAfnUY1iTZ2YFZ0hSJ77n4mB8wBSybBCapqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:10.382331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d559d99a1686591de1a86e18058e0a416f9f3c15b0d9f28fd4dada7bcd1c3952","sha256:391a2525296251252c5833e7a38606b54e019d1f57fde922153ae43791422c8f"],"state_sha256":"99ae60f99073e4c0af402cc8668ab2e8ba851cb2edc04cad7c96067774f59ac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1U5cRzB5Tiolr3aaTP51GMfrP+XJVwOhY/KBhnpil5/iOE8z/n/giLaYmhBEd+5+jTOmp2n2R/0LFJhNnY6yCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:22:52.902674Z","bundle_sha256":"7a0b4c8f6b06c46e96a87240a9ac325e1bc3fc668c00fad76d9e9734fab54230"}}