{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EORQ3WDTRZDGEPDYD6HBLEKKFY","short_pith_number":"pith:EORQ3WDT","schema_version":"1.0","canonical_sha256":"23a30dd8738e46623c781f8e15914a2e3d8b42a13fca636275920140a829a54e","source":{"kind":"arxiv","id":"2308.10966","version":6},"attestation_state":"computed","paper":{"title":"Deadlock-free, Safe, and Decentralized Multi-Robot Navigation in Social Mini-Games via Discrete-Time Control Barrier Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Efstathios Bakolas, Joydeep Biswas, Peter Stone, Rohan Chandra, Vrushabh Zinage","submitted_at":"2023-08-21T18:23:53Z","abstract_excerpt":"We present an approach to ensure safe and deadlock-free navigation for decentralized multi-robot systems operating in constrained environments, including doorways and intersections. Although many solutions have been proposed that ensure safety and resolve deadlocks, optimally preventing deadlocks in a minimally invasive and decentralized fashion remains an open problem. We first formalize the objective as a non-cooperative, non-communicative, partially observable multi-robot navigation problem in constrained spaces with multiple conflicting agents, which we term as social mini-games. Formally,"},"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":"2308.10966","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-08-21T18:23:53Z","cross_cats_sorted":["cs.GT","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"7b90b8521ccc32c42f0c6f85521244ca6f80f6cd82279dafc1c583eb23abfdac","abstract_canon_sha256":"03d182938767cbe59595744683d786ec2e8364ed727507f623e9223fc09cd934"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:07.111325Z","signature_b64":"DznROrmshsBM35WXqfrt81882/kUvQFrL4D87LUABZCn+SOM/vWVv8W6djW+SnuEwW0ALhIsBR9PMHAzBNZfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23a30dd8738e46623c781f8e15914a2e3d8b42a13fca636275920140a829a54e","last_reissued_at":"2026-07-05T10:05:07.110799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:07.110799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deadlock-free, Safe, and Decentralized Multi-Robot Navigation in Social Mini-Games via Discrete-Time Control Barrier Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Efstathios Bakolas, Joydeep Biswas, Peter Stone, Rohan Chandra, Vrushabh Zinage","submitted_at":"2023-08-21T18:23:53Z","abstract_excerpt":"We present an approach to ensure safe and deadlock-free navigation for decentralized multi-robot systems operating in constrained environments, including doorways and intersections. Although many solutions have been proposed that ensure safety and resolve deadlocks, optimally preventing deadlocks in a minimally invasive and decentralized fashion remains an open problem. We first formalize the objective as a non-cooperative, non-communicative, partially observable multi-robot navigation problem in constrained spaces with multiple conflicting agents, which we term as social mini-games. Formally,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10966","kind":"arxiv","version":6},"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/2308.10966/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":"2308.10966","created_at":"2026-07-05T10:05:07.110861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.10966v6","created_at":"2026-07-05T10:05:07.110861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10966","created_at":"2026-07-05T10:05:07.110861+00:00"},{"alias_kind":"pith_short_12","alias_value":"EORQ3WDTRZDG","created_at":"2026-07-05T10:05:07.110861+00:00"},{"alias_kind":"pith_short_16","alias_value":"EORQ3WDTRZDGEPDY","created_at":"2026-07-05T10:05:07.110861+00:00"},{"alias_kind":"pith_short_8","alias_value":"EORQ3WDT","created_at":"2026-07-05T10:05:07.110861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.12333","citing_title":"GameChat: Multi-LLM Dialogue for Safe, Agile, and Socially Optimal Multi-Agent Navigation in Constrained Environments","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY","json":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY.json","graph_json":"https://pith.science/api/pith-number/EORQ3WDTRZDGEPDYD6HBLEKKFY/graph.json","events_json":"https://pith.science/api/pith-number/EORQ3WDTRZDGEPDYD6HBLEKKFY/events.json","paper":"https://pith.science/paper/EORQ3WDT"},"agent_actions":{"view_html":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY","download_json":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY.json","view_paper":"https://pith.science/paper/EORQ3WDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.10966&json=true","fetch_graph":"https://pith.science/api/pith-number/EORQ3WDTRZDGEPDYD6HBLEKKFY/graph.json","fetch_events":"https://pith.science/api/pith-number/EORQ3WDTRZDGEPDYD6HBLEKKFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY/action/storage_attestation","attest_author":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY/action/author_attestation","sign_citation":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY/action/citation_signature","submit_replication":"https://pith.science/pith/EORQ3WDTRZDGEPDYD6HBLEKKFY/action/replication_record"}},"created_at":"2026-07-05T10:05:07.110861+00:00","updated_at":"2026-07-05T10:05:07.110861+00:00"}