{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZZXCO2UZHHWLFTOJQDMSOT7ZK5","short_pith_number":"pith:ZZXCO2UZ","canonical_record":{"source":{"id":"1503.03430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-11T17:43:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1d6a50bc432da275faa2ee0bb7f85346985e753d86b01c62241d99e3bc41a59","abstract_canon_sha256":"f3a26c0e7c3834f8f3e070aec08dfe286f8fbfcb77e91577aafc26f1e20ef2ce"},"schema_version":"1.0"},"canonical_sha256":"ce6e276a9939ecb2cdc980d9274ff9575a8c7461ff372a83438b3cd362af6a8c","source":{"kind":"arxiv","id":"1503.03430","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03430","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03430v2","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03430","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZZXCO2UZHHWL","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZZXCO2UZHHWLFTOJ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZZXCO2UZ","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZZXCO2UZHHWLFTOJQDMSOT7ZK5","target":"record","payload":{"canonical_record":{"source":{"id":"1503.03430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-11T17:43:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1d6a50bc432da275faa2ee0bb7f85346985e753d86b01c62241d99e3bc41a59","abstract_canon_sha256":"f3a26c0e7c3834f8f3e070aec08dfe286f8fbfcb77e91577aafc26f1e20ef2ce"},"schema_version":"1.0"},"canonical_sha256":"ce6e276a9939ecb2cdc980d9274ff9575a8c7461ff372a83438b3cd362af6a8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:34.927599Z","signature_b64":"BH01HTuMY/n4U2pYjOKLI5TPCReZya4l27KYNe6avyqYntgNk9fG9cgyuNdYPFetY5V57RuAgsopAtq3vAUdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce6e276a9939ecb2cdc980d9274ff9575a8c7461ff372a83438b3cd362af6a8c","last_reissued_at":"2026-05-18T01:35:34.926823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:34.926823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.03430","source_version":2,"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-18T01:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYSewCv8Qhh4qc7+4Um/CpxSdBYe9C281FPJlHGOrkdgKJW/Gx+MDoEsF2OoZjvaoowsXjYMCvT7VtwxJ9SlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:14:58.471849Z"},"content_sha256":"50b1af3982fcfc4185f469418abda3b9950f3781a2305bfe55d673df5796a56d","schema_version":"1.0","event_id":"sha256:50b1af3982fcfc4185f469418abda3b9950f3781a2305bfe55d673df5796a56d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZZXCO2UZHHWLFTOJQDMSOT7ZK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kempe Equivalence of Colourings of Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Carl Feghali, Daniel Paulusma, Matthew Johnson","submitted_at":"2015-03-11T17:43:10Z","abstract_excerpt":"Given a graph $G=(V,E)$ and a proper vertex colouring of $G$, a Kempe chain is a subset of $V$ that induces a maximal connected subgraph of $G$ in which every vertex has one of two colours. To make a Kempe change is to obtain one colouring from another by exchanging the colours of vertices in a Kempe chain. Two colourings are Kempe equivalent if each can be obtained from the other by a series of Kempe changes. A conjecture of Mohar asserts that, for $k \\geq 3$, all $k$-colourings of $k$-regular graphs that are not complete are Kempe equivalent. We address the case $k=3$ by showing that all $3$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03430","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"},"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-18T01:35:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/QJnXigkbPE6VJ/Xsv5QcToZKAainrdpLtCXboyqOydrDE0veBSUktup1QNfHlP4iqS6fKSgO2j69fQNFXmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:14:58.472203Z"},"content_sha256":"b608cc3d05b31d5f5e259d48ff86fd333a37b2f6324ea0cf939b5830624521e1","schema_version":"1.0","event_id":"sha256:b608cc3d05b31d5f5e259d48ff86fd333a37b2f6324ea0cf939b5830624521e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZXCO2UZHHWLFTOJQDMSOT7ZK5/bundle.json","state_url":"https://pith.science/pith/ZZXCO2UZHHWLFTOJQDMSOT7ZK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZXCO2UZHHWLFTOJQDMSOT7ZK5/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-04T03:14:58Z","links":{"resolver":"https://pith.science/pith/ZZXCO2UZHHWLFTOJQDMSOT7ZK5","bundle":"https://pith.science/pith/ZZXCO2UZHHWLFTOJQDMSOT7ZK5/bundle.json","state":"https://pith.science/pith/ZZXCO2UZHHWLFTOJQDMSOT7ZK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZXCO2UZHHWLFTOJQDMSOT7ZK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZZXCO2UZHHWLFTOJQDMSOT7ZK5","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":"f3a26c0e7c3834f8f3e070aec08dfe286f8fbfcb77e91577aafc26f1e20ef2ce","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-11T17:43:10Z","title_canon_sha256":"d1d6a50bc432da275faa2ee0bb7f85346985e753d86b01c62241d99e3bc41a59"},"schema_version":"1.0","source":{"id":"1503.03430","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03430","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03430v2","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03430","created_at":"2026-05-18T01:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZZXCO2UZHHWL","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZZXCO2UZHHWLFTOJ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZZXCO2UZ","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:b608cc3d05b31d5f5e259d48ff86fd333a37b2f6324ea0cf939b5830624521e1","target":"graph","created_at":"2026-05-18T01:35:34Z","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":"Given a graph $G=(V,E)$ and a proper vertex colouring of $G$, a Kempe chain is a subset of $V$ that induces a maximal connected subgraph of $G$ in which every vertex has one of two colours. To make a Kempe change is to obtain one colouring from another by exchanging the colours of vertices in a Kempe chain. Two colourings are Kempe equivalent if each can be obtained from the other by a series of Kempe changes. A conjecture of Mohar asserts that, for $k \\geq 3$, all $k$-colourings of $k$-regular graphs that are not complete are Kempe equivalent. We address the case $k=3$ by showing that all $3$","authors_text":"Carl Feghali, Daniel Paulusma, Matthew Johnson","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-11T17:43:10Z","title":"Kempe Equivalence of Colourings of Cubic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03430","kind":"arxiv","version":2},"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:50b1af3982fcfc4185f469418abda3b9950f3781a2305bfe55d673df5796a56d","target":"record","created_at":"2026-05-18T01:35:34Z","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":"f3a26c0e7c3834f8f3e070aec08dfe286f8fbfcb77e91577aafc26f1e20ef2ce","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-11T17:43:10Z","title_canon_sha256":"d1d6a50bc432da275faa2ee0bb7f85346985e753d86b01c62241d99e3bc41a59"},"schema_version":"1.0","source":{"id":"1503.03430","kind":"arxiv","version":2}},"canonical_sha256":"ce6e276a9939ecb2cdc980d9274ff9575a8c7461ff372a83438b3cd362af6a8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce6e276a9939ecb2cdc980d9274ff9575a8c7461ff372a83438b3cd362af6a8c","first_computed_at":"2026-05-18T01:35:34.926823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:34.926823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BH01HTuMY/n4U2pYjOKLI5TPCReZya4l27KYNe6avyqYntgNk9fG9cgyuNdYPFetY5V57RuAgsopAtq3vAUdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:34.927599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03430","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50b1af3982fcfc4185f469418abda3b9950f3781a2305bfe55d673df5796a56d","sha256:b608cc3d05b31d5f5e259d48ff86fd333a37b2f6324ea0cf939b5830624521e1"],"state_sha256":"e33d3461f13a1f1434ab7f7eb828d5606fd813a3c3c68c1b6b542fb050111ce0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJIIU2f7+Yqz9xbPDoMjBI2PjGh54iBhG4/YE8A50OQA4DJfh7ySqwI+bWk04QdVW4BzQscsflvGf4BNAo6cBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:14:58.474699Z","bundle_sha256":"c4014d4f308f9fb3ea6987bc62dbfc3850ad83458ede4142da7d3b3ff352951e"}}