{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FOMOJ3TZF7XUXPLNCRZP62UJPS","short_pith_number":"pith:FOMOJ3TZ","schema_version":"1.0","canonical_sha256":"2b98e4ee792fef4bbd6d1472ff6a897c844e409582db5877705db19249326e0a","source":{"kind":"arxiv","id":"1903.09820","version":1},"attestation_state":"computed","paper":{"title":"Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2019-03-23T13:27:32Z","abstract_excerpt":"This paper addresses a variant of multi-agent path finding (MAPF) in continuous space and time. We present a new solving approach based on satisfiability modulo theories (SMT) to obtain makespan optimal solutions. The standard MAPF is a task of navigating agents in an undirected graph from given starting vertices to given goal vertices so that agents do not collide with each other in vertices of the graph. In the continuous version (MAPF$^\\mathcal{R}$) agents move in an $n$-dimensional Euclidean space along straight lines that interconnect predefined positions. For simplicity, we work with cir"},"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":"1903.09820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-23T13:27:32Z","cross_cats_sorted":[],"title_canon_sha256":"a85531ad9ecbdb737f01b49432662573dda4c8795ce860219ce04c53dc8af26c","abstract_canon_sha256":"4b6b9d249ef8e683d5c1e139a8d1d66c4bcde149873b2328a275f81dc7e508db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:35.395515Z","signature_b64":"9G+KfAVaWwC6ScAgEc/qOyZEM5PFmlGPjgSbHxrTH3Fo5ygn/5VUJTj/ONHVq/bzAQmXpO3fFG3MtM7vOJXQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b98e4ee792fef4bbd6d1472ff6a897c844e409582db5877705db19249326e0a","last_reissued_at":"2026-05-17T23:50:35.394886Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:35.394886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Pavel Surynek","submitted_at":"2019-03-23T13:27:32Z","abstract_excerpt":"This paper addresses a variant of multi-agent path finding (MAPF) in continuous space and time. We present a new solving approach based on satisfiability modulo theories (SMT) to obtain makespan optimal solutions. The standard MAPF is a task of navigating agents in an undirected graph from given starting vertices to given goal vertices so that agents do not collide with each other in vertices of the graph. In the continuous version (MAPF$^\\mathcal{R}$) agents move in an $n$-dimensional Euclidean space along straight lines that interconnect predefined positions. For simplicity, we work with cir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09820","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":"1903.09820","created_at":"2026-05-17T23:50:35.394977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09820v1","created_at":"2026-05-17T23:50:35.394977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09820","created_at":"2026-05-17T23:50:35.394977+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOMOJ3TZF7XU","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOMOJ3TZF7XUXPLN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOMOJ3TZ","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07631","citing_title":"On the Tour Towards DPLL(MAPF) and Beyond","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS","json":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS.json","graph_json":"https://pith.science/api/pith-number/FOMOJ3TZF7XUXPLNCRZP62UJPS/graph.json","events_json":"https://pith.science/api/pith-number/FOMOJ3TZF7XUXPLNCRZP62UJPS/events.json","paper":"https://pith.science/paper/FOMOJ3TZ"},"agent_actions":{"view_html":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS","download_json":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS.json","view_paper":"https://pith.science/paper/FOMOJ3TZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09820&json=true","fetch_graph":"https://pith.science/api/pith-number/FOMOJ3TZF7XUXPLNCRZP62UJPS/graph.json","fetch_events":"https://pith.science/api/pith-number/FOMOJ3TZF7XUXPLNCRZP62UJPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS/action/storage_attestation","attest_author":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS/action/author_attestation","sign_citation":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS/action/citation_signature","submit_replication":"https://pith.science/pith/FOMOJ3TZF7XUXPLNCRZP62UJPS/action/replication_record"}},"created_at":"2026-05-17T23:50:35.394977+00:00","updated_at":"2026-05-17T23:50:35.394977+00:00"}