{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MN2ER5GYNZBOUFHRPGJS2K2XRC","short_pith_number":"pith:MN2ER5GY","schema_version":"1.0","canonical_sha256":"637448f4d86e42ea14f179932d2b5788822b90499b14b1ea9bbe476c22c7d2f3","source":{"kind":"arxiv","id":"1901.05506","version":3},"attestation_state":"computed","paper":{"title":"Multi-Agent Pathfinding with Continuous Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anton Andreychuk, Dor Atzmon, Konstantin Yakovlev, Roni Stern","submitted_at":"2019-01-16T19:34:03Z","abstract_excerpt":"Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. Most prior work on MAPF was on grids, assumed agents' actions have uniform duration, and that time is discretized into timesteps. We propose a MAPF algorithm that does not rely on these assumptions, is complete, and provides provably optimal solutions. This algorithm is based on a novel adaptation of Safe interval path planning (SIPP), a continuous time single-agent planning algorithm, and a modified version of Conflict-based search (CBS), a s"},"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":"1901.05506","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-16T19:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"e8b4897006937a0000ef908db106094c0f2813f03740e201b4c77ccc35d45ba2","abstract_canon_sha256":"86f96001056f50149e6e6b15ec0b933c853d2f6d59d92a1fc005239d370db3cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:23.318947Z","signature_b64":"x78pyyrA1BpeIqSNU021YP5spjuIE8qDNVGCBSHorFv89KPmuBJD0WOA0M4mSFKI1Hdj79gECMzD55M3CaYTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"637448f4d86e42ea14f179932d2b5788822b90499b14b1ea9bbe476c22c7d2f3","last_reissued_at":"2026-05-17T23:43:23.318264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:23.318264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Pathfinding with Continuous Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anton Andreychuk, Dor Atzmon, Konstantin Yakovlev, Roni Stern","submitted_at":"2019-01-16T19:34:03Z","abstract_excerpt":"Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. Most prior work on MAPF was on grids, assumed agents' actions have uniform duration, and that time is discretized into timesteps. We propose a MAPF algorithm that does not rely on these assumptions, is complete, and provides provably optimal solutions. This algorithm is based on a novel adaptation of Safe interval path planning (SIPP), a continuous time single-agent planning algorithm, and a modified version of Conflict-based search (CBS), a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05506","kind":"arxiv","version":3},"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":"1901.05506","created_at":"2026-05-17T23:43:23.318404+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05506v3","created_at":"2026-05-17T23:43:23.318404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05506","created_at":"2026-05-17T23:43:23.318404+00:00"},{"alias_kind":"pith_short_12","alias_value":"MN2ER5GYNZBO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MN2ER5GYNZBOUFHR","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MN2ER5GY","created_at":"2026-05-18T12:33:21.387695+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":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC","json":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC.json","graph_json":"https://pith.science/api/pith-number/MN2ER5GYNZBOUFHRPGJS2K2XRC/graph.json","events_json":"https://pith.science/api/pith-number/MN2ER5GYNZBOUFHRPGJS2K2XRC/events.json","paper":"https://pith.science/paper/MN2ER5GY"},"agent_actions":{"view_html":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC","download_json":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC.json","view_paper":"https://pith.science/paper/MN2ER5GY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05506&json=true","fetch_graph":"https://pith.science/api/pith-number/MN2ER5GYNZBOUFHRPGJS2K2XRC/graph.json","fetch_events":"https://pith.science/api/pith-number/MN2ER5GYNZBOUFHRPGJS2K2XRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/action/storage_attestation","attest_author":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/action/author_attestation","sign_citation":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/action/citation_signature","submit_replication":"https://pith.science/pith/MN2ER5GYNZBOUFHRPGJS2K2XRC/action/replication_record"}},"created_at":"2026-05-17T23:43:23.318404+00:00","updated_at":"2026-05-17T23:43:23.318404+00:00"}