{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FIZDMMW45U7R3UKBOZQ36MS7DF","short_pith_number":"pith:FIZDMMW4","canonical_record":{"source":{"id":"1705.00327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-30T15:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"b078187774d59f22719181b58187cc2baef1c05d65688e915c108b42054eb32f","abstract_canon_sha256":"242667e9b44e5d06937cc0baee80d80a0ab6b03187e4da8e951a1b06e6701cbd"},"schema_version":"1.0"},"canonical_sha256":"2a323632dced3f1dd1417661bf325f19668439843aa3106dd03b9344677d44c1","source":{"kind":"arxiv","id":"1705.00327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00327","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00327v1","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00327","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"FIZDMMW45U7R","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIZDMMW45U7R3UKB","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIZDMMW4","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FIZDMMW45U7R3UKBOZQ36MS7DF","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-30T15:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"b078187774d59f22719181b58187cc2baef1c05d65688e915c108b42054eb32f","abstract_canon_sha256":"242667e9b44e5d06937cc0baee80d80a0ab6b03187e4da8e951a1b06e6701cbd"},"schema_version":"1.0"},"canonical_sha256":"2a323632dced3f1dd1417661bf325f19668439843aa3106dd03b9344677d44c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:20.771218Z","signature_b64":"z+KGCCNL62ReLFzBHE44FNALWBK61N1hK7omdVdHKY10rWf7/MAl15n5MGDBnvZIE1ajx3mjjSvE75ojK9nOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a323632dced3f1dd1417661bf325f19668439843aa3106dd03b9344677d44c1","last_reissued_at":"2026-05-18T00:45:20.770488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:20.770488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00327","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-18T00:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxzISI7x603nk21k5/Qf7M9amKI755ZeKkuTiYnM3nTrXoXpRbScXUKDNzZwr4ztGbXjVHXnapFWKHdt4iZiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:35:32.835933Z"},"content_sha256":"50371a3af709cea43b9eadd46bae2bdb8c2a400f88b0abd6ea2c2a92e909043e","schema_version":"1.0","event_id":"sha256:50371a3af709cea43b9eadd46bae2bdb8c2a400f88b0abd6ea2c2a92e909043e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FIZDMMW45U7R3UKBOZQ36MS7DF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thorup-Zwick Emulators are Universally Optimal Hopsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Seth Pettie, Shang-En Huang","submitted_at":"2017-04-30T15:34:02Z","abstract_excerpt":"A $(\\beta,\\epsilon)$-$\\textit{hopset}$ is, informally, a weighted edge set that, when added to a graph, allows one to get from point $a$ to point $b$ using a path with at most $\\beta$ edges (\"hops\") and length $(1+\\epsilon)\\mathrm{dist}(a,b)$. In this paper we observe that Thorup and Zwick's $\\textit{sublinear additive}$ emulators are also actually $(O(k/\\epsilon)^k,\\epsilon)$-hopsets for every $\\epsilon>0$, and that with a small change to the Thorup-Zwick construction, the size of the hopset can be made $O(n^{1+\\frac{1}{2^{k+1}-1}})$. As corollaries, we also shave \"$k$\" factors off the size o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00327","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-18T00:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDqjA+mMhCbR7qHznrtJFQqEeCkuKwg+XpZXzklqnZE65e3M8wwn0lBC246LOTnLbMKtx+dhGOurZM34wErEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:35:32.836281Z"},"content_sha256":"3457556d84f77a46b483c16198ec4e4b47b4b630ae1880ec30c36c18bab56cff","schema_version":"1.0","event_id":"sha256:3457556d84f77a46b483c16198ec4e4b47b4b630ae1880ec30c36c18bab56cff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIZDMMW45U7R3UKBOZQ36MS7DF/bundle.json","state_url":"https://pith.science/pith/FIZDMMW45U7R3UKBOZQ36MS7DF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIZDMMW45U7R3UKBOZQ36MS7DF/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-01T14:35:32Z","links":{"resolver":"https://pith.science/pith/FIZDMMW45U7R3UKBOZQ36MS7DF","bundle":"https://pith.science/pith/FIZDMMW45U7R3UKBOZQ36MS7DF/bundle.json","state":"https://pith.science/pith/FIZDMMW45U7R3UKBOZQ36MS7DF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIZDMMW45U7R3UKBOZQ36MS7DF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FIZDMMW45U7R3UKBOZQ36MS7DF","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":"242667e9b44e5d06937cc0baee80d80a0ab6b03187e4da8e951a1b06e6701cbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-30T15:34:02Z","title_canon_sha256":"b078187774d59f22719181b58187cc2baef1c05d65688e915c108b42054eb32f"},"schema_version":"1.0","source":{"id":"1705.00327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00327","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00327v1","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00327","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"FIZDMMW45U7R","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIZDMMW45U7R3UKB","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIZDMMW4","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:3457556d84f77a46b483c16198ec4e4b47b4b630ae1880ec30c36c18bab56cff","target":"graph","created_at":"2026-05-18T00:45:20Z","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":"A $(\\beta,\\epsilon)$-$\\textit{hopset}$ is, informally, a weighted edge set that, when added to a graph, allows one to get from point $a$ to point $b$ using a path with at most $\\beta$ edges (\"hops\") and length $(1+\\epsilon)\\mathrm{dist}(a,b)$. In this paper we observe that Thorup and Zwick's $\\textit{sublinear additive}$ emulators are also actually $(O(k/\\epsilon)^k,\\epsilon)$-hopsets for every $\\epsilon>0$, and that with a small change to the Thorup-Zwick construction, the size of the hopset can be made $O(n^{1+\\frac{1}{2^{k+1}-1}})$. As corollaries, we also shave \"$k$\" factors off the size o","authors_text":"Seth Pettie, Shang-En Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-30T15:34:02Z","title":"Thorup-Zwick Emulators are Universally Optimal Hopsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00327","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:50371a3af709cea43b9eadd46bae2bdb8c2a400f88b0abd6ea2c2a92e909043e","target":"record","created_at":"2026-05-18T00:45:20Z","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":"242667e9b44e5d06937cc0baee80d80a0ab6b03187e4da8e951a1b06e6701cbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-30T15:34:02Z","title_canon_sha256":"b078187774d59f22719181b58187cc2baef1c05d65688e915c108b42054eb32f"},"schema_version":"1.0","source":{"id":"1705.00327","kind":"arxiv","version":1}},"canonical_sha256":"2a323632dced3f1dd1417661bf325f19668439843aa3106dd03b9344677d44c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a323632dced3f1dd1417661bf325f19668439843aa3106dd03b9344677d44c1","first_computed_at":"2026-05-18T00:45:20.770488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:20.770488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z+KGCCNL62ReLFzBHE44FNALWBK61N1hK7omdVdHKY10rWf7/MAl15n5MGDBnvZIE1ajx3mjjSvE75ojK9nOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:20.771218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50371a3af709cea43b9eadd46bae2bdb8c2a400f88b0abd6ea2c2a92e909043e","sha256:3457556d84f77a46b483c16198ec4e4b47b4b630ae1880ec30c36c18bab56cff"],"state_sha256":"806db4d28e21acab48b1964616fdb2a894a8a919f5ae58813d8cb5c1f789cf64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hp+wkHOSfaVIOy2ccPDVW17GkHyiFGm0NV5CDVnJxs4vn8AQc6/BGUOOi5I1AF1yH4JTXR8OzWUpQbEgjY/MDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:35:32.838463Z","bundle_sha256":"6dc40ccbd9fbb4813685daeb4311865083c5e21fa44975d9138a04b17f9fe6e1"}}