{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5JT7DCDF7UG5S47LIHPE2HD5BD","short_pith_number":"pith:5JT7DCDF","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"},"canonical_sha256":"ea67f18865fd0dd973eb41de4d1c7d08ef8eb989ea65fefab75321439b789c75","source":{"kind":"arxiv","id":"1904.12698","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12698","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12698v4","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12698","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"5JT7DCDF7UG5","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"pith_short_16","alias_value":"5JT7DCDF7UG5S47L","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"pith_short_8","alias_value":"5JT7DCDF","created_at":"2026-07-05T01:53:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5JT7DCDF7UG5S47LIHPE2HD5BD","target":"record","payload":{"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"},"canonical_sha256":"ea67f18865fd0dd973eb41de4d1c7d08ef8eb989ea65fefab75321439b789c75","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"},"source_kind":"arxiv","source_id":"1904.12698","source_version":4,"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:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"529zVTfhZjTK0HEtRbExG4nQQCZvWt8PPnDVKa6LDV+Q2avqWUN0If6rL/q5/vednbLmEBtv/gTiq84vt0v8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:30:51.287051Z"},"content_sha256":"d3f5e36d8f95d98804519196c57cb35dc0e2f82a96cf4a6557e4a6bdcd33e036","schema_version":"1.0","event_id":"sha256:d3f5e36d8f95d98804519196c57cb35dc0e2f82a96cf4a6557e4a6bdcd33e036"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5JT7DCDF7UG5S47LIHPE2HD5BD","target":"graph","payload":{"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"},"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:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47nCM3XGbsp85/LsB8HOZ77AgiCsQd79Mu5SxLeqJzogqiDNsAWOK8YhRi/zRtT8agamIIoAQ3DzkZ/GM01FCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:30:51.287577Z"},"content_sha256":"b3e0426652d4578f788a0675b34c39670a4bcd9f99f901ca5e0386f7353425a8","schema_version":"1.0","event_id":"sha256:b3e0426652d4578f788a0675b34c39670a4bcd9f99f901ca5e0386f7353425a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/bundle.json","state_url":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/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-11T04:30:51Z","links":{"resolver":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD","bundle":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/bundle.json","state":"https://pith.science/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JT7DCDF7UG5S47LIHPE2HD5BD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5JT7DCDF7UG5S47LIHPE2HD5BD","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":"40ec702fbf7c0a2972d64dd95aa5ed44ec5508703cff96ebf210cddfb5a0f1eb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-29T13:23:58Z","title_canon_sha256":"d735422d9059a10521da7b263050868ff1fa5a7f3b64786af434f37efceaf2ea"},"schema_version":"1.0","source":{"id":"1904.12698","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12698","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12698v4","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12698","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"5JT7DCDF7UG5","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"pith_short_16","alias_value":"5JT7DCDF7UG5S47L","created_at":"2026-07-05T01:53:45Z"},{"alias_kind":"pith_short_8","alias_value":"5JT7DCDF","created_at":"2026-07-05T01:53:45Z"}],"graph_snapshots":[{"event_id":"sha256:b3e0426652d4578f788a0675b34c39670a4bcd9f99f901ca5e0386f7353425a8","target":"graph","created_at":"2026-07-05T01:53:45Z","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/1904.12698/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 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.","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-04-29T13:23:58Z","title":"Reconfiguring colorings of graphs with bounded maximum average degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12698","kind":"arxiv","version":4},"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:d3f5e36d8f95d98804519196c57cb35dc0e2f82a96cf4a6557e4a6bdcd33e036","target":"record","created_at":"2026-07-05T01:53:45Z","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":"40ec702fbf7c0a2972d64dd95aa5ed44ec5508703cff96ebf210cddfb5a0f1eb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-29T13:23:58Z","title_canon_sha256":"d735422d9059a10521da7b263050868ff1fa5a7f3b64786af434f37efceaf2ea"},"schema_version":"1.0","source":{"id":"1904.12698","kind":"arxiv","version":4}},"canonical_sha256":"ea67f18865fd0dd973eb41de4d1c7d08ef8eb989ea65fefab75321439b789c75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea67f18865fd0dd973eb41de4d1c7d08ef8eb989ea65fefab75321439b789c75","first_computed_at":"2026-07-05T01:53:45.691773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:53:45.691773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BrdDAI0gUSN3BeZaxVktZI52dsGGCtOJWQNaBfsk0VQ7/s8Y9eVvbjJYX0MRI3Ym3qEQiuJUjsV7jgaYnTpoAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:53:45.692225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12698","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3f5e36d8f95d98804519196c57cb35dc0e2f82a96cf4a6557e4a6bdcd33e036","sha256:b3e0426652d4578f788a0675b34c39670a4bcd9f99f901ca5e0386f7353425a8"],"state_sha256":"ff1198279cc43b1755d03650f41c76f39754491daee8c86907631332ee306bde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LvzcsF8+FiouAHuwW80PRdPop0lQJTpZDWtTx22ImEBIrDLGwCcQT3vusL5n3AUgfnKFAxQtUBdmomtK84xCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:30:51.294224Z","bundle_sha256":"8b770c96b70b02a398bf3499b8d5b6f47d9ba08d2764124e3baf87df419c4f42"}}