{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:EDRAQJEWWS57GEGPU6FQ5NIKAN","short_pith_number":"pith:EDRAQJEW","schema_version":"1.0","canonical_sha256":"20e2082496b4bbf310cfa78b0eb50a0371710696f55b92ac9d3de8a97b6d8192","source":{"kind":"arxiv","id":"0907.0748","version":2},"attestation_state":"computed","paper":{"title":"Gossip consensus algorithms via quantized communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Fabio Fagnani, Paolo Frasca, Ruggero Carli, Sandro Zampieri","submitted_at":"2009-07-04T09:12:16Z","abstract_excerpt":"This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise ''gossip'' communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quantizer, and whether they should use, and how, exact information regarding their own states in the update."},"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":"0907.0748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-07-04T09:12:16Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"3935105a74bee5e54b935d9174c72321d6837509d86ac16c28be2e80075af3c9","abstract_canon_sha256":"2379661f2a9ebe56f2c31b9db00b61e6d95ce0c10d661e0d6e34135e63ff5228"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:04.668887Z","signature_b64":"oGQyl2wRy1jhHTV5r5olBm4Fx/4aHwTIXB6qpiIwol66AdBm8jdAAOkSBh3POzwno3eSB9RVMWsSd45IkLrIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20e2082496b4bbf310cfa78b0eb50a0371710696f55b92ac9d3de8a97b6d8192","last_reissued_at":"2026-05-18T04:17:04.668391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:04.668391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gossip consensus algorithms via quantized communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Fabio Fagnani, Paolo Frasca, Ruggero Carli, Sandro Zampieri","submitted_at":"2009-07-04T09:12:16Z","abstract_excerpt":"This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise ''gossip'' communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quantizer, and whether they should use, and how, exact information regarding their own states in the update."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.0748","kind":"arxiv","version":2},"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":"0907.0748","created_at":"2026-05-18T04:17:04.668486+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.0748v2","created_at":"2026-05-18T04:17:04.668486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.0748","created_at":"2026-05-18T04:17:04.668486+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDRAQJEWWS57","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDRAQJEWWS57GEGP","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDRAQJEW","created_at":"2026-05-18T12:25:59.703012+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/EDRAQJEWWS57GEGPU6FQ5NIKAN","json":"https://pith.science/pith/EDRAQJEWWS57GEGPU6FQ5NIKAN.json","graph_json":"https://pith.science/api/pith-number/EDRAQJEWWS57GEGPU6FQ5NIKAN/graph.json","events_json":"https://pith.science/api/pith-number/EDRAQJEWWS57GEGPU6FQ5NIKAN/events.json","paper":"https://pith.science/paper/EDRAQJEW"},"agent_actions":{"view_html":"https://pith.science/pith/EDRAQJEWWS57GEGPU6FQ5NIKAN","download_json":"https://pith.science/pith/EDRAQJEWWS57GEGPU6FQ5NIKAN.json","view_paper":"https://pith.science/paper/EDRAQJEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.0748&json=true","fetch_graph":"https://pith.science/api/pith-number/EDRAQJEWWS57GEGPU6FQ5NIKAN/graph.json","fetch_events":"https://pith.science/api/pith-number/EDRAQJEWWS57GEGPU6FQ5NIKAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDRAQJEWWS57GEGPU6FQ5NIKAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDRAQJEWWS57GEGPU6FQ5NIKAN/action/storage_attestation","attest_author":"https://pith.science/pith/EDRAQJEWWS57GEGPU6FQ5NIKAN/action/author_attestation","sign_citation":"https://pith.science/pith/EDRAQJEWWS57GEGPU6FQ5NIKAN/action/citation_signature","submit_replication":"https://pith.science/pith/EDRAQJEWWS57GEGPU6FQ5NIKAN/action/replication_record"}},"created_at":"2026-05-18T04:17:04.668486+00:00","updated_at":"2026-05-18T04:17:04.668486+00:00"}