{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:K5BGEG54ZFJJ55RCPRRD7EF7WK","short_pith_number":"pith:K5BGEG54","schema_version":"1.0","canonical_sha256":"5742621bbcc9529ef6227c623f90bfb29be79c1aa5e838174cecb9b92eebac8a","source":{"kind":"arxiv","id":"2105.04847","version":2},"attestation_state":"computed","paper":{"title":"Improved Local Computation Algorithms for Constructing Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edward Pyne, Lily Chung, Reut Levi, Rubi Arviv","submitted_at":"2021-05-11T08:06:59Z","abstract_excerpt":"A spanner of a graph is a subgraph that preserves lengths of shortest paths up to a multiplicative distortion. For every $k$, a spanner with size $O(n^{1+1/k})$ and stretch $(2k+1)$ can be constructed by a simple centralized greedy algorithm, and this is tight assuming Erd\\H{o}s girth conjecture.\n  In this paper we study the problem of constructing spanners in a local manner, specifically in the Local Computation Model proposed by Rubinfeld et al. (ICS 2011).\n  We provide a randomized Local Computation Agorithm (LCA) for constructing $(2r-1)$-spanners with $\\tilde{O}(n^{1+1/r})$ edges and prob"},"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":"2105.04847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-11T08:06:59Z","cross_cats_sorted":[],"title_canon_sha256":"a40fd92709cfb2a007290b4fd5c7cf59b18a22828e2af0782a69f9011ef3a67d","abstract_canon_sha256":"3521a528decbb5708c325a4a44f9fb08810516a5f618e9a8afcd94d9a9c6e48d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:29.743445Z","signature_b64":"RibHABHuOwT2DJJu2Wt/tNkM+fMVgetOzQg7MDzMAgUMgjloxJNpzWysnUQAUHmtwurp7sKwBdgnxsS8jx/wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5742621bbcc9529ef6227c623f90bfb29be79c1aa5e838174cecb9b92eebac8a","last_reissued_at":"2026-07-05T06:28:29.742730Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:29.742730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Local Computation Algorithms for Constructing Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edward Pyne, Lily Chung, Reut Levi, Rubi Arviv","submitted_at":"2021-05-11T08:06:59Z","abstract_excerpt":"A spanner of a graph is a subgraph that preserves lengths of shortest paths up to a multiplicative distortion. For every $k$, a spanner with size $O(n^{1+1/k})$ and stretch $(2k+1)$ can be constructed by a simple centralized greedy algorithm, and this is tight assuming Erd\\H{o}s girth conjecture.\n  In this paper we study the problem of constructing spanners in a local manner, specifically in the Local Computation Model proposed by Rubinfeld et al. (ICS 2011).\n  We provide a randomized Local Computation Agorithm (LCA) for constructing $(2r-1)$-spanners with $\\tilde{O}(n^{1+1/r})$ edges and prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.04847","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.04847/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.04847","created_at":"2026-07-05T06:28:29.742824+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.04847v2","created_at":"2026-07-05T06:28:29.742824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.04847","created_at":"2026-07-05T06:28:29.742824+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5BGEG54ZFJJ","created_at":"2026-07-05T06:28:29.742824+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5BGEG54ZFJJ55RC","created_at":"2026-07-05T06:28:29.742824+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5BGEG54","created_at":"2026-07-05T06:28:29.742824+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/K5BGEG54ZFJJ55RCPRRD7EF7WK","json":"https://pith.science/pith/K5BGEG54ZFJJ55RCPRRD7EF7WK.json","graph_json":"https://pith.science/api/pith-number/K5BGEG54ZFJJ55RCPRRD7EF7WK/graph.json","events_json":"https://pith.science/api/pith-number/K5BGEG54ZFJJ55RCPRRD7EF7WK/events.json","paper":"https://pith.science/paper/K5BGEG54"},"agent_actions":{"view_html":"https://pith.science/pith/K5BGEG54ZFJJ55RCPRRD7EF7WK","download_json":"https://pith.science/pith/K5BGEG54ZFJJ55RCPRRD7EF7WK.json","view_paper":"https://pith.science/paper/K5BGEG54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.04847&json=true","fetch_graph":"https://pith.science/api/pith-number/K5BGEG54ZFJJ55RCPRRD7EF7WK/graph.json","fetch_events":"https://pith.science/api/pith-number/K5BGEG54ZFJJ55RCPRRD7EF7WK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5BGEG54ZFJJ55RCPRRD7EF7WK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5BGEG54ZFJJ55RCPRRD7EF7WK/action/storage_attestation","attest_author":"https://pith.science/pith/K5BGEG54ZFJJ55RCPRRD7EF7WK/action/author_attestation","sign_citation":"https://pith.science/pith/K5BGEG54ZFJJ55RCPRRD7EF7WK/action/citation_signature","submit_replication":"https://pith.science/pith/K5BGEG54ZFJJ55RCPRRD7EF7WK/action/replication_record"}},"created_at":"2026-07-05T06:28:29.742824+00:00","updated_at":"2026-07-05T06:28:29.742824+00:00"}