{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PYYLKKYBHCGNQNKHVEE3YCL7OM","short_pith_number":"pith:PYYLKKYB","canonical_record":{"source":{"id":"1803.04998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-13T18:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"d5f2f2cb882f40c8ccecfec72d688abd0047914e7293a3138c5e365660c4bce7","abstract_canon_sha256":"0163e99356e170b5ce3bc49d00bbe3de1ebe97058ecb964669acc4343d310cb0"},"schema_version":"1.0"},"canonical_sha256":"7e30b52b01388cd83547a909bc097f7303be440f8668d396c0f4973d13f79872","source":{"kind":"arxiv","id":"1803.04998","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04998","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04998v2","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04998","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"PYYLKKYBHCGN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PYYLKKYBHCGNQNKH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PYYLKKYB","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PYYLKKYBHCGNQNKHVEE3YCL7OM","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-13T18:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"d5f2f2cb882f40c8ccecfec72d688abd0047914e7293a3138c5e365660c4bce7","abstract_canon_sha256":"0163e99356e170b5ce3bc49d00bbe3de1ebe97058ecb964669acc4343d310cb0"},"schema_version":"1.0"},"canonical_sha256":"7e30b52b01388cd83547a909bc097f7303be440f8668d396c0f4973d13f79872","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:55.463611Z","signature_b64":"2lxqmSjqXI+dWkQRuXqdBFyKDjpXw6k3sh/JAd5FaZlsZWvkhYOwEULlDc9V1DVttKzx+ooW9YT1OIIS+4R/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e30b52b01388cd83547a909bc097f7303be440f8668d396c0f4973d13f79872","last_reissued_at":"2026-05-18T00:20:55.463100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:55.463100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04998","source_version":2,"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:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1UJHB9zFellFCJNkoaQE8lJbvjEjXpW2rGUdUzUSB60tMfmRJY5vSe/8qMqWCMuDMzAOhEhBlKjB46yS1ErCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:18:37.733028Z"},"content_sha256":"9cc9a635edb8c5781c28b0d3039645cd7dba6ff8484659dc180500a3858b9eb7","schema_version":"1.0","event_id":"sha256:9cc9a635edb8c5781c28b0d3039645cd7dba6ff8484659dc180500a3858b9eb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PYYLKKYBHCGNQNKHVEE3YCL7OM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aditya Mandalika, Oren Salzman, Siddhartha Srinivasa","submitted_at":"2018-03-13T18:26:02Z","abstract_excerpt":"Motion-planning problems, such as manipulation in cluttered environments, often require a collision-free shortest path to be computed quickly given a roadmap graph. Typically, the computational cost of evaluating whether an edge of the roadmap graph is collision-free dominates the running time of search algorithms. Algorithms such as Lazy Weighted A* (LWA*) and LazySP have been proposed to reduce the number of edge evaluations by employing a lazy lookahead (one-step lookahead and infinite-step lookahead, respectively). However, this comes at the expense of additional graph operations: the larg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04998","kind":"arxiv","version":2},"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:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NuOdfWGab4KYmKcaDxu95sUT83EvnJZdqfTRCvw+ItrqbiTtOpcZWYOnVjqQa5ogbBbZEgb2mQ1vxsk8sczFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:18:37.733721Z"},"content_sha256":"0abe914296900b0aa43f19f46b5ffcff272d6c6a9bf5958dc995e513d9bfbff8","schema_version":"1.0","event_id":"sha256:0abe914296900b0aa43f19f46b5ffcff272d6c6a9bf5958dc995e513d9bfbff8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYYLKKYBHCGNQNKHVEE3YCL7OM/bundle.json","state_url":"https://pith.science/pith/PYYLKKYBHCGNQNKHVEE3YCL7OM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYYLKKYBHCGNQNKHVEE3YCL7OM/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-26T05:18:37Z","links":{"resolver":"https://pith.science/pith/PYYLKKYBHCGNQNKHVEE3YCL7OM","bundle":"https://pith.science/pith/PYYLKKYBHCGNQNKHVEE3YCL7OM/bundle.json","state":"https://pith.science/pith/PYYLKKYBHCGNQNKHVEE3YCL7OM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYYLKKYBHCGNQNKHVEE3YCL7OM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PYYLKKYBHCGNQNKHVEE3YCL7OM","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":"0163e99356e170b5ce3bc49d00bbe3de1ebe97058ecb964669acc4343d310cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-13T18:26:02Z","title_canon_sha256":"d5f2f2cb882f40c8ccecfec72d688abd0047914e7293a3138c5e365660c4bce7"},"schema_version":"1.0","source":{"id":"1803.04998","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04998","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04998v2","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04998","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"PYYLKKYBHCGN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PYYLKKYBHCGNQNKH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PYYLKKYB","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:0abe914296900b0aa43f19f46b5ffcff272d6c6a9bf5958dc995e513d9bfbff8","target":"graph","created_at":"2026-05-18T00:20:55Z","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":"Motion-planning problems, such as manipulation in cluttered environments, often require a collision-free shortest path to be computed quickly given a roadmap graph. Typically, the computational cost of evaluating whether an edge of the roadmap graph is collision-free dominates the running time of search algorithms. Algorithms such as Lazy Weighted A* (LWA*) and LazySP have been proposed to reduce the number of edge evaluations by employing a lazy lookahead (one-step lookahead and infinite-step lookahead, respectively). However, this comes at the expense of additional graph operations: the larg","authors_text":"Aditya Mandalika, Oren Salzman, Siddhartha Srinivasa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-13T18:26:02Z","title":"Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04998","kind":"arxiv","version":2},"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:9cc9a635edb8c5781c28b0d3039645cd7dba6ff8484659dc180500a3858b9eb7","target":"record","created_at":"2026-05-18T00:20:55Z","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":"0163e99356e170b5ce3bc49d00bbe3de1ebe97058ecb964669acc4343d310cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-13T18:26:02Z","title_canon_sha256":"d5f2f2cb882f40c8ccecfec72d688abd0047914e7293a3138c5e365660c4bce7"},"schema_version":"1.0","source":{"id":"1803.04998","kind":"arxiv","version":2}},"canonical_sha256":"7e30b52b01388cd83547a909bc097f7303be440f8668d396c0f4973d13f79872","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e30b52b01388cd83547a909bc097f7303be440f8668d396c0f4973d13f79872","first_computed_at":"2026-05-18T00:20:55.463100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:55.463100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2lxqmSjqXI+dWkQRuXqdBFyKDjpXw6k3sh/JAd5FaZlsZWvkhYOwEULlDc9V1DVttKzx+ooW9YT1OIIS+4R/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:55.463611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04998","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cc9a635edb8c5781c28b0d3039645cd7dba6ff8484659dc180500a3858b9eb7","sha256:0abe914296900b0aa43f19f46b5ffcff272d6c6a9bf5958dc995e513d9bfbff8"],"state_sha256":"4db054bb2a7a2021f9c151382a0e774ae38116b75e4a783d71ae928eb2100e57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uJBnynbUC/Efm2V4M9f7L/6KKse6CRHeiWXwFDwwY8PukwDYQ50niKF+xfLquW5YiN+ho/ZkU1G1JffLrcmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:18:37.737521Z","bundle_sha256":"3e7882a1f30272783155d0c1669bc81d91725289485f4c438a96ee20f421e866"}}