{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U2KHFVZN5STMAVICNLBBLR7E7H","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":"1d80ee415b7eeee5a7fad6ed8c7ad06a3ac11e5287847927d5c4ea481e216ffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-29T19:49:16Z","title_canon_sha256":"a9733dba59c3c16d0397b69fc6f495209092368a3548c36bddc3aed4be40e512"},"schema_version":"1.0","source":{"id":"1909.13352","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.13352","created_at":"2026-07-05T00:45:33Z"},{"alias_kind":"arxiv_version","alias_value":"1909.13352v2","created_at":"2026-07-05T00:45:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13352","created_at":"2026-07-05T00:45:33Z"},{"alias_kind":"pith_short_12","alias_value":"U2KHFVZN5STM","created_at":"2026-07-05T00:45:33Z"},{"alias_kind":"pith_short_16","alias_value":"U2KHFVZN5STMAVIC","created_at":"2026-07-05T00:45:33Z"},{"alias_kind":"pith_short_8","alias_value":"U2KHFVZN","created_at":"2026-07-05T00:45:33Z"}],"graph_snapshots":[{"event_id":"sha256:067196da089bfc20d3fe5eb40b81a81d31f659882d0f5a7ddbf51aba409fc310","target":"graph","created_at":"2026-07-05T00:45:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.13352/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Irving Solis, James Motes, Nancy M. Amato, Read Sandstr\\\"om","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-29T19:49:16Z","title":"Representation-Optimal Multi-Robot Motion Planning using Conflict-Based Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13352","kind":"arxiv","version":2},"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:b831871431ee6a4fbb689e60c26671d41e367b5bf7400d22ab2f9c34ff2edf15","target":"record","created_at":"2026-07-05T00:45:33Z","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":"1d80ee415b7eeee5a7fad6ed8c7ad06a3ac11e5287847927d5c4ea481e216ffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-29T19:49:16Z","title_canon_sha256":"a9733dba59c3c16d0397b69fc6f495209092368a3548c36bddc3aed4be40e512"},"schema_version":"1.0","source":{"id":"1909.13352","kind":"arxiv","version":2}},"canonical_sha256":"a69472d72deca6c055026ac215c7e4f9cf82feb6ea0ccba7d98d9ab696b89a3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a69472d72deca6c055026ac215c7e4f9cf82feb6ea0ccba7d98d9ab696b89a3b","first_computed_at":"2026-07-05T00:45:33.728748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:45:33.728748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wBJCHrnVrOtwAYaZjZmwTH61dDhVvFB28cvbtOMx51B99wWDuE+si4NXyZgEMerCZVV1UdKSWMy02e41zBCbBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:45:33.729257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.13352","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b831871431ee6a4fbb689e60c26671d41e367b5bf7400d22ab2f9c34ff2edf15","sha256:067196da089bfc20d3fe5eb40b81a81d31f659882d0f5a7ddbf51aba409fc310"],"state_sha256":"a380d906dca7fbdfe4f23b3c39de2cf958a1c770bb934a9b99bbcb9adadc536f"}