{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WEUIGL3HEC3XAQMS6JZIEJM7CZ","short_pith_number":"pith:WEUIGL3H","schema_version":"1.0","canonical_sha256":"b128832f6720b7704192f27282259f1666e66306a151affb8b246cf5b1fa74a9","source":{"kind":"arxiv","id":"2308.04292","version":2},"attestation_state":"computed","paper":{"title":"Engineering LaCAM$^\\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Keisuke Okumura","submitted_at":"2023-08-08T14:36:58Z","abstract_excerpt":"This paper addresses the challenges of real-time, large-scale, and near-optimal multi-agent pathfinding (MAPF) through enhancements to the recently proposed LaCAM* algorithm. LaCAM* is a scalable search-based algorithm that guarantees the eventual finding of optimal solutions for cumulative transition costs. While it has demonstrated remarkable planning success rates, surpassing various state-of-the-art MAPF methods, its initial solution quality is far from optimal, and its convergence speed to the optimum is slow. To overcome these limitations, this paper introduces several improvement techni"},"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.04292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-08T14:36:58Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"97716c3e1720834cc1ecaaedd0d60cc527f278ed073b02d57fe67fb34e6de710","abstract_canon_sha256":"1d4bfeab72e957086c6052faa8efbadcc7293082a7087851911c9cbec7ae1247"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:02.313044Z","signature_b64":"RuvtdH4twmi1OTEQEeaNhB6ueR7y+geNd4N+WPAwlPk3WjBLIuar2zrQzDg5wXuf2hPhugNdFXOeCyTJ56wMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b128832f6720b7704192f27282259f1666e66306a151affb8b246cf5b1fa74a9","last_reissued_at":"2026-07-05T07:36:02.312604Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:02.312604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Engineering LaCAM$^\\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Keisuke Okumura","submitted_at":"2023-08-08T14:36:58Z","abstract_excerpt":"This paper addresses the challenges of real-time, large-scale, and near-optimal multi-agent pathfinding (MAPF) through enhancements to the recently proposed LaCAM* algorithm. LaCAM* is a scalable search-based algorithm that guarantees the eventual finding of optimal solutions for cumulative transition costs. While it has demonstrated remarkable planning success rates, surpassing various state-of-the-art MAPF methods, its initial solution quality is far from optimal, and its convergence speed to the optimum is slow. To overcome these limitations, this paper introduces several improvement techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.04292","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/2308.04292/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.04292","created_at":"2026-07-05T07:36:02.312657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.04292v2","created_at":"2026-07-05T07:36:02.312657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.04292","created_at":"2026-07-05T07:36:02.312657+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEUIGL3HEC3X","created_at":"2026-07-05T07:36:02.312657+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEUIGL3HEC3XAQMS","created_at":"2026-07-05T07:36:02.312657+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEUIGL3H","created_at":"2026-07-05T07:36:02.312657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04746","citing_title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ","json":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ.json","graph_json":"https://pith.science/api/pith-number/WEUIGL3HEC3XAQMS6JZIEJM7CZ/graph.json","events_json":"https://pith.science/api/pith-number/WEUIGL3HEC3XAQMS6JZIEJM7CZ/events.json","paper":"https://pith.science/paper/WEUIGL3H"},"agent_actions":{"view_html":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ","download_json":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ.json","view_paper":"https://pith.science/paper/WEUIGL3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.04292&json=true","fetch_graph":"https://pith.science/api/pith-number/WEUIGL3HEC3XAQMS6JZIEJM7CZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WEUIGL3HEC3XAQMS6JZIEJM7CZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/action/storage_attestation","attest_author":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/action/author_attestation","sign_citation":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/action/citation_signature","submit_replication":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/action/replication_record"}},"created_at":"2026-07-05T07:36:02.312657+00:00","updated_at":"2026-07-05T07:36:02.312657+00:00"}