{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L7ZX35MTOIK74GFPDNASLR6OAK","short_pith_number":"pith:L7ZX35MT","canonical_record":{"source":{"id":"1706.02794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"dc2abdfb189ab82d170d1fdb04fe2461185d02c8aab81c781ee140f6ad7a53b6","abstract_canon_sha256":"e590d6fdb345c4d66a1b58fd479e6750090a3e0cee18feeb85d399265fa1d475"},"schema_version":"1.0"},"canonical_sha256":"5ff37df5937215fe18af1b4125c7ce028fc4e4adc650c3415e6f7c38d99415f4","source":{"kind":"arxiv","id":"1706.02794","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02794","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02794v1","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02794","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"L7ZX35MTOIK7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L7ZX35MTOIK74GFP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L7ZX35MT","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L7ZX35MTOIK74GFPDNASLR6OAK","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"dc2abdfb189ab82d170d1fdb04fe2461185d02c8aab81c781ee140f6ad7a53b6","abstract_canon_sha256":"e590d6fdb345c4d66a1b58fd479e6750090a3e0cee18feeb85d399265fa1d475"},"schema_version":"1.0"},"canonical_sha256":"5ff37df5937215fe18af1b4125c7ce028fc4e4adc650c3415e6f7c38d99415f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:40.895811Z","signature_b64":"5EhijOAi+9mBUnIpUxmdg8B6+yDok+CJ3MHQ4eZnP8R6NM8kZfR+3KsQs1dEM6XU48Ys58eRAzp4WGli3CGHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ff37df5937215fe18af1b4125c7ce028fc4e4adc650c3415e6f7c38d99415f4","last_reissued_at":"2026-05-18T00:42:40.895186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:40.895186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02794","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:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8AMqzPKFqhBBoRciNhxa/rzfvl/kem4wnsAWaCKrv8dkNxwKuc2BFldyl3vKNssIL2pSgpPJEqRhQSQEmU6WDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:23:44.836363Z"},"content_sha256":"e1c2b99280efaeb352d9c95927bc11c36b80bd58d8ecc540227f6a4409e2e55c","schema_version":"1.0","event_id":"sha256:e1c2b99280efaeb352d9c95927bc11c36b80bd58d8ecc540227f6a4409e2e55c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L7ZX35MTOIK74GFPDNASLR6OAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rapid Randomized Restarts for Multi-Agent Path Finding Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Glenn Wagner, Howie Choset, Liron Cohen, Sven Koenig, T.K. Satish Kumar","submitted_at":"2017-06-08T23:31:01Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is an NP-hard problem well studied in artificial intelligence and robotics. It has many real-world applications for which existing MAPF solvers use various heuristics. However, these solvers are deterministic and perform poorly on \"hard\" instances typically characterized by many agents interfering with each other in a small region. In this paper, we enhance MAPF solvers with randomization and observe that they exhibit heavy-tailed distributions of runtimes on hard instances. This leads us to develop simple rapid randomized restart (RRR) strategies with the intui"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02794","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:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xhv7uOF02Kjx3Rhs8PmYshsCQG/FL5sKYlvkxrbqXc5h3whyvPJu9bkQMoVLkBvGMcFeg3a6erL368Gq2qsWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:23:44.836716Z"},"content_sha256":"79529cade11c11af2ce88e7b7d1e73e5ce71957bcdeb1579cce0205c72cd58a7","schema_version":"1.0","event_id":"sha256:79529cade11c11af2ce88e7b7d1e73e5ce71957bcdeb1579cce0205c72cd58a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7ZX35MTOIK74GFPDNASLR6OAK/bundle.json","state_url":"https://pith.science/pith/L7ZX35MTOIK74GFPDNASLR6OAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7ZX35MTOIK74GFPDNASLR6OAK/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-22T14:23:44Z","links":{"resolver":"https://pith.science/pith/L7ZX35MTOIK74GFPDNASLR6OAK","bundle":"https://pith.science/pith/L7ZX35MTOIK74GFPDNASLR6OAK/bundle.json","state":"https://pith.science/pith/L7ZX35MTOIK74GFPDNASLR6OAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7ZX35MTOIK74GFPDNASLR6OAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L7ZX35MTOIK74GFPDNASLR6OAK","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":"e590d6fdb345c4d66a1b58fd479e6750090a3e0cee18feeb85d399265fa1d475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:31:01Z","title_canon_sha256":"dc2abdfb189ab82d170d1fdb04fe2461185d02c8aab81c781ee140f6ad7a53b6"},"schema_version":"1.0","source":{"id":"1706.02794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02794","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02794v1","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02794","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"L7ZX35MTOIK7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L7ZX35MTOIK74GFP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L7ZX35MT","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:79529cade11c11af2ce88e7b7d1e73e5ce71957bcdeb1579cce0205c72cd58a7","target":"graph","created_at":"2026-05-18T00:42:40Z","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":"Multi-Agent Path Finding (MAPF) is an NP-hard problem well studied in artificial intelligence and robotics. It has many real-world applications for which existing MAPF solvers use various heuristics. However, these solvers are deterministic and perform poorly on \"hard\" instances typically characterized by many agents interfering with each other in a small region. In this paper, we enhance MAPF solvers with randomization and observe that they exhibit heavy-tailed distributions of runtimes on hard instances. This leads us to develop simple rapid randomized restart (RRR) strategies with the intui","authors_text":"Glenn Wagner, Howie Choset, Liron Cohen, Sven Koenig, T.K. Satish Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:31:01Z","title":"Rapid Randomized Restarts for Multi-Agent Path Finding Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02794","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:e1c2b99280efaeb352d9c95927bc11c36b80bd58d8ecc540227f6a4409e2e55c","target":"record","created_at":"2026-05-18T00:42:40Z","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":"e590d6fdb345c4d66a1b58fd479e6750090a3e0cee18feeb85d399265fa1d475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:31:01Z","title_canon_sha256":"dc2abdfb189ab82d170d1fdb04fe2461185d02c8aab81c781ee140f6ad7a53b6"},"schema_version":"1.0","source":{"id":"1706.02794","kind":"arxiv","version":1}},"canonical_sha256":"5ff37df5937215fe18af1b4125c7ce028fc4e4adc650c3415e6f7c38d99415f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ff37df5937215fe18af1b4125c7ce028fc4e4adc650c3415e6f7c38d99415f4","first_computed_at":"2026-05-18T00:42:40.895186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:40.895186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5EhijOAi+9mBUnIpUxmdg8B6+yDok+CJ3MHQ4eZnP8R6NM8kZfR+3KsQs1dEM6XU48Ys58eRAzp4WGli3CGHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:40.895811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1c2b99280efaeb352d9c95927bc11c36b80bd58d8ecc540227f6a4409e2e55c","sha256:79529cade11c11af2ce88e7b7d1e73e5ce71957bcdeb1579cce0205c72cd58a7"],"state_sha256":"afb5f036ff5fb520d9e51e5ff86f3ebd11292dfdc7863db8cf574470e3a764c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Enmr4OaQvjdwaaAP6og30Mkteq4c6WoD3FmC6S/WsHIVZJBnmuNhaQhAVMRrGypbZwpgS3HXfNSNiKaaLqBWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:23:44.838682Z","bundle_sha256":"82018e0cb45433ec5f0d2d037e9aabb474b7ccc825faea1167ca844633c4ee0e"}}