{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6BPXIERTG6OQZNGESEJA3WJHMV","short_pith_number":"pith:6BPXIERT","schema_version":"1.0","canonical_sha256":"f05f741233379d0cb4c491120dd9276559e954a52622dbfe97071bfd54acefc0","source":{"kind":"arxiv","id":"2312.16767","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2312.16767","created_at":"2026-07-05T07:29:14.446430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.16767v2","created_at":"2026-07-05T07:29:14.446430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16767","created_at":"2026-07-05T07:29:14.446430+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BPXIERTG6OQ","created_at":"2026-07-05T07:29:14.446430+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BPXIERTG6OQZNGE","created_at":"2026-07-05T07:29:14.446430+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BPXIERT","created_at":"2026-07-05T07:29:14.446430+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV","json":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV.json","graph_json":"https://pith.science/api/pith-number/6BPXIERTG6OQZNGESEJA3WJHMV/graph.json","events_json":"https://pith.science/api/pith-number/6BPXIERTG6OQZNGESEJA3WJHMV/events.json","paper":"https://pith.science/paper/6BPXIERT"},"agent_actions":{"view_html":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV","download_json":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV.json","view_paper":"https://pith.science/paper/6BPXIERT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.16767&json=true","fetch_graph":"https://pith.science/api/pith-number/6BPXIERTG6OQZNGESEJA3WJHMV/graph.json","fetch_events":"https://pith.science/api/pith-number/6BPXIERTG6OQZNGESEJA3WJHMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/action/storage_attestation","attest_author":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/action/author_attestation","sign_citation":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/action/citation_signature","submit_replication":"https://pith.science/pith/6BPXIERTG6OQZNGESEJA3WJHMV/action/replication_record"}},"created_at":"2026-07-05T07:29:14.446430+00:00","updated_at":"2026-07-05T07:29:14.446430+00:00"}