{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QHUMRVORY4D6UVB444QBYIQF43","short_pith_number":"pith:QHUMRVOR","schema_version":"1.0","canonical_sha256":"81e8c8d5d1c707ea543ce7201c2205e6dfc3a342f43a1275175882664c27f34c","source":{"kind":"arxiv","id":"2006.09269","version":1},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.09269","created_at":"2026-07-05T01:10:47.754986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.09269v1","created_at":"2026-07-05T01:10:47.754986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09269","created_at":"2026-07-05T01:10:47.754986+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHUMRVORY4D6","created_at":"2026-07-05T01:10:47.754986+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHUMRVORY4D6UVB4","created_at":"2026-07-05T01:10:47.754986+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHUMRVOR","created_at":"2026-07-05T01:10:47.754986+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/QHUMRVORY4D6UVB444QBYIQF43","json":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43.json","graph_json":"https://pith.science/api/pith-number/QHUMRVORY4D6UVB444QBYIQF43/graph.json","events_json":"https://pith.science/api/pith-number/QHUMRVORY4D6UVB444QBYIQF43/events.json","paper":"https://pith.science/paper/QHUMRVOR"},"agent_actions":{"view_html":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43","download_json":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43.json","view_paper":"https://pith.science/paper/QHUMRVOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.09269&json=true","fetch_graph":"https://pith.science/api/pith-number/QHUMRVORY4D6UVB444QBYIQF43/graph.json","fetch_events":"https://pith.science/api/pith-number/QHUMRVORY4D6UVB444QBYIQF43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/action/storage_attestation","attest_author":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/action/author_attestation","sign_citation":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/action/citation_signature","submit_replication":"https://pith.science/pith/QHUMRVORY4D6UVB444QBYIQF43/action/replication_record"}},"created_at":"2026-07-05T01:10:47.754986+00:00","updated_at":"2026-07-05T01:10:47.754986+00:00"}