{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4VV2ICM5OUAZTOFCDFXGDOOG2D","short_pith_number":"pith:4VV2ICM5","canonical_record":{"source":{"id":"1705.10868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-30T21:08:16Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"6815bd4726b244ea8fdc160e7a60367bafbf84d65d6c25360ffff68fdba72ccd","abstract_canon_sha256":"a12ac408a8f9e9764a4b46e3cd5c5188a1783cb1ce6f267e0838cbaf9050baec"},"schema_version":"1.0"},"canonical_sha256":"e56ba4099d750199b8a2196e61b9c6d0db6edeb3d3fb76fca0592b8a4bc3faf7","source":{"kind":"arxiv","id":"1705.10868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10868","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10868v1","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10868","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"4VV2ICM5OUAZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VV2ICM5OUAZTOFC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VV2ICM5","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4VV2ICM5OUAZTOFCDFXGDOOG2D","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-30T21:08:16Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"6815bd4726b244ea8fdc160e7a60367bafbf84d65d6c25360ffff68fdba72ccd","abstract_canon_sha256":"a12ac408a8f9e9764a4b46e3cd5c5188a1783cb1ce6f267e0838cbaf9050baec"},"schema_version":"1.0"},"canonical_sha256":"e56ba4099d750199b8a2196e61b9c6d0db6edeb3d3fb76fca0592b8a4bc3faf7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:20.028255Z","signature_b64":"PmKHcrO2PfgNohW+t5SVETanwCeReARHyImCseKQZGK4WWkvnq/N/3T/83+Ck11ckwxDO96hOCJZHgF92vk+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e56ba4099d750199b8a2196e61b9c6d0db6edeb3d3fb76fca0592b8a4bc3faf7","last_reissued_at":"2026-05-18T00:43:20.027661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:20.027661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10868","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfPQDN0WklD03x2RIleURyDIZ3L14k/E9M52nExhqxLrTnW/sXesWpt7SgniA0WC+COERcOzW8CG0CmKQmgpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:56:02.775007Z"},"content_sha256":"c73cf15e443eaa72ac403f4f17f57404cb4fda3a5a3ae73f9b56fb5d7af2b8cc","schema_version":"1.0","event_id":"sha256:c73cf15e443eaa72ac403f4f17f57404cb4fda3a5a3ae73f9b56fb5d7af2b8cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4VV2ICM5OUAZTOFCDFXGDOOG2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Hang Ma, Jiaoyang Li, Sven Koenig, T. K. Satish Kumar","submitted_at":"2017-05-30T21:08:16Z","abstract_excerpt":"The multi-agent path-finding (MAPF) problem has recently received a lot of attention. However, it does not capture important characteristics of many real-world domains, such as automated warehouses, where agents are constantly engaged with new tasks. In this paper, we therefore study a lifelong version of the MAPF problem, called the multi-agent pickup and delivery (MAPD) problem. In the MAPD problem, agents have to attend to a stream of delivery tasks in an online setting. One agent has to be assigned to each delivery task. This agent has to first move to a given pickup location and then to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10868","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Khk7saxOR4OgQb36FEYxfiz5W3D532V61OaRqKcXaF/z7at27DscXAmi7QX1dYw19gVDV7Ss168DXa0dQL7TCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:56:02.775643Z"},"content_sha256":"45b605f47845439dc6063d0ca4c14fe631261b16fec1a34bc55d44ed01d83e39","schema_version":"1.0","event_id":"sha256:45b605f47845439dc6063d0ca4c14fe631261b16fec1a34bc55d44ed01d83e39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/bundle.json","state_url":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T15:56:02Z","links":{"resolver":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D","bundle":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/bundle.json","state":"https://pith.science/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VV2ICM5OUAZTOFCDFXGDOOG2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4VV2ICM5OUAZTOFCDFXGDOOG2D","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":"a12ac408a8f9e9764a4b46e3cd5c5188a1783cb1ce6f267e0838cbaf9050baec","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-30T21:08:16Z","title_canon_sha256":"6815bd4726b244ea8fdc160e7a60367bafbf84d65d6c25360ffff68fdba72ccd"},"schema_version":"1.0","source":{"id":"1705.10868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10868","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10868v1","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10868","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"4VV2ICM5OUAZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VV2ICM5OUAZTOFC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VV2ICM5","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:45b605f47845439dc6063d0ca4c14fe631261b16fec1a34bc55d44ed01d83e39","target":"graph","created_at":"2026-05-18T00:43:20Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The multi-agent path-finding (MAPF) problem has recently received a lot of attention. However, it does not capture important characteristics of many real-world domains, such as automated warehouses, where agents are constantly engaged with new tasks. In this paper, we therefore study a lifelong version of the MAPF problem, called the multi-agent pickup and delivery (MAPD) problem. In the MAPD problem, agents have to attend to a stream of delivery tasks in an online setting. One agent has to be assigned to each delivery task. This agent has to first move to a given pickup location and then to a","authors_text":"Hang Ma, Jiaoyang Li, Sven Koenig, T. K. Satish Kumar","cross_cats":["cs.MA","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-30T21:08:16Z","title":"Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10868","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c73cf15e443eaa72ac403f4f17f57404cb4fda3a5a3ae73f9b56fb5d7af2b8cc","target":"record","created_at":"2026-05-18T00:43:20Z","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":"a12ac408a8f9e9764a4b46e3cd5c5188a1783cb1ce6f267e0838cbaf9050baec","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-30T21:08:16Z","title_canon_sha256":"6815bd4726b244ea8fdc160e7a60367bafbf84d65d6c25360ffff68fdba72ccd"},"schema_version":"1.0","source":{"id":"1705.10868","kind":"arxiv","version":1}},"canonical_sha256":"e56ba4099d750199b8a2196e61b9c6d0db6edeb3d3fb76fca0592b8a4bc3faf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e56ba4099d750199b8a2196e61b9c6d0db6edeb3d3fb76fca0592b8a4bc3faf7","first_computed_at":"2026-05-18T00:43:20.027661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:20.027661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PmKHcrO2PfgNohW+t5SVETanwCeReARHyImCseKQZGK4WWkvnq/N/3T/83+Ck11ckwxDO96hOCJZHgF92vk+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:20.028255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c73cf15e443eaa72ac403f4f17f57404cb4fda3a5a3ae73f9b56fb5d7af2b8cc","sha256:45b605f47845439dc6063d0ca4c14fe631261b16fec1a34bc55d44ed01d83e39"],"state_sha256":"3bb51866a8b133edadf5ab4daf8d3acc65c1ebd2dea8c8c38633a1c6a46070df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1aiFDwsEV393FP9eoCiCfG1R6YB4IjzN4B9E9Hn5HKXXtNe/dgVK6lJ6MhGr6yebyENnFdYH/RrI7PpE3DnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:56:02.778958Z","bundle_sha256":"6d2b29cb4c0f9c8869d3bf525c759fb78cfcf0103fa6644d6387ccc26c3dd61f"}}