{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EE2IGGQAM2FQ3I63VLKWHEEFIM","short_pith_number":"pith:EE2IGGQA","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"},"canonical_sha256":"2134831a00668b0da3dbaad5639085431cda761a6a9a502b013a2630ac762f08","source":{"kind":"arxiv","id":"1803.06977","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06977","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06977v2","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06977","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"EE2IGGQAM2FQ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EE2IGGQAM2FQ3I63","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EE2IGGQA","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EE2IGGQAM2FQ3I63VLKWHEEFIM","target":"record","payload":{"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"},"canonical_sha256":"2134831a00668b0da3dbaad5639085431cda761a6a9a502b013a2630ac762f08","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"},"source_kind":"arxiv","source_id":"1803.06977","source_version":2,"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-17T23:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMVFBDXcRdoEEXVF4jTO9gFiDvYD5Cj9YFsG6aKKJ/1TCU+Qvb3kBEJim20MfXhcUoJAoJJ+ap0+YDllB/rDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T09:18:07.264441Z"},"content_sha256":"70e0ab3a283c0a9b6e5e1ed514fc1da4b63fb4c35d06be995efd7ba8998d83a4","schema_version":"1.0","event_id":"sha256:70e0ab3a283c0a9b6e5e1ed514fc1da4b63fb4c35d06be995efd7ba8998d83a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EE2IGGQAM2FQ3I63VLKWHEEFIM","target":"graph","payload":{"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"},"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-17T23:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abKuuICVS0IDIIlt18y1AeCU993HiGLDHDABLlaNEhvN28lP/35U07HGgGaCJhcOhRoAQVFJVf0ZRHHrvknYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T09:18:07.264832Z"},"content_sha256":"0db0b08d1d24d0b0a23344d4657102e4ea58afef3164582f25a5dac491a20f90","schema_version":"1.0","event_id":"sha256:0db0b08d1d24d0b0a23344d4657102e4ea58afef3164582f25a5dac491a20f90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/bundle.json","state_url":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/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-05-23T09:18:07Z","links":{"resolver":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM","bundle":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/bundle.json","state":"https://pith.science/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EE2IGGQAM2FQ3I63VLKWHEEFIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EE2IGGQAM2FQ3I63VLKWHEEFIM","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":"145bc160f9752ffc9e18edc5f93f43742b230e0d26d5a35c1d9ef00eef701ddb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T15:06:49Z","title_canon_sha256":"69bb4992f5cce19b0dd030c052b5cd52b94d03d3a0cabc13c5710fbd24a25f22"},"schema_version":"1.0","source":{"id":"1803.06977","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06977","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06977v2","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06977","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"EE2IGGQAM2FQ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EE2IGGQAM2FQ3I63","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EE2IGGQA","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:0db0b08d1d24d0b0a23344d4657102e4ea58afef3164582f25a5dac491a20f90","target":"graph","created_at":"2026-05-17T23:45:15Z","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":"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","authors_text":"Adrian Kosowski (GANG), IRIF, Laurent Viennot (GANG, LINCS), Siddharth Gupta (BGU)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T15:06:49Z","title":"Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06977","kind":"arxiv","version":2},"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:70e0ab3a283c0a9b6e5e1ed514fc1da4b63fb4c35d06be995efd7ba8998d83a4","target":"record","created_at":"2026-05-17T23:45:15Z","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":"145bc160f9752ffc9e18edc5f93f43742b230e0d26d5a35c1d9ef00eef701ddb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T15:06:49Z","title_canon_sha256":"69bb4992f5cce19b0dd030c052b5cd52b94d03d3a0cabc13c5710fbd24a25f22"},"schema_version":"1.0","source":{"id":"1803.06977","kind":"arxiv","version":2}},"canonical_sha256":"2134831a00668b0da3dbaad5639085431cda761a6a9a502b013a2630ac762f08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2134831a00668b0da3dbaad5639085431cda761a6a9a502b013a2630ac762f08","first_computed_at":"2026-05-17T23:45:15.569077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:15.569077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QCOK+vy1pBs7tki/0hq4gkiVgxKILje67P8TEIsYdguBOA6+KPMT1bU7T/WQPiBdq8ItVTxC1vu7veTyuu1AAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:15.569773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06977","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70e0ab3a283c0a9b6e5e1ed514fc1da4b63fb4c35d06be995efd7ba8998d83a4","sha256:0db0b08d1d24d0b0a23344d4657102e4ea58afef3164582f25a5dac491a20f90"],"state_sha256":"9cb8cacdf1e9926b6524f67941785e94f3fa526fe25ce0a78feb7ab2c92e96bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIOLFQIusSqIZoYVj+biyuupWGT+PArjIgoHa4vaeXjnGgOaiRIprzwO7OUlupYiO4bxx8QWbC8vNfJrUGYoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T09:18:07.267555Z","bundle_sha256":"2480ef35e2b21a8d4528aefbb3957f1056fe6ef69bbf635499200765151f949a"}}