{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JQVXQTTGMETJ2DSQ3NUFDVPIHP","short_pith_number":"pith:JQVXQTTG","schema_version":"1.0","canonical_sha256":"4c2b784e6661269d0e50db6851d5e83bf8d077dd7c5d18827b9f350804001152","source":{"kind":"arxiv","id":"2606.27495","version":1},"attestation_state":"computed","paper":{"title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"James D. Motes, Marco Morales, Nancy M. Amato","submitted_at":"2026-06-25T19:20:26Z","abstract_excerpt":"We present AO-ARC, an anytime multi-robot motion planning (MRMP) method that achieves initial solution times on par with state-of-the-art MRMP feasibility solvers while converging faster and more reliably than existing anytime MRMP methods as the number of robots increases. AO-ARC adapts the AO-x meta-algorithm for converting feasibility solvers into anytime algorithms by iteratively calling the original ARC method on bounded MRMP instances under a makespan cost metric. This exploits the adaptive (de)coupling of ARC while maintaining the consistent cost bound across robot (de)compositions need"},"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":"2606.27495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-25T19:20:26Z","cross_cats_sorted":[],"title_canon_sha256":"d92ba60511f3a2204d8ebf3b305915a2084181215a46daeca294c27a91345765","abstract_canon_sha256":"4be067131c7a780000e9fe869b60e70b664a54af48a70eaeb318383ecd409456"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T00:14:08.217652Z","signature_b64":"fa5ofIVYeGkVA8eR1RDXLSnSCdfCQX2+IvNAjj21hxm4S0gMHaPaQR+1U1UHmBnMxUn7kegAPQNpPoycBtdwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2b784e6661269d0e50db6851d5e83bf8d077dd7c5d18827b9f350804001152","last_reissued_at":"2026-06-29T00:14:08.217223Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T00:14:08.217223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"James D. Motes, Marco Morales, Nancy M. Amato","submitted_at":"2026-06-25T19:20:26Z","abstract_excerpt":"We present AO-ARC, an anytime multi-robot motion planning (MRMP) method that achieves initial solution times on par with state-of-the-art MRMP feasibility solvers while converging faster and more reliably than existing anytime MRMP methods as the number of robots increases. AO-ARC adapts the AO-x meta-algorithm for converting feasibility solvers into anytime algorithms by iteratively calling the original ARC method on bounded MRMP instances under a makespan cost metric. This exploits the adaptive (de)coupling of ARC while maintaining the consistent cost bound across robot (de)compositions need"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27495","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.27495/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":"2606.27495","created_at":"2026-06-29T00:14:08.217282+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.27495v1","created_at":"2026-06-29T00:14:08.217282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27495","created_at":"2026-06-29T00:14:08.217282+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQVXQTTGMETJ","created_at":"2026-06-29T00:14:08.217282+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQVXQTTGMETJ2DSQ","created_at":"2026-06-29T00:14:08.217282+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQVXQTTG","created_at":"2026-06-29T00:14:08.217282+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/JQVXQTTGMETJ2DSQ3NUFDVPIHP","json":"https://pith.science/pith/JQVXQTTGMETJ2DSQ3NUFDVPIHP.json","graph_json":"https://pith.science/api/pith-number/JQVXQTTGMETJ2DSQ3NUFDVPIHP/graph.json","events_json":"https://pith.science/api/pith-number/JQVXQTTGMETJ2DSQ3NUFDVPIHP/events.json","paper":"https://pith.science/paper/JQVXQTTG"},"agent_actions":{"view_html":"https://pith.science/pith/JQVXQTTGMETJ2DSQ3NUFDVPIHP","download_json":"https://pith.science/pith/JQVXQTTGMETJ2DSQ3NUFDVPIHP.json","view_paper":"https://pith.science/paper/JQVXQTTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.27495&json=true","fetch_graph":"https://pith.science/api/pith-number/JQVXQTTGMETJ2DSQ3NUFDVPIHP/graph.json","fetch_events":"https://pith.science/api/pith-number/JQVXQTTGMETJ2DSQ3NUFDVPIHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQVXQTTGMETJ2DSQ3NUFDVPIHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQVXQTTGMETJ2DSQ3NUFDVPIHP/action/storage_attestation","attest_author":"https://pith.science/pith/JQVXQTTGMETJ2DSQ3NUFDVPIHP/action/author_attestation","sign_citation":"https://pith.science/pith/JQVXQTTGMETJ2DSQ3NUFDVPIHP/action/citation_signature","submit_replication":"https://pith.science/pith/JQVXQTTGMETJ2DSQ3NUFDVPIHP/action/replication_record"}},"created_at":"2026-06-29T00:14:08.217282+00:00","updated_at":"2026-06-29T00:14:08.217282+00:00"}