{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6BPXIERTG6OQZNGESEJA3WJHMV","short_pith_number":"pith:6BPXIERT","canonical_record":{"source":{"id":"2312.16767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-28T01:24:42Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"fb67a1921fbfdaacb670672a0eb7e578c884834bd815a6d87f41c969a350c9a2","abstract_canon_sha256":"76fdc230d75c316436b0401d58f97e3e514c33258f616782ded3b47774db73a6"},"schema_version":"1.0"},"canonical_sha256":"f05f741233379d0cb4c491120dd9276559e954a52622dbfe97071bfd54acefc0","source":{"kind":"arxiv","id":"2312.16767","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16767","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16767v2","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16767","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"6BPXIERTG6OQ","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"6BPXIERTG6OQZNGE","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"6BPXIERT","created_at":"2026-07-05T07:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6BPXIERTG6OQZNGESEJA3WJHMV","target":"record","payload":{"canonical_record":{"source":{"id":"2312.16767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-28T01:24:42Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"fb67a1921fbfdaacb670672a0eb7e578c884834bd815a6d87f41c969a350c9a2","abstract_canon_sha256":"76fdc230d75c316436b0401d58f97e3e514c33258f616782ded3b47774db73a6"},"schema_version":"1.0"},"canonical_sha256":"f05f741233379d0cb4c491120dd9276559e954a52622dbfe97071bfd54acefc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:14.446826Z","signature_b64":"S+yVkh8eUxej3LtsszVjcEdAJrfwQ2f3cGCOM2RFX74dpfXaLLJL+2OdqbCix1M5P6o89wtLLPcPVU7KiNjzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f05f741233379d0cb4c491120dd9276559e954a52622dbfe97071bfd54acefc0","last_reissued_at":"2026-07-05T07:29:14.446368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:14.446368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.16767","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:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhZuzAhhscQeZh/JNvUI0MqVrC7Pdw9EZhOsEM5W64pOGhrBY9+FSSXKD5f4JZV27bBVbEzUhC/0yR0RJzRmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T02:52:04.443969Z"},"content_sha256":"633fd14eccf57d61550631b23a5ae1566f0c82c8f23ff9ab32cff5754ec6ae90","schema_version":"1.0","event_id":"sha256:633fd14eccf57d61550631b23a5ae1566f0c82c8f23ff9ab32cff5754ec6ae90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6BPXIERTG6OQZNGESEJA3WJHMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Bistra Dilkina, Sven Koenig, Taoan Huang, Thomy Phan","submitted_at":"2023-12-28T01:24:42Z","abstract_excerpt":"Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in large-scale multi-agent systems. State-of-the-art anytime MAPF is based on Large Neighborhood Search (LNS), where a fast initial solution is iteratively optimized by destroying and repairing a fixed number of parts, i.e., the neighborhood, of the solution, using randomized destroy heuristics and prioritized planning. Despite their recent success in various MAPF instances, current LNS-based approaches lack exploration and flexibility due to greedy optimization with a fixed neighborhood size which ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16767","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/2312.16767/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:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQQUovmM2xHhVMTDXo94o0/bY+n6qHKzM0N2dlbON/4D4fGiPESJnAFbSqknH3Kk8kZtPujQgWsJCVAKj6UgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T02:52:04.444453Z"},"content_sha256":"d223cb4506e55b417bb4a40f1d41ecf3ac8e209134e5023822595afe5deb1fc6","schema_version":"1.0","event_id":"sha256:d223cb4506e55b417bb4a40f1d41ecf3ac8e209134e5023822595afe5deb1fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/bundle.json","state_url":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BPXIERTG6OQZNGESEJA3WJHMV/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-01T02:52:04Z","links":{"resolver":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV","bundle":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/bundle.json","state":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BPXIERTG6OQZNGESEJA3WJHMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6BPXIERTG6OQZNGESEJA3WJHMV","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":"76fdc230d75c316436b0401d58f97e3e514c33258f616782ded3b47774db73a6","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-28T01:24:42Z","title_canon_sha256":"fb67a1921fbfdaacb670672a0eb7e578c884834bd815a6d87f41c969a350c9a2"},"schema_version":"1.0","source":{"id":"2312.16767","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16767","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16767v2","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16767","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"6BPXIERTG6OQ","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"6BPXIERTG6OQZNGE","created_at":"2026-07-05T07:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"6BPXIERT","created_at":"2026-07-05T07:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:d223cb4506e55b417bb4a40f1d41ecf3ac8e209134e5023822595afe5deb1fc6","target":"graph","created_at":"2026-07-05T07:29:14Z","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/2312.16767/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in large-scale multi-agent systems. State-of-the-art anytime MAPF is based on Large Neighborhood Search (LNS), where a fast initial solution is iteratively optimized by destroying and repairing a fixed number of parts, i.e., the neighborhood, of the solution, using randomized destroy heuristics and prioritized planning. Despite their recent success in various MAPF instances, current LNS-based approaches lack exploration and flexibility due to greedy optimization with a fixed neighborhood size which ca","authors_text":"Bistra Dilkina, Sven Koenig, Taoan Huang, Thomy Phan","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-28T01:24:42Z","title":"Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16767","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:633fd14eccf57d61550631b23a5ae1566f0c82c8f23ff9ab32cff5754ec6ae90","target":"record","created_at":"2026-07-05T07:29:14Z","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":"76fdc230d75c316436b0401d58f97e3e514c33258f616782ded3b47774db73a6","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-28T01:24:42Z","title_canon_sha256":"fb67a1921fbfdaacb670672a0eb7e578c884834bd815a6d87f41c969a350c9a2"},"schema_version":"1.0","source":{"id":"2312.16767","kind":"arxiv","version":2}},"canonical_sha256":"f05f741233379d0cb4c491120dd9276559e954a52622dbfe97071bfd54acefc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f05f741233379d0cb4c491120dd9276559e954a52622dbfe97071bfd54acefc0","first_computed_at":"2026-07-05T07:29:14.446368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:29:14.446368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S+yVkh8eUxej3LtsszVjcEdAJrfwQ2f3cGCOM2RFX74dpfXaLLJL+2OdqbCix1M5P6o89wtLLPcPVU7KiNjzAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:29:14.446826Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.16767","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:633fd14eccf57d61550631b23a5ae1566f0c82c8f23ff9ab32cff5754ec6ae90","sha256:d223cb4506e55b417bb4a40f1d41ecf3ac8e209134e5023822595afe5deb1fc6"],"state_sha256":"91f854aaee6127cf5e1c076b60b435a3757ce00e05cc3de7a3e0fa039d148d5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovuZjFC8keFS9s/zI2gICy2aNkrMZpUiw8nyZ6AVXTeBcUztCTVVioBZsj/vDyPiXX4UBrqRVTlvhRRgTvEgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T02:52:04.447242Z","bundle_sha256":"fe5704a2014e83c0898316273c8881cdb29965397a7d5157865e28c71c771686"}}