{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6H2UUSPWQLHY5B6RPCFCYDD5W6","short_pith_number":"pith:6H2UUSPW","schema_version":"1.0","canonical_sha256":"f1f54a49f682cf8e87d1788a2c0c7db7b555f81e4c0be3686bb2106f930b3e2c","source":{"kind":"arxiv","id":"2409.09573","version":1},"attestation_state":"computed","paper":{"title":"Decentralized Safe and Scalable Multi-Agent Control under Limited Actuation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Abhishek Jha, Efstathios Bakolas, Rohan Chandra, Vrushabh Zinage","submitted_at":"2024-09-15T01:26:35Z","abstract_excerpt":"To deploy safe and agile robots in cluttered environments, there is a need to develop fully decentralized controllers that guarantee safety, respect actuation limits, prevent deadlocks, and scale to thousands of agents. Current approaches fall short of meeting all these goals: optimization-based methods ensure safety but lack scalability, while learning-based methods scale but do not guarantee safety. We propose a novel algorithm to achieve safe and scalable control for multiple agents under limited actuation. Specifically, our approach includes: $(i)$ learning a decentralized neural Integral "},"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":"2409.09573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-15T01:26:35Z","cross_cats_sorted":["cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"3d157a883ce5087103d8fc0a91df0ad2798e4137dd4404e5cd44d0dc32dd9cbd","abstract_canon_sha256":"1e24ff5fc6fe634d5fb3d12ea83d5c8fb1a0ee0cb1743e85e67f71b8a1c8d261"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:11.324452Z","signature_b64":"gGMWjRykiCwPcXZTRwZ8YkjAyYRMNs7qdInJBFb3Hud1avLLoyeUWY0FocKXFELbVCQzcXBKr4KVHdKUzgkiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f54a49f682cf8e87d1788a2c0c7db7b555f81e4c0be3686bb2106f930b3e2c","last_reissued_at":"2026-07-05T09:07:11.323977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:11.323977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Safe and Scalable Multi-Agent Control under Limited Actuation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Abhishek Jha, Efstathios Bakolas, Rohan Chandra, Vrushabh Zinage","submitted_at":"2024-09-15T01:26:35Z","abstract_excerpt":"To deploy safe and agile robots in cluttered environments, there is a need to develop fully decentralized controllers that guarantee safety, respect actuation limits, prevent deadlocks, and scale to thousands of agents. Current approaches fall short of meeting all these goals: optimization-based methods ensure safety but lack scalability, while learning-based methods scale but do not guarantee safety. We propose a novel algorithm to achieve safe and scalable control for multiple agents under limited actuation. Specifically, our approach includes: $(i)$ learning a decentralized neural Integral "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09573","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/2409.09573/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":"2409.09573","created_at":"2026-07-05T09:07:11.324031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09573v1","created_at":"2026-07-05T09:07:11.324031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09573","created_at":"2026-07-05T09:07:11.324031+00:00"},{"alias_kind":"pith_short_12","alias_value":"6H2UUSPWQLHY","created_at":"2026-07-05T09:07:11.324031+00:00"},{"alias_kind":"pith_short_16","alias_value":"6H2UUSPWQLHY5B6R","created_at":"2026-07-05T09:07:11.324031+00:00"},{"alias_kind":"pith_short_8","alias_value":"6H2UUSPW","created_at":"2026-07-05T09:07:11.324031+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":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6","json":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6.json","graph_json":"https://pith.science/api/pith-number/6H2UUSPWQLHY5B6RPCFCYDD5W6/graph.json","events_json":"https://pith.science/api/pith-number/6H2UUSPWQLHY5B6RPCFCYDD5W6/events.json","paper":"https://pith.science/paper/6H2UUSPW"},"agent_actions":{"view_html":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6","download_json":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6.json","view_paper":"https://pith.science/paper/6H2UUSPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09573&json=true","fetch_graph":"https://pith.science/api/pith-number/6H2UUSPWQLHY5B6RPCFCYDD5W6/graph.json","fetch_events":"https://pith.science/api/pith-number/6H2UUSPWQLHY5B6RPCFCYDD5W6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6/action/storage_attestation","attest_author":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6/action/author_attestation","sign_citation":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6/action/citation_signature","submit_replication":"https://pith.science/pith/6H2UUSPWQLHY5B6RPCFCYDD5W6/action/replication_record"}},"created_at":"2026-07-05T09:07:11.324031+00:00","updated_at":"2026-07-05T09:07:11.324031+00:00"}