{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FUANURU3FYURLMRD5SM6BDXSH3","short_pith_number":"pith:FUANURU3","schema_version":"1.0","canonical_sha256":"2d00da469b2e2915b223ec99e08ef23ef8486969fc5826ec82d55249395f0376","source":{"kind":"arxiv","id":"1502.02290","version":1},"attestation_state":"computed","paper":{"title":"How Hard is Computing Parity with Noisy Communications?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Chinmoy Dutta, D. Manjunath, Jaikumar Radhakrishnan, Yashodhan Kanoria","submitted_at":"2015-02-08T19:32:58Z","abstract_excerpt":"We show a tight lower bound of $\\Omega(N \\log\\log N)$ on the number of transmissions required to compute the parity of $N$ input bits with constant error in a noisy communication network of $N$ randomly placed sensors, each having one input bit and communicating with others using local transmissions with power near the connectivity threshold. This result settles the lower bound question left open by Ying, Srikant and Dullerud (WiOpt 06), who showed how the sum of all the $N$ bits can be computed using $O(N \\log\\log N)$ transmissions. The same lower bound has been shown to hold for a host of ot"},"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":"1502.02290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-08T19:32:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fb24eed986ca1ba11f7cdef9978673f50f95ea7708ad6de8f35b8a26b2d46de3","abstract_canon_sha256":"b6e90905186548c012322b89a3d1d2b19cbdce62fbc2c67b9d10d5a235d82a76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.968099Z","signature_b64":"HKppj7mttKspygj/cVVPFYXdvtUOCIWREwl8HfX916GoOpEKUsyk2Fg9DhL4Gs0S4aTWEbfHOhR350TFzTeUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d00da469b2e2915b223ec99e08ef23ef8486969fc5826ec82d55249395f0376","last_reissued_at":"2026-05-18T02:27:42.967278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.967278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Hard is Computing Parity with Noisy Communications?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Chinmoy Dutta, D. Manjunath, Jaikumar Radhakrishnan, Yashodhan Kanoria","submitted_at":"2015-02-08T19:32:58Z","abstract_excerpt":"We show a tight lower bound of $\\Omega(N \\log\\log N)$ on the number of transmissions required to compute the parity of $N$ input bits with constant error in a noisy communication network of $N$ randomly placed sensors, each having one input bit and communicating with others using local transmissions with power near the connectivity threshold. This result settles the lower bound question left open by Ying, Srikant and Dullerud (WiOpt 06), who showed how the sum of all the $N$ bits can be computed using $O(N \\log\\log N)$ transmissions. The same lower bound has been shown to hold for a host of ot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02290","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":"1502.02290","created_at":"2026-05-18T02:27:42.967424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02290v1","created_at":"2026-05-18T02:27:42.967424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02290","created_at":"2026-05-18T02:27:42.967424+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUANURU3FYUR","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUANURU3FYURLMRD","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUANURU3","created_at":"2026-05-18T12:29:22.688609+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/FUANURU3FYURLMRD5SM6BDXSH3","json":"https://pith.science/pith/FUANURU3FYURLMRD5SM6BDXSH3.json","graph_json":"https://pith.science/api/pith-number/FUANURU3FYURLMRD5SM6BDXSH3/graph.json","events_json":"https://pith.science/api/pith-number/FUANURU3FYURLMRD5SM6BDXSH3/events.json","paper":"https://pith.science/paper/FUANURU3"},"agent_actions":{"view_html":"https://pith.science/pith/FUANURU3FYURLMRD5SM6BDXSH3","download_json":"https://pith.science/pith/FUANURU3FYURLMRD5SM6BDXSH3.json","view_paper":"https://pith.science/paper/FUANURU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02290&json=true","fetch_graph":"https://pith.science/api/pith-number/FUANURU3FYURLMRD5SM6BDXSH3/graph.json","fetch_events":"https://pith.science/api/pith-number/FUANURU3FYURLMRD5SM6BDXSH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUANURU3FYURLMRD5SM6BDXSH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUANURU3FYURLMRD5SM6BDXSH3/action/storage_attestation","attest_author":"https://pith.science/pith/FUANURU3FYURLMRD5SM6BDXSH3/action/author_attestation","sign_citation":"https://pith.science/pith/FUANURU3FYURLMRD5SM6BDXSH3/action/citation_signature","submit_replication":"https://pith.science/pith/FUANURU3FYURLMRD5SM6BDXSH3/action/replication_record"}},"created_at":"2026-05-18T02:27:42.967424+00:00","updated_at":"2026-05-18T02:27:42.967424+00:00"}