{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UFPF7ALRHNDTNQ2SX3A2DMAFSQ","short_pith_number":"pith:UFPF7ALR","schema_version":"1.0","canonical_sha256":"a15e5f81713b4736c352bec1a1b00594156ad660aa53ca15d3a00d7092a3eb30","source":{"kind":"arxiv","id":"1101.4372","version":1},"attestation_state":"computed","paper":{"title":"Order Optimal Information Spreading Using Algebraic Gossip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Avin, Keren Censor-Hillel, Michael Borokhovich, Zvi Lotker","submitted_at":"2011-01-23T13:44:38Z","abstract_excerpt":"In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate $k$ distinct messages to all $n$ nodes in a network. For arbitrary networks we provide a new upper bound for uniform algebraic gossip of $O((k+\\log n + D)\\Delta)$ rounds with high probability, where $D$ and $\\Delta$ are the diameter and the maximum degree in the network, respectively. For many topologies and selections of $k$ this bound improves previous results, in particular, for graphs with a constant maximum degree it implies that uniform gossip is \\emph{order optima"},"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":"1101.4372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-23T13:44:38Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"0b47c46c9d1ed661c94bb4b97828a14c27f1bdd54ffc243718568f5258749ccc","abstract_canon_sha256":"3c5650249d97ba0ae4a5975c517dd37ae150fdcf19f879c85eed2a53afc4b4cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:11.151769Z","signature_b64":"lRcpX6ZbDxEmrB1rvuAQwI3jv3o0GtkK+6nBrcteH4/Z5lGYT19Q+ood3oQIQq45zVqjaWdcECOzYje9pWO5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a15e5f81713b4736c352bec1a1b00594156ad660aa53ca15d3a00d7092a3eb30","last_reissued_at":"2026-05-18T04:31:11.151301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:11.151301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Order Optimal Information Spreading Using Algebraic Gossip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Avin, Keren Censor-Hillel, Michael Borokhovich, Zvi Lotker","submitted_at":"2011-01-23T13:44:38Z","abstract_excerpt":"In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate $k$ distinct messages to all $n$ nodes in a network. For arbitrary networks we provide a new upper bound for uniform algebraic gossip of $O((k+\\log n + D)\\Delta)$ rounds with high probability, where $D$ and $\\Delta$ are the diameter and the maximum degree in the network, respectively. For many topologies and selections of $k$ this bound improves previous results, in particular, for graphs with a constant maximum degree it implies that uniform gossip is \\emph{order optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4372","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":"1101.4372","created_at":"2026-05-18T04:31:11.151377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4372v1","created_at":"2026-05-18T04:31:11.151377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4372","created_at":"2026-05-18T04:31:11.151377+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFPF7ALRHNDT","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFPF7ALRHNDTNQ2S","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFPF7ALR","created_at":"2026-05-18T12:26:42.757692+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/UFPF7ALRHNDTNQ2SX3A2DMAFSQ","json":"https://pith.science/pith/UFPF7ALRHNDTNQ2SX3A2DMAFSQ.json","graph_json":"https://pith.science/api/pith-number/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/graph.json","events_json":"https://pith.science/api/pith-number/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/events.json","paper":"https://pith.science/paper/UFPF7ALR"},"agent_actions":{"view_html":"https://pith.science/pith/UFPF7ALRHNDTNQ2SX3A2DMAFSQ","download_json":"https://pith.science/pith/UFPF7ALRHNDTNQ2SX3A2DMAFSQ.json","view_paper":"https://pith.science/paper/UFPF7ALR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4372&json=true","fetch_graph":"https://pith.science/api/pith-number/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/action/storage_attestation","attest_author":"https://pith.science/pith/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/action/author_attestation","sign_citation":"https://pith.science/pith/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/action/citation_signature","submit_replication":"https://pith.science/pith/UFPF7ALRHNDTNQ2SX3A2DMAFSQ/action/replication_record"}},"created_at":"2026-05-18T04:31:11.151377+00:00","updated_at":"2026-05-18T04:31:11.151377+00:00"}