{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EPXM5BVAQFWKKLCVLX63JI652D","short_pith_number":"pith:EPXM5BVA","canonical_record":{"source":{"id":"1802.06511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T03:37:32Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"56b460d25fab5f1c8d5e494dd5250940d2fc333a62e2605874431936415e38a8","abstract_canon_sha256":"fe5ca40d66bcfe3ad64442509d7b870b03ca274e0e257c62d3db868a9eb82f4c"},"schema_version":"1.0"},"canonical_sha256":"23eece86a0816ca52c555dfdb4a3ddd0dc905d4daab7dc6a0c8b2b18a259e818","source":{"kind":"arxiv","id":"1802.06511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06511","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06511v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06511","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"EPXM5BVAQFWK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EPXM5BVAQFWKKLCV","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EPXM5BVA","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EPXM5BVAQFWKKLCVLX63JI652D","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T03:37:32Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"56b460d25fab5f1c8d5e494dd5250940d2fc333a62e2605874431936415e38a8","abstract_canon_sha256":"fe5ca40d66bcfe3ad64442509d7b870b03ca274e0e257c62d3db868a9eb82f4c"},"schema_version":"1.0"},"canonical_sha256":"23eece86a0816ca52c555dfdb4a3ddd0dc905d4daab7dc6a0c8b2b18a259e818","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.039127Z","signature_b64":"8G0w4QGaEvzyXaHJRJXzCs3wNhcec+AwRSb/pkG00XfB606TJTpDcGvN4TqnR4kCedgVTINug7Y1xw93kt0SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23eece86a0816ca52c555dfdb4a3ddd0dc905d4daab7dc6a0c8b2b18a259e818","last_reissued_at":"2026-05-18T00:23:03.038379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.038379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06511","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-05-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2QYDqb5hsW5ytwO5vc0uw9UXJFO21mwFWekdY887E+J0jArvbAMdMgyIZ4P4EOz5t5+QLJrpNU4boMIFjFqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:49:39.831157Z"},"content_sha256":"60a4185421d59b35c0bc6366d8c1ccb974bdf1831b7553d67b32ac5172f028a2","schema_version":"1.0","event_id":"sha256:60a4185421d59b35c0bc6366d8c1ccb974bdf1831b7553d67b32ac5172f028a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EPXM5BVAQFWKKLCVLX63JI652D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconfiguration of Colorable Sets in Classes of Perfect Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Takehiro Ito, Yota Otachi","submitted_at":"2018-02-19T03:37:32Z","abstract_excerpt":"A set of vertices in a graph is c-colorable if the subgraph induced by the set has a proper c-coloring. In this paper, we study the problem of finding a step-by-step transformation (reconfiguration) between two c-colorable sets in the same graph. This problem generalizes the well-studied Independent Set Reconfiguration problem. As the first step toward a systematic understanding of the complexity of this general problem, we study the problem on classes of perfect graphs. We first focus on interval graphs and give a combinatorial characterization of the distance between two c-colorable sets. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06511","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":""},"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-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtpnmzVzBAOgm3wh6PW7g8GaiwJauIz57/xs7Cc5Z6HkXI3od1NIbzCUTBtdCUZ1572MOg8+AnBLmrkf46aMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:49:39.831708Z"},"content_sha256":"bf297c8c24953370b31313b1f37f87ecfa6a217b77837d534a4d3d0229b689d6","schema_version":"1.0","event_id":"sha256:bf297c8c24953370b31313b1f37f87ecfa6a217b77837d534a4d3d0229b689d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/bundle.json","state_url":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPXM5BVAQFWKKLCVLX63JI652D/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-06-07T07:49:39Z","links":{"resolver":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D","bundle":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/bundle.json","state":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPXM5BVAQFWKKLCVLX63JI652D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EPXM5BVAQFWKKLCVLX63JI652D","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":"fe5ca40d66bcfe3ad64442509d7b870b03ca274e0e257c62d3db868a9eb82f4c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T03:37:32Z","title_canon_sha256":"56b460d25fab5f1c8d5e494dd5250940d2fc333a62e2605874431936415e38a8"},"schema_version":"1.0","source":{"id":"1802.06511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06511","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06511v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06511","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"EPXM5BVAQFWK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EPXM5BVAQFWKKLCV","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EPXM5BVA","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:bf297c8c24953370b31313b1f37f87ecfa6a217b77837d534a4d3d0229b689d6","target":"graph","created_at":"2026-05-18T00:23:03Z","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"},"paper":{"abstract_excerpt":"A set of vertices in a graph is c-colorable if the subgraph induced by the set has a proper c-coloring. In this paper, we study the problem of finding a step-by-step transformation (reconfiguration) between two c-colorable sets in the same graph. This problem generalizes the well-studied Independent Set Reconfiguration problem. As the first step toward a systematic understanding of the complexity of this general problem, we study the problem on classes of perfect graphs. We first focus on interval graphs and give a combinatorial characterization of the distance between two c-colorable sets. Th","authors_text":"Takehiro Ito, Yota Otachi","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T03:37:32Z","title":"Reconfiguration of Colorable Sets in Classes of Perfect Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06511","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:60a4185421d59b35c0bc6366d8c1ccb974bdf1831b7553d67b32ac5172f028a2","target":"record","created_at":"2026-05-18T00:23:03Z","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":"fe5ca40d66bcfe3ad64442509d7b870b03ca274e0e257c62d3db868a9eb82f4c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T03:37:32Z","title_canon_sha256":"56b460d25fab5f1c8d5e494dd5250940d2fc333a62e2605874431936415e38a8"},"schema_version":"1.0","source":{"id":"1802.06511","kind":"arxiv","version":1}},"canonical_sha256":"23eece86a0816ca52c555dfdb4a3ddd0dc905d4daab7dc6a0c8b2b18a259e818","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23eece86a0816ca52c555dfdb4a3ddd0dc905d4daab7dc6a0c8b2b18a259e818","first_computed_at":"2026-05-18T00:23:03.038379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.038379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8G0w4QGaEvzyXaHJRJXzCs3wNhcec+AwRSb/pkG00XfB606TJTpDcGvN4TqnR4kCedgVTINug7Y1xw93kt0SCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.039127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60a4185421d59b35c0bc6366d8c1ccb974bdf1831b7553d67b32ac5172f028a2","sha256:bf297c8c24953370b31313b1f37f87ecfa6a217b77837d534a4d3d0229b689d6"],"state_sha256":"3b734adbdd55b374555025bce417acef612beef5cb661f20d355440d0cee0ccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lohO226GzAoLmeVZTk5Ds4DeRE5+WBopclCe6bnk5P9/lYJj+DlIJrHFCTZw2K3NXcRlb+puVN/vIranagWCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:49:39.834554Z","bundle_sha256":"9ce058908c588efaea564849af7ac9b8003ad09fc5580f30b9f9e0466245ddd3"}}