{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EPXM5BVAQFWKKLCVLX63JI652D","short_pith_number":"pith:EPXM5BVA","schema_version":"1.0","canonical_sha256":"23eece86a0816ca52c555dfdb4a3ddd0dc905d4daab7dc6a0c8b2b18a259e818","source":{"kind":"arxiv","id":"1802.06511","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.06511","created_at":"2026-05-18T00:23:03.038516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06511v1","created_at":"2026-05-18T00:23:03.038516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06511","created_at":"2026-05-18T00:23:03.038516+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPXM5BVAQFWK","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPXM5BVAQFWKKLCV","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPXM5BVA","created_at":"2026-05-18T12:32:22.470017+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/EPXM5BVAQFWKKLCVLX63JI652D","json":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D.json","graph_json":"https://pith.science/api/pith-number/EPXM5BVAQFWKKLCVLX63JI652D/graph.json","events_json":"https://pith.science/api/pith-number/EPXM5BVAQFWKKLCVLX63JI652D/events.json","paper":"https://pith.science/paper/EPXM5BVA"},"agent_actions":{"view_html":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D","download_json":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D.json","view_paper":"https://pith.science/paper/EPXM5BVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06511&json=true","fetch_graph":"https://pith.science/api/pith-number/EPXM5BVAQFWKKLCVLX63JI652D/graph.json","fetch_events":"https://pith.science/api/pith-number/EPXM5BVAQFWKKLCVLX63JI652D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/action/storage_attestation","attest_author":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/action/author_attestation","sign_citation":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/action/citation_signature","submit_replication":"https://pith.science/pith/EPXM5BVAQFWKKLCVLX63JI652D/action/replication_record"}},"created_at":"2026-05-18T00:23:03.038516+00:00","updated_at":"2026-05-18T00:23:03.038516+00:00"}