{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LIH6L5F2V2T5GWAQ2EOIR4MB7A","short_pith_number":"pith:LIH6L5F2","schema_version":"1.0","canonical_sha256":"5a0fe5f4baaea7d35810d11c88f181f80f179c5bd26a6e1fd70281805cfa4a84","source":{"kind":"arxiv","id":"1304.4661","version":1},"attestation_state":"computed","paper":{"title":"Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Takuya Akiba, Yoichi Iwata, Yuichi Yoshida","submitted_at":"2013-04-17T01:11:12Z","abstract_excerpt":"We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search from every vertex. Seemingly too obvious and too inefficient at first glance, the key ingredient introduced here is pruning during breadth-first searches. While we can still answer the correct distance for any pair of vertices from the labels, it surprisingly reduces the search space and sizes of labels. Moreover, we show that we can perform 32 or 64 breadth-first searches simultaneously exploiting bitwise operations."},"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.4661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-17T01:11:12Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"aa088ae7623d08754ac38cf1ac849761f16de03185aef29f2dff310c4df5a252","abstract_canon_sha256":"a849248584dbd675844fd37cb334eabe885784ee3119ace34a22cc599dcc06ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:44.047292Z","signature_b64":"MEcmDPlQzlmqKmQxgr59LQ1lNJ7HsTsC1EV25mzLlzsyNjbzPM8RScxH8OokfmiltabVQamqjEDRP7lbhvKUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a0fe5f4baaea7d35810d11c88f181f80f179c5bd26a6e1fd70281805cfa4a84","last_reissued_at":"2026-05-18T03:27:44.046844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:44.046844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Takuya Akiba, Yoichi Iwata, Yuichi Yoshida","submitted_at":"2013-04-17T01:11:12Z","abstract_excerpt":"We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search from every vertex. Seemingly too obvious and too inefficient at first glance, the key ingredient introduced here is pruning during breadth-first searches. While we can still answer the correct distance for any pair of vertices from the labels, it surprisingly reduces the search space and sizes of labels. Moreover, we show that we can perform 32 or 64 breadth-first searches simultaneously exploiting bitwise operations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4661","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":"1304.4661","created_at":"2026-05-18T03:27:44.046909+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4661v1","created_at":"2026-05-18T03:27:44.046909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4661","created_at":"2026-05-18T03:27:44.046909+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIH6L5F2V2T5","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIH6L5F2V2T5GWAQ","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIH6L5F2","created_at":"2026-05-18T12:27:51.066281+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/LIH6L5F2V2T5GWAQ2EOIR4MB7A","json":"https://pith.science/pith/LIH6L5F2V2T5GWAQ2EOIR4MB7A.json","graph_json":"https://pith.science/api/pith-number/LIH6L5F2V2T5GWAQ2EOIR4MB7A/graph.json","events_json":"https://pith.science/api/pith-number/LIH6L5F2V2T5GWAQ2EOIR4MB7A/events.json","paper":"https://pith.science/paper/LIH6L5F2"},"agent_actions":{"view_html":"https://pith.science/pith/LIH6L5F2V2T5GWAQ2EOIR4MB7A","download_json":"https://pith.science/pith/LIH6L5F2V2T5GWAQ2EOIR4MB7A.json","view_paper":"https://pith.science/paper/LIH6L5F2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4661&json=true","fetch_graph":"https://pith.science/api/pith-number/LIH6L5F2V2T5GWAQ2EOIR4MB7A/graph.json","fetch_events":"https://pith.science/api/pith-number/LIH6L5F2V2T5GWAQ2EOIR4MB7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIH6L5F2V2T5GWAQ2EOIR4MB7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIH6L5F2V2T5GWAQ2EOIR4MB7A/action/storage_attestation","attest_author":"https://pith.science/pith/LIH6L5F2V2T5GWAQ2EOIR4MB7A/action/author_attestation","sign_citation":"https://pith.science/pith/LIH6L5F2V2T5GWAQ2EOIR4MB7A/action/citation_signature","submit_replication":"https://pith.science/pith/LIH6L5F2V2T5GWAQ2EOIR4MB7A/action/replication_record"}},"created_at":"2026-05-18T03:27:44.046909+00:00","updated_at":"2026-05-18T03:27:44.046909+00:00"}