{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WA3PVFWJCL25DYHZSR3ZSGJYZW","short_pith_number":"pith:WA3PVFWJ","canonical_record":{"source":{"id":"1605.04538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-15T12:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"9e6a4edefbd918a72f2ff6bd3b701c50ed9963fbae357263ba177b176f3ebef2","abstract_canon_sha256":"c06af8a2ff055188ffe8692e81a00f49a165e36ba9acbc24eca193ecf7463e3c"},"schema_version":"1.0"},"canonical_sha256":"b036fa96c912f5d1e0f99477991938cd8826949ce8e025b5a3b396d2326eb79b","source":{"kind":"arxiv","id":"1605.04538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04538","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04538v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04538","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"WA3PVFWJCL25","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WA3PVFWJCL25DYHZ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WA3PVFWJ","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WA3PVFWJCL25DYHZSR3ZSGJYZW","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-15T12:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"9e6a4edefbd918a72f2ff6bd3b701c50ed9963fbae357263ba177b176f3ebef2","abstract_canon_sha256":"c06af8a2ff055188ffe8692e81a00f49a165e36ba9acbc24eca193ecf7463e3c"},"schema_version":"1.0"},"canonical_sha256":"b036fa96c912f5d1e0f99477991938cd8826949ce8e025b5a3b396d2326eb79b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:46.916223Z","signature_b64":"mdfH/MA35rDf/Z1pZGCTsAWeUAVkG77dpC3KseOwR7qoGJryk6Gsmdz8ljX0bwpH6udIKUQDgjqqMhqvAfkZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b036fa96c912f5d1e0f99477991938cd8826949ce8e025b5a3b396d2326eb79b","last_reissued_at":"2026-05-18T01:14:46.915556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:46.915556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04538","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-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5mkeSLNQOx0Au4dClTDNR9zlISwfuNIaUSVetJfqlcPEOB4r1ihCv3vBY7wKuqy2It1uUsvrbcihbf4VR0VBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:43:56.624115Z"},"content_sha256":"8d1cff479ce815b5d8d0ea311fe854f88f3ef19d15656251673ca3b764d4fe4e","schema_version":"1.0","event_id":"sha256:8d1cff479ce815b5d8d0ea311fe854f88f3ef19d15656251673ca3b764d4fe4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WA3PVFWJCL25DYHZSR3ZSGJYZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Elkin, Ofer Neiman","submitted_at":"2016-05-15T12:56:42Z","abstract_excerpt":"A $(\\beta,\\epsilon)$-hopset for a weighted undirected $n$-vertex graph $G=(V,E)$ is a set of edges, whose addition to the graph guarantees that every pair of vertices has a path between them that contains at most $\\beta$ edges, whose length is within $1+\\epsilon$ of the shortest path. In her seminal paper, Cohen \\cite[JACM 2000]{C00} introduced the notion of hopsets in the context of parallel computation of approximate shortest paths, and since then it has found numerous applications in various other settings, such as dynamic graph algorithms, distributed computing, and the streaming model.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04538","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-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DtfStSXjEbPKQ8SWEZA69B9QS2HdK+vg5RWj4szZfEP0tHbMRbjWCN2gAElao22k3LmL34if1x5wym1AdqbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:43:56.624589Z"},"content_sha256":"970f7b8b66ba8722dd40ae65852882dfc28028a6fe300d9476fcfc7b7f354b73","schema_version":"1.0","event_id":"sha256:970f7b8b66ba8722dd40ae65852882dfc28028a6fe300d9476fcfc7b7f354b73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WA3PVFWJCL25DYHZSR3ZSGJYZW/bundle.json","state_url":"https://pith.science/pith/WA3PVFWJCL25DYHZSR3ZSGJYZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WA3PVFWJCL25DYHZSR3ZSGJYZW/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-25T07:43:56Z","links":{"resolver":"https://pith.science/pith/WA3PVFWJCL25DYHZSR3ZSGJYZW","bundle":"https://pith.science/pith/WA3PVFWJCL25DYHZSR3ZSGJYZW/bundle.json","state":"https://pith.science/pith/WA3PVFWJCL25DYHZSR3ZSGJYZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WA3PVFWJCL25DYHZSR3ZSGJYZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WA3PVFWJCL25DYHZSR3ZSGJYZW","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":"c06af8a2ff055188ffe8692e81a00f49a165e36ba9acbc24eca193ecf7463e3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-15T12:56:42Z","title_canon_sha256":"9e6a4edefbd918a72f2ff6bd3b701c50ed9963fbae357263ba177b176f3ebef2"},"schema_version":"1.0","source":{"id":"1605.04538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04538","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04538v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04538","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"WA3PVFWJCL25","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WA3PVFWJCL25DYHZ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WA3PVFWJ","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:970f7b8b66ba8722dd40ae65852882dfc28028a6fe300d9476fcfc7b7f354b73","target":"graph","created_at":"2026-05-18T01:14:46Z","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)$-hopset for a weighted undirected $n$-vertex graph $G=(V,E)$ is a set of edges, whose addition to the graph guarantees that every pair of vertices has a path between them that contains at most $\\beta$ edges, whose length is within $1+\\epsilon$ of the shortest path. In her seminal paper, Cohen \\cite[JACM 2000]{C00} introduced the notion of hopsets in the context of parallel computation of approximate shortest paths, and since then it has found numerous applications in various other settings, such as dynamic graph algorithms, distributed computing, and the streaming model.\n  ","authors_text":"Michael Elkin, Ofer Neiman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-15T12:56:42Z","title":"Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04538","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:8d1cff479ce815b5d8d0ea311fe854f88f3ef19d15656251673ca3b764d4fe4e","target":"record","created_at":"2026-05-18T01:14:46Z","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":"c06af8a2ff055188ffe8692e81a00f49a165e36ba9acbc24eca193ecf7463e3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-15T12:56:42Z","title_canon_sha256":"9e6a4edefbd918a72f2ff6bd3b701c50ed9963fbae357263ba177b176f3ebef2"},"schema_version":"1.0","source":{"id":"1605.04538","kind":"arxiv","version":1}},"canonical_sha256":"b036fa96c912f5d1e0f99477991938cd8826949ce8e025b5a3b396d2326eb79b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b036fa96c912f5d1e0f99477991938cd8826949ce8e025b5a3b396d2326eb79b","first_computed_at":"2026-05-18T01:14:46.915556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:46.915556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mdfH/MA35rDf/Z1pZGCTsAWeUAVkG77dpC3KseOwR7qoGJryk6Gsmdz8ljX0bwpH6udIKUQDgjqqMhqvAfkZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:46.916223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d1cff479ce815b5d8d0ea311fe854f88f3ef19d15656251673ca3b764d4fe4e","sha256:970f7b8b66ba8722dd40ae65852882dfc28028a6fe300d9476fcfc7b7f354b73"],"state_sha256":"877532f441639380d6135a5d8bef59871de7079710836132045dd14a4d2359b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBd7XirpNfZ8ZevfgvNkexOvvBeDDAUBOc8QrdKQP9hz/4gM3PHx0cYwQ8K+H/Z9t+HPCM+tD2rGN+jKU6StCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:43:56.627054Z","bundle_sha256":"632aa3e14af7f0e400ed1f1d565ef5bfd34f0ae0e33248d4e7a11048bffd238b"}}