{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EE2IGGQAM2FQ3I63VLKWHEEFIM","short_pith_number":"pith:EE2IGGQA","schema_version":"1.0","canonical_sha256":"2134831a00668b0da3dbaad5639085431cda761a6a9a502b013a2630ac762f08","source":{"kind":"arxiv","id":"1803.06977","version":2},"attestation_state":"computed","paper":{"title":"Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski (GANG), IRIF, Laurent Viennot (GANG, LINCS), Siddharth Gupta (BGU)","submitted_at":"2018-03-19T15:06:49Z","abstract_excerpt":"For fixed $h \\geq 2$, we consider the task of adding to a graph $G$ a set of weighted shortcut edges on the same vertex set, such that the length of a shortest $h$-hop path between any pair of vertices in the augmented graph is exactly the same as the original distance between these vertices in $G$. A set of shortcut edges with this property is called an exact $h$-hopset and may be applied in processing distance queries on graph $G$. In particular, a $2$-hopset directly corresponds to a distributed distance oracle known as a hub labeling. In this work, we explore centralized distance oracles b"},"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":"1803.06977","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T15:06:49Z","cross_cats_sorted":[],"title_canon_sha256":"69bb4992f5cce19b0dd030c052b5cd52b94d03d3a0cabc13c5710fbd24a25f22","abstract_canon_sha256":"145bc160f9752ffc9e18edc5f93f43742b230e0d26d5a35c1d9ef00eef701ddb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.569773Z","signature_b64":"QCOK+vy1pBs7tki/0hq4gkiVgxKILje67P8TEIsYdguBOA6+KPMT1bU7T/WQPiBdq8ItVTxC1vu7veTyuu1AAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2134831a00668b0da3dbaad5639085431cda761a6a9a502b013a2630ac762f08","last_reissued_at":"2026-05-17T23:45:15.569077Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.569077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski (GANG), IRIF, Laurent Viennot (GANG, LINCS), Siddharth Gupta (BGU)","submitted_at":"2018-03-19T15:06:49Z","abstract_excerpt":"For fixed $h \\geq 2$, we consider the task of adding to a graph $G$ a set of weighted shortcut edges on the same vertex set, such that the length of a shortest $h$-hop path between any pair of vertices in the augmented graph is exactly the same as the original distance between these vertices in $G$. A set of shortcut edges with this property is called an exact $h$-hopset and may be applied in processing distance queries on graph $G$. In particular, a $2$-hopset directly corresponds to a distributed distance oracle known as a hub labeling. In this work, we explore centralized distance oracles b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06977","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":"1803.06977","created_at":"2026-05-17T23:45:15.569169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06977v2","created_at":"2026-05-17T23:45:15.569169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06977","created_at":"2026-05-17T23:45:15.569169+00:00"},{"alias_kind":"pith_short_12","alias_value":"EE2IGGQAM2FQ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EE2IGGQAM2FQ3I63","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EE2IGGQA","created_at":"2026-05-18T12:32:22.470017+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/EE2IGGQAM2FQ3I63VLKWHEEFIM","json":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM.json","graph_json":"https://pith.science/api/pith-number/EE2IGGQAM2FQ3I63VLKWHEEFIM/graph.json","events_json":"https://pith.science/api/pith-number/EE2IGGQAM2FQ3I63VLKWHEEFIM/events.json","paper":"https://pith.science/paper/EE2IGGQA"},"agent_actions":{"view_html":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM","download_json":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM.json","view_paper":"https://pith.science/paper/EE2IGGQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06977&json=true","fetch_graph":"https://pith.science/api/pith-number/EE2IGGQAM2FQ3I63VLKWHEEFIM/graph.json","fetch_events":"https://pith.science/api/pith-number/EE2IGGQAM2FQ3I63VLKWHEEFIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/action/storage_attestation","attest_author":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/action/author_attestation","sign_citation":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/action/citation_signature","submit_replication":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/action/replication_record"}},"created_at":"2026-05-17T23:45:15.569169+00:00","updated_at":"2026-05-17T23:45:15.569169+00:00"}