{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QWEVDW4NS55IS4HDV2HKIOZ72G","short_pith_number":"pith:QWEVDW4N","schema_version":"1.0","canonical_sha256":"858951db8d977a8970e3ae8ea43b3fd1bc2e74359275880bfd45296292555e20","source":{"kind":"arxiv","id":"1605.05109","version":1},"attestation_state":"computed","paper":{"title":"Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Amir Abboud, Keren Censor-Hillel, Seri Khoury","submitted_at":"2016-05-17T11:02:16Z","abstract_excerpt":"We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\\widetilde{\\Omega}(n)$ lower bound for computing the diameter in sparse networks, which was previously known only for dense networks [Frishknecht et al., SODA 2012]. In fact, we can even modify our construction to obtain graphs with constant degree, using a simple but powerful degree-reduction technique which we define.\n  Moreover, our technique allows us to show $\\widetilde{\\Omega}(n)$ lower bou"},"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":"1605.05109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-17T11:02:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"938c172ae4a7e949ba71d533e79ce754aa84355a982fbeb74ba71cf103bf5e44","abstract_canon_sha256":"cb15289250f4b412003e6ad4fd6c4b9df979297c693409c95763c912307bd02a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.358209Z","signature_b64":"1xZNSMq2OdK0VTpjhWa77PENptbzEdcEEzbwivVbv4U6YmchDT3sqDOjc6SduN8NjrFD+pGQAhUVpOzQ90SLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"858951db8d977a8970e3ae8ea43b3fd1bc2e74359275880bfd45296292555e20","last_reissued_at":"2026-05-18T01:14:37.357382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.357382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Amir Abboud, Keren Censor-Hillel, Seri Khoury","submitted_at":"2016-05-17T11:02:16Z","abstract_excerpt":"We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\\widetilde{\\Omega}(n)$ lower bound for computing the diameter in sparse networks, which was previously known only for dense networks [Frishknecht et al., SODA 2012]. In fact, we can even modify our construction to obtain graphs with constant degree, using a simple but powerful degree-reduction technique which we define.\n  Moreover, our technique allows us to show $\\widetilde{\\Omega}(n)$ lower bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05109","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":"1605.05109","created_at":"2026-05-18T01:14:37.357526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05109v1","created_at":"2026-05-18T01:14:37.357526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05109","created_at":"2026-05-18T01:14:37.357526+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWEVDW4NS55I","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWEVDW4NS55IS4HD","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWEVDW4N","created_at":"2026-05-18T12:30:41.710351+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/QWEVDW4NS55IS4HDV2HKIOZ72G","json":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G.json","graph_json":"https://pith.science/api/pith-number/QWEVDW4NS55IS4HDV2HKIOZ72G/graph.json","events_json":"https://pith.science/api/pith-number/QWEVDW4NS55IS4HDV2HKIOZ72G/events.json","paper":"https://pith.science/paper/QWEVDW4N"},"agent_actions":{"view_html":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G","download_json":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G.json","view_paper":"https://pith.science/paper/QWEVDW4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05109&json=true","fetch_graph":"https://pith.science/api/pith-number/QWEVDW4NS55IS4HDV2HKIOZ72G/graph.json","fetch_events":"https://pith.science/api/pith-number/QWEVDW4NS55IS4HDV2HKIOZ72G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/action/storage_attestation","attest_author":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/action/author_attestation","sign_citation":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/action/citation_signature","submit_replication":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/action/replication_record"}},"created_at":"2026-05-18T01:14:37.357526+00:00","updated_at":"2026-05-18T01:14:37.357526+00:00"}