{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SRK7JVYDTIBDIV6YXXUYFMA22S","short_pith_number":"pith:SRK7JVYD","schema_version":"1.0","canonical_sha256":"9455f4d7039a023457d8bde982b01ad4b0913cf63377d15c1903541bb824db73","source":{"kind":"arxiv","id":"1704.08468","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.08468","created_at":"2026-05-18T00:45:27.623731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08468v1","created_at":"2026-05-18T00:45:27.623731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08468","created_at":"2026-05-18T00:45:27.623731+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRK7JVYDTIBD","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRK7JVYDTIBDIV6Y","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRK7JVYD","created_at":"2026-05-18T12:31:43.269735+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/SRK7JVYDTIBDIV6YXXUYFMA22S","json":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S.json","graph_json":"https://pith.science/api/pith-number/SRK7JVYDTIBDIV6YXXUYFMA22S/graph.json","events_json":"https://pith.science/api/pith-number/SRK7JVYDTIBDIV6YXXUYFMA22S/events.json","paper":"https://pith.science/paper/SRK7JVYD"},"agent_actions":{"view_html":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S","download_json":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S.json","view_paper":"https://pith.science/paper/SRK7JVYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08468&json=true","fetch_graph":"https://pith.science/api/pith-number/SRK7JVYDTIBDIV6YXXUYFMA22S/graph.json","fetch_events":"https://pith.science/api/pith-number/SRK7JVYDTIBDIV6YXXUYFMA22S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/action/storage_attestation","attest_author":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/action/author_attestation","sign_citation":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/action/citation_signature","submit_replication":"https://pith.science/pith/SRK7JVYDTIBDIV6YXXUYFMA22S/action/replication_record"}},"created_at":"2026-05-18T00:45:27.623731+00:00","updated_at":"2026-05-18T00:45:27.623731+00:00"}