{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RUBBDQY6ZZLQ7FYOAONO5IQFFH","short_pith_number":"pith:RUBBDQY6","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"},"canonical_sha256":"8d0211c31ece570f970e039aeea20529dc0c407c2d7fff70d9da8e2623a8f0bf","source":{"kind":"arxiv","id":"1808.00838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00838","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00838v1","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00838","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"RUBBDQY6ZZLQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RUBBDQY6ZZLQ7FYO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RUBBDQY6","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RUBBDQY6ZZLQ7FYOAONO5IQFFH","target":"record","payload":{"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"},"canonical_sha256":"8d0211c31ece570f970e039aeea20529dc0c407c2d7fff70d9da8e2623a8f0bf","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"},"source_kind":"arxiv","source_id":"1808.00838","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-18T00:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kE/rJzZPROP93EuzKqgswlFGmR/9KBgWa9U29FQptl56nRnazOqK1Fm19mbIxTEv4ISe3Dt3iEpIRTxzR/rSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:51:04.881861Z"},"content_sha256":"268ded1cf662bc7f0d2b0884828184665e3ea6787b4ac31c047c00ba0804191f","schema_version":"1.0","event_id":"sha256:268ded1cf662bc7f0d2b0884828184665e3ea6787b4ac31c047c00ba0804191f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RUBBDQY6ZZLQ7FYOAONO5IQFFH","target":"graph","payload":{"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"},"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-18T00:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tQljl4q8GbL3ath1isR1RQRLtGn2insofWHHxrWYWFUlx0X5N2Rj9w68DpzX0EsboBCxd8rg2FptaC0kp7uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:51:04.882567Z"},"content_sha256":"48652b03f925d9561d0be6b7d2da522fb8d5b376aa7f0125270a83411620ef7a","schema_version":"1.0","event_id":"sha256:48652b03f925d9561d0be6b7d2da522fb8d5b376aa7f0125270a83411620ef7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/bundle.json","state_url":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/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-28T20:51:04Z","links":{"resolver":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH","bundle":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/bundle.json","state":"https://pith.science/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUBBDQY6ZZLQ7FYOAONO5IQFFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RUBBDQY6ZZLQ7FYOAONO5IQFFH","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":"463b114e8cf6257581bc5437fbb64527381503101fead07e4a39f260571e328e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-02T14:38:40Z","title_canon_sha256":"a640648b160951c2857bd73164eb0ebc51962a49bd8588d6bcfc2d3a40ae8243"},"schema_version":"1.0","source":{"id":"1808.00838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00838","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00838v1","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00838","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"RUBBDQY6ZZLQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RUBBDQY6ZZLQ7FYO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RUBBDQY6","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:48652b03f925d9561d0be6b7d2da522fb8d5b376aa7f0125270a83411620ef7a","target":"graph","created_at":"2026-05-18T00:09:03Z","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":"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","authors_text":"Bernhard Haeupler, Ofer Grossman, Sidhanth Mohanty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-02T14:38:40Z","title":"Algorithms for Noisy Broadcast under Erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00838","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:268ded1cf662bc7f0d2b0884828184665e3ea6787b4ac31c047c00ba0804191f","target":"record","created_at":"2026-05-18T00:09:03Z","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":"463b114e8cf6257581bc5437fbb64527381503101fead07e4a39f260571e328e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-02T14:38:40Z","title_canon_sha256":"a640648b160951c2857bd73164eb0ebc51962a49bd8588d6bcfc2d3a40ae8243"},"schema_version":"1.0","source":{"id":"1808.00838","kind":"arxiv","version":1}},"canonical_sha256":"8d0211c31ece570f970e039aeea20529dc0c407c2d7fff70d9da8e2623a8f0bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d0211c31ece570f970e039aeea20529dc0c407c2d7fff70d9da8e2623a8f0bf","first_computed_at":"2026-05-18T00:09:03.310381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:03.310381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MUuCNwjdZEvckSvQ6TFrqrt7BSzbfB213Rg9ViDVVYWcCgvGBwbSir+yCL+KwRYudwR0IvIzqIbhLk9X6MXhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:03.311086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:268ded1cf662bc7f0d2b0884828184665e3ea6787b4ac31c047c00ba0804191f","sha256:48652b03f925d9561d0be6b7d2da522fb8d5b376aa7f0125270a83411620ef7a"],"state_sha256":"b2f795a3fa4f751a4923c0e49e6cb46b5a32bd5124a211d3898063d788f93249"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auWCKLnOjec0zGIzmckmMRVjJB+JYNWl9XKGIZNZebN08nPBqmO87qR9xoq37d7zswX3Xpn7eZu+C0gk346/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:51:04.885204Z","bundle_sha256":"0c87e8a9ea36a478e14f4ab953354eea284e975ff9d35e8548179187f8e408d2"}}