{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RUBBDQY6ZZLQ7FYOAONO5IQFFH","short_pith_number":"pith:RUBBDQY6","schema_version":"1.0","canonical_sha256":"8d0211c31ece570f970e039aeea20529dc0c407c2d7fff70d9da8e2623a8f0bf","source":{"kind":"arxiv","id":"1808.00838","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Noisy Broadcast under Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Ofer Grossman, Sidhanth Mohanty","submitted_at":"2018-08-02T14:38:40Z","abstract_excerpt":"The noisy broadcast model was first studied in [Gallager, TranInf'88] where an $n$-character input is distributed among $n$ processors, so that each processor receives one input bit. Computation proceeds in rounds, where in each round each processor broadcasts a single character, and each reception is corrupted independently at random with some probability $p$. [Gallager, TranInf'88] gave an algorithm for all processors to learn the input in $O(\\log\\log n)$ rounds with high probability. Later, a matching lower bound of $\\Omega(\\log\\log n)$ was given in [Goyal, Kindler, Saks; SICOMP'08].\n  We s"},"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":"1808.00838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-02T14:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"a640648b160951c2857bd73164eb0ebc51962a49bd8588d6bcfc2d3a40ae8243","abstract_canon_sha256":"463b114e8cf6257581bc5437fbb64527381503101fead07e4a39f260571e328e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:03.311086Z","signature_b64":"MUuCNwjdZEvckSvQ6TFrqrt7BSzbfB213Rg9ViDVVYWcCgvGBwbSir+yCL+KwRYudwR0IvIzqIbhLk9X6MXhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d0211c31ece570f970e039aeea20529dc0c407c2d7fff70d9da8e2623a8f0bf","last_reissued_at":"2026-05-18T00:09:03.310381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:03.310381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Noisy Broadcast under Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Ofer Grossman, Sidhanth Mohanty","submitted_at":"2018-08-02T14:38:40Z","abstract_excerpt":"The noisy broadcast model was first studied in [Gallager, TranInf'88] where an $n$-character input is distributed among $n$ processors, so that each processor receives one input bit. Computation proceeds in rounds, where in each round each processor broadcasts a single character, and each reception is corrupted independently at random with some probability $p$. [Gallager, TranInf'88] gave an algorithm for all processors to learn the input in $O(\\log\\log n)$ rounds with high probability. Later, a matching lower bound of $\\Omega(\\log\\log n)$ was given in [Goyal, Kindler, Saks; SICOMP'08].\n  We s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00838","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":"1808.00838","created_at":"2026-05-18T00:09:03.310481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00838v1","created_at":"2026-05-18T00:09:03.310481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00838","created_at":"2026-05-18T00:09:03.310481+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUBBDQY6ZZLQ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUBBDQY6ZZLQ7FYO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUBBDQY6","created_at":"2026-05-18T12:32:50.500415+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/RUBBDQY6ZZLQ7FYOAONO5IQFFH","json":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH.json","graph_json":"https://pith.science/api/pith-number/RUBBDQY6ZZLQ7FYOAONO5IQFFH/graph.json","events_json":"https://pith.science/api/pith-number/RUBBDQY6ZZLQ7FYOAONO5IQFFH/events.json","paper":"https://pith.science/paper/RUBBDQY6"},"agent_actions":{"view_html":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH","download_json":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH.json","view_paper":"https://pith.science/paper/RUBBDQY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00838&json=true","fetch_graph":"https://pith.science/api/pith-number/RUBBDQY6ZZLQ7FYOAONO5IQFFH/graph.json","fetch_events":"https://pith.science/api/pith-number/RUBBDQY6ZZLQ7FYOAONO5IQFFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/action/storage_attestation","attest_author":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/action/author_attestation","sign_citation":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/action/citation_signature","submit_replication":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/action/replication_record"}},"created_at":"2026-05-18T00:09:03.310481+00:00","updated_at":"2026-05-18T00:09:03.310481+00:00"}