{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HZBVZ3D6R26CV32VTS6GC7N2NE","short_pith_number":"pith:HZBVZ3D6","schema_version":"1.0","canonical_sha256":"3e435cec7e8ebc2aef559cbc617dba692ae61360b4639e752c3ee2ecf24ed5b2","source":{"kind":"arxiv","id":"1809.05959","version":1},"attestation_state":"computed","paper":{"title":"Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2018-09-16T21:19:35Z","abstract_excerpt":"We address item relocation problems in graphs in this paper. We assume items placed in vertices of an undirected graph with at most one item per vertex. Items can be moved across edges while various constraints depending on the type of relocation problem must be satisfied. We introduce a general problem formulation that encompasses known types of item relocation problems such as multi-agent path finding (MAPF) and token swapping (TSWAP). In this formulation we express two new types of relocation problems derived from token swapping that we call token rotation (TROT) and token permutation (TPER"},"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":"1809.05959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-16T21:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"e4cb9b1567cf1954d43ecd644300d36bfc8eea928ca669b23e0cf3fdfd85e204","abstract_canon_sha256":"e92f09182d835e256a1f12aa42f9b9a411696d42293919976e08b1940b4b3a4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:36.023791Z","signature_b64":"kVUZbtZszt0kuLsbdHni1jX9zIdwExW/6yjrI0QaFQ2WYRbtHzysFUnlMMjxgymlwzQFoKpqkyZEBAYJYRzIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e435cec7e8ebc2aef559cbc617dba692ae61360b4639e752c3ee2ecf24ed5b2","last_reissued_at":"2026-05-18T00:05:36.023353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:36.023353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2018-09-16T21:19:35Z","abstract_excerpt":"We address item relocation problems in graphs in this paper. We assume items placed in vertices of an undirected graph with at most one item per vertex. Items can be moved across edges while various constraints depending on the type of relocation problem must be satisfied. We introduce a general problem formulation that encompasses known types of item relocation problems such as multi-agent path finding (MAPF) and token swapping (TSWAP). In this formulation we express two new types of relocation problems derived from token swapping that we call token rotation (TROT) and token permutation (TPER"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05959","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":"1809.05959","created_at":"2026-05-18T00:05:36.023432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05959v1","created_at":"2026-05-18T00:05:36.023432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05959","created_at":"2026-05-18T00:05:36.023432+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZBVZ3D6R26C","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZBVZ3D6R26CV32V","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZBVZ3D6","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/HZBVZ3D6R26CV32VTS6GC7N2NE","json":"https://pith.science/pith/HZBVZ3D6R26CV32VTS6GC7N2NE.json","graph_json":"https://pith.science/api/pith-number/HZBVZ3D6R26CV32VTS6GC7N2NE/graph.json","events_json":"https://pith.science/api/pith-number/HZBVZ3D6R26CV32VTS6GC7N2NE/events.json","paper":"https://pith.science/paper/HZBVZ3D6"},"agent_actions":{"view_html":"https://pith.science/pith/HZBVZ3D6R26CV32VTS6GC7N2NE","download_json":"https://pith.science/pith/HZBVZ3D6R26CV32VTS6GC7N2NE.json","view_paper":"https://pith.science/paper/HZBVZ3D6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05959&json=true","fetch_graph":"https://pith.science/api/pith-number/HZBVZ3D6R26CV32VTS6GC7N2NE/graph.json","fetch_events":"https://pith.science/api/pith-number/HZBVZ3D6R26CV32VTS6GC7N2NE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZBVZ3D6R26CV32VTS6GC7N2NE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZBVZ3D6R26CV32VTS6GC7N2NE/action/storage_attestation","attest_author":"https://pith.science/pith/HZBVZ3D6R26CV32VTS6GC7N2NE/action/author_attestation","sign_citation":"https://pith.science/pith/HZBVZ3D6R26CV32VTS6GC7N2NE/action/citation_signature","submit_replication":"https://pith.science/pith/HZBVZ3D6R26CV32VTS6GC7N2NE/action/replication_record"}},"created_at":"2026-05-18T00:05:36.023432+00:00","updated_at":"2026-05-18T00:05:36.023432+00:00"}