{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XKZTJ3X2BGSWOFL6TYEYVXXR2H","short_pith_number":"pith:XKZTJ3X2","schema_version":"1.0","canonical_sha256":"bab334eefa09a567157e9e098adef1d1d722647a4d8963a97487fef9cea303fa","source":{"kind":"arxiv","id":"2606.22757","version":1},"attestation_state":"computed","paper":{"title":"Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andy Li, Hongkun Lyu, Jiaqi Chen, Junfeng Wu, Kevin Zheng","submitted_at":"2026-06-22T01:56:19Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is a problem that requires computing collision-free paths for a set of agents from their start locations to designated goal locations. The problem has broad applications in domains where teams of robots must operate in a coordinated manner. ORCA* is a real time MAPF solver that assigns for each timestep a velocity for each agent. Due to its real time nature, it is myopic to future deadlocks that result from current decisions. ORCA*-MAPF attempts to remedy this limitation by introducing fallback mechanisms when deadlocks are detected. However, post hoc interventi"},"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.22757","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-22T01:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"39fca2ee6e409c6a80ff5c63793387b8964f51019291b2bba18b74b3e6e0d3aa","abstract_canon_sha256":"9ab5faab1f13c574b2ae0b72265aa1b7714850992172b0117cc0e5938520e67b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:46.416302Z","signature_b64":"EZynUBJhweW3+19CMuLJ8dhxJkp4LgGIx/HyLRZ1XoxZmG7JZdGuhGF/x2zKlaeiMBit9b2N02Q/zP9o89unDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bab334eefa09a567157e9e098adef1d1d722647a4d8963a97487fef9cea303fa","last_reissued_at":"2026-06-23T02:13:46.415899Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:46.415899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andy Li, Hongkun Lyu, Jiaqi Chen, Junfeng Wu, Kevin Zheng","submitted_at":"2026-06-22T01:56:19Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is a problem that requires computing collision-free paths for a set of agents from their start locations to designated goal locations. The problem has broad applications in domains where teams of robots must operate in a coordinated manner. ORCA* is a real time MAPF solver that assigns for each timestep a velocity for each agent. Due to its real time nature, it is myopic to future deadlocks that result from current decisions. ORCA*-MAPF attempts to remedy this limitation by introducing fallback mechanisms when deadlocks are detected. However, post hoc interventi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22757","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.22757/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.22757","created_at":"2026-06-23T02:13:46.415961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22757v1","created_at":"2026-06-23T02:13:46.415961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22757","created_at":"2026-06-23T02:13:46.415961+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKZTJ3X2BGSW","created_at":"2026-06-23T02:13:46.415961+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKZTJ3X2BGSWOFL6","created_at":"2026-06-23T02:13:46.415961+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKZTJ3X2","created_at":"2026-06-23T02:13:46.415961+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/XKZTJ3X2BGSWOFL6TYEYVXXR2H","json":"https://pith.science/pith/XKZTJ3X2BGSWOFL6TYEYVXXR2H.json","graph_json":"https://pith.science/api/pith-number/XKZTJ3X2BGSWOFL6TYEYVXXR2H/graph.json","events_json":"https://pith.science/api/pith-number/XKZTJ3X2BGSWOFL6TYEYVXXR2H/events.json","paper":"https://pith.science/paper/XKZTJ3X2"},"agent_actions":{"view_html":"https://pith.science/pith/XKZTJ3X2BGSWOFL6TYEYVXXR2H","download_json":"https://pith.science/pith/XKZTJ3X2BGSWOFL6TYEYVXXR2H.json","view_paper":"https://pith.science/paper/XKZTJ3X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22757&json=true","fetch_graph":"https://pith.science/api/pith-number/XKZTJ3X2BGSWOFL6TYEYVXXR2H/graph.json","fetch_events":"https://pith.science/api/pith-number/XKZTJ3X2BGSWOFL6TYEYVXXR2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKZTJ3X2BGSWOFL6TYEYVXXR2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKZTJ3X2BGSWOFL6TYEYVXXR2H/action/storage_attestation","attest_author":"https://pith.science/pith/XKZTJ3X2BGSWOFL6TYEYVXXR2H/action/author_attestation","sign_citation":"https://pith.science/pith/XKZTJ3X2BGSWOFL6TYEYVXXR2H/action/citation_signature","submit_replication":"https://pith.science/pith/XKZTJ3X2BGSWOFL6TYEYVXXR2H/action/replication_record"}},"created_at":"2026-06-23T02:13:46.415961+00:00","updated_at":"2026-06-23T02:13:46.415961+00:00"}