{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:CYPB7LXLRZFH6FNK3BUX5THMY2","short_pith_number":"pith:CYPB7LXL","schema_version":"1.0","canonical_sha256":"161e1faeeb8e4a7f15aad8697eccecc6bce08f24ddb98772d52f57233fba6207","source":{"kind":"arxiv","id":"0903.1337","version":1},"attestation_state":"computed","paper":{"title":"Efficient quantization for average consensus","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-03-07T11:16:35Z","abstract_excerpt":"This paper presents an algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links. The algorithm is based on an efficient zooming-in/zooming-out quantization scheme."},"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":"0903.1337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-03-07T11:16:35Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4754c1d97d14b900d302b2160cc7f9e63f25305a204d07b45c4ef6350738b38f","abstract_canon_sha256":"f210e07e7deb02b2f42ccaa53d0f8e6c2fd3d873c669d7c7cd883ac5ae5997dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:04.699399Z","signature_b64":"zFf2+HjGTT9PkkVYmKsw+X/Ys+HUsYHMqgD9EQspoVFZz3eVvb9fatt5gzMTKYuLJjEQ98Qo+eN2AmlPxnZWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"161e1faeeb8e4a7f15aad8697eccecc6bce08f24ddb98772d52f57233fba6207","last_reissued_at":"2026-05-18T04:17:04.698880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:04.698880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient quantization for average consensus","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-03-07T11:16:35Z","abstract_excerpt":"This paper presents an algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links. The algorithm is based on an efficient zooming-in/zooming-out quantization scheme."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1337","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":"0903.1337","created_at":"2026-05-18T04:17:04.698956+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.1337v1","created_at":"2026-05-18T04:17:04.698956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1337","created_at":"2026-05-18T04:17:04.698956+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYPB7LXLRZFH","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYPB7LXLRZFH6FNK","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYPB7LXL","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/CYPB7LXLRZFH6FNK3BUX5THMY2","json":"https://pith.science/pith/CYPB7LXLRZFH6FNK3BUX5THMY2.json","graph_json":"https://pith.science/api/pith-number/CYPB7LXLRZFH6FNK3BUX5THMY2/graph.json","events_json":"https://pith.science/api/pith-number/CYPB7LXLRZFH6FNK3BUX5THMY2/events.json","paper":"https://pith.science/paper/CYPB7LXL"},"agent_actions":{"view_html":"https://pith.science/pith/CYPB7LXLRZFH6FNK3BUX5THMY2","download_json":"https://pith.science/pith/CYPB7LXLRZFH6FNK3BUX5THMY2.json","view_paper":"https://pith.science/paper/CYPB7LXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.1337&json=true","fetch_graph":"https://pith.science/api/pith-number/CYPB7LXLRZFH6FNK3BUX5THMY2/graph.json","fetch_events":"https://pith.science/api/pith-number/CYPB7LXLRZFH6FNK3BUX5THMY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYPB7LXLRZFH6FNK3BUX5THMY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYPB7LXLRZFH6FNK3BUX5THMY2/action/storage_attestation","attest_author":"https://pith.science/pith/CYPB7LXLRZFH6FNK3BUX5THMY2/action/author_attestation","sign_citation":"https://pith.science/pith/CYPB7LXLRZFH6FNK3BUX5THMY2/action/citation_signature","submit_replication":"https://pith.science/pith/CYPB7LXLRZFH6FNK3BUX5THMY2/action/replication_record"}},"created_at":"2026-05-18T04:17:04.698956+00:00","updated_at":"2026-05-18T04:17:04.698956+00:00"}