{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JBUWLXVRHZNZ23GMX3IRUX6PA5","short_pith_number":"pith:JBUWLXVR","schema_version":"1.0","canonical_sha256":"486965deb13e5b9d6cccbed11a5fcf076812b6f8ed981b865f31cf7e39ee71ee","source":{"kind":"arxiv","id":"2408.02960","version":2},"attestation_state":"computed","paper":{"title":"Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benran Zhang, Shao-Hung Chan, Sven Koenig, Thomy Phan","submitted_at":"2024-08-06T05:15:35Z","abstract_excerpt":"Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems. MAPF-LNS, based on Large Neighborhood Search (LNS), is the current state-of-the-art approach where a fast initial solution is iteratively optimized by destroying and repairing selected paths of the solution. Current MAPF-LNS variants commonly use an adaptive selection mechanism to choose among multiple destroy heuristics. However, to determine promising destroy heuristics, MAPF-LNS requires a considerable amount of exploration time. As common destroy heuristics are non-adaptive"},"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":"2408.02960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-06T05:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"8fd5e867f6b379765524523852093e48947925fc6eeab3c4246482550b56499d","abstract_canon_sha256":"61c5d6649c98d410a81a3e53fef2b5ebd3f850ab06c9550585af7aa67f5e7ab0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:32.393954Z","signature_b64":"yDdkrIA4nNvGp54/kFwMJZ6cup9SQ1XKWq+09Qs4SxnAdvof0gqtUobXjjfrAjQsrGPU82ldVlmXHt/Sce9RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"486965deb13e5b9d6cccbed11a5fcf076812b6f8ed981b865f31cf7e39ee71ee","last_reissued_at":"2026-07-05T09:50:32.393448Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:32.393448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benran Zhang, Shao-Hung Chan, Sven Koenig, Thomy Phan","submitted_at":"2024-08-06T05:15:35Z","abstract_excerpt":"Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems. MAPF-LNS, based on Large Neighborhood Search (LNS), is the current state-of-the-art approach where a fast initial solution is iteratively optimized by destroying and repairing selected paths of the solution. Current MAPF-LNS variants commonly use an adaptive selection mechanism to choose among multiple destroy heuristics. However, to determine promising destroy heuristics, MAPF-LNS requires a considerable amount of exploration time. As common destroy heuristics are non-adaptive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.02960","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/2408.02960/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":"2408.02960","created_at":"2026-07-05T09:50:32.393504+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.02960v2","created_at":"2026-07-05T09:50:32.393504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.02960","created_at":"2026-07-05T09:50:32.393504+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBUWLXVRHZNZ","created_at":"2026-07-05T09:50:32.393504+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBUWLXVRHZNZ23GM","created_at":"2026-07-05T09:50:32.393504+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBUWLXVR","created_at":"2026-07-05T09:50:32.393504+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/JBUWLXVRHZNZ23GMX3IRUX6PA5","json":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5.json","graph_json":"https://pith.science/api/pith-number/JBUWLXVRHZNZ23GMX3IRUX6PA5/graph.json","events_json":"https://pith.science/api/pith-number/JBUWLXVRHZNZ23GMX3IRUX6PA5/events.json","paper":"https://pith.science/paper/JBUWLXVR"},"agent_actions":{"view_html":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5","download_json":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5.json","view_paper":"https://pith.science/paper/JBUWLXVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.02960&json=true","fetch_graph":"https://pith.science/api/pith-number/JBUWLXVRHZNZ23GMX3IRUX6PA5/graph.json","fetch_events":"https://pith.science/api/pith-number/JBUWLXVRHZNZ23GMX3IRUX6PA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/action/storage_attestation","attest_author":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/action/author_attestation","sign_citation":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/action/citation_signature","submit_replication":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/action/replication_record"}},"created_at":"2026-07-05T09:50:32.393504+00:00","updated_at":"2026-07-05T09:50:32.393504+00:00"}