{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7FOZVNJX5TV4TIE6PQGFMMAXFW","short_pith_number":"pith:7FOZVNJX","schema_version":"1.0","canonical_sha256":"f95d9ab537ecebc9a09e7c0c5630172daed0868bbe17d61142436488118e2e72","source":{"kind":"arxiv","id":"2407.09451","version":2},"attestation_state":"computed","paper":{"title":"Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hang Ma, Jiaoyang Li, Jiaqi Tan, Yudong Luo","submitted_at":"2024-07-12T17:34:45Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) aims to arrange collision-free goal-reaching paths for a group of agents. Anytime MAPF solvers based on large neighborhood search (LNS) have gained prominence recently due to their flexibility and scalability, leading to a surge of methods, especially those leveraging machine learning, to enhance neighborhood selection. However, several pitfalls exist and hinder a comprehensive evaluation of these new methods, which mainly include: 1) Lower than actual or incorrect baseline performance; 2) Lack of a unified evaluation setting and criterion; 3) Lack of a codebase"},"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":"2407.09451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-07-12T17:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"d7302e705dd3d75417681cbbf68aad4eff45f520cbddbd264bc3152b539f3fcf","abstract_canon_sha256":"21b67590fa00558d544131c42092c85d33942bdebe48af6997382420be89fe6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:33.253144Z","signature_b64":"8FV7LISRhC2ThiHw5rj5k17QJhuAGI6/Dg1tJESVBBY9aD6QalaqEXVskeAjS7gHoQ53Ul6RXFPNA8Tyxb0+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95d9ab537ecebc9a09e7c0c5630172daed0868bbe17d61142436488118e2e72","last_reissued_at":"2026-07-05T11:11:33.252600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:33.252600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hang Ma, Jiaoyang Li, Jiaqi Tan, Yudong Luo","submitted_at":"2024-07-12T17:34:45Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) aims to arrange collision-free goal-reaching paths for a group of agents. Anytime MAPF solvers based on large neighborhood search (LNS) have gained prominence recently due to their flexibility and scalability, leading to a surge of methods, especially those leveraging machine learning, to enhance neighborhood selection. However, several pitfalls exist and hinder a comprehensive evaluation of these new methods, which mainly include: 1) Lower than actual or incorrect baseline performance; 2) Lack of a unified evaluation setting and criterion; 3) Lack of a codebase"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09451","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/2407.09451/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":"2407.09451","created_at":"2026-07-05T11:11:33.252660+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09451v2","created_at":"2026-07-05T11:11:33.252660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09451","created_at":"2026-07-05T11:11:33.252660+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FOZVNJX5TV4","created_at":"2026-07-05T11:11:33.252660+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FOZVNJX5TV4TIE6","created_at":"2026-07-05T11:11:33.252660+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FOZVNJX","created_at":"2026-07-05T11:11:33.252660+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19219","citing_title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW","json":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW.json","graph_json":"https://pith.science/api/pith-number/7FOZVNJX5TV4TIE6PQGFMMAXFW/graph.json","events_json":"https://pith.science/api/pith-number/7FOZVNJX5TV4TIE6PQGFMMAXFW/events.json","paper":"https://pith.science/paper/7FOZVNJX"},"agent_actions":{"view_html":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW","download_json":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW.json","view_paper":"https://pith.science/paper/7FOZVNJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09451&json=true","fetch_graph":"https://pith.science/api/pith-number/7FOZVNJX5TV4TIE6PQGFMMAXFW/graph.json","fetch_events":"https://pith.science/api/pith-number/7FOZVNJX5TV4TIE6PQGFMMAXFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW/action/storage_attestation","attest_author":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW/action/author_attestation","sign_citation":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW/action/citation_signature","submit_replication":"https://pith.science/pith/7FOZVNJX5TV4TIE6PQGFMMAXFW/action/replication_record"}},"created_at":"2026-07-05T11:11:33.252660+00:00","updated_at":"2026-07-05T11:11:33.252660+00:00"}