{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WPR5JH6FEY3IOVSZ6YBIBUMUJQ","short_pith_number":"pith:WPR5JH6F","schema_version":"1.0","canonical_sha256":"b3e3d49fc52636875659f60280d1944c0c97c263260e061b8d8d1493a0887b70","source":{"kind":"arxiv","id":"2405.17794","version":3},"attestation_state":"computed","paper":{"title":"LNS2+RL: Combining Multi-Agent Reinforcement Learning with Large Neighborhood Search in Multi-Agent Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Guillaume Sartoretti, Jiaoyang Li, Tanishq Duhan, Yutong Wang","submitted_at":"2024-05-28T03:45:32Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is a critical component of logistics and warehouse management, which focuses on planning collision-free paths for a team of robots in a known environment. Recent work introduced a novel MAPF approach, LNS2, which proposed to repair a quickly obtained set of infeasible paths via iterative replanning, by relying on a fast, yet lower-quality, prioritized planning (PP) algorithm. At the same time, there has been a recent push for Multi-Agent Reinforcement Learning (MARL) based MAPF algorithms, which exhibit improved cooperation over such PP algorithms, although inev"},"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":"2405.17794","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-05-28T03:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"f4f7723ae94f6adc05bac08f3022afeda56adafe327958b0e5b700f48112e17a","abstract_canon_sha256":"222727b013cc789a35e15bd1f9b854932aa7a34a91bc0a3f6e67d36bf4595b6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:41.725514Z","signature_b64":"N4cwa1WMfxhuj3DlJvtOvGMKey/up1qJzV8/r+XqMu29xBEzY4HY0CaCI9NIQ7Mba+N55OzTAXRzxr1A9imMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3e3d49fc52636875659f60280d1944c0c97c263260e061b8d8d1493a0887b70","last_reissued_at":"2026-07-05T10:07:41.725016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:41.725016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LNS2+RL: Combining Multi-Agent Reinforcement Learning with Large Neighborhood Search in Multi-Agent Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Guillaume Sartoretti, Jiaoyang Li, Tanishq Duhan, Yutong Wang","submitted_at":"2024-05-28T03:45:32Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is a critical component of logistics and warehouse management, which focuses on planning collision-free paths for a team of robots in a known environment. Recent work introduced a novel MAPF approach, LNS2, which proposed to repair a quickly obtained set of infeasible paths via iterative replanning, by relying on a fast, yet lower-quality, prioritized planning (PP) algorithm. At the same time, there has been a recent push for Multi-Agent Reinforcement Learning (MARL) based MAPF algorithms, which exhibit improved cooperation over such PP algorithms, although inev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17794","kind":"arxiv","version":3},"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/2405.17794/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":"2405.17794","created_at":"2026-07-05T10:07:41.725073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17794v3","created_at":"2026-07-05T10:07:41.725073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17794","created_at":"2026-07-05T10:07:41.725073+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPR5JH6FEY3I","created_at":"2026-07-05T10:07:41.725073+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPR5JH6FEY3IOVSZ","created_at":"2026-07-05T10:07:41.725073+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPR5JH6F","created_at":"2026-07-05T10:07:41.725073+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":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ","json":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ.json","graph_json":"https://pith.science/api/pith-number/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/graph.json","events_json":"https://pith.science/api/pith-number/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/events.json","paper":"https://pith.science/paper/WPR5JH6F"},"agent_actions":{"view_html":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ","download_json":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ.json","view_paper":"https://pith.science/paper/WPR5JH6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17794&json=true","fetch_graph":"https://pith.science/api/pith-number/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/action/storage_attestation","attest_author":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/action/author_attestation","sign_citation":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/action/citation_signature","submit_replication":"https://pith.science/pith/WPR5JH6FEY3IOVSZ6YBIBUMUJQ/action/replication_record"}},"created_at":"2026-07-05T10:07:41.725073+00:00","updated_at":"2026-07-05T10:07:41.725073+00:00"}