{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O743RTMP2E554CC2ZIP45QX5OT","short_pith_number":"pith:O743RTMP","canonical_record":{"source":{"id":"1612.05309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-15T23:33:41Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"c5e5dbac441a762b0e112e091ae4efd8a0012dac5671417ed0f69d57f66e1622","abstract_canon_sha256":"53f45d0096f1d90e29817f2a6fb3bffb6b799cb81b5364755270e3187ce691e0"},"schema_version":"1.0"},"canonical_sha256":"77f9b8cd8fd13bde085aca1fcec2fd74c15732595804c7caaeacd07168a35202","source":{"kind":"arxiv","id":"1612.05309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05309","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05309v1","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05309","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"O743RTMP2E55","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O743RTMP2E554CC2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O743RTMP","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O743RTMP2E554CC2ZIP45QX5OT","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-15T23:33:41Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"c5e5dbac441a762b0e112e091ae4efd8a0012dac5671417ed0f69d57f66e1622","abstract_canon_sha256":"53f45d0096f1d90e29817f2a6fb3bffb6b799cb81b5364755270e3187ce691e0"},"schema_version":"1.0"},"canonical_sha256":"77f9b8cd8fd13bde085aca1fcec2fd74c15732595804c7caaeacd07168a35202","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:22.943555Z","signature_b64":"zPcRNEIGKIbfTKWm7WH6MVFuq3MOzrbvU2cfG2c9MG5M0nLHK29qbjiuWcbdJLCUbhnFJa6UxM7TKIMypecBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77f9b8cd8fd13bde085aca1fcec2fd74c15732595804c7caaeacd07168a35202","last_reissued_at":"2026-05-18T00:49:22.942962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:22.942962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05309","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:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asCl/Z/cSENH8pSp8TBteCx6udN5JwsjujqsaOJjXWAVrXJZXu4cUAJ03JPb+k3zPtSnH1E6M2+1n5V6o7JTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:56:37.685561Z"},"content_sha256":"f69f31d62b045a0f9155ec259c6c13d875562f0308492bb57bc8de9f85908c68","schema_version":"1.0","event_id":"sha256:f69f31d62b045a0f9155ec259c6c13d875562f0308492bb57bc8de9f85908c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O743RTMP2E554CC2ZIP45QX5OT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Path Finding with Delay Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Hang Ma, Sven Koenig, T. K. Satish Kumar","submitted_at":"2016-12-15T23:33:41Z","abstract_excerpt":"Several recently developed Multi-Agent Path Finding (MAPF) solvers scale to large MAPF instances by searching for MAPF plans on 2 levels: The high-level search resolves collisions between agents, and the low-level search plans paths for single agents under the constraints imposed by the high-level search. We make the following contributions to solve the MAPF problem with imperfect plan execution with small average makespans: First, we formalize the MAPF Problem with Delay Probabilities (MAPF-DP), define valid MAPF-DP plans and propose the use of robust plan-execution policies for valid MAPF-DP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05309","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:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HmvV8FacgPGc47PFdSbfZ/a4nQBTEjnuRQ3JXs9f5SFvNc+DbJLQkyDyYm+8jUgkJjyduyAcn4VGOceVRqiiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:56:37.685915Z"},"content_sha256":"a5c88dd016b84de4cd3f05a192fb090d371dadd49d35917ece4335294012900c","schema_version":"1.0","event_id":"sha256:a5c88dd016b84de4cd3f05a192fb090d371dadd49d35917ece4335294012900c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O743RTMP2E554CC2ZIP45QX5OT/bundle.json","state_url":"https://pith.science/pith/O743RTMP2E554CC2ZIP45QX5OT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O743RTMP2E554CC2ZIP45QX5OT/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-28T06:56:37Z","links":{"resolver":"https://pith.science/pith/O743RTMP2E554CC2ZIP45QX5OT","bundle":"https://pith.science/pith/O743RTMP2E554CC2ZIP45QX5OT/bundle.json","state":"https://pith.science/pith/O743RTMP2E554CC2ZIP45QX5OT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O743RTMP2E554CC2ZIP45QX5OT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O743RTMP2E554CC2ZIP45QX5OT","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":"53f45d0096f1d90e29817f2a6fb3bffb6b799cb81b5364755270e3187ce691e0","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-15T23:33:41Z","title_canon_sha256":"c5e5dbac441a762b0e112e091ae4efd8a0012dac5671417ed0f69d57f66e1622"},"schema_version":"1.0","source":{"id":"1612.05309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05309","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05309v1","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05309","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"O743RTMP2E55","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O743RTMP2E554CC2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O743RTMP","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:a5c88dd016b84de4cd3f05a192fb090d371dadd49d35917ece4335294012900c","target":"graph","created_at":"2026-05-18T00:49:22Z","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":"Several recently developed Multi-Agent Path Finding (MAPF) solvers scale to large MAPF instances by searching for MAPF plans on 2 levels: The high-level search resolves collisions between agents, and the low-level search plans paths for single agents under the constraints imposed by the high-level search. We make the following contributions to solve the MAPF problem with imperfect plan execution with small average makespans: First, we formalize the MAPF Problem with Delay Probabilities (MAPF-DP), define valid MAPF-DP plans and propose the use of robust plan-execution policies for valid MAPF-DP","authors_text":"Hang Ma, 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":"2016-12-15T23:33:41Z","title":"Multi-Agent Path Finding with Delay Probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05309","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:f69f31d62b045a0f9155ec259c6c13d875562f0308492bb57bc8de9f85908c68","target":"record","created_at":"2026-05-18T00:49:22Z","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":"53f45d0096f1d90e29817f2a6fb3bffb6b799cb81b5364755270e3187ce691e0","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-15T23:33:41Z","title_canon_sha256":"c5e5dbac441a762b0e112e091ae4efd8a0012dac5671417ed0f69d57f66e1622"},"schema_version":"1.0","source":{"id":"1612.05309","kind":"arxiv","version":1}},"canonical_sha256":"77f9b8cd8fd13bde085aca1fcec2fd74c15732595804c7caaeacd07168a35202","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77f9b8cd8fd13bde085aca1fcec2fd74c15732595804c7caaeacd07168a35202","first_computed_at":"2026-05-18T00:49:22.942962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:22.942962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zPcRNEIGKIbfTKWm7WH6MVFuq3MOzrbvU2cfG2c9MG5M0nLHK29qbjiuWcbdJLCUbhnFJa6UxM7TKIMypecBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:22.943555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f69f31d62b045a0f9155ec259c6c13d875562f0308492bb57bc8de9f85908c68","sha256:a5c88dd016b84de4cd3f05a192fb090d371dadd49d35917ece4335294012900c"],"state_sha256":"d26547c45007108895b7e343b42b6194bae3bc4c2e2cc89354e7823c34f06c58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Gktox4sCZTlUKByYRTcpjrkNwc2qnep0x/i5GQlSknC0MKJSm8U2RO8GRUM/3jpWOsMLxOUASjeYphClSZUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:56:37.688144Z","bundle_sha256":"1f934105077eae4082716276f0cfc6441c4168a378395e736e5d8b5b83047321"}}