{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6TRWCVJ5WVMNSKW76IXIWAYP56","short_pith_number":"pith:6TRWCVJ5","canonical_record":{"source":{"id":"1411.0257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-02T14:16:44Z","cross_cats_sorted":[],"title_canon_sha256":"2420b915ca72b1fb87584f6f96bf2669b2c92de1ed26a8feaeb72687ce57c5fd","abstract_canon_sha256":"79e88cb6f5c3da76df6c52111e513c729eafa5cb3049175deed507faf02f10d7"},"schema_version":"1.0"},"canonical_sha256":"f4e361553db558d92adff22e8b030fef8b85bfcc4e975499a544911bd80c07af","source":{"kind":"arxiv","id":"1411.0257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0257","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0257v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0257","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"6TRWCVJ5WVMN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6TRWCVJ5WVMNSKW7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6TRWCVJ5","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6TRWCVJ5WVMNSKW76IXIWAYP56","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-02T14:16:44Z","cross_cats_sorted":[],"title_canon_sha256":"2420b915ca72b1fb87584f6f96bf2669b2c92de1ed26a8feaeb72687ce57c5fd","abstract_canon_sha256":"79e88cb6f5c3da76df6c52111e513c729eafa5cb3049175deed507faf02f10d7"},"schema_version":"1.0"},"canonical_sha256":"f4e361553db558d92adff22e8b030fef8b85bfcc4e975499a544911bd80c07af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:52.152375Z","signature_b64":"PkkTFbTKRAvXsWSXxwux0gBUnvZkkOr7TkE5uBmEY+rYTI17dRa0oU4AUy9Z6Obd1wx41i0qUWQnE6dAUhrmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4e361553db558d92adff22e8b030fef8b85bfcc4e975499a544911bd80c07af","last_reissued_at":"2026-05-18T02:38:52.151787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:52.151787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0257","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-18T02:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2jVglee09zl0zDWmHicjOCZ6Fu4a/EV3+eFYeK1AhxeryTmRe+0/K/2XwZCUc2qxzk9pUyAVnz1mlh0jn31Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:42:38.126982Z"},"content_sha256":"9152ba1043a060ff6c5d1672c1be49862bfdd34c173c93af54bab05ced7d374c","schema_version":"1.0","event_id":"sha256:9152ba1043a060ff6c5d1672c1be49862bfdd34c173c93af54bab05ced7d374c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6TRWCVJ5WVMNSKW76IXIWAYP56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SALT. A unified framework for all shortest-path query variants on road networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandros Efentakis, Dieter Pfoser, Yannis Vassiliou","submitted_at":"2014-11-02T14:16:44Z","abstract_excerpt":"Although recent scientific output focuses on multiple shortest-path problem definitions for road networks, none of the existing solutions does efficiently answer all different types of SP queries. This work proposes SALT, a novel framework that not only efficiently answers SP related queries but also k-nearest neighbor queries not handled by previous approaches. Our solution offers all the benefits needed for practical use-cases, including excellent query performance and very short preprocessing times, thus making it also a viable option for dynamic road networks, i.e., edge weights changing f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0257","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-18T02:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrKnBUzdJxK1a4EoG+H3lDxZ3lwO0eh/PnuRwRSphSWfEquuL7PEFtVpsPF8dJ3sKPd04kqskRALS0i72d7/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:42:38.127339Z"},"content_sha256":"1fa904c18cd06d6026002912a4ab868226baac9e89ba155a61b672faa5783a7f","schema_version":"1.0","event_id":"sha256:1fa904c18cd06d6026002912a4ab868226baac9e89ba155a61b672faa5783a7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/bundle.json","state_url":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/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-22T11:42:38Z","links":{"resolver":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56","bundle":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/bundle.json","state":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6TRWCVJ5WVMNSKW76IXIWAYP56","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":"79e88cb6f5c3da76df6c52111e513c729eafa5cb3049175deed507faf02f10d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-02T14:16:44Z","title_canon_sha256":"2420b915ca72b1fb87584f6f96bf2669b2c92de1ed26a8feaeb72687ce57c5fd"},"schema_version":"1.0","source":{"id":"1411.0257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0257","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0257v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0257","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"6TRWCVJ5WVMN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6TRWCVJ5WVMNSKW7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6TRWCVJ5","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:1fa904c18cd06d6026002912a4ab868226baac9e89ba155a61b672faa5783a7f","target":"graph","created_at":"2026-05-18T02:38:52Z","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":"Although recent scientific output focuses on multiple shortest-path problem definitions for road networks, none of the existing solutions does efficiently answer all different types of SP queries. This work proposes SALT, a novel framework that not only efficiently answers SP related queries but also k-nearest neighbor queries not handled by previous approaches. Our solution offers all the benefits needed for practical use-cases, including excellent query performance and very short preprocessing times, thus making it also a viable option for dynamic road networks, i.e., edge weights changing f","authors_text":"Alexandros Efentakis, Dieter Pfoser, Yannis Vassiliou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-02T14:16:44Z","title":"SALT. A unified framework for all shortest-path query variants on road networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0257","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:9152ba1043a060ff6c5d1672c1be49862bfdd34c173c93af54bab05ced7d374c","target":"record","created_at":"2026-05-18T02:38:52Z","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":"79e88cb6f5c3da76df6c52111e513c729eafa5cb3049175deed507faf02f10d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-02T14:16:44Z","title_canon_sha256":"2420b915ca72b1fb87584f6f96bf2669b2c92de1ed26a8feaeb72687ce57c5fd"},"schema_version":"1.0","source":{"id":"1411.0257","kind":"arxiv","version":1}},"canonical_sha256":"f4e361553db558d92adff22e8b030fef8b85bfcc4e975499a544911bd80c07af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4e361553db558d92adff22e8b030fef8b85bfcc4e975499a544911bd80c07af","first_computed_at":"2026-05-18T02:38:52.151787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:52.151787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PkkTFbTKRAvXsWSXxwux0gBUnvZkkOr7TkE5uBmEY+rYTI17dRa0oU4AUy9Z6Obd1wx41i0qUWQnE6dAUhrmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:52.152375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9152ba1043a060ff6c5d1672c1be49862bfdd34c173c93af54bab05ced7d374c","sha256:1fa904c18cd06d6026002912a4ab868226baac9e89ba155a61b672faa5783a7f"],"state_sha256":"c9ea656315a4d2181f17291a4db5db0861ea1cb9c9caab1775dba5c3204d8eb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/intvg54qgmEweNryR/nNvef5tzt0Ci/mx0V9EC7h4xFjD8unO4+BpkRLc5e+ebGVI7jKJaNS/4m+wyvAXaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:42:38.129280Z","bundle_sha256":"93fa8573f9155d31259ee8824ead65835d7262368c95fb09582c1fa72aced51d"}}