{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QQB6QNR4GHPX3X4UWNKNG5B2H6","short_pith_number":"pith:QQB6QNR4","schema_version":"1.0","canonical_sha256":"8403e8363c31df7ddf94b354d3743a3fa96d8361dd8d865ed4a2c6c468cdc637","source":{"kind":"arxiv","id":"1012.3310","version":1},"attestation_state":"computed","paper":{"title":"The asymptotical error of broadcast gossip averaging algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.PR"],"primary_cat":"math.OC","authors_text":"Fabio Fagnani, Paolo Frasca","submitted_at":"2010-12-15T12:38:01Z","abstract_excerpt":"In problems of estimation and control which involve a network, efficient distributed computation of averages is a key issue. This paper presents theoretical and simulation results about the accumulation of errors during the computation of averages by means of iterative \"broadcast gossip\" algorithms. Using martingale theory, we prove that the expectation of the accumulated error can be bounded from above by a quantity which only depends on the mixing parameter of the algorithm and on few properties of the network: its size, its maximum degree and its spectral gap. Both analytical results and co"},"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":"1012.3310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-12-15T12:38:01Z","cross_cats_sorted":["cs.SY","math.PR"],"title_canon_sha256":"7ed49da19008a5023d62af662d6bf6ed6f5b3e8a675d4170aaf695645e8724ff","abstract_canon_sha256":"1781a2ab04a52d672122045b96209da51ab480fb43fef2e7d8163d3fb3cbdaf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:04.444971Z","signature_b64":"lJuu8zhEhrkg1yL/lijwemvjz5nALul5I8xCu4JhtEtmuAiS06nZ09lDBpEgMSe9U57wUVfZIO32OKQOkOWFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8403e8363c31df7ddf94b354d3743a3fa96d8361dd8d865ed4a2c6c468cdc637","last_reissued_at":"2026-05-18T04:17:04.444339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:04.444339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The asymptotical error of broadcast gossip averaging algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.PR"],"primary_cat":"math.OC","authors_text":"Fabio Fagnani, Paolo Frasca","submitted_at":"2010-12-15T12:38:01Z","abstract_excerpt":"In problems of estimation and control which involve a network, efficient distributed computation of averages is a key issue. This paper presents theoretical and simulation results about the accumulation of errors during the computation of averages by means of iterative \"broadcast gossip\" algorithms. Using martingale theory, we prove that the expectation of the accumulated error can be bounded from above by a quantity which only depends on the mixing parameter of the algorithm and on few properties of the network: its size, its maximum degree and its spectral gap. Both analytical results and co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3310","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":"1012.3310","created_at":"2026-05-18T04:17:04.444430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3310v1","created_at":"2026-05-18T04:17:04.444430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3310","created_at":"2026-05-18T04:17:04.444430+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQB6QNR4GHPX","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQB6QNR4GHPX3X4U","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQB6QNR4","created_at":"2026-05-18T12:26:12.377268+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/QQB6QNR4GHPX3X4UWNKNG5B2H6","json":"https://pith.science/pith/QQB6QNR4GHPX3X4UWNKNG5B2H6.json","graph_json":"https://pith.science/api/pith-number/QQB6QNR4GHPX3X4UWNKNG5B2H6/graph.json","events_json":"https://pith.science/api/pith-number/QQB6QNR4GHPX3X4UWNKNG5B2H6/events.json","paper":"https://pith.science/paper/QQB6QNR4"},"agent_actions":{"view_html":"https://pith.science/pith/QQB6QNR4GHPX3X4UWNKNG5B2H6","download_json":"https://pith.science/pith/QQB6QNR4GHPX3X4UWNKNG5B2H6.json","view_paper":"https://pith.science/paper/QQB6QNR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3310&json=true","fetch_graph":"https://pith.science/api/pith-number/QQB6QNR4GHPX3X4UWNKNG5B2H6/graph.json","fetch_events":"https://pith.science/api/pith-number/QQB6QNR4GHPX3X4UWNKNG5B2H6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQB6QNR4GHPX3X4UWNKNG5B2H6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQB6QNR4GHPX3X4UWNKNG5B2H6/action/storage_attestation","attest_author":"https://pith.science/pith/QQB6QNR4GHPX3X4UWNKNG5B2H6/action/author_attestation","sign_citation":"https://pith.science/pith/QQB6QNR4GHPX3X4UWNKNG5B2H6/action/citation_signature","submit_replication":"https://pith.science/pith/QQB6QNR4GHPX3X4UWNKNG5B2H6/action/replication_record"}},"created_at":"2026-05-18T04:17:04.444430+00:00","updated_at":"2026-05-18T04:17:04.444430+00:00"}