{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6TRWCVJ5WVMNSKW76IXIWAYP56","short_pith_number":"pith:6TRWCVJ5","schema_version":"1.0","canonical_sha256":"f4e361553db558d92adff22e8b030fef8b85bfcc4e975499a544911bd80c07af","source":{"kind":"arxiv","id":"1411.0257","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.0257","created_at":"2026-05-18T02:38:52.151875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0257v1","created_at":"2026-05-18T02:38:52.151875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0257","created_at":"2026-05-18T02:38:52.151875+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TRWCVJ5WVMN","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TRWCVJ5WVMNSKW7","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TRWCVJ5","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56","json":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56.json","graph_json":"https://pith.science/api/pith-number/6TRWCVJ5WVMNSKW76IXIWAYP56/graph.json","events_json":"https://pith.science/api/pith-number/6TRWCVJ5WVMNSKW76IXIWAYP56/events.json","paper":"https://pith.science/paper/6TRWCVJ5"},"agent_actions":{"view_html":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56","download_json":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56.json","view_paper":"https://pith.science/paper/6TRWCVJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0257&json=true","fetch_graph":"https://pith.science/api/pith-number/6TRWCVJ5WVMNSKW76IXIWAYP56/graph.json","fetch_events":"https://pith.science/api/pith-number/6TRWCVJ5WVMNSKW76IXIWAYP56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/action/storage_attestation","attest_author":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/action/author_attestation","sign_citation":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/action/citation_signature","submit_replication":"https://pith.science/pith/6TRWCVJ5WVMNSKW76IXIWAYP56/action/replication_record"}},"created_at":"2026-05-18T02:38:52.151875+00:00","updated_at":"2026-05-18T02:38:52.151875+00:00"}