{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YN66PH7I5B2SAFCE7QFMQWFVCB","short_pith_number":"pith:YN66PH7I","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"},"canonical_sha256":"c37de79fe8e875201444fc0ac858b5106f4fac2fad7591a5fdfc14393b9804fc","source":{"kind":"arxiv","id":"1401.2690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2690","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2690v1","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2690","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"YN66PH7I5B2S","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YN66PH7I5B2SAFCE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YN66PH7I","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YN66PH7I5B2SAFCE7QFMQWFVCB","target":"record","payload":{"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"},"canonical_sha256":"c37de79fe8e875201444fc0ac858b5106f4fac2fad7591a5fdfc14393b9804fc","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"},"source_kind":"arxiv","source_id":"1401.2690","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-18T03:02:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QN8jRz9EkDFplq1T4/1/ivawMU36GH160K/I9qDHGAkCYPgSQRACMDSKhrNGC77p1rYUJUA4JnMm2a15XpTqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:55:34.000969Z"},"content_sha256":"c531055747b840c471b000f6cad22457d34f037606783bffb5b389002103f1a4","schema_version":"1.0","event_id":"sha256:c531055747b840c471b000f6cad22457d34f037606783bffb5b389002103f1a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YN66PH7I5B2SAFCE7QFMQWFVCB","target":"graph","payload":{"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"},"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-18T03:02:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlcV42c2Hxmg5aodI7QqcgecD0tLzvhXTwicy6cjgGkr+xj04QgCW2Y1mQbkoq+j9B9FinInWsi78lL+JZ9pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:55:34.001654Z"},"content_sha256":"a8b3be19ca2a2b0bf84781e48dfb6e6ba9448ddf7dcec59fd5ca3bf4a81a8047","schema_version":"1.0","event_id":"sha256:a8b3be19ca2a2b0bf84781e48dfb6e6ba9448ddf7dcec59fd5ca3bf4a81a8047"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/bundle.json","state_url":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/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-04T22:55:34Z","links":{"resolver":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB","bundle":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/bundle.json","state":"https://pith.science/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YN66PH7I5B2SAFCE7QFMQWFVCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YN66PH7I5B2SAFCE7QFMQWFVCB","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":"e22ecdff49458f982d4f5fff0dd5b93b12c179b7b02ff1c385e309281261278c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2014-01-13T00:56:12Z","title_canon_sha256":"bf54880aa23d09dc9d9386030d7d20ad2aba4d90c9e6274e88eda21ef4f6cf2b"},"schema_version":"1.0","source":{"id":"1401.2690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2690","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2690v1","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2690","created_at":"2026-05-18T03:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"YN66PH7I5B2S","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YN66PH7I5B2SAFCE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YN66PH7I","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:a8b3be19ca2a2b0bf84781e48dfb6e6ba9448ddf7dcec59fd5ca3bf4a81a8047","target":"graph","created_at":"2026-05-18T03:02:32Z","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":"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 ","authors_text":"Haixun Wang, Jianxin Li, Jinpeng Huai, Kaiyu Feng, Shuai Ma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2014-01-13T00:56:12Z","title":"Distance Landmarks Revisited for Road Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2690","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:c531055747b840c471b000f6cad22457d34f037606783bffb5b389002103f1a4","target":"record","created_at":"2026-05-18T03:02:32Z","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":"e22ecdff49458f982d4f5fff0dd5b93b12c179b7b02ff1c385e309281261278c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DB","submitted_at":"2014-01-13T00:56:12Z","title_canon_sha256":"bf54880aa23d09dc9d9386030d7d20ad2aba4d90c9e6274e88eda21ef4f6cf2b"},"schema_version":"1.0","source":{"id":"1401.2690","kind":"arxiv","version":1}},"canonical_sha256":"c37de79fe8e875201444fc0ac858b5106f4fac2fad7591a5fdfc14393b9804fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c37de79fe8e875201444fc0ac858b5106f4fac2fad7591a5fdfc14393b9804fc","first_computed_at":"2026-05-18T03:02:32.516951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:32.516951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TcNo8vMN7sQ5qA+yTTUf+KvLoREdeA0iXVTb331e5ZR3bRyCZW3ken/rBFALJg6KG176R85QgPcNA7lGGlHfAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:32.517867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c531055747b840c471b000f6cad22457d34f037606783bffb5b389002103f1a4","sha256:a8b3be19ca2a2b0bf84781e48dfb6e6ba9448ddf7dcec59fd5ca3bf4a81a8047"],"state_sha256":"a40fb6d5c3b3abca0a786e576e49ae6fd9cd8a07faf6c0f0622da4aa687ff6cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1zrwfC3R1PbWp1JOwDsXmv33AIfGe//SS4PuFLzqfXSuAvIt6AqK3OrAlHwuuAo15UjG7r+vVP69FkaXWGaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:55:34.005186Z","bundle_sha256":"a8f3083c9704706cd1708e6863a0de7071401b347a13bd2639035bc279b74ea0"}}