{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GS5SVPNFDN7OLGF5G6GTB57HQ4","short_pith_number":"pith:GS5SVPNF","schema_version":"1.0","canonical_sha256":"34bb2abda51b7ee598bd378d30f7e7872778863b86c6f99000399bdec312d7f9","source":{"kind":"arxiv","id":"2406.12224","version":1},"attestation_state":"computed","paper":{"title":"Leveraging Large Language Model for Heterogeneous Ad Hoc Teamwork Collaboration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Di Guo, Huaping Liu, Peiyan Li, Wenju Yang, Xinzhu Liu","submitted_at":"2024-06-18T03:00:39Z","abstract_excerpt":"Compared with the widely investigated homogeneous multi-robot collaboration, heterogeneous robots with different capabilities can provide a more efficient and flexible collaboration for more complex tasks. In this paper, we consider a more challenging heterogeneous ad hoc teamwork collaboration problem where an ad hoc robot joins an existing heterogeneous team for a shared goal. Specifically, the ad hoc robot collaborates with unknown teammates without prior coordination, and it is expected to generate an appropriate cooperation policy to improve the efficiency of the whole team. To solve this"},"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":"2406.12224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-18T03:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"ed6ac05bb38990bbc03fc1e5f648af0df453c32f47dcecbe0fd41ec5ab4372ff","abstract_canon_sha256":"68f135cf792e84088eed102602008c0a59e1db6c2cf4e69fd15789ea2284cc27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:42.823762Z","signature_b64":"2UjHoBdbbR/Z/Z/vcGjq97ODsIv2LgBR22PukXiV+9W2VgPfm36ka3ouVRPbtj55IWji6TTBII9WD0PDoGeLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34bb2abda51b7ee598bd378d30f7e7872778863b86c6f99000399bdec312d7f9","last_reissued_at":"2026-07-05T08:33:42.823293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:42.823293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging Large Language Model for Heterogeneous Ad Hoc Teamwork Collaboration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Di Guo, Huaping Liu, Peiyan Li, Wenju Yang, Xinzhu Liu","submitted_at":"2024-06-18T03:00:39Z","abstract_excerpt":"Compared with the widely investigated homogeneous multi-robot collaboration, heterogeneous robots with different capabilities can provide a more efficient and flexible collaboration for more complex tasks. In this paper, we consider a more challenging heterogeneous ad hoc teamwork collaboration problem where an ad hoc robot joins an existing heterogeneous team for a shared goal. Specifically, the ad hoc robot collaborates with unknown teammates without prior coordination, and it is expected to generate an appropriate cooperation policy to improve the efficiency of the whole team. To solve this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12224","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/2406.12224/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":"2406.12224","created_at":"2026-07-05T08:33:42.823358+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.12224v1","created_at":"2026-07-05T08:33:42.823358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12224","created_at":"2026-07-05T08:33:42.823358+00:00"},{"alias_kind":"pith_short_12","alias_value":"GS5SVPNFDN7O","created_at":"2026-07-05T08:33:42.823358+00:00"},{"alias_kind":"pith_short_16","alias_value":"GS5SVPNFDN7OLGF5","created_at":"2026-07-05T08:33:42.823358+00:00"},{"alias_kind":"pith_short_8","alias_value":"GS5SVPNF","created_at":"2026-07-05T08:33:42.823358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06990","citing_title":"A Closed-Loop Multi-Agent Framework for Robust Multi-Robot Manipulation","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4","json":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4.json","graph_json":"https://pith.science/api/pith-number/GS5SVPNFDN7OLGF5G6GTB57HQ4/graph.json","events_json":"https://pith.science/api/pith-number/GS5SVPNFDN7OLGF5G6GTB57HQ4/events.json","paper":"https://pith.science/paper/GS5SVPNF"},"agent_actions":{"view_html":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4","download_json":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4.json","view_paper":"https://pith.science/paper/GS5SVPNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.12224&json=true","fetch_graph":"https://pith.science/api/pith-number/GS5SVPNFDN7OLGF5G6GTB57HQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/GS5SVPNFDN7OLGF5G6GTB57HQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4/action/storage_attestation","attest_author":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4/action/author_attestation","sign_citation":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4/action/citation_signature","submit_replication":"https://pith.science/pith/GS5SVPNFDN7OLGF5G6GTB57HQ4/action/replication_record"}},"created_at":"2026-07-05T08:33:42.823358+00:00","updated_at":"2026-07-05T08:33:42.823358+00:00"}