{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QYUETPDAUSFQXSCE3J2VEZGPON","short_pith_number":"pith:QYUETPDA","schema_version":"1.0","canonical_sha256":"862849bc60a48b0bc844da755264cf736052751d20595262d419a5c18716ee3e","source":{"kind":"arxiv","id":"1011.6596","version":1},"attestation_state":"computed","paper":{"title":"Dependability in Aggregation by Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carlos Baquero, Paulo Jesus, Paulo S\\'ergio Almeida","submitted_at":"2010-11-30T16:10:49Z","abstract_excerpt":"Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capacity, average load, majorities, etc.) that are used to direct the execution of the system. However, the majority of the existing aggregation algorithms exhibit relevant dependability issues, when prospecting their use in real application environments. In this paper, we reveal some dependability issues of aggregation algorithms based on iterative averaging techniques, giving some directions to solve them. This class of algorithm"},"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":"1011.6596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-30T16:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"db3ab79079bc33a60f713311032189d962017932e362fa4870e96ed67efcb966","abstract_canon_sha256":"5e0fa7f30905b26d83e758f1e2c6e7a4f7f9f648a6568c77e2ff6a2a5fa9a48a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:26.540143Z","signature_b64":"1I6zKLrowGBXU+uodoL2TDdCLDMiofSj4Dn9ZLFB6WlFHcLwXd+3YmFf1Wyu9NGi1e4C9ekGQ/TpJPkRvXypDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"862849bc60a48b0bc844da755264cf736052751d20595262d419a5c18716ee3e","last_reissued_at":"2026-05-18T04:34:26.539501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:26.539501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dependability in Aggregation by Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carlos Baquero, Paulo Jesus, Paulo S\\'ergio Almeida","submitted_at":"2010-11-30T16:10:49Z","abstract_excerpt":"Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capacity, average load, majorities, etc.) that are used to direct the execution of the system. However, the majority of the existing aggregation algorithms exhibit relevant dependability issues, when prospecting their use in real application environments. In this paper, we reveal some dependability issues of aggregation algorithms based on iterative averaging techniques, giving some directions to solve them. This class of algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6596","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":"1011.6596","created_at":"2026-05-18T04:34:26.539579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.6596v1","created_at":"2026-05-18T04:34:26.539579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6596","created_at":"2026-05-18T04:34:26.539579+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYUETPDAUSFQ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYUETPDAUSFQXSCE","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYUETPDA","created_at":"2026-05-18T12:26:13.927090+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/QYUETPDAUSFQXSCE3J2VEZGPON","json":"https://pith.science/pith/QYUETPDAUSFQXSCE3J2VEZGPON.json","graph_json":"https://pith.science/api/pith-number/QYUETPDAUSFQXSCE3J2VEZGPON/graph.json","events_json":"https://pith.science/api/pith-number/QYUETPDAUSFQXSCE3J2VEZGPON/events.json","paper":"https://pith.science/paper/QYUETPDA"},"agent_actions":{"view_html":"https://pith.science/pith/QYUETPDAUSFQXSCE3J2VEZGPON","download_json":"https://pith.science/pith/QYUETPDAUSFQXSCE3J2VEZGPON.json","view_paper":"https://pith.science/paper/QYUETPDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.6596&json=true","fetch_graph":"https://pith.science/api/pith-number/QYUETPDAUSFQXSCE3J2VEZGPON/graph.json","fetch_events":"https://pith.science/api/pith-number/QYUETPDAUSFQXSCE3J2VEZGPON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYUETPDAUSFQXSCE3J2VEZGPON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYUETPDAUSFQXSCE3J2VEZGPON/action/storage_attestation","attest_author":"https://pith.science/pith/QYUETPDAUSFQXSCE3J2VEZGPON/action/author_attestation","sign_citation":"https://pith.science/pith/QYUETPDAUSFQXSCE3J2VEZGPON/action/citation_signature","submit_replication":"https://pith.science/pith/QYUETPDAUSFQXSCE3J2VEZGPON/action/replication_record"}},"created_at":"2026-05-18T04:34:26.539579+00:00","updated_at":"2026-05-18T04:34:26.539579+00:00"}