{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JEXEN74WMCHTIDGQCQAFJMF46I","short_pith_number":"pith:JEXEN74W","schema_version":"1.0","canonical_sha256":"492e46ff96608f340cd0140054b0bcf2150ea5b2df732b4cbf59e1c385eb73f1","source":{"kind":"arxiv","id":"1403.0779","version":2},"attestation_state":"computed","paper":{"title":"Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ada Wai-chee Fu, Minhao Jiang, Raymond Chi-Wing Wong, Yanyan Xu","submitted_at":"2014-03-04T13:09:09Z","abstract_excerpt":"We study the problem of point-to-point distance querying for massive scale-free graphs, which is important for numerous applications. Given a directed or undirected graph, we propose to build an index for answering such queries based on a hop-doubling labeling technique. We derive bounds on the index size, the computation costs and I/O costs based on the properties of unweighted scale-free graphs. We show that our method is much more efficient compared to the state-of-the-art technique, in terms of both querying time and indexing time. Our empirical study shows that our method can handle graph"},"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":"1403.0779","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-03-04T13:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"c435f218b519f2e791837387172e46a4629106da180cd30241806e5f83bde450","abstract_canon_sha256":"87e8156c56f196021e3d491903136f29d47354aa4c9b9794c7d6d4320ce2d2c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:47.812532Z","signature_b64":"N9446MeeSk/FVbDN17TfKoYnApKQotTSEVJLerlGvKH7/vsFiP6qu3Ih7C3hZU0uZFm7Jjg8xgZWy7dYeFQiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"492e46ff96608f340cd0140054b0bcf2150ea5b2df732b4cbf59e1c385eb73f1","last_reissued_at":"2026-05-18T02:52:47.812101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:47.812101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ada Wai-chee Fu, Minhao Jiang, Raymond Chi-Wing Wong, Yanyan Xu","submitted_at":"2014-03-04T13:09:09Z","abstract_excerpt":"We study the problem of point-to-point distance querying for massive scale-free graphs, which is important for numerous applications. Given a directed or undirected graph, we propose to build an index for answering such queries based on a hop-doubling labeling technique. We derive bounds on the index size, the computation costs and I/O costs based on the properties of unweighted scale-free graphs. We show that our method is much more efficient compared to the state-of-the-art technique, in terms of both querying time and indexing time. Our empirical study shows that our method can handle graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0779","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":"1403.0779","created_at":"2026-05-18T02:52:47.812164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0779v2","created_at":"2026-05-18T02:52:47.812164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0779","created_at":"2026-05-18T02:52:47.812164+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEXEN74WMCHT","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEXEN74WMCHTIDGQ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEXEN74W","created_at":"2026-05-18T12:28:33.132498+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/JEXEN74WMCHTIDGQCQAFJMF46I","json":"https://pith.science/pith/JEXEN74WMCHTIDGQCQAFJMF46I.json","graph_json":"https://pith.science/api/pith-number/JEXEN74WMCHTIDGQCQAFJMF46I/graph.json","events_json":"https://pith.science/api/pith-number/JEXEN74WMCHTIDGQCQAFJMF46I/events.json","paper":"https://pith.science/paper/JEXEN74W"},"agent_actions":{"view_html":"https://pith.science/pith/JEXEN74WMCHTIDGQCQAFJMF46I","download_json":"https://pith.science/pith/JEXEN74WMCHTIDGQCQAFJMF46I.json","view_paper":"https://pith.science/paper/JEXEN74W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0779&json=true","fetch_graph":"https://pith.science/api/pith-number/JEXEN74WMCHTIDGQCQAFJMF46I/graph.json","fetch_events":"https://pith.science/api/pith-number/JEXEN74WMCHTIDGQCQAFJMF46I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEXEN74WMCHTIDGQCQAFJMF46I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEXEN74WMCHTIDGQCQAFJMF46I/action/storage_attestation","attest_author":"https://pith.science/pith/JEXEN74WMCHTIDGQCQAFJMF46I/action/author_attestation","sign_citation":"https://pith.science/pith/JEXEN74WMCHTIDGQCQAFJMF46I/action/citation_signature","submit_replication":"https://pith.science/pith/JEXEN74WMCHTIDGQCQAFJMF46I/action/replication_record"}},"created_at":"2026-05-18T02:52:47.812164+00:00","updated_at":"2026-05-18T02:52:47.812164+00:00"}