{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HUXN3KKHROF4L7PKLX4TGZP2YI","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":"0ea255d2358b41b74a29a64bae8b6abe95496b299e2a3df7017de8eef3fdfd69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-16T19:44:30Z","title_canon_sha256":"649099fa7ca5c9c330b9745f5902afa00ef2c03ba0a33388a690ef5fd806f0f9"},"schema_version":"1.0","source":{"id":"1602.05150","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05150","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05150v3","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05150","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"HUXN3KKHROF4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HUXN3KKHROF4L7PK","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HUXN3KKH","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:39ccfaf7a26ea068f8ea4f61881f688fd5620b103ab6dcee0af7bb2d0fc629df","target":"graph","created_at":"2026-05-18T00:39:23Z","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":"Given a graph $G=(V,E)$ with $V=\\{1,\\ldots,n\\}$, we place on every vertex a token $T_1,\\ldots,T_n$. A swap is an exchange of tokens on adjacent vertices. We consider the algorithmic question of finding a shortest sequence of swaps such that token $T_i$ is on vertex $i$. We are able to achieve essentially matching upper and lower bounds, for exact algorithms and approximation algorithms. For exact algorithms, we rule out any $2^{o(n)}$ algorithm under the ETH. This is matched with a simple $2^{O(n\\log n)}$ algorithm based on a breadth-first search in an auxiliary graph. We show one general $4$-","authors_text":"Antonis Thomas, G\\\"unter Rote, Lothar Narins, Takeaki Uno, Tillmann Miltzow, Yoshio Okamoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-16T19:44:30Z","title":"Approximation and Hardness for Token Swapping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05150","kind":"arxiv","version":3},"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:90454ffddeda4051d57b89090e3a4a96c4c22694c6dc3be52b8e4ced5ae570ac","target":"record","created_at":"2026-05-18T00:39:23Z","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":"0ea255d2358b41b74a29a64bae8b6abe95496b299e2a3df7017de8eef3fdfd69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-16T19:44:30Z","title_canon_sha256":"649099fa7ca5c9c330b9745f5902afa00ef2c03ba0a33388a690ef5fd806f0f9"},"schema_version":"1.0","source":{"id":"1602.05150","kind":"arxiv","version":3}},"canonical_sha256":"3d2edda9478b8bc5fdea5df93365fac23d766d3cd46ac3b0689415e6ffc15b96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d2edda9478b8bc5fdea5df93365fac23d766d3cd46ac3b0689415e6ffc15b96","first_computed_at":"2026-05-18T00:39:23.212784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:23.212784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s7jUPYNS6mKdsnJQ/N0AQgToGtOhHkIoNODmHsLaI8nOK5XUo/jZ2QC1N3hrEFX7bZPtthC6Aav6+p2vrZtJBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:23.213548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05150","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90454ffddeda4051d57b89090e3a4a96c4c22694c6dc3be52b8e4ced5ae570ac","sha256:39ccfaf7a26ea068f8ea4f61881f688fd5620b103ab6dcee0af7bb2d0fc629df"],"state_sha256":"d9e8bc573977067adf7d82a18fbf4cfbd536300b5c90895bf26c20d02841247c"}