{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EBKNGNR55W2KSBEBOA35EJG7GF","short_pith_number":"pith:EBKNGNR5","schema_version":"1.0","canonical_sha256":"2054d3363dedb4a904817037d224df31611d14abb3b5ee77a6a3b640ba08d0c6","source":{"kind":"arxiv","id":"2401.03630","version":2},"attestation_state":"computed","paper":{"title":"Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.MA","authors_text":"Bistra Dilkina, Sven Koenig, Weizhe Chen","submitted_at":"2024-01-08T02:22:04Z","abstract_excerpt":"With the explosive influence caused by the success of large language models (LLM) like ChatGPT and GPT-4, there has been an extensive amount of recent work showing that foundation models can be used to solve a large variety of tasks. However, there is very limited work that shares insights on multi-agent planning. Multi-agent planning is different from other domains by combining the difficulty of multi-agent coordination and planning, and making it hard to leverage external tools to facilitate the reasoning needed. In this paper, we focus on the problem of multi-agent path finding (MAPF), whic"},"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":"2401.03630","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-01-08T02:22:04Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"985353fe142f521c0b8a46afce0ab97d5c359075df9e5ba52e8acac30a766d32","abstract_canon_sha256":"41eebe3edaa76b82f34375dcd6c96e0911d688cdd2ddd6ea1f0f86d6b7ab2f8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:14.093081Z","signature_b64":"UrXqiFSjXdg5iRuHgXceHjG0NxjmGCxyTJiJHscSman2S4v0WBdKUF+IrtZSu14PtJlNI36UArNE0ZGuqd2rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2054d3363dedb4a904817037d224df31611d14abb3b5ee77a6a3b640ba08d0c6","last_reissued_at":"2026-07-05T07:43:14.092617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:14.092617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.MA","authors_text":"Bistra Dilkina, Sven Koenig, Weizhe Chen","submitted_at":"2024-01-08T02:22:04Z","abstract_excerpt":"With the explosive influence caused by the success of large language models (LLM) like ChatGPT and GPT-4, there has been an extensive amount of recent work showing that foundation models can be used to solve a large variety of tasks. However, there is very limited work that shares insights on multi-agent planning. Multi-agent planning is different from other domains by combining the difficulty of multi-agent coordination and planning, and making it hard to leverage external tools to facilitate the reasoning needed. In this paper, we focus on the problem of multi-agent path finding (MAPF), whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.03630","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/2401.03630/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":"2401.03630","created_at":"2026-07-05T07:43:14.092678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.03630v2","created_at":"2026-07-05T07:43:14.092678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.03630","created_at":"2026-07-05T07:43:14.092678+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBKNGNR55W2K","created_at":"2026-07-05T07:43:14.092678+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBKNGNR55W2KSBEB","created_at":"2026-07-05T07:43:14.092678+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBKNGNR5","created_at":"2026-07-05T07:43:14.092678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25404","citing_title":"HEART: Coordination of Heterogeneous Expert Agents for Physically Grounded Robotic Task Planning","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2502.03814","citing_title":"Large Language Models for Multi-Robot Systems: A Survey","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF","json":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF.json","graph_json":"https://pith.science/api/pith-number/EBKNGNR55W2KSBEBOA35EJG7GF/graph.json","events_json":"https://pith.science/api/pith-number/EBKNGNR55W2KSBEBOA35EJG7GF/events.json","paper":"https://pith.science/paper/EBKNGNR5"},"agent_actions":{"view_html":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF","download_json":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF.json","view_paper":"https://pith.science/paper/EBKNGNR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.03630&json=true","fetch_graph":"https://pith.science/api/pith-number/EBKNGNR55W2KSBEBOA35EJG7GF/graph.json","fetch_events":"https://pith.science/api/pith-number/EBKNGNR55W2KSBEBOA35EJG7GF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF/action/storage_attestation","attest_author":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF/action/author_attestation","sign_citation":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF/action/citation_signature","submit_replication":"https://pith.science/pith/EBKNGNR55W2KSBEBOA35EJG7GF/action/replication_record"}},"created_at":"2026-07-05T07:43:14.092678+00:00","updated_at":"2026-07-05T07:43:14.092678+00:00"}