{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QWEVDW4NS55IS4HDV2HKIOZ72G","short_pith_number":"pith:QWEVDW4N","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"},"canonical_sha256":"858951db8d977a8970e3ae8ea43b3fd1bc2e74359275880bfd45296292555e20","source":{"kind":"arxiv","id":"1605.05109","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05109","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05109v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05109","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"QWEVDW4NS55I","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QWEVDW4NS55IS4HD","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QWEVDW4N","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QWEVDW4NS55IS4HDV2HKIOZ72G","target":"record","payload":{"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"},"canonical_sha256":"858951db8d977a8970e3ae8ea43b3fd1bc2e74359275880bfd45296292555e20","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"},"source_kind":"arxiv","source_id":"1605.05109","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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AoshvvmbUJilJUoc6mmYke2rQNzpnzRaMtDxy77pUFao87+npT3Kc0fIJZMVh4l3x+TXZcFDGPUXmKQruSqWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:26:43.025451Z"},"content_sha256":"fceb102f2f8986a4ecf4b2e8fe9b21f411deb317c3c1bec6296327b66abec006","schema_version":"1.0","event_id":"sha256:fceb102f2f8986a4ecf4b2e8fe9b21f411deb317c3c1bec6296327b66abec006"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QWEVDW4NS55IS4HDV2HKIOZ72G","target":"graph","payload":{"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"},"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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oscTGH7zXMjGEZ3vfBJJ/hZP5oiefcVPTxDowsNNastnZa0sTLUIJ9W9Hnr6+9lOKVCBeGmqx1VkHiXgvDqQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:26:43.025804Z"},"content_sha256":"b900554eb9b2d3c4f9680d850c183117890f95d5e4cf05f5885d231f1d1b0b65","schema_version":"1.0","event_id":"sha256:b900554eb9b2d3c4f9680d850c183117890f95d5e4cf05f5885d231f1d1b0b65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/bundle.json","state_url":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/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-05-31T21:26:43Z","links":{"resolver":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G","bundle":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/bundle.json","state":"https://pith.science/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWEVDW4NS55IS4HDV2HKIOZ72G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QWEVDW4NS55IS4HDV2HKIOZ72G","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":"cb15289250f4b412003e6ad4fd6c4b9df979297c693409c95763c912307bd02a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-17T11:02:16Z","title_canon_sha256":"938c172ae4a7e949ba71d533e79ce754aa84355a982fbeb74ba71cf103bf5e44"},"schema_version":"1.0","source":{"id":"1605.05109","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05109","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05109v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05109","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"QWEVDW4NS55I","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QWEVDW4NS55IS4HD","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QWEVDW4N","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:b900554eb9b2d3c4f9680d850c183117890f95d5e4cf05f5885d231f1d1b0b65","target":"graph","created_at":"2026-05-18T01:14:37Z","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":"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","authors_text":"Amir Abboud, Keren Censor-Hillel, Seri Khoury","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-17T11:02:16Z","title":"Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05109","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:fceb102f2f8986a4ecf4b2e8fe9b21f411deb317c3c1bec6296327b66abec006","target":"record","created_at":"2026-05-18T01:14:37Z","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":"cb15289250f4b412003e6ad4fd6c4b9df979297c693409c95763c912307bd02a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-17T11:02:16Z","title_canon_sha256":"938c172ae4a7e949ba71d533e79ce754aa84355a982fbeb74ba71cf103bf5e44"},"schema_version":"1.0","source":{"id":"1605.05109","kind":"arxiv","version":1}},"canonical_sha256":"858951db8d977a8970e3ae8ea43b3fd1bc2e74359275880bfd45296292555e20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"858951db8d977a8970e3ae8ea43b3fd1bc2e74359275880bfd45296292555e20","first_computed_at":"2026-05-18T01:14:37.357382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:37.357382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1xZNSMq2OdK0VTpjhWa77PENptbzEdcEEzbwivVbv4U6YmchDT3sqDOjc6SduN8NjrFD+pGQAhUVpOzQ90SLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:37.358209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05109","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fceb102f2f8986a4ecf4b2e8fe9b21f411deb317c3c1bec6296327b66abec006","sha256:b900554eb9b2d3c4f9680d850c183117890f95d5e4cf05f5885d231f1d1b0b65"],"state_sha256":"8b01bda7dd627ad62fffebacde5208a9625aee447ef2e50bf50b1682c462548a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rY4NLZPwrFl8Zo/vrFBhsKAoEORuLFGB7egFTMhYEWu3/CmRgsI6KYOsA1fvwugGY9W6V/n8eJjqeZhnvDVxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:26:43.027789Z","bundle_sha256":"c2d5774f563a55e3aebcc28515bb6fb592f70984c02d4d00cf9673fb332cbf4b"}}