{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7XHRWJDQNPP6VZ2GTUFQBHJXSU","short_pith_number":"pith:7XHRWJDQ","canonical_record":{"source":{"id":"1806.04216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-11T19:54:38Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"99a398e0c298cbc5c3f39486363da28501aa70a0a91fbb4666244697a0135a9c","abstract_canon_sha256":"4eb0b1da127123aecaf29730db39c9766163826b20dee6636478852af9578707"},"schema_version":"1.0"},"canonical_sha256":"fdcf1b24706bdfeae7469d0b009d37953c0b18d64fc5eed6d42f15b0a23e0f5d","source":{"kind":"arxiv","id":"1806.04216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04216","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04216v1","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04216","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"7XHRWJDQNPP6","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7XHRWJDQNPP6VZ2G","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7XHRWJDQ","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7XHRWJDQNPP6VZ2GTUFQBHJXSU","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-11T19:54:38Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"99a398e0c298cbc5c3f39486363da28501aa70a0a91fbb4666244697a0135a9c","abstract_canon_sha256":"4eb0b1da127123aecaf29730db39c9766163826b20dee6636478852af9578707"},"schema_version":"1.0"},"canonical_sha256":"fdcf1b24706bdfeae7469d0b009d37953c0b18d64fc5eed6d42f15b0a23e0f5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:36.245106Z","signature_b64":"gtKZPX+mOo3splas3L5KBTkMakbiLZTG62GPK246Vmiuhfmyi/gyzThC/i6KPYealkHqeAbQ98aEB2P9ZaXzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdcf1b24706bdfeae7469d0b009d37953c0b18d64fc5eed6d42f15b0a23e0f5d","last_reissued_at":"2026-05-18T00:13:36.244395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:36.244395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04216","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:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Wow5Dj+OYZV/h+UVNxNgR5mozVYc5WhOAIx0IAk+htCGPnGstyfUBTyh4AR9WCaespPrDTdUOuEd9JmPsbPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:33:36.802338Z"},"content_sha256":"451401015cdf0c0151d4c33c6e2370019c93215aa768a8ffd39bf13669ee5641","schema_version":"1.0","event_id":"sha256:451401015cdf0c0151d4c33c6e2370019c93215aa768a8ffd39bf13669ee5641"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7XHRWJDQNPP6VZ2GTUFQBHJXSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Path Finding with Deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Glenn Wagner, Hang Ma, Jiaoyang Li, Sven Koenig, T. K. Satish Kumar","submitted_at":"2018-06-11T19:54:38Z","abstract_excerpt":"We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04216","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:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nq9QH/3r8Oj0GLO+zB0c6QTtoOhe2rncxcEBL/IpaOko+t/9h2WD28vKNXREPZntT6365B9PnPLg3eAydK7/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:33:36.802697Z"},"content_sha256":"11dc80a2cdd522d6e63d4f228316e78ce717632731cb7a315a270d328df0d8a4","schema_version":"1.0","event_id":"sha256:11dc80a2cdd522d6e63d4f228316e78ce717632731cb7a315a270d328df0d8a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XHRWJDQNPP6VZ2GTUFQBHJXSU/bundle.json","state_url":"https://pith.science/pith/7XHRWJDQNPP6VZ2GTUFQBHJXSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XHRWJDQNPP6VZ2GTUFQBHJXSU/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-06-23T06:33:36Z","links":{"resolver":"https://pith.science/pith/7XHRWJDQNPP6VZ2GTUFQBHJXSU","bundle":"https://pith.science/pith/7XHRWJDQNPP6VZ2GTUFQBHJXSU/bundle.json","state":"https://pith.science/pith/7XHRWJDQNPP6VZ2GTUFQBHJXSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XHRWJDQNPP6VZ2GTUFQBHJXSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7XHRWJDQNPP6VZ2GTUFQBHJXSU","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":"4eb0b1da127123aecaf29730db39c9766163826b20dee6636478852af9578707","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-11T19:54:38Z","title_canon_sha256":"99a398e0c298cbc5c3f39486363da28501aa70a0a91fbb4666244697a0135a9c"},"schema_version":"1.0","source":{"id":"1806.04216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04216","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04216v1","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04216","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"7XHRWJDQNPP6","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7XHRWJDQNPP6VZ2G","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7XHRWJDQ","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:11dc80a2cdd522d6e63d4f228316e78ce717632731cb7a315a270d328df0d8a4","target":"graph","created_at":"2026-05-18T00:13:36Z","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":"We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms.","authors_text":"Ariel Felner, Glenn Wagner, 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":"2018-06-11T19:54:38Z","title":"Multi-Agent Path Finding with Deadlines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04216","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:451401015cdf0c0151d4c33c6e2370019c93215aa768a8ffd39bf13669ee5641","target":"record","created_at":"2026-05-18T00:13:36Z","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":"4eb0b1da127123aecaf29730db39c9766163826b20dee6636478852af9578707","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-11T19:54:38Z","title_canon_sha256":"99a398e0c298cbc5c3f39486363da28501aa70a0a91fbb4666244697a0135a9c"},"schema_version":"1.0","source":{"id":"1806.04216","kind":"arxiv","version":1}},"canonical_sha256":"fdcf1b24706bdfeae7469d0b009d37953c0b18d64fc5eed6d42f15b0a23e0f5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdcf1b24706bdfeae7469d0b009d37953c0b18d64fc5eed6d42f15b0a23e0f5d","first_computed_at":"2026-05-18T00:13:36.244395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:36.244395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gtKZPX+mOo3splas3L5KBTkMakbiLZTG62GPK246Vmiuhfmyi/gyzThC/i6KPYealkHqeAbQ98aEB2P9ZaXzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:36.245106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:451401015cdf0c0151d4c33c6e2370019c93215aa768a8ffd39bf13669ee5641","sha256:11dc80a2cdd522d6e63d4f228316e78ce717632731cb7a315a270d328df0d8a4"],"state_sha256":"5be7ca241926cb9d38f90d5bdd20db7938ee2a06a41732407fd725cd35305db5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozdp7vvOveNoMKGDOQYbTsaO+xKbjtAJ5zlRO+/RMt7HgupqYdoGU5OyLBZff/q69bK3kaX8U2/KHknrMWwWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T06:33:36.804725Z","bundle_sha256":"0edc503a434dbee690be91a4ef8e202cd8680fd00f730609346d4db29512fb79"}}