{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QHUMRVORY4D6UVB444QBYIQF43","short_pith_number":"pith:QHUMRVOR","canonical_record":{"source":{"id":"2006.09269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-16T15:53:49Z","cross_cats_sorted":[],"title_canon_sha256":"1c004d27948e83becb78cf02bb81c87541166e58261ebcf595fa5673769365c6","abstract_canon_sha256":"845d9e0e78f7cf7f519a39f2cbdc513c1286840cb276c45ef071e01fad72d282"},"schema_version":"1.0"},"canonical_sha256":"81e8c8d5d1c707ea543ce7201c2205e6dfc3a342f43a1275175882664c27f34c","source":{"kind":"arxiv","id":"2006.09269","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.09269","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"2006.09269v1","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09269","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"QHUMRVORY4D6","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"pith_short_16","alias_value":"QHUMRVORY4D6UVB4","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"pith_short_8","alias_value":"QHUMRVOR","created_at":"2026-07-05T01:10:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QHUMRVORY4D6UVB444QBYIQF43","target":"record","payload":{"canonical_record":{"source":{"id":"2006.09269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-16T15:53:49Z","cross_cats_sorted":[],"title_canon_sha256":"1c004d27948e83becb78cf02bb81c87541166e58261ebcf595fa5673769365c6","abstract_canon_sha256":"845d9e0e78f7cf7f519a39f2cbdc513c1286840cb276c45ef071e01fad72d282"},"schema_version":"1.0"},"canonical_sha256":"81e8c8d5d1c707ea543ce7201c2205e6dfc3a342f43a1275175882664c27f34c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:47.755305Z","signature_b64":"s6d8/6+Nm2X8B/v/aleswCO1NHjPR0Dk/a05j9xczvAsHfj3MH5chtgDKpxZ30vAA+YSEGruXF9z6B2HUVpdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81e8c8d5d1c707ea543ce7201c2205e6dfc3a342f43a1275175882664c27f34c","last_reissued_at":"2026-07-05T01:10:47.754922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:47.754922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.09269","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-07-05T01:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VjplLxRer6nHAqAQswTNvrcS/jWgLwLKKDYrQu+I0ZCt0oQaS9IrlNckXOu6okGzZw83iS2ac0ap+VG1zFjABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:46:51.580313Z"},"content_sha256":"51f28590442656b0202b7ad861dd9cbd2067c28ca0dc3d947ac6f46a3257d83f","schema_version":"1.0","event_id":"sha256:51f28590442656b0202b7ad861dd9cbd2067c28ca0dc3d947ac6f46a3257d83f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QHUMRVORY4D6UVB444QBYIQF43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Thomassen-type method for planar graph recoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2020-06-16T15:53:49Z","abstract_excerpt":"The reconfiguration graph $R_k(G)$ for the $k$-colorings of a graph $G$ has as vertices all possible $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex. We use a list coloring technique inspired by results of Thomassen to prove that for a planar graph $G$ with $n$ vertices, $R_{10}(G)$ has diameter at most $8n$, and if $G$ is triangle-free, then $R_7(G)$ has diameter at most $7n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09269","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.09269/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cBOqnxL66UkmuXW9WZ/Z5FbsGHBTEeeAAZSjPBo8iCheK0f4x2QEzuOXD+ENogWrFqSs+yk5rHe0UD78pC/TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:46:51.581180Z"},"content_sha256":"ce1e6fb2d8c22e1caf3e60368f00933725863c91e81d0e26145242610cbb0411","schema_version":"1.0","event_id":"sha256:ce1e6fb2d8c22e1caf3e60368f00933725863c91e81d0e26145242610cbb0411"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/bundle.json","state_url":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHUMRVORY4D6UVB444QBYIQF43/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-08-10T22:46:51Z","links":{"resolver":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43","bundle":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/bundle.json","state":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHUMRVORY4D6UVB444QBYIQF43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QHUMRVORY4D6UVB444QBYIQF43","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":"845d9e0e78f7cf7f519a39f2cbdc513c1286840cb276c45ef071e01fad72d282","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-16T15:53:49Z","title_canon_sha256":"1c004d27948e83becb78cf02bb81c87541166e58261ebcf595fa5673769365c6"},"schema_version":"1.0","source":{"id":"2006.09269","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.09269","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"2006.09269v1","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09269","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"QHUMRVORY4D6","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"pith_short_16","alias_value":"QHUMRVORY4D6UVB4","created_at":"2026-07-05T01:10:47Z"},{"alias_kind":"pith_short_8","alias_value":"QHUMRVOR","created_at":"2026-07-05T01:10:47Z"}],"graph_snapshots":[{"event_id":"sha256:ce1e6fb2d8c22e1caf3e60368f00933725863c91e81d0e26145242610cbb0411","target":"graph","created_at":"2026-07-05T01:10:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.09269/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The reconfiguration graph $R_k(G)$ for the $k$-colorings of a graph $G$ has as vertices all possible $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex. We use a list coloring technique inspired by results of Thomassen to prove that for a planar graph $G$ with $n$ vertices, $R_{10}(G)$ has diameter at most $8n$, and if $G$ is triangle-free, then $R_7(G)$ has diameter at most $7n$.","authors_text":"Carl Feghali, Zden\\v{e}k Dvo\\v{r}\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-16T15:53:49Z","title":"A Thomassen-type method for planar graph recoloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09269","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:51f28590442656b0202b7ad861dd9cbd2067c28ca0dc3d947ac6f46a3257d83f","target":"record","created_at":"2026-07-05T01:10:47Z","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":"845d9e0e78f7cf7f519a39f2cbdc513c1286840cb276c45ef071e01fad72d282","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-16T15:53:49Z","title_canon_sha256":"1c004d27948e83becb78cf02bb81c87541166e58261ebcf595fa5673769365c6"},"schema_version":"1.0","source":{"id":"2006.09269","kind":"arxiv","version":1}},"canonical_sha256":"81e8c8d5d1c707ea543ce7201c2205e6dfc3a342f43a1275175882664c27f34c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81e8c8d5d1c707ea543ce7201c2205e6dfc3a342f43a1275175882664c27f34c","first_computed_at":"2026-07-05T01:10:47.754922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:47.754922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s6d8/6+Nm2X8B/v/aleswCO1NHjPR0Dk/a05j9xczvAsHfj3MH5chtgDKpxZ30vAA+YSEGruXF9z6B2HUVpdDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:47.755305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.09269","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51f28590442656b0202b7ad861dd9cbd2067c28ca0dc3d947ac6f46a3257d83f","sha256:ce1e6fb2d8c22e1caf3e60368f00933725863c91e81d0e26145242610cbb0411"],"state_sha256":"145689d451ddf0a89737e702f6a137d5a2ecfd7888d4c93b989b9408dc0b9d99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"me8vZAfKrNYtCIurVn8A3okv1zl7XVHlnE7QA3IEQqMXyU06Y2UVM1dR6RbKv9QkBx2ITdN8WLig5vP8IjkGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T22:46:51.585192Z","bundle_sha256":"324c402a8f7aba37b7685ec0990b79e55cfeeb93eba48749edc0f81d890eaa29"}}