{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WEUIGL3HEC3XAQMS6JZIEJM7CZ","short_pith_number":"pith:WEUIGL3H","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"},"canonical_sha256":"b128832f6720b7704192f27282259f1666e66306a151affb8b246cf5b1fa74a9","source":{"kind":"arxiv","id":"2308.04292","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.04292","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"arxiv_version","alias_value":"2308.04292v2","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.04292","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"pith_short_12","alias_value":"WEUIGL3HEC3X","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"pith_short_16","alias_value":"WEUIGL3HEC3XAQMS","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"pith_short_8","alias_value":"WEUIGL3H","created_at":"2026-07-05T07:36:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WEUIGL3HEC3XAQMS6JZIEJM7CZ","target":"record","payload":{"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"},"canonical_sha256":"b128832f6720b7704192f27282259f1666e66306a151affb8b246cf5b1fa74a9","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"},"source_kind":"arxiv","source_id":"2308.04292","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:36:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5Yu09Z6Ayu39GW3B7+OTRvipv3vxQbdz6ObDyBmkKs8C6T5sKhhGJi2NA4R3HEvtvIfqRDI4/xu85qeN+pDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:04:29.512953Z"},"content_sha256":"55b753aa866a4bfbeb47043096bf07a0cb2ae40977add610edaf05a6aea03c3c","schema_version":"1.0","event_id":"sha256:55b753aa866a4bfbeb47043096bf07a0cb2ae40977add610edaf05a6aea03c3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WEUIGL3HEC3XAQMS6JZIEJM7CZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:36:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIKeLfFxEfVxcYV/hhgtxpvfY9Y/2k/QbZ3TTxXdMgIRS9PRjH1gJw5UyFvk8/2zKOjkID/BFqUqF0xMxCNyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:04:29.513533Z"},"content_sha256":"bfb2895f9c09102d3f47694e227d87fe4bbfbb2d8c7347d7de520b8a72d6c40b","schema_version":"1.0","event_id":"sha256:bfb2895f9c09102d3f47694e227d87fe4bbfbb2d8c7347d7de520b8a72d6c40b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/bundle.json","state_url":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T01:04:29Z","links":{"resolver":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ","bundle":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/bundle.json","state":"https://pith.science/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEUIGL3HEC3XAQMS6JZIEJM7CZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WEUIGL3HEC3XAQMS6JZIEJM7CZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1d4bfeab72e957086c6052faa8efbadcc7293082a7087851911c9cbec7ae1247","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-08T14:36:58Z","title_canon_sha256":"97716c3e1720834cc1ecaaedd0d60cc527f278ed073b02d57fe67fb34e6de710"},"schema_version":"1.0","source":{"id":"2308.04292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.04292","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"arxiv_version","alias_value":"2308.04292v2","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.04292","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"pith_short_12","alias_value":"WEUIGL3HEC3X","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"pith_short_16","alias_value":"WEUIGL3HEC3XAQMS","created_at":"2026-07-05T07:36:02Z"},{"alias_kind":"pith_short_8","alias_value":"WEUIGL3H","created_at":"2026-07-05T07:36:02Z"}],"graph_snapshots":[{"event_id":"sha256:bfb2895f9c09102d3f47694e227d87fe4bbfbb2d8c7347d7de520b8a72d6c40b","target":"graph","created_at":"2026-07-05T07:36:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.04292/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Keisuke Okumura","cross_cats":["cs.MA","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-08T14:36:58Z","title":"Engineering LaCAM$^\\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.04292","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:55b753aa866a4bfbeb47043096bf07a0cb2ae40977add610edaf05a6aea03c3c","target":"record","created_at":"2026-07-05T07:36:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1d4bfeab72e957086c6052faa8efbadcc7293082a7087851911c9cbec7ae1247","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-08T14:36:58Z","title_canon_sha256":"97716c3e1720834cc1ecaaedd0d60cc527f278ed073b02d57fe67fb34e6de710"},"schema_version":"1.0","source":{"id":"2308.04292","kind":"arxiv","version":2}},"canonical_sha256":"b128832f6720b7704192f27282259f1666e66306a151affb8b246cf5b1fa74a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b128832f6720b7704192f27282259f1666e66306a151affb8b246cf5b1fa74a9","first_computed_at":"2026-07-05T07:36:02.312604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:36:02.312604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RuvtdH4twmi1OTEQEeaNhB6ueR7y+geNd4N+WPAwlPk3WjBLIuar2zrQzDg5wXuf2hPhugNdFXOeCyTJ56wMBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:36:02.313044Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.04292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55b753aa866a4bfbeb47043096bf07a0cb2ae40977add610edaf05a6aea03c3c","sha256:bfb2895f9c09102d3f47694e227d87fe4bbfbb2d8c7347d7de520b8a72d6c40b"],"state_sha256":"8594617c8cf4645c5f5dc64b2e6295620f4c65222e0e730c3aeacc11a40ba17d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b57UPBD6lJltjjtvsYBQvgf4vRdcMkpnytFOv9wFNIAoV9rk0dIRAaylus0dX3sHgx4mui7Q2cDFSyPhy0AVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:04:29.517599Z","bundle_sha256":"6f01ccae472e5f9eca5a7ce5c9e6cadf09442cdfe84744c31dbd271a09d5e771"}}