{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BKHZHQMYSZXTWTLL74CW2LO2PL","short_pith_number":"pith:BKHZHQMY","canonical_record":{"source":{"id":"1902.02278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T17:15:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b1e20b35a27d559d8a9cbf70c05d942b245ee77caa58ee5e1375e975f04a886d","abstract_canon_sha256":"ae87948c6cdd937bed3a74fb3297d08a99fe69661a5ffa20e99bb0c9168c8393"},"schema_version":"1.0"},"canonical_sha256":"0a8f93c198966f3b4d6bff056d2dda7ac9475e33e47412d44e51967d709521df","source":{"kind":"arxiv","id":"1902.02278","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02278","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02278v2","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02278","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"BKHZHQMYSZXT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BKHZHQMYSZXTWTLL","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BKHZHQMY","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BKHZHQMYSZXTWTLL74CW2LO2PL","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T17:15:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b1e20b35a27d559d8a9cbf70c05d942b245ee77caa58ee5e1375e975f04a886d","abstract_canon_sha256":"ae87948c6cdd937bed3a74fb3297d08a99fe69661a5ffa20e99bb0c9168c8393"},"schema_version":"1.0"},"canonical_sha256":"0a8f93c198966f3b4d6bff056d2dda7ac9475e33e47412d44e51967d709521df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:08.729666Z","signature_b64":"+TyWyokKVZqAXOm8cX20bJM6ApXgUvSbmiqkFLxtQE79tgOk61ytE7sW3KAingFiLdokxol6BGx6AbxHZtqLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a8f93c198966f3b4d6bff056d2dda7ac9475e33e47412d44e51967d709521df","last_reissued_at":"2026-05-17T23:53:08.729006Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:08.729006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02278","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-17T23:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxV0uy603cbMijLefSpCicVY2vmbCnsf8C1idkIVpUhc4pvx9czo5n3x+hWLxqz+v7Su9s8RfCeGtGASfuQyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:21:20.205699Z"},"content_sha256":"e34f97e99bbdeb320958339097e6d6dd2e4acd591c6191e484854b5f964ed31a","schema_version":"1.0","event_id":"sha256:e34f97e99bbdeb320958339097e6d6dd2e4acd591c6191e484854b5f964ed31a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BKHZHQMYSZXTWTLL74CW2LO2PL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconfiguring 10-colourings of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carl Feghali","submitted_at":"2019-02-06T17:15:15Z","abstract_excerpt":"Let $k \\geq 1$ be an integer. The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph~$G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on exactly one vertex. A conjecture of Cereceda from 2007 asserts that for every integer $\\ell \\geq k + 2$ and $k$-degenerate graph $G$ on $n$ vertices, $R_{\\ell}(G)$ has diameter $O(n^2)$. The conjecture has been verified only when $\\ell \\geq 2k + 1$. We give a simple proof that if $G$ is a planar graph on $n$ vertices, then $R_{10}(G)$ has diameter at most $n^2$. Since planar graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02278","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-17T23:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSteN4LfgTTEwvUZe0fDX4mqX1sCmN1h8cxrKuT3rgtQoka0Yg7W+HpBdJYv5SsKeiuSBDUACnNenI7UgToHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:21:20.206408Z"},"content_sha256":"6d6166dd88f756b1e96eaa4ea89a3d11fa50040699ad17f943f5ddc8caf6606c","schema_version":"1.0","event_id":"sha256:6d6166dd88f756b1e96eaa4ea89a3d11fa50040699ad17f943f5ddc8caf6606c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKHZHQMYSZXTWTLL74CW2LO2PL/bundle.json","state_url":"https://pith.science/pith/BKHZHQMYSZXTWTLL74CW2LO2PL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKHZHQMYSZXTWTLL74CW2LO2PL/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-05-25T14:21:20Z","links":{"resolver":"https://pith.science/pith/BKHZHQMYSZXTWTLL74CW2LO2PL","bundle":"https://pith.science/pith/BKHZHQMYSZXTWTLL74CW2LO2PL/bundle.json","state":"https://pith.science/pith/BKHZHQMYSZXTWTLL74CW2LO2PL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKHZHQMYSZXTWTLL74CW2LO2PL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BKHZHQMYSZXTWTLL74CW2LO2PL","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":"ae87948c6cdd937bed3a74fb3297d08a99fe69661a5ffa20e99bb0c9168c8393","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T17:15:15Z","title_canon_sha256":"b1e20b35a27d559d8a9cbf70c05d942b245ee77caa58ee5e1375e975f04a886d"},"schema_version":"1.0","source":{"id":"1902.02278","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02278","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02278v2","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02278","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"BKHZHQMYSZXT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BKHZHQMYSZXTWTLL","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BKHZHQMY","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:6d6166dd88f756b1e96eaa4ea89a3d11fa50040699ad17f943f5ddc8caf6606c","target":"graph","created_at":"2026-05-17T23:53:08Z","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":"Let $k \\geq 1$ be an integer. The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph~$G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on exactly one vertex. A conjecture of Cereceda from 2007 asserts that for every integer $\\ell \\geq k + 2$ and $k$-degenerate graph $G$ on $n$ vertices, $R_{\\ell}(G)$ has diameter $O(n^2)$. The conjecture has been verified only when $\\ell \\geq 2k + 1$. We give a simple proof that if $G$ is a planar graph on $n$ vertices, then $R_{10}(G)$ has diameter at most $n^2$. Since planar graphs","authors_text":"Carl Feghali","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T17:15:15Z","title":"Reconfiguring 10-colourings of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02278","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:e34f97e99bbdeb320958339097e6d6dd2e4acd591c6191e484854b5f964ed31a","target":"record","created_at":"2026-05-17T23:53:08Z","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":"ae87948c6cdd937bed3a74fb3297d08a99fe69661a5ffa20e99bb0c9168c8393","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T17:15:15Z","title_canon_sha256":"b1e20b35a27d559d8a9cbf70c05d942b245ee77caa58ee5e1375e975f04a886d"},"schema_version":"1.0","source":{"id":"1902.02278","kind":"arxiv","version":2}},"canonical_sha256":"0a8f93c198966f3b4d6bff056d2dda7ac9475e33e47412d44e51967d709521df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a8f93c198966f3b4d6bff056d2dda7ac9475e33e47412d44e51967d709521df","first_computed_at":"2026-05-17T23:53:08.729006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:08.729006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+TyWyokKVZqAXOm8cX20bJM6ApXgUvSbmiqkFLxtQE79tgOk61ytE7sW3KAingFiLdokxol6BGx6AbxHZtqLDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:08.729666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02278","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e34f97e99bbdeb320958339097e6d6dd2e4acd591c6191e484854b5f964ed31a","sha256:6d6166dd88f756b1e96eaa4ea89a3d11fa50040699ad17f943f5ddc8caf6606c"],"state_sha256":"7e66900f19f99deb7571f55be30ae1e2e2f6deb2a0bef050bd5c0a589551ae82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLi3sQ5k+7jGgLAvbgZ2VdULf0wQoYFeEOS6WtF+Wm1yf3Ssf25GhN5IVUZ8odEfnHBPb68UodCrr6UDL8ldDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:21:20.210227Z","bundle_sha256":"5d3e142edaa953ac15b2ff2eaf702a6315e8fa5e4816e45abf0238ad0130be60"}}