{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:T4QV4ENIUIBY2CXTXDYNUV5MFW","short_pith_number":"pith:T4QV4ENI","schema_version":"1.0","canonical_sha256":"9f215e11a8a2038d0af3b8f0da57ac2db45f7ed316f807ddc016abc956759c13","source":{"kind":"arxiv","id":"2605.14376","version":1},"attestation_state":"computed","paper":{"title":"Fast Gossip-based Rumor Spreading using Small Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Fabien Dufoulon, Gopal Pandurangan, William K. Moses Jr.","submitted_at":"2026-05-14T04:55:05Z","abstract_excerpt":"We study gossip algorithms for the fundamental rumor spreading problem, where the goal is to disseminate a rumor from a given source node to all nodes in an arbitrary (and unknown) graph. Gossip algorithms allow each node to call only one neighbor per round and are therefore highly message-efficient, with low per-node communication overhead per round. The state of the art present fast gossip algorithms, however they typically leverage large-sized messages. This undermines the light-weight communication advantage of gossip, since even though only one neighbor is contacted per round, the message"},"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":"2605.14376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T04:55:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1ba8a1a4acf202f5455d2241300730f7226a52148104ca6a4b05671976b1e0b8","abstract_canon_sha256":"c10f96f16c56756d9e377e07844bfc318f6fbc80add9fe121cd0430ad8716060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.773141Z","signature_b64":"g35yv4ylpgpzgHW0+7DSwwNSo0PGKAL1/bYjF7us8RrNwPC1YdNcQGHtSNdrFrlfihTnpxMc3K13G+WeSmlyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f215e11a8a2038d0af3b8f0da57ac2db45f7ed316f807ddc016abc956759c13","last_reissued_at":"2026-05-17T23:39:07.772449Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.772449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Gossip-based Rumor Spreading using Small Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Fabien Dufoulon, Gopal Pandurangan, William K. Moses Jr.","submitted_at":"2026-05-14T04:55:05Z","abstract_excerpt":"We study gossip algorithms for the fundamental rumor spreading problem, where the goal is to disseminate a rumor from a given source node to all nodes in an arbitrary (and unknown) graph. Gossip algorithms allow each node to call only one neighbor per round and are therefore highly message-efficient, with low per-node communication overhead per round. The state of the art present fast gossip algorithms, however they typically leverage large-sized messages. This undermines the light-weight communication advantage of gossip, since even though only one neighbor is contacted per round, the message"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14376","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":"2605.14376","created_at":"2026-05-17T23:39:07.772558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14376v1","created_at":"2026-05-17T23:39:07.772558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14376","created_at":"2026-05-17T23:39:07.772558+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4QV4ENIUIBY","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4QV4ENIUIBY2CXT","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4QV4ENI","created_at":"2026-05-18T12:33:37.589309+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/T4QV4ENIUIBY2CXTXDYNUV5MFW","json":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW.json","graph_json":"https://pith.science/api/pith-number/T4QV4ENIUIBY2CXTXDYNUV5MFW/graph.json","events_json":"https://pith.science/api/pith-number/T4QV4ENIUIBY2CXTXDYNUV5MFW/events.json","paper":"https://pith.science/paper/T4QV4ENI"},"agent_actions":{"view_html":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW","download_json":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW.json","view_paper":"https://pith.science/paper/T4QV4ENI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14376&json=true","fetch_graph":"https://pith.science/api/pith-number/T4QV4ENIUIBY2CXTXDYNUV5MFW/graph.json","fetch_events":"https://pith.science/api/pith-number/T4QV4ENIUIBY2CXTXDYNUV5MFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/action/storage_attestation","attest_author":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/action/author_attestation","sign_citation":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/action/citation_signature","submit_replication":"https://pith.science/pith/T4QV4ENIUIBY2CXTXDYNUV5MFW/action/replication_record"}},"created_at":"2026-05-17T23:39:07.772558+00:00","updated_at":"2026-05-17T23:39:07.772558+00:00"}