{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JDRRYYNGZ5SVVATBAR77WJXWMG","short_pith_number":"pith:JDRRYYNG","canonical_record":{"source":{"id":"2402.12705","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T04:09:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6588e0fa68713ce78422e3b6cd7e4b4e290f24f318c4bed5af94d197b559c767","abstract_canon_sha256":"8f1d2b587352c287688f2a136d950ea978ec19457c0c5fece7b480fa33d08942"},"schema_version":"1.0"},"canonical_sha256":"48e31c61a6cf655a8261047ffb26f6619f9479ad4e1f82265d79c8b024d80ce7","source":{"kind":"arxiv","id":"2402.12705","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.12705","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"2402.12705v5","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12705","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"JDRRYYNGZ5SV","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"pith_short_16","alias_value":"JDRRYYNGZ5SVVATB","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"pith_short_8","alias_value":"JDRRYYNG","created_at":"2026-05-20T00:02:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JDRRYYNGZ5SVVATBAR77WJXWMG","target":"record","payload":{"canonical_record":{"source":{"id":"2402.12705","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T04:09:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6588e0fa68713ce78422e3b6cd7e4b4e290f24f318c4bed5af94d197b559c767","abstract_canon_sha256":"8f1d2b587352c287688f2a136d950ea978ec19457c0c5fece7b480fa33d08942"},"schema_version":"1.0"},"canonical_sha256":"48e31c61a6cf655a8261047ffb26f6619f9479ad4e1f82265d79c8b024d80ce7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:02.515260Z","signature_b64":"Rx55AfoqW+UunFAuVtf2djvjutfRY+zKx2xLjthGQrmpdqyYKxXOf/FjdDSFMOQUvn+euTg2hOZqS/r4fTGyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48e31c61a6cf655a8261047ffb26f6619f9479ad4e1f82265d79c8b024d80ce7","last_reissued_at":"2026-05-20T00:02:02.514529Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:02.514529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.12705","source_version":5,"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-20T00:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JSLQ7D1ND8Xp5QNsQC3IIYYVO60KcmtowSd8E5saAank78TidFB2cq9tWvD6Rg/pq7dkbdAEKZ9SkqC/ByQIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:28:13.272912Z"},"content_sha256":"457bd4c53c33243fff5ee4baa34dbd8766318ebcc918ec38a3ab0450432d4190","schema_version":"1.0","event_id":"sha256:457bd4c53c33243fff5ee4baa34dbd8766318ebcc918ec38a3ab0450432d4190"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JDRRYYNGZ5SVVATBAR77WJXWMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance Recoloring","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Christian Engels, Duc A. Hoang, Niranka Banerjee","submitted_at":"2024-02-20T04:09:00Z","abstract_excerpt":"Reconfiguration problems ask whether one feasible solution can be transformed into another by a sequence of local moves while maintaining feasibility throughout. For integers $d \\geq 1$ and $k \\geq d+1$, the Distance Coloring problem asks if a given graph $G$ has a $(d, k)$-coloring, i.e., a coloring of the vertices of $G$ by $k$ colors such that any two vertices within distance $d$ from each other have different colors.\n  For ordinary proper colorings ($d=1$), the $k$-Coloring Reconfiguration problem is polynomial-time solvable for $k\\le 3$ [Cereceda, van den Heuvel, and Johnson, J. Graph The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12705","kind":"arxiv","version":5},"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/2402.12705/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-05-20T00:02:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2yjWWwzLVuWQxov8gvmW8K13yp7mqaV8PEi65tgapAehFhZOPKFhqei7PNysNkc8EGuuT4gbazwO08+XV9q+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:28:13.273651Z"},"content_sha256":"5a53c9d3c5d995494a6955f688aec25d9c1412239741f8ca598a19e944f386d3","schema_version":"1.0","event_id":"sha256:5a53c9d3c5d995494a6955f688aec25d9c1412239741f8ca598a19e944f386d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDRRYYNGZ5SVVATBAR77WJXWMG/bundle.json","state_url":"https://pith.science/pith/JDRRYYNGZ5SVVATBAR77WJXWMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDRRYYNGZ5SVVATBAR77WJXWMG/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-27T06:28:13Z","links":{"resolver":"https://pith.science/pith/JDRRYYNGZ5SVVATBAR77WJXWMG","bundle":"https://pith.science/pith/JDRRYYNGZ5SVVATBAR77WJXWMG/bundle.json","state":"https://pith.science/pith/JDRRYYNGZ5SVVATBAR77WJXWMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDRRYYNGZ5SVVATBAR77WJXWMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JDRRYYNGZ5SVVATBAR77WJXWMG","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":"8f1d2b587352c287688f2a136d950ea978ec19457c0c5fece7b480fa33d08942","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T04:09:00Z","title_canon_sha256":"6588e0fa68713ce78422e3b6cd7e4b4e290f24f318c4bed5af94d197b559c767"},"schema_version":"1.0","source":{"id":"2402.12705","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.12705","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"arxiv_version","alias_value":"2402.12705v5","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12705","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"pith_short_12","alias_value":"JDRRYYNGZ5SV","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"pith_short_16","alias_value":"JDRRYYNGZ5SVVATB","created_at":"2026-05-20T00:02:02Z"},{"alias_kind":"pith_short_8","alias_value":"JDRRYYNG","created_at":"2026-05-20T00:02:02Z"}],"graph_snapshots":[{"event_id":"sha256:5a53c9d3c5d995494a6955f688aec25d9c1412239741f8ca598a19e944f386d3","target":"graph","created_at":"2026-05-20T00:02:02Z","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/2402.12705/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reconfiguration problems ask whether one feasible solution can be transformed into another by a sequence of local moves while maintaining feasibility throughout. For integers $d \\geq 1$ and $k \\geq d+1$, the Distance Coloring problem asks if a given graph $G$ has a $(d, k)$-coloring, i.e., a coloring of the vertices of $G$ by $k$ colors such that any two vertices within distance $d$ from each other have different colors.\n  For ordinary proper colorings ($d=1$), the $k$-Coloring Reconfiguration problem is polynomial-time solvable for $k\\le 3$ [Cereceda, van den Heuvel, and Johnson, J. Graph The","authors_text":"Christian Engels, Duc A. Hoang, Niranka Banerjee","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T04:09:00Z","title":"Distance Recoloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12705","kind":"arxiv","version":5},"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:457bd4c53c33243fff5ee4baa34dbd8766318ebcc918ec38a3ab0450432d4190","target":"record","created_at":"2026-05-20T00:02:02Z","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":"8f1d2b587352c287688f2a136d950ea978ec19457c0c5fece7b480fa33d08942","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-20T04:09:00Z","title_canon_sha256":"6588e0fa68713ce78422e3b6cd7e4b4e290f24f318c4bed5af94d197b559c767"},"schema_version":"1.0","source":{"id":"2402.12705","kind":"arxiv","version":5}},"canonical_sha256":"48e31c61a6cf655a8261047ffb26f6619f9479ad4e1f82265d79c8b024d80ce7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48e31c61a6cf655a8261047ffb26f6619f9479ad4e1f82265d79c8b024d80ce7","first_computed_at":"2026-05-20T00:02:02.514529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:02.514529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rx55AfoqW+UunFAuVtf2djvjutfRY+zKx2xLjthGQrmpdqyYKxXOf/FjdDSFMOQUvn+euTg2hOZqS/r4fTGyDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:02.515260Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.12705","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:457bd4c53c33243fff5ee4baa34dbd8766318ebcc918ec38a3ab0450432d4190","sha256:5a53c9d3c5d995494a6955f688aec25d9c1412239741f8ca598a19e944f386d3"],"state_sha256":"a623106437cc8c4544afdea9e0a755af38eb22caa832ec7604ffa1b3400448f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3u7aS/SCDA7aiRzmn6spR2JM47Fuymql3Wf5TXXP6oUaevwdqxqlIwOZe6HUnwH3NkAKda8lOUMEInN6MlTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:28:13.277244Z","bundle_sha256":"85e372cdb76e6eec86bd3dde191cef43894be56fe9d959e0bea68c57ed9349b8"}}