{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PPBK7V64AJ53FDXBKCEGRZLWUS","short_pith_number":"pith:PPBK7V64","schema_version":"1.0","canonical_sha256":"7bc2afd7dc027bb28ee1508868e576a4a3c5626d264ce5f7fbc0594ed8de0cec","source":{"kind":"arxiv","id":"2408.14527","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Path Finding with Real Robot Dynamics and Interdependent Tasks for Automated Warehouses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Albert Wang, Christelle Loiodice, Seungjoon Lee, Sofia Michel, Tomi Silander, Vassilissa Lehoux-Lebacque","submitted_at":"2024-08-26T15:13:38Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is an important optimization problem underlying the deployment of robots in automated warehouses and factories. Despite the large body of work on this topic, most approaches make heavy simplifications, both on the environment and the agents, which make the resulting algorithms impractical for real-life scenarios. In this paper, we consider a realistic problem of online order delivery in a warehouse, where a fleet of robots bring the products belonging to each order from shelves to workstations. This creates a stream of inter-dependent pickup and delivery tasks a"},"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.14527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-08-26T15:13:38Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"05d9927b545e166dcfc50885ef8d112fcf89134f1c16628c5095b5691c563ebf","abstract_canon_sha256":"c61b204724d8fb9fbb971457ce3aefa265c8ed17cd7cff86d440800f5bd8c787"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:34.751242Z","signature_b64":"+b8GceHPClG65UBnk6Q13IXROY/pNb1kiq3MWIsWRoTBX5aIGqSVFpTfRPldlYPawsZab+C06HM+mGaiIpHVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bc2afd7dc027bb28ee1508868e576a4a3c5626d264ce5f7fbc0594ed8de0cec","last_reissued_at":"2026-07-05T08:59:34.750845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:34.750845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Path Finding with Real Robot Dynamics and Interdependent Tasks for Automated Warehouses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Albert Wang, Christelle Loiodice, Seungjoon Lee, Sofia Michel, Tomi Silander, Vassilissa Lehoux-Lebacque","submitted_at":"2024-08-26T15:13:38Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is an important optimization problem underlying the deployment of robots in automated warehouses and factories. Despite the large body of work on this topic, most approaches make heavy simplifications, both on the environment and the agents, which make the resulting algorithms impractical for real-life scenarios. In this paper, we consider a realistic problem of online order delivery in a warehouse, where a fleet of robots bring the products belonging to each order from shelves to workstations. This creates a stream of inter-dependent pickup and delivery tasks a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14527","kind":"arxiv","version":1},"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.14527/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.14527","created_at":"2026-07-05T08:59:34.750906+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.14527v1","created_at":"2026-07-05T08:59:34.750906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14527","created_at":"2026-07-05T08:59:34.750906+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPBK7V64AJ53","created_at":"2026-07-05T08:59:34.750906+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPBK7V64AJ53FDXB","created_at":"2026-07-05T08:59:34.750906+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPBK7V64","created_at":"2026-07-05T08:59:34.750906+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/PPBK7V64AJ53FDXBKCEGRZLWUS","json":"https://pith.science/pith/PPBK7V64AJ53FDXBKCEGRZLWUS.json","graph_json":"https://pith.science/api/pith-number/PPBK7V64AJ53FDXBKCEGRZLWUS/graph.json","events_json":"https://pith.science/api/pith-number/PPBK7V64AJ53FDXBKCEGRZLWUS/events.json","paper":"https://pith.science/paper/PPBK7V64"},"agent_actions":{"view_html":"https://pith.science/pith/PPBK7V64AJ53FDXBKCEGRZLWUS","download_json":"https://pith.science/pith/PPBK7V64AJ53FDXBKCEGRZLWUS.json","view_paper":"https://pith.science/paper/PPBK7V64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.14527&json=true","fetch_graph":"https://pith.science/api/pith-number/PPBK7V64AJ53FDXBKCEGRZLWUS/graph.json","fetch_events":"https://pith.science/api/pith-number/PPBK7V64AJ53FDXBKCEGRZLWUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPBK7V64AJ53FDXBKCEGRZLWUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPBK7V64AJ53FDXBKCEGRZLWUS/action/storage_attestation","attest_author":"https://pith.science/pith/PPBK7V64AJ53FDXBKCEGRZLWUS/action/author_attestation","sign_citation":"https://pith.science/pith/PPBK7V64AJ53FDXBKCEGRZLWUS/action/citation_signature","submit_replication":"https://pith.science/pith/PPBK7V64AJ53FDXBKCEGRZLWUS/action/replication_record"}},"created_at":"2026-07-05T08:59:34.750906+00:00","updated_at":"2026-07-05T08:59:34.750906+00:00"}