{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:COLNVJ3A6YKWZ6F3NAAR7KVEAY","short_pith_number":"pith:COLNVJ3A","canonical_record":{"source":{"id":"1805.04961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-13T21:44:19Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"61cc5e9954afdf85edd30582131c14dd50a0a907828101178dd94fd03f6eb6b5","abstract_canon_sha256":"7a69a3e83cb8076bddbe0c4dd841bc1c1b2a79e1307f17c7d1007bc9c0783522"},"schema_version":"1.0"},"canonical_sha256":"1396daa760f6156cf8bb68011faaa4062125a424622ace749bbdfa0a96bbcf66","source":{"kind":"arxiv","id":"1805.04961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04961","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04961v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04961","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"COLNVJ3A6YKW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"COLNVJ3A6YKWZ6F3","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"COLNVJ3A","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:COLNVJ3A6YKWZ6F3NAAR7KVEAY","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-13T21:44:19Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"61cc5e9954afdf85edd30582131c14dd50a0a907828101178dd94fd03f6eb6b5","abstract_canon_sha256":"7a69a3e83cb8076bddbe0c4dd841bc1c1b2a79e1307f17c7d1007bc9c0783522"},"schema_version":"1.0"},"canonical_sha256":"1396daa760f6156cf8bb68011faaa4062125a424622ace749bbdfa0a96bbcf66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.230653Z","signature_b64":"/s+Kpky2+L094p0SeMKi5V0CNh6QLUG2JXGosZxeSyQcpBh4DdGoZS7/3TsCCfXi9o1UMwvzi64oCIRQ78WgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1396daa760f6156cf8bb68011faaa4062125a424622ace749bbdfa0a96bbcf66","last_reissued_at":"2026-05-18T00:16:04.230004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.230004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04961","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:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0GZ6VSSaCHxejyoTtyeaRkixdSXGbmcKwIrnWxhLPdMLn5CYNDmnMTJeJ/z44aRLkIfy8SzalVV23bHEZdFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:51:25.886684Z"},"content_sha256":"245a12aa434a0c19a5a0caa1005395a7debd440799479a910c4d0113d9c57095","schema_version":"1.0","event_id":"sha256:245a12aa434a0c19a5a0caa1005395a7debd440799479a910c4d0113d9c57095"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:COLNVJ3A6YKWZ6F3NAAR7KVEAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Path Finding with Deadlines: Preliminary Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Glenn Wagner, Hang Ma, Jiaoyang Li, Sven Koenig, T. K. Satish Kumar","submitted_at":"2018-05-13T21:44:19Z","abstract_excerpt":"We formalize the problem of 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 a given deadline, without colliding with each other. We first show that the MAPF-DL problem is NP-hard to solve optimally. We then present an optimal MAPF-DL algorithm based on a reduction of the MAPF-DL problem to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04961","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:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYBtXJpXWXCVZbeZtuHAKnwg6Mz6SjK9KcGKfTDl3e5SwObMzs/4gteBSAz42jPb/Tpv/tR+fPLNBAogJ2YlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:51:25.887061Z"},"content_sha256":"2c093b503e992cf58b36aab98c7d02840402798f515a8ee0f3dc2a834bac00c1","schema_version":"1.0","event_id":"sha256:2c093b503e992cf58b36aab98c7d02840402798f515a8ee0f3dc2a834bac00c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COLNVJ3A6YKWZ6F3NAAR7KVEAY/bundle.json","state_url":"https://pith.science/pith/COLNVJ3A6YKWZ6F3NAAR7KVEAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COLNVJ3A6YKWZ6F3NAAR7KVEAY/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-02T11:51:25Z","links":{"resolver":"https://pith.science/pith/COLNVJ3A6YKWZ6F3NAAR7KVEAY","bundle":"https://pith.science/pith/COLNVJ3A6YKWZ6F3NAAR7KVEAY/bundle.json","state":"https://pith.science/pith/COLNVJ3A6YKWZ6F3NAAR7KVEAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COLNVJ3A6YKWZ6F3NAAR7KVEAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:COLNVJ3A6YKWZ6F3NAAR7KVEAY","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":"7a69a3e83cb8076bddbe0c4dd841bc1c1b2a79e1307f17c7d1007bc9c0783522","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-13T21:44:19Z","title_canon_sha256":"61cc5e9954afdf85edd30582131c14dd50a0a907828101178dd94fd03f6eb6b5"},"schema_version":"1.0","source":{"id":"1805.04961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04961","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04961v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04961","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"COLNVJ3A6YKW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"COLNVJ3A6YKWZ6F3","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"COLNVJ3A","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:2c093b503e992cf58b36aab98c7d02840402798f515a8ee0f3dc2a834bac00c1","target":"graph","created_at":"2026-05-18T00:16:04Z","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 the problem of 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 a given deadline, without colliding with each other. We first show that the MAPF-DL problem is NP-hard to solve optimally. We then present an optimal MAPF-DL algorithm based on a reduction of the MAPF-DL problem to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network.","authors_text":"Ariel Felner, Glenn Wagner, Hang Ma, Jiaoyang Li, Sven Koenig, T. K. Satish Kumar","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-13T21:44:19Z","title":"Multi-Agent Path Finding with Deadlines: Preliminary Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04961","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:245a12aa434a0c19a5a0caa1005395a7debd440799479a910c4d0113d9c57095","target":"record","created_at":"2026-05-18T00:16:04Z","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":"7a69a3e83cb8076bddbe0c4dd841bc1c1b2a79e1307f17c7d1007bc9c0783522","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-13T21:44:19Z","title_canon_sha256":"61cc5e9954afdf85edd30582131c14dd50a0a907828101178dd94fd03f6eb6b5"},"schema_version":"1.0","source":{"id":"1805.04961","kind":"arxiv","version":1}},"canonical_sha256":"1396daa760f6156cf8bb68011faaa4062125a424622ace749bbdfa0a96bbcf66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1396daa760f6156cf8bb68011faaa4062125a424622ace749bbdfa0a96bbcf66","first_computed_at":"2026-05-18T00:16:04.230004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:04.230004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/s+Kpky2+L094p0SeMKi5V0CNh6QLUG2JXGosZxeSyQcpBh4DdGoZS7/3TsCCfXi9o1UMwvzi64oCIRQ78WgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:04.230653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:245a12aa434a0c19a5a0caa1005395a7debd440799479a910c4d0113d9c57095","sha256:2c093b503e992cf58b36aab98c7d02840402798f515a8ee0f3dc2a834bac00c1"],"state_sha256":"2f11590304ecdc3845a3d8a48391f78638071db8677b4b2defc98dc9dabfa574"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zy69o1kZ0ki0ohMg6ykUE19RlefPSxNiDKUZWyQV7g2ZLv5/9MXPjelkJtA5jKPPU6B/FR8qM0UkgkhsPy60CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:51:25.889067Z","bundle_sha256":"a964fbaef593fe49a7167f544f622a7ae413307177a215c79754ac1224a925c3"}}