{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SRK7JVYDTIBDIV6YXXUYFMA22S","short_pith_number":"pith:SRK7JVYD","canonical_record":{"source":{"id":"1704.08468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T08:08:22Z","cross_cats_sorted":[],"title_canon_sha256":"053472e9b84b0f50bb86b7775a7b0666bd94bdd85c151ab455c19a4cd0f5ef92","abstract_canon_sha256":"fb1d75ce6fc24aa41bd3d8aff7f5adc918caae47e9a0c9acecc6954cc6e68197"},"schema_version":"1.0"},"canonical_sha256":"9455f4d7039a023457d8bde982b01ad4b0913cf63377d15c1903541bb824db73","source":{"kind":"arxiv","id":"1704.08468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08468","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08468v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08468","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"SRK7JVYDTIBD","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SRK7JVYDTIBDIV6Y","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SRK7JVYD","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SRK7JVYDTIBDIV6YXXUYFMA22S","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T08:08:22Z","cross_cats_sorted":[],"title_canon_sha256":"053472e9b84b0f50bb86b7775a7b0666bd94bdd85c151ab455c19a4cd0f5ef92","abstract_canon_sha256":"fb1d75ce6fc24aa41bd3d8aff7f5adc918caae47e9a0c9acecc6954cc6e68197"},"schema_version":"1.0"},"canonical_sha256":"9455f4d7039a023457d8bde982b01ad4b0913cf63377d15c1903541bb824db73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.624040Z","signature_b64":"cJKszEt0MqEyRLYDAZh0eFBk3dIPp98qREI/3f6e/OjxgSA/FsxVbdfkLHe+cvAe37kTBARBiqmH+lgpNdC9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9455f4d7039a023457d8bde982b01ad4b0913cf63377d15c1903541bb824db73","last_reissued_at":"2026-05-18T00:45:27.623675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.623675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08468","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:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1nqlH3jMB/wSTkSC/1J1DIVGjPiHoGRSaYfsddoDpehynX2CoO/Gzjbz7BQifA1wRhbPJQjdUIvu5Lhmi84AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:37:19.768011Z"},"content_sha256":"90791f548dc84e0195008dba950842d763f6cbe91545b11502e9e5bc13f710e7","schema_version":"1.0","event_id":"sha256:90791f548dc84e0195008dba950842d763f6cbe91545b11502e9e5bc13f710e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SRK7JVYDTIBDIV6YXXUYFMA22S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Elkin, Ofer Neiman","submitted_at":"2017-04-27T08:08:22Z","abstract_excerpt":"For a positive parameter $\\beta$, the $\\beta$-bounded distance between a pair of vertices $u,v$ in a weighted undirected graph $G = (V,E,\\omega)$ is the length of the shortest $u-v$ path in $G$ with at most $\\beta$ edges, aka {\\em hops}. For $\\beta$ as above and $\\epsilon>0$, a {\\em $(\\beta,\\epsilon)$-hopset} of $G = (V,E,\\omega)$ is a graph $G' =(V,H,\\omega_H)$ on the same vertex set, such that all distances in $G$ are $(1+\\epsilon)$-approximated by $\\beta$-bounded distances in $G\\cup G'$.\n  Hopsets are a fundamental graph-theoretic and graph-algorithmic construct, and they are widely used fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08468","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:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ze3I/Ipjny8HPZ8pzIPW5J/2aEV1RuoqUWFgTzDC9JdKb98YldHXO/MSrviJRZtypM2bW8HnwHryJLkEw+SNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:37:19.768393Z"},"content_sha256":"8d25dcca83eed918ad30a46844562db4aaef78ddbb6bd99f998c8f127da307fc","schema_version":"1.0","event_id":"sha256:8d25dcca83eed918ad30a46844562db4aaef78ddbb6bd99f998c8f127da307fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/bundle.json","state_url":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/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-25T09:37:19Z","links":{"resolver":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S","bundle":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/bundle.json","state":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SRK7JVYDTIBDIV6YXXUYFMA22S","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":"fb1d75ce6fc24aa41bd3d8aff7f5adc918caae47e9a0c9acecc6954cc6e68197","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T08:08:22Z","title_canon_sha256":"053472e9b84b0f50bb86b7775a7b0666bd94bdd85c151ab455c19a4cd0f5ef92"},"schema_version":"1.0","source":{"id":"1704.08468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08468","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08468v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08468","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"SRK7JVYDTIBD","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SRK7JVYDTIBDIV6Y","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SRK7JVYD","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:8d25dcca83eed918ad30a46844562db4aaef78ddbb6bd99f998c8f127da307fc","target":"graph","created_at":"2026-05-18T00:45:27Z","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 a positive parameter $\\beta$, the $\\beta$-bounded distance between a pair of vertices $u,v$ in a weighted undirected graph $G = (V,E,\\omega)$ is the length of the shortest $u-v$ path in $G$ with at most $\\beta$ edges, aka {\\em hops}. For $\\beta$ as above and $\\epsilon>0$, a {\\em $(\\beta,\\epsilon)$-hopset} of $G = (V,E,\\omega)$ is a graph $G' =(V,H,\\omega_H)$ on the same vertex set, such that all distances in $G$ are $(1+\\epsilon)$-approximated by $\\beta$-bounded distances in $G\\cup G'$.\n  Hopsets are a fundamental graph-theoretic and graph-algorithmic construct, and they are widely used fo","authors_text":"Michael Elkin, Ofer Neiman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T08:08:22Z","title":"Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08468","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:90791f548dc84e0195008dba950842d763f6cbe91545b11502e9e5bc13f710e7","target":"record","created_at":"2026-05-18T00:45:27Z","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":"fb1d75ce6fc24aa41bd3d8aff7f5adc918caae47e9a0c9acecc6954cc6e68197","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T08:08:22Z","title_canon_sha256":"053472e9b84b0f50bb86b7775a7b0666bd94bdd85c151ab455c19a4cd0f5ef92"},"schema_version":"1.0","source":{"id":"1704.08468","kind":"arxiv","version":1}},"canonical_sha256":"9455f4d7039a023457d8bde982b01ad4b0913cf63377d15c1903541bb824db73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9455f4d7039a023457d8bde982b01ad4b0913cf63377d15c1903541bb824db73","first_computed_at":"2026-05-18T00:45:27.623675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.623675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cJKszEt0MqEyRLYDAZh0eFBk3dIPp98qREI/3f6e/OjxgSA/FsxVbdfkLHe+cvAe37kTBARBiqmH+lgpNdC9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.624040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90791f548dc84e0195008dba950842d763f6cbe91545b11502e9e5bc13f710e7","sha256:8d25dcca83eed918ad30a46844562db4aaef78ddbb6bd99f998c8f127da307fc"],"state_sha256":"6c0ae3122b2cc4f8e55c9e6145f13ffb2e42a2bcfb1d9581ad5c365597494f6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEVx7P7P+rHj7bT0bXS6VJYa1YZUCvGaXMkYefJWQcoKTrRY+xaTKfRicCldj89/+Fe3425iNwYohrb6NnQcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:37:19.770600Z","bundle_sha256":"763448ad363bc538429a80a86c4a01360c5975721f0b58c4588c4dfe83e492a4"}}