{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M6DBCPD3IW326G4GAKDUQBDHIN","short_pith_number":"pith:M6DBCPD3","canonical_record":{"source":{"id":"1904.02795","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-04T21:24:29Z","cross_cats_sorted":[],"title_canon_sha256":"bd8a5b339c0f991a25b1dc5724b11fa871c9c189cdff942c8adf8d62989a8570","abstract_canon_sha256":"c37bab66930d137e7abae7784bae462813b5a3273d889ad30bcb6be24fd9c873"},"schema_version":"1.0"},"canonical_sha256":"6786113c7b45b7af1b860287480467435a1906abbfd3469b38fc4133357bea63","source":{"kind":"arxiv","id":"1904.02795","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02795","created_at":"2026-05-17T23:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02795v4","created_at":"2026-05-17T23:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02795","created_at":"2026-05-17T23:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"M6DBCPD3IW32","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M6DBCPD3IW326G4G","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M6DBCPD3","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M6DBCPD3IW326G4GAKDUQBDHIN","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02795","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-04T21:24:29Z","cross_cats_sorted":[],"title_canon_sha256":"bd8a5b339c0f991a25b1dc5724b11fa871c9c189cdff942c8adf8d62989a8570","abstract_canon_sha256":"c37bab66930d137e7abae7784bae462813b5a3273d889ad30bcb6be24fd9c873"},"schema_version":"1.0"},"canonical_sha256":"6786113c7b45b7af1b860287480467435a1906abbfd3469b38fc4133357bea63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:54.321957Z","signature_b64":"tASDePwvunureVQRyvWzyqd7qsvsZXDTYE4YYwO4sBguygiOSiKu5/TcfBHWFGbCNU7ohOv2BGS2rFFJV75xBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6786113c7b45b7af1b860287480467435a1906abbfd3469b38fc4133357bea63","last_reissued_at":"2026-05-17T23:39:54.321394Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:54.321394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02795","source_version":4,"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-17T23:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozAepHCWmq52MYw3mFpgw9fwZJmW7TtjvKT19bFh5mDQFgTqItf03XI8LNp+ZuDhqrVj8LwdPqJojaE+8U3dBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:46:38.386675Z"},"content_sha256":"529a5e345203d878ed299d14a87e591bbf454c359df4eec8d970e2eb342f5ec7","schema_version":"1.0","event_id":"sha256:529a5e345203d878ed299d14a87e591bbf454c359df4eec8d970e2eb342f5ec7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M6DBCPD3IW326G4GAKDUQBDHIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aditya Mandalika, Oren Salzman, Sanjiban Choudhury, Siddhartha Srinivasa","submitted_at":"2019-04-04T21:24:29Z","abstract_excerpt":"Lazy search algorithms can efficiently solve problems where edge evaluation is the bottleneck in computation, as is the case for robotic motion planning. The optimal algorithm in this class, LazySP, lazily restricts edge evaluation to only the shortest path. Doing so comes at the expense of search effort, i.e., LazySP must recompute the search tree every time an edge is found to be invalid. This becomes prohibitively expensive when dealing with large graphs or highly cluttered environments. Our key insight is the need to balance both edge evaluation and search effort to minimize the total plan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02795","kind":"arxiv","version":4},"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-17T23:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOfZpOJ1TVmKs6ZcQZQHM1DzlOUUlktR2snRpvtte6yIkNvmbc/QfRh+LsLysJIGZNicuCQI1y76Le+fw3RlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:46:38.387042Z"},"content_sha256":"0fa2ed839ad7d6f82924470cc226e28727301645b615f7ec3e197b27e175ee2d","schema_version":"1.0","event_id":"sha256:0fa2ed839ad7d6f82924470cc226e28727301645b615f7ec3e197b27e175ee2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6DBCPD3IW326G4GAKDUQBDHIN/bundle.json","state_url":"https://pith.science/pith/M6DBCPD3IW326G4GAKDUQBDHIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6DBCPD3IW326G4GAKDUQBDHIN/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-25T18:46:38Z","links":{"resolver":"https://pith.science/pith/M6DBCPD3IW326G4GAKDUQBDHIN","bundle":"https://pith.science/pith/M6DBCPD3IW326G4GAKDUQBDHIN/bundle.json","state":"https://pith.science/pith/M6DBCPD3IW326G4GAKDUQBDHIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6DBCPD3IW326G4GAKDUQBDHIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M6DBCPD3IW326G4GAKDUQBDHIN","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":"c37bab66930d137e7abae7784bae462813b5a3273d889ad30bcb6be24fd9c873","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-04T21:24:29Z","title_canon_sha256":"bd8a5b339c0f991a25b1dc5724b11fa871c9c189cdff942c8adf8d62989a8570"},"schema_version":"1.0","source":{"id":"1904.02795","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02795","created_at":"2026-05-17T23:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02795v4","created_at":"2026-05-17T23:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02795","created_at":"2026-05-17T23:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"M6DBCPD3IW32","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M6DBCPD3IW326G4G","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M6DBCPD3","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:0fa2ed839ad7d6f82924470cc226e28727301645b615f7ec3e197b27e175ee2d","target":"graph","created_at":"2026-05-17T23:39:54Z","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":"Lazy search algorithms can efficiently solve problems where edge evaluation is the bottleneck in computation, as is the case for robotic motion planning. The optimal algorithm in this class, LazySP, lazily restricts edge evaluation to only the shortest path. Doing so comes at the expense of search effort, i.e., LazySP must recompute the search tree every time an edge is found to be invalid. This becomes prohibitively expensive when dealing with large graphs or highly cluttered environments. Our key insight is the need to balance both edge evaluation and search effort to minimize the total plan","authors_text":"Aditya Mandalika, Oren Salzman, Sanjiban Choudhury, Siddhartha Srinivasa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-04T21:24:29Z","title":"Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02795","kind":"arxiv","version":4},"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:529a5e345203d878ed299d14a87e591bbf454c359df4eec8d970e2eb342f5ec7","target":"record","created_at":"2026-05-17T23:39:54Z","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":"c37bab66930d137e7abae7784bae462813b5a3273d889ad30bcb6be24fd9c873","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-04T21:24:29Z","title_canon_sha256":"bd8a5b339c0f991a25b1dc5724b11fa871c9c189cdff942c8adf8d62989a8570"},"schema_version":"1.0","source":{"id":"1904.02795","kind":"arxiv","version":4}},"canonical_sha256":"6786113c7b45b7af1b860287480467435a1906abbfd3469b38fc4133357bea63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6786113c7b45b7af1b860287480467435a1906abbfd3469b38fc4133357bea63","first_computed_at":"2026-05-17T23:39:54.321394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:54.321394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tASDePwvunureVQRyvWzyqd7qsvsZXDTYE4YYwO4sBguygiOSiKu5/TcfBHWFGbCNU7ohOv2BGS2rFFJV75xBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:54.321957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02795","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:529a5e345203d878ed299d14a87e591bbf454c359df4eec8d970e2eb342f5ec7","sha256:0fa2ed839ad7d6f82924470cc226e28727301645b615f7ec3e197b27e175ee2d"],"state_sha256":"f4ff7b2795b596c33590c209a69fcd133dea78c68d5a20b8cb29213a618691a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vByMl2NouHVA0XAlyfQuTQKexh6NA7rZav7UcDgNzssWDAcJpzA31X8L6dlt4Ib4al5j1k01KaVhfK+5Uuv9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:46:38.390310Z","bundle_sha256":"1b7e4220ed7387243cc7acecf9e44736b2833d0adb9c4f70bb71e7858c90baa6"}}