{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:67UFKFFSN4ICDJTBC5FOHOVFRQ","short_pith_number":"pith:67UFKFFS","schema_version":"1.0","canonical_sha256":"f7e85514b26f1021a661174ae3baa58c3d14e5361fdd6e01d292347e360deb6f","source":{"kind":"arxiv","id":"2404.06413","version":2},"attestation_state":"computed","paper":{"title":"Foundation Models to the Rescue: Deadlock Resolution in Connected Multi-Robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","math.OC"],"primary_cat":"cs.RO","authors_text":"Chuchu Fan, Jacob Arkin, Kunal Garg, Songyuan Zhang","submitted_at":"2024-04-09T16:03:26Z","abstract_excerpt":"Connected multi-agent robotic systems (MRS) are prone to deadlocks in an obstacle environment where the robots can get stuck away from their desired locations under a smooth low-level control policy. Without an external intervention, often in terms of a high-level command, a low-level control policy cannot resolve such deadlocks. Utilizing the generalizability and low data requirements of foundation models, this paper explores the possibility of using text-based models, i.e., large language models (LLMs), and text-and-image-based models, i.e., vision-language models (VLMs), as high-level plann"},"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":"2404.06413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-04-09T16:03:26Z","cross_cats_sorted":["cs.CL","math.OC"],"title_canon_sha256":"1479e1e9441f8ea717dadd8eaf7ac295eefa884179c2e43120877def922ccc9e","abstract_canon_sha256":"25caa0f98f67e2d35ab48e2c9fdebba7bda5224f1795a0f27e23bb31426fab7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:47.065491Z","signature_b64":"vRpdqKE9DM2tTm5zYytj5vttsvHq+Q9hlFqk2uIpv6as7dkKZqQe5nRkKOdHewNkWGTdEXmVWDe6ShnqI5E5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7e85514b26f1021a661174ae3baa58c3d14e5361fdd6e01d292347e360deb6f","last_reissued_at":"2026-07-05T09:07:47.065012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:47.065012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Foundation Models to the Rescue: Deadlock Resolution in Connected Multi-Robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","math.OC"],"primary_cat":"cs.RO","authors_text":"Chuchu Fan, Jacob Arkin, Kunal Garg, Songyuan Zhang","submitted_at":"2024-04-09T16:03:26Z","abstract_excerpt":"Connected multi-agent robotic systems (MRS) are prone to deadlocks in an obstacle environment where the robots can get stuck away from their desired locations under a smooth low-level control policy. Without an external intervention, often in terms of a high-level command, a low-level control policy cannot resolve such deadlocks. Utilizing the generalizability and low data requirements of foundation models, this paper explores the possibility of using text-based models, i.e., large language models (LLMs), and text-and-image-based models, i.e., vision-language models (VLMs), as high-level plann"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06413","kind":"arxiv","version":2},"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/2404.06413/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":"2404.06413","created_at":"2026-07-05T09:07:47.065076+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.06413v2","created_at":"2026-07-05T09:07:47.065076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06413","created_at":"2026-07-05T09:07:47.065076+00:00"},{"alias_kind":"pith_short_12","alias_value":"67UFKFFSN4IC","created_at":"2026-07-05T09:07:47.065076+00:00"},{"alias_kind":"pith_short_16","alias_value":"67UFKFFSN4ICDJTB","created_at":"2026-07-05T09:07:47.065076+00:00"},{"alias_kind":"pith_short_8","alias_value":"67UFKFFS","created_at":"2026-07-05T09:07:47.065076+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.03814","citing_title":"Large Language Models for Multi-Robot Systems: A Survey","ref_index":29,"is_internal_anchor":false},{"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":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ","json":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ.json","graph_json":"https://pith.science/api/pith-number/67UFKFFSN4ICDJTBC5FOHOVFRQ/graph.json","events_json":"https://pith.science/api/pith-number/67UFKFFSN4ICDJTBC5FOHOVFRQ/events.json","paper":"https://pith.science/paper/67UFKFFS"},"agent_actions":{"view_html":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ","download_json":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ.json","view_paper":"https://pith.science/paper/67UFKFFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.06413&json=true","fetch_graph":"https://pith.science/api/pith-number/67UFKFFSN4ICDJTBC5FOHOVFRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/67UFKFFSN4ICDJTBC5FOHOVFRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ/action/storage_attestation","attest_author":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ/action/author_attestation","sign_citation":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ/action/citation_signature","submit_replication":"https://pith.science/pith/67UFKFFSN4ICDJTBC5FOHOVFRQ/action/replication_record"}},"created_at":"2026-07-05T09:07:47.065076+00:00","updated_at":"2026-07-05T09:07:47.065076+00:00"}