{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4AAWVGJIVCF6KMAK5S44XESSPZ","short_pith_number":"pith:4AAWVGJI","schema_version":"1.0","canonical_sha256":"e0016a9928a88be5300aecb9cb92527e4aae1cee87f2ca26af7f7a4829794cd0","source":{"kind":"arxiv","id":"1304.2576","version":2},"attestation_state":"computed","paper":{"title":"Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Andy Diwen Zhu, Hui Ma, Shuigeng Zhou, Siqiang Luo, Xiaokui Xiao, Youze Tang","submitted_at":"2013-04-09T13:14:38Z","abstract_excerpt":"Given two locations $s$ and $t$ in a road network, a distance query returns the minimum network distance from $s$ to $t$, while a shortest path query computes the actual route that achieves the minimum distance. These two types of queries find important applications in practice, and a plethora of solutions have been proposed in past few decades. The existing solutions, however, are optimized for either practical or asymptotic performance, but not both. In particular, the techniques with enhanced practical efficiency are mostly heuristic-based, and they offer unattractive worst-case guarantees "},"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":"1304.2576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-09T13:14:38Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"bf04a773410dc286ab7b161b8a09ffcbceb09b1e4ab621c9785064ee6aecece9","abstract_canon_sha256":"68c8a7245839e2286ef7c68851bd4bf0d440abe6e21b62be314f6b7a0b83e1ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.324488Z","signature_b64":"PfS43grUkZlo5NNR3BQn6vq0wIIwtYkAKgxng/9026xO+hvtbIPJ34G2NyOC7fVdy7/PqwzH0RqqX2N1E6NUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0016a9928a88be5300aecb9cb92527e4aae1cee87f2ca26af7f7a4829794cd0","last_reissued_at":"2026-05-18T03:27:13.323730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.323730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Andy Diwen Zhu, Hui Ma, Shuigeng Zhou, Siqiang Luo, Xiaokui Xiao, Youze Tang","submitted_at":"2013-04-09T13:14:38Z","abstract_excerpt":"Given two locations $s$ and $t$ in a road network, a distance query returns the minimum network distance from $s$ to $t$, while a shortest path query computes the actual route that achieves the minimum distance. These two types of queries find important applications in practice, and a plethora of solutions have been proposed in past few decades. The existing solutions, however, are optimized for either practical or asymptotic performance, but not both. In particular, the techniques with enhanced practical efficiency are mostly heuristic-based, and they offer unattractive worst-case guarantees "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2576","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.2576","created_at":"2026-05-18T03:27:13.323856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2576v2","created_at":"2026-05-18T03:27:13.323856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2576","created_at":"2026-05-18T03:27:13.323856+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AAWVGJIVCF6","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AAWVGJIVCF6KMAK","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AAWVGJI","created_at":"2026-05-18T12:27:32.513160+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/4AAWVGJIVCF6KMAK5S44XESSPZ","json":"https://pith.science/pith/4AAWVGJIVCF6KMAK5S44XESSPZ.json","graph_json":"https://pith.science/api/pith-number/4AAWVGJIVCF6KMAK5S44XESSPZ/graph.json","events_json":"https://pith.science/api/pith-number/4AAWVGJIVCF6KMAK5S44XESSPZ/events.json","paper":"https://pith.science/paper/4AAWVGJI"},"agent_actions":{"view_html":"https://pith.science/pith/4AAWVGJIVCF6KMAK5S44XESSPZ","download_json":"https://pith.science/pith/4AAWVGJIVCF6KMAK5S44XESSPZ.json","view_paper":"https://pith.science/paper/4AAWVGJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2576&json=true","fetch_graph":"https://pith.science/api/pith-number/4AAWVGJIVCF6KMAK5S44XESSPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4AAWVGJIVCF6KMAK5S44XESSPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AAWVGJIVCF6KMAK5S44XESSPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AAWVGJIVCF6KMAK5S44XESSPZ/action/storage_attestation","attest_author":"https://pith.science/pith/4AAWVGJIVCF6KMAK5S44XESSPZ/action/author_attestation","sign_citation":"https://pith.science/pith/4AAWVGJIVCF6KMAK5S44XESSPZ/action/citation_signature","submit_replication":"https://pith.science/pith/4AAWVGJIVCF6KMAK5S44XESSPZ/action/replication_record"}},"created_at":"2026-05-18T03:27:13.323856+00:00","updated_at":"2026-05-18T03:27:13.323856+00:00"}