{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:U2KHFVZN5STMAVICNLBBLR7E7H","short_pith_number":"pith:U2KHFVZN","schema_version":"1.0","canonical_sha256":"a69472d72deca6c055026ac215c7e4f9cf82feb6ea0ccba7d98d9ab696b89a3b","source":{"kind":"arxiv","id":"1909.13352","version":2},"attestation_state":"computed","paper":{"title":"Representation-Optimal Multi-Robot Motion Planning using Conflict-Based Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Irving Solis, James Motes, Nancy M. Amato, Read Sandstr\\\"om","submitted_at":"2019-09-29T19:49:16Z","abstract_excerpt":"Multi-Agent Motion Planning (MAMP) is the problem of computing feasible paths for a set of agents given individual start and goal states. Given the hardness of MAMP, most of the research related to multi-agent systems has focused on multi-agent pathfinding (MAPF), which simplifies the problem by assuming a shared discrete representation of the space for all agents. The Conflict-Based Search algorithm (CBS) has proven a tractable means of generating optimal solutions in discrete spaces. However, neither CBS nor other discrete MAPF techniques can be directly applied to solve MAMP problems becaus"},"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":"1909.13352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-29T19:49:16Z","cross_cats_sorted":[],"title_canon_sha256":"a9733dba59c3c16d0397b69fc6f495209092368a3548c36bddc3aed4be40e512","abstract_canon_sha256":"1d80ee415b7eeee5a7fad6ed8c7ad06a3ac11e5287847927d5c4ea481e216ffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:45:33.729257Z","signature_b64":"wBJCHrnVrOtwAYaZjZmwTH61dDhVvFB28cvbtOMx51B99wWDuE+si4NXyZgEMerCZVV1UdKSWMy02e41zBCbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a69472d72deca6c055026ac215c7e4f9cf82feb6ea0ccba7d98d9ab696b89a3b","last_reissued_at":"2026-07-05T00:45:33.728748Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:45:33.728748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representation-Optimal Multi-Robot Motion Planning using Conflict-Based Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Irving Solis, James Motes, Nancy M. Amato, Read Sandstr\\\"om","submitted_at":"2019-09-29T19:49:16Z","abstract_excerpt":"Multi-Agent Motion Planning (MAMP) is the problem of computing feasible paths for a set of agents given individual start and goal states. Given the hardness of MAMP, most of the research related to multi-agent systems has focused on multi-agent pathfinding (MAPF), which simplifies the problem by assuming a shared discrete representation of the space for all agents. The Conflict-Based Search algorithm (CBS) has proven a tractable means of generating optimal solutions in discrete spaces. However, neither CBS nor other discrete MAPF techniques can be directly applied to solve MAMP problems becaus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13352","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.13352/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.13352","created_at":"2026-07-05T00:45:33.728818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.13352v2","created_at":"2026-07-05T00:45:33.728818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13352","created_at":"2026-07-05T00:45:33.728818+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2KHFVZN5STM","created_at":"2026-07-05T00:45:33.728818+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2KHFVZN5STMAVIC","created_at":"2026-07-05T00:45:33.728818+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2KHFVZN","created_at":"2026-07-05T00:45:33.728818+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/U2KHFVZN5STMAVICNLBBLR7E7H","json":"https://pith.science/pith/U2KHFVZN5STMAVICNLBBLR7E7H.json","graph_json":"https://pith.science/api/pith-number/U2KHFVZN5STMAVICNLBBLR7E7H/graph.json","events_json":"https://pith.science/api/pith-number/U2KHFVZN5STMAVICNLBBLR7E7H/events.json","paper":"https://pith.science/paper/U2KHFVZN"},"agent_actions":{"view_html":"https://pith.science/pith/U2KHFVZN5STMAVICNLBBLR7E7H","download_json":"https://pith.science/pith/U2KHFVZN5STMAVICNLBBLR7E7H.json","view_paper":"https://pith.science/paper/U2KHFVZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.13352&json=true","fetch_graph":"https://pith.science/api/pith-number/U2KHFVZN5STMAVICNLBBLR7E7H/graph.json","fetch_events":"https://pith.science/api/pith-number/U2KHFVZN5STMAVICNLBBLR7E7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2KHFVZN5STMAVICNLBBLR7E7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2KHFVZN5STMAVICNLBBLR7E7H/action/storage_attestation","attest_author":"https://pith.science/pith/U2KHFVZN5STMAVICNLBBLR7E7H/action/author_attestation","sign_citation":"https://pith.science/pith/U2KHFVZN5STMAVICNLBBLR7E7H/action/citation_signature","submit_replication":"https://pith.science/pith/U2KHFVZN5STMAVICNLBBLR7E7H/action/replication_record"}},"created_at":"2026-07-05T00:45:33.728818+00:00","updated_at":"2026-07-05T00:45:33.728818+00:00"}