{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7FNBTDH4LUJQLSGOLSMMVS7O2V","short_pith_number":"pith:7FNBTDH4","canonical_record":{"source":{"id":"1209.6158","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-27T08:25:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9e760dee7152a524a31dc126d60c32baf111ecf823bc7a62f64ea9bcf3af7c82","abstract_canon_sha256":"c0c319551259a95367b6e75b4b47f154aac4397e3499ea0baec0036526abed79"},"schema_version":"1.0"},"canonical_sha256":"f95a198cfc5d1305c8ce5c98cacbeed54952a67dc8c821af6baa82fa07435859","source":{"kind":"arxiv","id":"1209.6158","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6158","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6158v5","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6158","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"7FNBTDH4LUJQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7FNBTDH4LUJQLSGO","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7FNBTDH4","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7FNBTDH4LUJQLSGOLSMMVS7O2V","target":"record","payload":{"canonical_record":{"source":{"id":"1209.6158","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-27T08:25:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9e760dee7152a524a31dc126d60c32baf111ecf823bc7a62f64ea9bcf3af7c82","abstract_canon_sha256":"c0c319551259a95367b6e75b4b47f154aac4397e3499ea0baec0036526abed79"},"schema_version":"1.0"},"canonical_sha256":"f95a198cfc5d1305c8ce5c98cacbeed54952a67dc8c821af6baa82fa07435859","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.782691Z","signature_b64":"qiy8Z1gVtCiE4BoDanqSHiDJbfsBOVY8JIcpXzwk+bvDx61duffbwoPTrFnu1xjh6MPF2db8WLsu7J1eCScTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95a198cfc5d1305c8ce5c98cacbeed54952a67dc8c821af6baa82fa07435859","last_reissued_at":"2026-05-18T02:30:08.782186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.782186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.6158","source_version":5,"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-18T02:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8Q0WlnxWlj+pGTf5oLNLRIJwmh+3d5ixIyEcNtdlp3vxlUGdAVVV4HFWVLQiMLc3aqIOTT91nRerXUqaruhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:46:24.385974Z"},"content_sha256":"fdcc7ffa52edec2d6c646ba027d049bb32311c75d43cad49d829820b73f41fd8","schema_version":"1.0","event_id":"sha256:fdcc7ffa52edec2d6c646ba027d049bb32311c75d43cad49d829820b73f41fd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7FNBTDH4LUJQLSGOLSMMVS7O2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple and Optimal Randomized Fault-Tolerant Rumor Spreading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran","submitted_at":"2012-09-27T08:25:23Z","abstract_excerpt":"We revisit the classic problem of spreading a piece of information in a group of $n$ fully connected processors. By suitably adding a small dose of randomness to the protocol of Gasienic and Pelc (1996), we derive for the first time protocols that (i) use a linear number of messages, (ii) are correct even when an arbitrary number of adversarially chosen processors does not participate in the process, and (iii) with high probability have the asymptotically optimal runtime of $O(\\log n)$ when at least an arbitrarily small constant fraction of the processors are working. In addition, our protocol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6158","kind":"arxiv","version":5},"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-18T02:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XeTSFMf6WGwAqaXFR5BRdWQnX2Cl53/TCHGjJb7IadWrhh/mVu7c3ze6ZsbeLDY6RudB0N+GjjyaOmI4WAowBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:46:24.386324Z"},"content_sha256":"1805e2bef6cebc2464ac87020222cba195724571ca275ae0ab30147967dbfaad","schema_version":"1.0","event_id":"sha256:1805e2bef6cebc2464ac87020222cba195724571ca275ae0ab30147967dbfaad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FNBTDH4LUJQLSGOLSMMVS7O2V/bundle.json","state_url":"https://pith.science/pith/7FNBTDH4LUJQLSGOLSMMVS7O2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FNBTDH4LUJQLSGOLSMMVS7O2V/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-06-07T06:46:24Z","links":{"resolver":"https://pith.science/pith/7FNBTDH4LUJQLSGOLSMMVS7O2V","bundle":"https://pith.science/pith/7FNBTDH4LUJQLSGOLSMMVS7O2V/bundle.json","state":"https://pith.science/pith/7FNBTDH4LUJQLSGOLSMMVS7O2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FNBTDH4LUJQLSGOLSMMVS7O2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7FNBTDH4LUJQLSGOLSMMVS7O2V","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":"c0c319551259a95367b6e75b4b47f154aac4397e3499ea0baec0036526abed79","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-27T08:25:23Z","title_canon_sha256":"9e760dee7152a524a31dc126d60c32baf111ecf823bc7a62f64ea9bcf3af7c82"},"schema_version":"1.0","source":{"id":"1209.6158","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6158","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6158v5","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6158","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"7FNBTDH4LUJQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7FNBTDH4LUJQLSGO","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7FNBTDH4","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:1805e2bef6cebc2464ac87020222cba195724571ca275ae0ab30147967dbfaad","target":"graph","created_at":"2026-05-18T02:30:08Z","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 revisit the classic problem of spreading a piece of information in a group of $n$ fully connected processors. By suitably adding a small dose of randomness to the protocol of Gasienic and Pelc (1996), we derive for the first time protocols that (i) use a linear number of messages, (ii) are correct even when an arbitrary number of adversarially chosen processors does not participate in the process, and (iii) with high probability have the asymptotically optimal runtime of $O(\\log n)$ when at least an arbitrarily small constant fraction of the processors are working. In addition, our protocol","authors_text":"Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-27T08:25:23Z","title":"Simple and Optimal Randomized Fault-Tolerant Rumor Spreading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6158","kind":"arxiv","version":5},"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:fdcc7ffa52edec2d6c646ba027d049bb32311c75d43cad49d829820b73f41fd8","target":"record","created_at":"2026-05-18T02:30:08Z","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":"c0c319551259a95367b6e75b4b47f154aac4397e3499ea0baec0036526abed79","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-27T08:25:23Z","title_canon_sha256":"9e760dee7152a524a31dc126d60c32baf111ecf823bc7a62f64ea9bcf3af7c82"},"schema_version":"1.0","source":{"id":"1209.6158","kind":"arxiv","version":5}},"canonical_sha256":"f95a198cfc5d1305c8ce5c98cacbeed54952a67dc8c821af6baa82fa07435859","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95a198cfc5d1305c8ce5c98cacbeed54952a67dc8c821af6baa82fa07435859","first_computed_at":"2026-05-18T02:30:08.782186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:08.782186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qiy8Z1gVtCiE4BoDanqSHiDJbfsBOVY8JIcpXzwk+bvDx61duffbwoPTrFnu1xjh6MPF2db8WLsu7J1eCScTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:08.782691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.6158","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdcc7ffa52edec2d6c646ba027d049bb32311c75d43cad49d829820b73f41fd8","sha256:1805e2bef6cebc2464ac87020222cba195724571ca275ae0ab30147967dbfaad"],"state_sha256":"6b16d215e2db02664d5e13fc420ca9fb3754e7436e23af2f9bd89de024db5fa1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caBbXA9a8pQYXyHOBrA1kn73HSYwbBkmh8IgxDVDehPCbkBxoxpTmBwiMg0hAB+3AqNKBcz+27OW1S/uYaP8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:46:24.388240Z","bundle_sha256":"e137eb1348448beba17735d81c201ef8d66bb7e2712638650ba4e8a17a850d52"}}