{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GD34F2O6ESA6UAXGIZTFVYMQZ5","short_pith_number":"pith:GD34F2O6","canonical_record":{"source":{"id":"1806.09487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-25T14:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"d6868379791eb614f530b8e4b62e53405b60f9f52ff90473176168727e209d32","abstract_canon_sha256":"b4491647966c72b6a1fde78818686ee27636bc3642f4f668ffbe5e2efe18e356"},"schema_version":"1.0"},"canonical_sha256":"30f7c2e9de2481ea02e646665ae190cf707d984af20a286ded7538525f99adfc","source":{"kind":"arxiv","id":"1806.09487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09487","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09487v1","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09487","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"GD34F2O6ESA6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GD34F2O6ESA6UAXG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GD34F2O6","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GD34F2O6ESA6UAXGIZTFVYMQZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-25T14:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"d6868379791eb614f530b8e4b62e53405b60f9f52ff90473176168727e209d32","abstract_canon_sha256":"b4491647966c72b6a1fde78818686ee27636bc3642f4f668ffbe5e2efe18e356"},"schema_version":"1.0"},"canonical_sha256":"30f7c2e9de2481ea02e646665ae190cf707d984af20a286ded7538525f99adfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:27.127039Z","signature_b64":"SelZqzyqgDNkfXGog6IwPGgCPt2yMkqs7nqmhzOtA+TjK4OG/gqwVu3EZqwSDIGKSTqUE28Dr2gwEaj9mKUiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30f7c2e9de2481ea02e646665ae190cf707d984af20a286ded7538525f99adfc","last_reissued_at":"2026-05-18T00:12:27.126262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:27.126262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09487","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:12:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cIu5Qp2mFaKL1IVHDtMLMbxnIRNpvVJGK7YDQtFwh4o/sO3b9i6hGXbPAE3DfeLPRIiNs3hIYmNvL6pSFz/FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:50.746600Z"},"content_sha256":"5e20b0692fe9584f5afd84542aa4092d451a09535757b01fd96dbba5d0f7e5f3","schema_version":"1.0","event_id":"sha256:5e20b0692fe9584f5afd84542aa4092d451a09535757b01fd96dbba5d0f7e5f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GD34F2O6ESA6UAXGIZTFVYMQZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2018-06-25T14:28:09Z","abstract_excerpt":"We study practical approaches to solving the token swapping (TSWAP) problem optimally in this short paper. In TSWAP, we are given an undirected graph with colored vertices. A colored token is placed in each vertex. A pair of tokens can be swapped between adjacent vertices. The goal is to perform a sequence of swaps so that token and vertex colors agree across the graph. The minimum number of swaps is required in the optimization variant of the problem. We observed similarities between the TSWAP problem and multi-agent path finding (MAPF) where instead of tokens we have multiple agents that nee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09487","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:12:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0L9b/NDp6psPoIzI/FZiuLC/PjUejuiMk5q8ofQBtAiIRB7IjDc4GOxg/HyoFVqipSDeODj2xY//CSMhEmRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:50.747197Z"},"content_sha256":"bb31dd8a9b88dd44e161291974f390697142ea3e09adc21a1e8c928a664411fc","schema_version":"1.0","event_id":"sha256:bb31dd8a9b88dd44e161291974f390697142ea3e09adc21a1e8c928a664411fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GD34F2O6ESA6UAXGIZTFVYMQZ5/bundle.json","state_url":"https://pith.science/pith/GD34F2O6ESA6UAXGIZTFVYMQZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GD34F2O6ESA6UAXGIZTFVYMQZ5/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-27T19:43:50Z","links":{"resolver":"https://pith.science/pith/GD34F2O6ESA6UAXGIZTFVYMQZ5","bundle":"https://pith.science/pith/GD34F2O6ESA6UAXGIZTFVYMQZ5/bundle.json","state":"https://pith.science/pith/GD34F2O6ESA6UAXGIZTFVYMQZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GD34F2O6ESA6UAXGIZTFVYMQZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GD34F2O6ESA6UAXGIZTFVYMQZ5","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":"b4491647966c72b6a1fde78818686ee27636bc3642f4f668ffbe5e2efe18e356","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-25T14:28:09Z","title_canon_sha256":"d6868379791eb614f530b8e4b62e53405b60f9f52ff90473176168727e209d32"},"schema_version":"1.0","source":{"id":"1806.09487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09487","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09487v1","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09487","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"GD34F2O6ESA6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GD34F2O6ESA6UAXG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GD34F2O6","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:bb31dd8a9b88dd44e161291974f390697142ea3e09adc21a1e8c928a664411fc","target":"graph","created_at":"2026-05-18T00:12:27Z","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":"We study practical approaches to solving the token swapping (TSWAP) problem optimally in this short paper. In TSWAP, we are given an undirected graph with colored vertices. A colored token is placed in each vertex. A pair of tokens can be swapped between adjacent vertices. The goal is to perform a sequence of swaps so that token and vertex colors agree across the graph. The minimum number of swaps is required in the optimization variant of the problem. We observed similarities between the TSWAP problem and multi-agent path finding (MAPF) where instead of tokens we have multiple agents that nee","authors_text":"Pavel Surynek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-25T14:28:09Z","title":"Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09487","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:5e20b0692fe9584f5afd84542aa4092d451a09535757b01fd96dbba5d0f7e5f3","target":"record","created_at":"2026-05-18T00:12:27Z","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":"b4491647966c72b6a1fde78818686ee27636bc3642f4f668ffbe5e2efe18e356","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-25T14:28:09Z","title_canon_sha256":"d6868379791eb614f530b8e4b62e53405b60f9f52ff90473176168727e209d32"},"schema_version":"1.0","source":{"id":"1806.09487","kind":"arxiv","version":1}},"canonical_sha256":"30f7c2e9de2481ea02e646665ae190cf707d984af20a286ded7538525f99adfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30f7c2e9de2481ea02e646665ae190cf707d984af20a286ded7538525f99adfc","first_computed_at":"2026-05-18T00:12:27.126262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:27.126262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SelZqzyqgDNkfXGog6IwPGgCPt2yMkqs7nqmhzOtA+TjK4OG/gqwVu3EZqwSDIGKSTqUE28Dr2gwEaj9mKUiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:27.127039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e20b0692fe9584f5afd84542aa4092d451a09535757b01fd96dbba5d0f7e5f3","sha256:bb31dd8a9b88dd44e161291974f390697142ea3e09adc21a1e8c928a664411fc"],"state_sha256":"4b7f29b9191c4c3dd08fbfdf9fa7a6ff0fe365199e9c19f1cba43a4a7939e301"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ef2IHeClsMF5gJqG/KbJ5pOQRdjwMiwVnC16scHwTGKKSNe7BwrZ7dPMn/UhqThgnEzOuDMaMIOjwiLxdLPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:43:50.750240Z","bundle_sha256":"2ada784720727e4d7239c12ea7bfb60813d19c37e386fea5182aa4403e15460d"}}