{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2HZ53UURWMHMFW46XXXKX3IVWO","short_pith_number":"pith:2HZ53UUR","schema_version":"1.0","canonical_sha256":"d1f3ddd291b30ec2db9ebdeeabed15b385556486fd251ea443cc7077e1dfa78b","source":{"kind":"arxiv","id":"1104.2944","version":1},"attestation_state":"computed","paper":{"title":"Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SI","physics.soc-ph"],"primary_cat":"cs.DM","authors_text":"Bernhard Haeupler, Jonathan A. Kelner, Keren Censor-Hillel, Petar Maymounkov","submitted_at":"2011-04-14T23:39:22Z","abstract_excerpt":"In this paper, we study the question of how efficiently a collection of interconnected nodes can perform a global computation in the widely studied GOSSIP model of communication. In this model, nodes do not know the global topology of the network, and they may only initiate contact with a single neighbor in each round. This model contrasts with the much less restrictive LOCAL model, where a node may simultaneously communicate with all of its neighbors in a single round. A basic question in this setting is how many rounds of communication are required for the information dissemination problem, "},"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":"1104.2944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-14T23:39:22Z","cross_cats_sorted":["cs.DC","cs.SI","physics.soc-ph"],"title_canon_sha256":"fd808b2f99b6967f679062d2d5a9ddbb735833c66b0994984967b3abf497681f","abstract_canon_sha256":"3c4ca459d9c288e4a31e30211f0de88e2535cdff5fd458467afceb41c7313d78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:06.867533Z","signature_b64":"4PvUXLAxw84D/esjjr1cwPBoBuSylqU+MFuh7vZK3mkHWlUKYUfuk9OiJh+ChPMHD79HsBBhlAC09snjBSZICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1f3ddd291b30ec2db9ebdeeabed15b385556486fd251ea443cc7077e1dfa78b","last_reissued_at":"2026-05-18T04:24:06.867042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:06.867042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SI","physics.soc-ph"],"primary_cat":"cs.DM","authors_text":"Bernhard Haeupler, Jonathan A. Kelner, Keren Censor-Hillel, Petar Maymounkov","submitted_at":"2011-04-14T23:39:22Z","abstract_excerpt":"In this paper, we study the question of how efficiently a collection of interconnected nodes can perform a global computation in the widely studied GOSSIP model of communication. In this model, nodes do not know the global topology of the network, and they may only initiate contact with a single neighbor in each round. This model contrasts with the much less restrictive LOCAL model, where a node may simultaneously communicate with all of its neighbors in a single round. A basic question in this setting is how many rounds of communication are required for the information dissemination problem, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2944","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":"1104.2944","created_at":"2026-05-18T04:24:06.867115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2944v1","created_at":"2026-05-18T04:24:06.867115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2944","created_at":"2026-05-18T04:24:06.867115+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HZ53UURWMHM","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HZ53UURWMHMFW46","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HZ53UUR","created_at":"2026-05-18T12:26:18.847500+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/2HZ53UURWMHMFW46XXXKX3IVWO","json":"https://pith.science/pith/2HZ53UURWMHMFW46XXXKX3IVWO.json","graph_json":"https://pith.science/api/pith-number/2HZ53UURWMHMFW46XXXKX3IVWO/graph.json","events_json":"https://pith.science/api/pith-number/2HZ53UURWMHMFW46XXXKX3IVWO/events.json","paper":"https://pith.science/paper/2HZ53UUR"},"agent_actions":{"view_html":"https://pith.science/pith/2HZ53UURWMHMFW46XXXKX3IVWO","download_json":"https://pith.science/pith/2HZ53UURWMHMFW46XXXKX3IVWO.json","view_paper":"https://pith.science/paper/2HZ53UUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2944&json=true","fetch_graph":"https://pith.science/api/pith-number/2HZ53UURWMHMFW46XXXKX3IVWO/graph.json","fetch_events":"https://pith.science/api/pith-number/2HZ53UURWMHMFW46XXXKX3IVWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HZ53UURWMHMFW46XXXKX3IVWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HZ53UURWMHMFW46XXXKX3IVWO/action/storage_attestation","attest_author":"https://pith.science/pith/2HZ53UURWMHMFW46XXXKX3IVWO/action/author_attestation","sign_citation":"https://pith.science/pith/2HZ53UURWMHMFW46XXXKX3IVWO/action/citation_signature","submit_replication":"https://pith.science/pith/2HZ53UURWMHMFW46XXXKX3IVWO/action/replication_record"}},"created_at":"2026-05-18T04:24:06.867115+00:00","updated_at":"2026-05-18T04:24:06.867115+00:00"}