{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:N5RXUVGZHMTIVSTZO7WUHCCRBT","short_pith_number":"pith:N5RXUVGZ","canonical_record":{"source":{"id":"1603.03490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-10T23:50:05Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"9aa08f37c311a7a908595b912838cc90fe3fa14869674ad3d6db0769fe947a69","abstract_canon_sha256":"373fb5840f2cd61761262813811c14d1204afebcdf160a9e5175b1edd92fb7a2"},"schema_version":"1.0"},"canonical_sha256":"6f637a54d93b268aca7977ed4388510cdc3dc41af198402dfc28e2b42a300f6b","source":{"kind":"arxiv","id":"1603.03490","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03490","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03490v2","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03490","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"pith_short_12","alias_value":"N5RXUVGZHMTI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N5RXUVGZHMTIVSTZ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N5RXUVGZ","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:N5RXUVGZHMTIVSTZO7WUHCCRBT","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-10T23:50:05Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"9aa08f37c311a7a908595b912838cc90fe3fa14869674ad3d6db0769fe947a69","abstract_canon_sha256":"373fb5840f2cd61761262813811c14d1204afebcdf160a9e5175b1edd92fb7a2"},"schema_version":"1.0"},"canonical_sha256":"6f637a54d93b268aca7977ed4388510cdc3dc41af198402dfc28e2b42a300f6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:29.824185Z","signature_b64":"U1GT+YTdCeu6VyKND/ZZvzPh6qse4P4F7205s1iNlWEkRq0pMPPsRrQzdXwsGgWstwra1nbufrCJyNZ4PHPOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f637a54d93b268aca7977ed4388510cdc3dc41af198402dfc28e2b42a300f6b","last_reissued_at":"2026-05-18T01:12:29.823872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:29.823872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03490","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-18T01:12:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"khtxOsG6BYpjb6JDMFb6nS8S2Zx3OhmcKfupf/NpL1Da62ZNrbikyz4Ke0enIHIPC7sQqvKs6QDsA6asgz8MCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:46:32.570655Z"},"content_sha256":"f562dac0f68107a2afb4e98432e617930e68f85ae8a5e84652060dcea8bd2bc5","schema_version":"1.0","event_id":"sha256:f562dac0f68107a2afb4e98432e617930e68f85ae8a5e84652060dcea8bd2bc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:N5RXUVGZHMTIVSTZO7WUHCCRBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.DS","authors_text":"Christopher M. Dellin, Siddhartha S. Srinivasa","submitted_at":"2016-03-10T23:50:05Z","abstract_excerpt":"While the shortest path problem has myriad applications, the computational efficiency of suitable algorithms depends intimately on the underlying problem domain. In this paper, we focus on domains where evaluating the edge weight function dominates algorithm running time. Inspired by approaches in robotic motion planning, we define and investigate the Lazy Shortest Path class of algorithms which is differentiated by the choice of an edge selector function. We show that several algorithms in the literature are equivalent to this lazy algorithm for appropriate choice of this selector. Further, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03490","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-18T01:12:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRmEHWcKls9CNwU2MG9i0NpxTSNWtMTQsudNVpJymga6MWOEextRerWmAX3WScS4KXoLW6RlvZT2BNHuC/hLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:46:32.570998Z"},"content_sha256":"9982b4d9912ed658f1bf289e2324e204e1167be2dbe692c27a9ed66255a51c80","schema_version":"1.0","event_id":"sha256:9982b4d9912ed658f1bf289e2324e204e1167be2dbe692c27a9ed66255a51c80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5RXUVGZHMTIVSTZO7WUHCCRBT/bundle.json","state_url":"https://pith.science/pith/N5RXUVGZHMTIVSTZO7WUHCCRBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5RXUVGZHMTIVSTZO7WUHCCRBT/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-10T22:46:32Z","links":{"resolver":"https://pith.science/pith/N5RXUVGZHMTIVSTZO7WUHCCRBT","bundle":"https://pith.science/pith/N5RXUVGZHMTIVSTZO7WUHCCRBT/bundle.json","state":"https://pith.science/pith/N5RXUVGZHMTIVSTZO7WUHCCRBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5RXUVGZHMTIVSTZO7WUHCCRBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:N5RXUVGZHMTIVSTZO7WUHCCRBT","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":"373fb5840f2cd61761262813811c14d1204afebcdf160a9e5175b1edd92fb7a2","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-10T23:50:05Z","title_canon_sha256":"9aa08f37c311a7a908595b912838cc90fe3fa14869674ad3d6db0769fe947a69"},"schema_version":"1.0","source":{"id":"1603.03490","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03490","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03490v2","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03490","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"pith_short_12","alias_value":"N5RXUVGZHMTI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N5RXUVGZHMTIVSTZ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N5RXUVGZ","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:9982b4d9912ed658f1bf289e2324e204e1167be2dbe692c27a9ed66255a51c80","target":"graph","created_at":"2026-05-18T01:12:29Z","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":"While the shortest path problem has myriad applications, the computational efficiency of suitable algorithms depends intimately on the underlying problem domain. In this paper, we focus on domains where evaluating the edge weight function dominates algorithm running time. Inspired by approaches in robotic motion planning, we define and investigate the Lazy Shortest Path class of algorithms which is differentiated by the choice of an edge selector function. We show that several algorithms in the literature are equivalent to this lazy algorithm for appropriate choice of this selector. Further, w","authors_text":"Christopher M. Dellin, Siddhartha S. Srinivasa","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-10T23:50:05Z","title":"A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03490","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:f562dac0f68107a2afb4e98432e617930e68f85ae8a5e84652060dcea8bd2bc5","target":"record","created_at":"2026-05-18T01:12:29Z","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":"373fb5840f2cd61761262813811c14d1204afebcdf160a9e5175b1edd92fb7a2","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-10T23:50:05Z","title_canon_sha256":"9aa08f37c311a7a908595b912838cc90fe3fa14869674ad3d6db0769fe947a69"},"schema_version":"1.0","source":{"id":"1603.03490","kind":"arxiv","version":2}},"canonical_sha256":"6f637a54d93b268aca7977ed4388510cdc3dc41af198402dfc28e2b42a300f6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f637a54d93b268aca7977ed4388510cdc3dc41af198402dfc28e2b42a300f6b","first_computed_at":"2026-05-18T01:12:29.823872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:29.823872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U1GT+YTdCeu6VyKND/ZZvzPh6qse4P4F7205s1iNlWEkRq0pMPPsRrQzdXwsGgWstwra1nbufrCJyNZ4PHPOAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:29.824185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03490","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f562dac0f68107a2afb4e98432e617930e68f85ae8a5e84652060dcea8bd2bc5","sha256:9982b4d9912ed658f1bf289e2324e204e1167be2dbe692c27a9ed66255a51c80"],"state_sha256":"755745b8ab011e1f9d9688cf9730c2c0a1b26639ca418bee4d1617f8a5a80225"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kg2deRSsVboSKJDFoYVTpRdR2vSZzjZikuqEAVlLobbVgLaT19KAb0mC0RuXgrRwfU46Q8S3UATsWN/ITcKaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:46:32.572921Z","bundle_sha256":"3d74e24c68fb38cf81cf313d059f39201a6111ce695469b7ec5933a0ecb86e87"}}