{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5JT7DCDF7UG5S47LIHPE2HD5BD","short_pith_number":"pith:5JT7DCDF","schema_version":"1.0","canonical_sha256":"ea67f18865fd0dd973eb41de4d1c7d08ef8eb989ea65fefab75321439b789c75","source":{"kind":"arxiv","id":"1904.12698","version":4},"attestation_state":"computed","paper":{"title":"Reconfiguring colorings of graphs with bounded maximum average degree","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-04-29T13:23:58Z","abstract_excerpt":"The reconfiguration graph $R_k(G)$ for the $k$-colorings of a graph $G$ has as vertex set the set of all possible $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex of $G$. Let $d, k \\geq 1$ be integers such that $k \\geq d+1$. We prove that for every $\\epsilon > 0$ and every graph $G$ with $n$ vertices and maximum average degree $d - \\epsilon$, $R_k(G)$ has diameter $O(n(\\log n)^{d - 1})$. This significantly strengthens several existing results."},"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":"1904.12698","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-29T13:23:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d735422d9059a10521da7b263050868ff1fa5a7f3b64786af434f37efceaf2ea","abstract_canon_sha256":"40ec702fbf7c0a2972d64dd95aa5ed44ec5508703cff96ebf210cddfb5a0f1eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:45.692225Z","signature_b64":"BrdDAI0gUSN3BeZaxVktZI52dsGGCtOJWQNaBfsk0VQ7/s8Y9eVvbjJYX0MRI3Ym3qEQiuJUjsV7jgaYnTpoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea67f18865fd0dd973eb41de4d1c7d08ef8eb989ea65fefab75321439b789c75","last_reissued_at":"2026-07-05T01:53:45.691773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:45.691773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconfiguring colorings of graphs with bounded maximum average degree","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-04-29T13:23:58Z","abstract_excerpt":"The reconfiguration graph $R_k(G)$ for the $k$-colorings of a graph $G$ has as vertex set the set of all possible $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex of $G$. Let $d, k \\geq 1$ be integers such that $k \\geq d+1$. We prove that for every $\\epsilon > 0$ and every graph $G$ with $n$ vertices and maximum average degree $d - \\epsilon$, $R_k(G)$ has diameter $O(n(\\log n)^{d - 1})$. This significantly strengthens several existing results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12698","kind":"arxiv","version":4},"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/1904.12698/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":"1904.12698","created_at":"2026-07-05T01:53:45.691830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12698v4","created_at":"2026-07-05T01:53:45.691830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12698","created_at":"2026-07-05T01:53:45.691830+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JT7DCDF7UG5","created_at":"2026-07-05T01:53:45.691830+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JT7DCDF7UG5S47L","created_at":"2026-07-05T01:53:45.691830+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JT7DCDF","created_at":"2026-07-05T01:53:45.691830+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/5JT7DCDF7UG5S47LIHPE2HD5BD","json":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD.json","graph_json":"https://pith.science/api/pith-number/5JT7DCDF7UG5S47LIHPE2HD5BD/graph.json","events_json":"https://pith.science/api/pith-number/5JT7DCDF7UG5S47LIHPE2HD5BD/events.json","paper":"https://pith.science/paper/5JT7DCDF"},"agent_actions":{"view_html":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD","download_json":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD.json","view_paper":"https://pith.science/paper/5JT7DCDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12698&json=true","fetch_graph":"https://pith.science/api/pith-number/5JT7DCDF7UG5S47LIHPE2HD5BD/graph.json","fetch_events":"https://pith.science/api/pith-number/5JT7DCDF7UG5S47LIHPE2HD5BD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/action/storage_attestation","attest_author":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/action/author_attestation","sign_citation":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/action/citation_signature","submit_replication":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/action/replication_record"}},"created_at":"2026-07-05T01:53:45.691830+00:00","updated_at":"2026-07-05T01:53:45.691830+00:00"}