{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IAKM6TAVDEAOF6WCWBFQFVWI7Q","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":"6f19535c80b882afaca847ba8c7ed6f926342388dda061cc7ad79243197e40f0","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-15T09:55:35Z","title_canon_sha256":"87ca1dcd65c40788d936e60edd4fc54568e1349cd7329a6db2c51e28f3bbce0e"},"schema_version":"1.0","source":{"id":"2605.15799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15799","created_at":"2026-05-20T00:01:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15799v1","created_at":"2026-05-20T00:01:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15799","created_at":"2026-05-20T00:01:18Z"},{"alias_kind":"pith_short_12","alias_value":"IAKM6TAVDEAO","created_at":"2026-05-20T00:01:18Z"},{"alias_kind":"pith_short_16","alias_value":"IAKM6TAVDEAOF6WC","created_at":"2026-05-20T00:01:18Z"},{"alias_kind":"pith_short_8","alias_value":"IAKM6TAV","created_at":"2026-05-20T00:01:18Z"}],"graph_snapshots":[{"event_id":"sha256:abb3640e1de6149fe383a7052778addbe1a04c00f946427561627abb546a0f49","target":"graph","created_at":"2026-05-20T00:01:18Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our experiments reveal that PP and LNS2 struggle to solve instances with many agents, while PIBT-based approaches achieve preferable scalability with increased solution cost."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The four listed constraints (straight motion only, multi-step rotations, acceleration/deceleration, and follower-collision prohibition) are assumed to be sufficient to close the main reality gaps for differential-drive AGVs while remaining tractable for discrete search."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Adapts PP, LNS2, PIBT and LaCAM to MAWPF with AGV motion constraints and shows PIBT variants scale better than PP or LNS2 at the cost of longer paths."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Adapting MAPF for warehouse AGVs with motion constraints shows PIBT scales better than PP or LNS2 for large teams."}],"snapshot_sha256":"214e6dcac31d07a271eefef0844663d1b115d9312271c227367108479d1d76ab"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:01:37.572379Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:19.016873Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.739400Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.903004Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15799/integrity.json","findings":[],"snapshot_sha256":"c3c02c809d566c139173be3d09367fb232db6e9778104e8230bea41791f1fe0c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-agent pathfinding (MAPF) under one-shot planning is a core component of warehouse automation, yet classical formulations typically assume four-connected 2D grids with unit-time moves in four directions. To fill reality gaps while still being trackable with discrete combinatorial search, this work proposes a more practical counterpart tailored to differential-drive AGVs. We term this multi-agent warehouse pathfinding (MAWPF), featured with four constraints: (i) agent actions are restricted to straight motion and in-place rotation; (ii) rotations require multi-step costs; (iii) acceleratio","authors_text":"Hiroki Nagai, Keisuke Okumura","cross_cats":["cs.RO"],"headline":"Adapting MAPF for warehouse AGVs with motion constraints shows PIBT scales better than PP or LNS2 for large teams.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-15T09:55:35Z","title":"From Gridworlds to Warehouses: Adapting Lightweight One-shot Multi-Agent Pathfinding for AGVs"},"references":{"count":21,"internal_anchors":1,"resolved_work":21,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Prioritized sipp for multi-agent path finding with kinematic constraints","work_id":"607124bc-df15-4b13-b7c8-39cfe2b4565f","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"The league of robot runners competition: Goals, designs, and implementation","work_id":"b4c384cc-d293-4ae1-87c2-c1962d0d9d55","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A multiagent approach to autonomous intersection manage- ment.Journal of Artificial Intelligence Research (JAIR),","work_id":"c1d09c4f-f5c6-480c-a28d-3588b885ac72","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"On multiple moving objects.Al- gorithmica,","work_id":"a81fd6ae-18c9-443d-ad31-78994c88831b","year":1987},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"[Hartet al., 1968 ] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths.IEEE Transactions on Systems Science and Cybernetics,","work_id":"50fcf795-a45b-4b46-ae0b-0bbba030f6c1","year":1968}],"snapshot_sha256":"1bed11826791ad476b3ab9083518cc531d55ec8b2d9ce19838e02feb2886e666"},"source":{"id":"2605.15799","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:54:20.877118Z","id":"6491181a-4cc5-4d7d-a09c-fee53ae75412","model_set":{"reader":"grok-4.3"},"one_line_summary":"Adapts PP, LNS2, PIBT and LaCAM to MAWPF with AGV motion constraints and shows PIBT variants scale better than PP or LNS2 at the cost of longer paths.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Adapting MAPF for warehouse AGVs with motion constraints shows PIBT scales better than PP or LNS2 for large teams.","strongest_claim":"Our experiments reveal that PP and LNS2 struggle to solve instances with many agents, while PIBT-based approaches achieve preferable scalability with increased solution cost.","weakest_assumption":"The four listed constraints (straight motion only, multi-step rotations, acceleration/deceleration, and follower-collision prohibition) are assumed to be sufficient to close the main reality gaps for differential-drive AGVs while remaining tractable for discrete search."}},"verdict_id":"6491181a-4cc5-4d7d-a09c-fee53ae75412"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:055e216455b4a87ad3f88e280742208131211f9ab7a7cfd704213400b015d500","target":"record","created_at":"2026-05-20T00:01:18Z","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":"6f19535c80b882afaca847ba8c7ed6f926342388dda061cc7ad79243197e40f0","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-15T09:55:35Z","title_canon_sha256":"87ca1dcd65c40788d936e60edd4fc54568e1349cd7329a6db2c51e28f3bbce0e"},"schema_version":"1.0","source":{"id":"2605.15799","kind":"arxiv","version":1}},"canonical_sha256":"4014cf4c151900e2fac2b04b02d6c8fc22dd2f6a76f8f6db91906b19cac9550e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4014cf4c151900e2fac2b04b02d6c8fc22dd2f6a76f8f6db91906b19cac9550e","first_computed_at":"2026-05-20T00:01:18.950447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:18.950447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xrIXiwJ5SjPXVC6VzOOGoMi8W53ONcCSTXKho0HVH8zYdtO8UfHxQujGqC9e/FTxoc8s2ka5+V2WXRLvNdNPAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:18.951860Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:055e216455b4a87ad3f88e280742208131211f9ab7a7cfd704213400b015d500","sha256:abb3640e1de6149fe383a7052778addbe1a04c00f946427561627abb546a0f49"],"state_sha256":"d26594c299d4b1887b4a1213929c31e4466692147edffc9051c81d029fe9cacb"}