{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YEKVAXX3WESWE42FI7U23BFRMY","short_pith_number":"pith:YEKVAXX3","schema_version":"1.0","canonical_sha256":"c115505efbb12562734547e9ad84b166029383f0c4fd609a18347e49ddfb8ecc","source":{"kind":"arxiv","id":"1802.03160","version":1},"attestation_state":"computed","paper":{"title":"Distributed Spanner Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Keren Censor-Hillel, Michal Dory","submitted_at":"2018-02-09T08:01:28Z","abstract_excerpt":"We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results.\n  Our main hardness result shows that an $\\alpha$-approximation for the minimum directed $k$-spanner problem for $k \\geq 5$ requires $\\Omega(n /\\sqrt{\\alpha}\\log{n})$ rounds using deterministic algorithms or $\\Omega(\\sqrt{n }/\\sqrt{\\alpha}\\log{n})$ rounds using randomized ones, in the CONGEST model of distributed computing. Combined with the constant-round $O(n^{\\epsilon})$-approximation algorithm in "},"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":"1802.03160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-09T08:01:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"34cc0c43ff92846351135073772270fce77b6f8676556f924232c7c912661437","abstract_canon_sha256":"d07bdc96f91f2203dc413403db823c521daa5f1b3c7b3ff3e9199b09562aacb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:58.435355Z","signature_b64":"doXKPjtX2W2pHP0It6hm9r5eY+PYD/tFmq0NOECuorUUDHoIYTmbl3YW8tvkrgHkEmnw/Cf3hBBF7AKkcjtMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c115505efbb12562734547e9ad84b166029383f0c4fd609a18347e49ddfb8ecc","last_reissued_at":"2026-05-18T00:23:58.434817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:58.434817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Spanner Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Keren Censor-Hillel, Michal Dory","submitted_at":"2018-02-09T08:01:28Z","abstract_excerpt":"We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results.\n  Our main hardness result shows that an $\\alpha$-approximation for the minimum directed $k$-spanner problem for $k \\geq 5$ requires $\\Omega(n /\\sqrt{\\alpha}\\log{n})$ rounds using deterministic algorithms or $\\Omega(\\sqrt{n }/\\sqrt{\\alpha}\\log{n})$ rounds using randomized ones, in the CONGEST model of distributed computing. Combined with the constant-round $O(n^{\\epsilon})$-approximation algorithm in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03160","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":"1802.03160","created_at":"2026-05-18T00:23:58.434907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03160v1","created_at":"2026-05-18T00:23:58.434907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03160","created_at":"2026-05-18T00:23:58.434907+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEKVAXX3WESW","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEKVAXX3WESWE42F","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEKVAXX3","created_at":"2026-05-18T12:33:04.347982+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/YEKVAXX3WESWE42FI7U23BFRMY","json":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY.json","graph_json":"https://pith.science/api/pith-number/YEKVAXX3WESWE42FI7U23BFRMY/graph.json","events_json":"https://pith.science/api/pith-number/YEKVAXX3WESWE42FI7U23BFRMY/events.json","paper":"https://pith.science/paper/YEKVAXX3"},"agent_actions":{"view_html":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY","download_json":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY.json","view_paper":"https://pith.science/paper/YEKVAXX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03160&json=true","fetch_graph":"https://pith.science/api/pith-number/YEKVAXX3WESWE42FI7U23BFRMY/graph.json","fetch_events":"https://pith.science/api/pith-number/YEKVAXX3WESWE42FI7U23BFRMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/action/storage_attestation","attest_author":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/action/author_attestation","sign_citation":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/action/citation_signature","submit_replication":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/action/replication_record"}},"created_at":"2026-05-18T00:23:58.434907+00:00","updated_at":"2026-05-18T00:23:58.434907+00:00"}