{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YN66PH7I5B2SAFCE7QFMQWFVCB","short_pith_number":"pith:YN66PH7I","schema_version":"1.0","canonical_sha256":"c37de79fe8e875201444fc0ac858b5106f4fac2fad7591a5fdfc14393b9804fc","source":{"kind":"arxiv","id":"1401.2690","version":1},"attestation_state":"computed","paper":{"title":"Distance Landmarks Revisited for Road Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haixun Wang, Jianxin Li, Jinpeng Huai, Kaiyu Feng, Shuai Ma","submitted_at":"2014-01-13T00:56:12Z","abstract_excerpt":"Computing shortest distances is one of the fundamental problems on graphs, and remains a {\\em challenging} task today. {\\em Distance} {\\em landmarks} have been recently studied for shortest distance queries with an auxiliary data structure, referred to as {\\em landmark} {\\em covers}. This paper studies how to apply distance landmarks for fast {\\em exact} shortest distance query answering on large road graphs. However, the {\\em direct} application of distance landmarks is {\\em impractical} due to the high space and time cost. To rectify this problem, we investigate novel techniques that can be "},"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":"1401.2690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2014-01-13T00:56:12Z","cross_cats_sorted":[],"title_canon_sha256":"bf54880aa23d09dc9d9386030d7d20ad2aba4d90c9e6274e88eda21ef4f6cf2b","abstract_canon_sha256":"e22ecdff49458f982d4f5fff0dd5b93b12c179b7b02ff1c385e309281261278c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:32.517867Z","signature_b64":"TcNo8vMN7sQ5qA+yTTUf+KvLoREdeA0iXVTb331e5ZR3bRyCZW3ken/rBFALJg6KG176R85QgPcNA7lGGlHfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c37de79fe8e875201444fc0ac858b5106f4fac2fad7591a5fdfc14393b9804fc","last_reissued_at":"2026-05-18T03:02:32.516951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:32.516951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance Landmarks Revisited for Road Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haixun Wang, Jianxin Li, Jinpeng Huai, Kaiyu Feng, Shuai Ma","submitted_at":"2014-01-13T00:56:12Z","abstract_excerpt":"Computing shortest distances is one of the fundamental problems on graphs, and remains a {\\em challenging} task today. {\\em Distance} {\\em landmarks} have been recently studied for shortest distance queries with an auxiliary data structure, referred to as {\\em landmark} {\\em covers}. This paper studies how to apply distance landmarks for fast {\\em exact} shortest distance query answering on large road graphs. However, the {\\em direct} application of distance landmarks is {\\em impractical} due to the high space and time cost. To rectify this problem, we investigate novel techniques that can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2690","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":"1401.2690","created_at":"2026-05-18T03:02:32.517107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2690v1","created_at":"2026-05-18T03:02:32.517107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2690","created_at":"2026-05-18T03:02:32.517107+00:00"},{"alias_kind":"pith_short_12","alias_value":"YN66PH7I5B2S","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YN66PH7I5B2SAFCE","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YN66PH7I","created_at":"2026-05-18T12:28:57.508820+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/YN66PH7I5B2SAFCE7QFMQWFVCB","json":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB.json","graph_json":"https://pith.science/api/pith-number/YN66PH7I5B2SAFCE7QFMQWFVCB/graph.json","events_json":"https://pith.science/api/pith-number/YN66PH7I5B2SAFCE7QFMQWFVCB/events.json","paper":"https://pith.science/paper/YN66PH7I"},"agent_actions":{"view_html":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB","download_json":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB.json","view_paper":"https://pith.science/paper/YN66PH7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2690&json=true","fetch_graph":"https://pith.science/api/pith-number/YN66PH7I5B2SAFCE7QFMQWFVCB/graph.json","fetch_events":"https://pith.science/api/pith-number/YN66PH7I5B2SAFCE7QFMQWFVCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/action/storage_attestation","attest_author":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/action/author_attestation","sign_citation":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/action/citation_signature","submit_replication":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/action/replication_record"}},"created_at":"2026-05-18T03:02:32.517107+00:00","updated_at":"2026-05-18T03:02:32.517107+00:00"}