{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I75YD7MKJHRTC5PN2ZPSLX5EAC","short_pith_number":"pith:I75YD7MK","schema_version":"1.0","canonical_sha256":"47fb81fd8a49e33175edd65f25dfa4008ed0fe6c2b495b13f661a01772981dfa","source":{"kind":"arxiv","id":"1803.06816","version":1},"attestation_state":"computed","paper":{"title":"Swapping Colored Tokens on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Kirkpatrick, J. Mark Keil, Katsuhisa Yamanaka, Ryuhei Uehara, Takashi Horiyama, Toshiki Saitoh, Yota Otachi, Yushi Uno","submitted_at":"2018-03-19T06:53:35Z","abstract_excerpt":"We investigate the computational complexity of the following problem. We are given a graph in which each vertex has an initial and a target color. Each pair of adjacent vertices can swap their current colors. Our goal is to perform the minimum number of swaps so that the current and target colors agree at each vertex. When the colors are chosen from {1,2,...,c}, we call this problem c-Colored Token Swapping since the current color of a vertex can be seen as a colored token placed on the vertex. We show that c-Colored Token Swapping is NP-complete for c = 3 even if input graphs are restricted t"},"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":"1803.06816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T06:53:35Z","cross_cats_sorted":[],"title_canon_sha256":"d7b83e3c12ca95f520caed1af1c187cd33313f0f9d00a4f295cd357708c50539","abstract_canon_sha256":"0f83a769f3c79cba4a71a30b94278d1a1e45ab8af226265d6d8690e2b5295706"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:41.281104Z","signature_b64":"+Zxb6kk0+nQsk3got/lwToGN6ZTYJJ0uKQX2ZJtcCmKoc4tEnyk9BRkKf9Jvi0tvdy/jtFuIwv6WNJDLW6TlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47fb81fd8a49e33175edd65f25dfa4008ed0fe6c2b495b13f661a01772981dfa","last_reissued_at":"2026-05-18T00:20:41.280463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:41.280463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Swapping Colored Tokens on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Kirkpatrick, J. Mark Keil, Katsuhisa Yamanaka, Ryuhei Uehara, Takashi Horiyama, Toshiki Saitoh, Yota Otachi, Yushi Uno","submitted_at":"2018-03-19T06:53:35Z","abstract_excerpt":"We investigate the computational complexity of the following problem. We are given a graph in which each vertex has an initial and a target color. Each pair of adjacent vertices can swap their current colors. Our goal is to perform the minimum number of swaps so that the current and target colors agree at each vertex. When the colors are chosen from {1,2,...,c}, we call this problem c-Colored Token Swapping since the current color of a vertex can be seen as a colored token placed on the vertex. We show that c-Colored Token Swapping is NP-complete for c = 3 even if input graphs are restricted t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06816","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":"1803.06816","created_at":"2026-05-18T00:20:41.280588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06816v1","created_at":"2026-05-18T00:20:41.280588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06816","created_at":"2026-05-18T00:20:41.280588+00:00"},{"alias_kind":"pith_short_12","alias_value":"I75YD7MKJHRT","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"I75YD7MKJHRTC5PN","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"I75YD7MK","created_at":"2026-05-18T12:32:28.185984+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/I75YD7MKJHRTC5PN2ZPSLX5EAC","json":"https://pith.science/pith/I75YD7MKJHRTC5PN2ZPSLX5EAC.json","graph_json":"https://pith.science/api/pith-number/I75YD7MKJHRTC5PN2ZPSLX5EAC/graph.json","events_json":"https://pith.science/api/pith-number/I75YD7MKJHRTC5PN2ZPSLX5EAC/events.json","paper":"https://pith.science/paper/I75YD7MK"},"agent_actions":{"view_html":"https://pith.science/pith/I75YD7MKJHRTC5PN2ZPSLX5EAC","download_json":"https://pith.science/pith/I75YD7MKJHRTC5PN2ZPSLX5EAC.json","view_paper":"https://pith.science/paper/I75YD7MK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06816&json=true","fetch_graph":"https://pith.science/api/pith-number/I75YD7MKJHRTC5PN2ZPSLX5EAC/graph.json","fetch_events":"https://pith.science/api/pith-number/I75YD7MKJHRTC5PN2ZPSLX5EAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I75YD7MKJHRTC5PN2ZPSLX5EAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I75YD7MKJHRTC5PN2ZPSLX5EAC/action/storage_attestation","attest_author":"https://pith.science/pith/I75YD7MKJHRTC5PN2ZPSLX5EAC/action/author_attestation","sign_citation":"https://pith.science/pith/I75YD7MKJHRTC5PN2ZPSLX5EAC/action/citation_signature","submit_replication":"https://pith.science/pith/I75YD7MKJHRTC5PN2ZPSLX5EAC/action/replication_record"}},"created_at":"2026-05-18T00:20:41.280588+00:00","updated_at":"2026-05-18T00:20:41.280588+00:00"}