{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G7GHPESWBFKI5PPIJULNLI3TA7","short_pith_number":"pith:G7GHPESW","schema_version":"1.0","canonical_sha256":"37cc77925609548ebde84d16d5a37307c869cd06c6a783363931ec54a43cd06d","source":{"kind":"arxiv","id":"1402.2701","version":1},"attestation_state":"computed","paper":{"title":"Optimal Gossip with Direct Addressing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Dahlia Malkhi","submitted_at":"2014-02-12T00:14:58Z","abstract_excerpt":"Gossip algorithms spread information by having nodes repeatedly forward information to a few random contacts. By their very nature, gossip algorithms tend to be distributed and fault tolerant. If done right, they can also be fast and message-efficient. A common model for gossip communication is the random phone call model, in which in each synchronous round each node can PUSH or PULL information to or from a random other node. For example, Karp et al. [FOCS 2000] gave algorithms in this model that spread a message to all nodes in $\\Theta(\\log n)$ rounds while sending only $O(\\log \\log n)$ mess"},"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":"1402.2701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-12T00:14:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d469131fe17f58850df9acf81f28605c9f3f6f1103f8c0ee9a7caa440d21f378","abstract_canon_sha256":"ce6cd23386d750209edfc0e3a32421c9318e24729d4353d417149702ff321a65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:17.597537Z","signature_b64":"97c6gDEA0bIOLR2bm3fln5yyOL9wecbXhhfeuT/e22O4GxN9NHvGsPK8qjjFk2yhmIcgyEfY/STZx7XpTs8ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37cc77925609548ebde84d16d5a37307c869cd06c6a783363931ec54a43cd06d","last_reissued_at":"2026-05-18T02:59:17.596652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:17.596652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Gossip with Direct Addressing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Dahlia Malkhi","submitted_at":"2014-02-12T00:14:58Z","abstract_excerpt":"Gossip algorithms spread information by having nodes repeatedly forward information to a few random contacts. By their very nature, gossip algorithms tend to be distributed and fault tolerant. If done right, they can also be fast and message-efficient. A common model for gossip communication is the random phone call model, in which in each synchronous round each node can PUSH or PULL information to or from a random other node. For example, Karp et al. [FOCS 2000] gave algorithms in this model that spread a message to all nodes in $\\Theta(\\log n)$ rounds while sending only $O(\\log \\log n)$ mess"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2701","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":"1402.2701","created_at":"2026-05-18T02:59:17.596799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2701v1","created_at":"2026-05-18T02:59:17.596799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2701","created_at":"2026-05-18T02:59:17.596799+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7GHPESWBFKI","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7GHPESWBFKI5PPI","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7GHPESW","created_at":"2026-05-18T12:28:28.263976+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/G7GHPESWBFKI5PPIJULNLI3TA7","json":"https://pith.science/pith/G7GHPESWBFKI5PPIJULNLI3TA7.json","graph_json":"https://pith.science/api/pith-number/G7GHPESWBFKI5PPIJULNLI3TA7/graph.json","events_json":"https://pith.science/api/pith-number/G7GHPESWBFKI5PPIJULNLI3TA7/events.json","paper":"https://pith.science/paper/G7GHPESW"},"agent_actions":{"view_html":"https://pith.science/pith/G7GHPESWBFKI5PPIJULNLI3TA7","download_json":"https://pith.science/pith/G7GHPESWBFKI5PPIJULNLI3TA7.json","view_paper":"https://pith.science/paper/G7GHPESW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2701&json=true","fetch_graph":"https://pith.science/api/pith-number/G7GHPESWBFKI5PPIJULNLI3TA7/graph.json","fetch_events":"https://pith.science/api/pith-number/G7GHPESWBFKI5PPIJULNLI3TA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7GHPESWBFKI5PPIJULNLI3TA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7GHPESWBFKI5PPIJULNLI3TA7/action/storage_attestation","attest_author":"https://pith.science/pith/G7GHPESWBFKI5PPIJULNLI3TA7/action/author_attestation","sign_citation":"https://pith.science/pith/G7GHPESWBFKI5PPIJULNLI3TA7/action/citation_signature","submit_replication":"https://pith.science/pith/G7GHPESWBFKI5PPIJULNLI3TA7/action/replication_record"}},"created_at":"2026-05-18T02:59:17.596799+00:00","updated_at":"2026-05-18T02:59:17.596799+00:00"}