{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7S2BEX6RQ5AAKUQIUWVZEP3E7G","short_pith_number":"pith:7S2BEX6R","canonical_record":{"source":{"id":"2305.03632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-05-05T15:43:20Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"ba8c6a7c51e68e4ef16d8ef5938c64f7d9d51f0b2bac4bf4753453fafe6680b4","abstract_canon_sha256":"ea52b4c1ef25bd30f9c25fc251c1fdc84670181467be4d56b7d90f18e4b84afe"},"schema_version":"1.0"},"canonical_sha256":"fcb4125fd18740055208a5ab923f64f99af2fe8daa2ba4d9925f4a3f61593e15","source":{"kind":"arxiv","id":"2305.03632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.03632","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"2305.03632v1","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.03632","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"7S2BEX6RQ5AA","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"pith_short_16","alias_value":"7S2BEX6RQ5AAKUQI","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"pith_short_8","alias_value":"7S2BEX6R","created_at":"2026-07-05T06:07:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7S2BEX6RQ5AAKUQIUWVZEP3E7G","target":"record","payload":{"canonical_record":{"source":{"id":"2305.03632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-05-05T15:43:20Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"ba8c6a7c51e68e4ef16d8ef5938c64f7d9d51f0b2bac4bf4753453fafe6680b4","abstract_canon_sha256":"ea52b4c1ef25bd30f9c25fc251c1fdc84670181467be4d56b7d90f18e4b84afe"},"schema_version":"1.0"},"canonical_sha256":"fcb4125fd18740055208a5ab923f64f99af2fe8daa2ba4d9925f4a3f61593e15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:25.562892Z","signature_b64":"K95R27Yf3mGGg6b4KuO0lZNcYxTXRh6RteRN1Zl7Zfw4svHMYfnR0grZfc974/IQ5fVlJp3fvNFkBXNhVagHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb4125fd18740055208a5ab923f64f99af2fe8daa2ba4d9925f4a3f61593e15","last_reissued_at":"2026-07-05T06:07:25.562404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:25.562404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.03632","source_version":1,"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-05T06:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rE9hkIqNOP2GSNhTIiGbjW/VeLxwORRoF+z6R9dN9fw4hB6WskrCk3A1Uehz19O0zoYfqAwnSlcCQanQFhmrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T19:02:09.066433Z"},"content_sha256":"33b1b3481184828b09e82ae06964bdb3333e0ac854c0f7be62f7b6fa9a1493d3","schema_version":"1.0","event_id":"sha256:33b1b3481184828b09e82ae06964bdb3333e0ac854c0f7be62f7b6fa9a1493d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7S2BEX6RQ5AAKUQIUWVZEP3E7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving LaCAM for Scalable Eventually 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-05-05T15:43:20Z","abstract_excerpt":"This study extends the recently-developed LaCAM algorithm for multi-agent pathfinding (MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor generation to dramatically reduce the planning effort. We present two enhancements. First, we propose its anytime version, called LaCAM*, which eventually converges to optima, provided that solution costs are accumulated transition costs. Second, we improve the successor generation to quickly obtain initial solutions. Exhaustive experiments demonstrate their utility. For instance, LaCAM* sub-optimally solved 99% of the instances re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.03632","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/2305.03632/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-05T06:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5ZgGtoU1xjBK3Yl0PgJ7uZRpSxX+Y7FWLrako5SrWL5HK6IGVfBn/LqbAW3/Rj+QLvKga88c2be9HqPNI8gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T19:02:09.066947Z"},"content_sha256":"26121543674110a2d8ffa4f4145864a8c92c43e7ee6f6e4e256798341e20a7fe","schema_version":"1.0","event_id":"sha256:26121543674110a2d8ffa4f4145864a8c92c43e7ee6f6e4e256798341e20a7fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/bundle.json","state_url":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/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-13T19:02:09Z","links":{"resolver":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G","bundle":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/bundle.json","state":"https://pith.science/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7S2BEX6RQ5AAKUQIUWVZEP3E7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7S2BEX6RQ5AAKUQIUWVZEP3E7G","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":"ea52b4c1ef25bd30f9c25fc251c1fdc84670181467be4d56b7d90f18e4b84afe","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-05-05T15:43:20Z","title_canon_sha256":"ba8c6a7c51e68e4ef16d8ef5938c64f7d9d51f0b2bac4bf4753453fafe6680b4"},"schema_version":"1.0","source":{"id":"2305.03632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.03632","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"2305.03632v1","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.03632","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"7S2BEX6RQ5AA","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"pith_short_16","alias_value":"7S2BEX6RQ5AAKUQI","created_at":"2026-07-05T06:07:25Z"},{"alias_kind":"pith_short_8","alias_value":"7S2BEX6R","created_at":"2026-07-05T06:07:25Z"}],"graph_snapshots":[{"event_id":"sha256:26121543674110a2d8ffa4f4145864a8c92c43e7ee6f6e4e256798341e20a7fe","target":"graph","created_at":"2026-07-05T06:07:25Z","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/2305.03632/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This study extends the recently-developed LaCAM algorithm for multi-agent pathfinding (MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor generation to dramatically reduce the planning effort. We present two enhancements. First, we propose its anytime version, called LaCAM*, which eventually converges to optima, provided that solution costs are accumulated transition costs. Second, we improve the successor generation to quickly obtain initial solutions. Exhaustive experiments demonstrate their utility. For instance, LaCAM* sub-optimally solved 99% of the instances re","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-05-05T15:43:20Z","title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.03632","kind":"arxiv","version":1},"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:33b1b3481184828b09e82ae06964bdb3333e0ac854c0f7be62f7b6fa9a1493d3","target":"record","created_at":"2026-07-05T06:07:25Z","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":"ea52b4c1ef25bd30f9c25fc251c1fdc84670181467be4d56b7d90f18e4b84afe","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-05-05T15:43:20Z","title_canon_sha256":"ba8c6a7c51e68e4ef16d8ef5938c64f7d9d51f0b2bac4bf4753453fafe6680b4"},"schema_version":"1.0","source":{"id":"2305.03632","kind":"arxiv","version":1}},"canonical_sha256":"fcb4125fd18740055208a5ab923f64f99af2fe8daa2ba4d9925f4a3f61593e15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcb4125fd18740055208a5ab923f64f99af2fe8daa2ba4d9925f4a3f61593e15","first_computed_at":"2026-07-05T06:07:25.562404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:07:25.562404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K95R27Yf3mGGg6b4KuO0lZNcYxTXRh6RteRN1Zl7Zfw4svHMYfnR0grZfc974/IQ5fVlJp3fvNFkBXNhVagHAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:07:25.562892Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.03632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33b1b3481184828b09e82ae06964bdb3333e0ac854c0f7be62f7b6fa9a1493d3","sha256:26121543674110a2d8ffa4f4145864a8c92c43e7ee6f6e4e256798341e20a7fe"],"state_sha256":"d15937592df3873309b3d821d3b08e26a324b65ab2ef04dc420204e395bf9d94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjF4lOTD14qQGm9Qms3yOeDKVWKaE8a1k4oda05o9SdufBLcLzNxUpxw0QOpbAwscxDE6fyBk+mJw8sKzfK/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T19:02:09.086119Z","bundle_sha256":"79a947b7aab1c5e2e5af1407a4772ea75b63d4a70d627e64be7de17fc3460057"}}