{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7IAXSEEGYEPAEUOBYMT3CSFXDZ","short_pith_number":"pith:7IAXSEEG","schema_version":"1.0","canonical_sha256":"fa01791086c11e0251c1c327b148b71e79df25ab85017f3161e006c98a5c2a60","source":{"kind":"arxiv","id":"1303.2422","version":1},"attestation_state":"computed","paper":{"title":"Robust Distributed Averaging in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Khanafer, Behrouz Touri, Tamer Ba\\c{s}ar","submitted_at":"2013-03-11T04:27:17Z","abstract_excerpt":"In this work, we consider two types of adversarial attacks on a network of nodes seeking to reach consensus. The first type involves an adversary that is capable of breaking a specific number of links at each time instant. In the second attack, the adversary is capable of corrupting the values of the nodes by adding a noise signal. In this latter case, we assume that the adversary is constrained by a power budget. We consider the optimization problem of the adversary and fully characterize its optimum strategy for each scenario."},"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":"1303.2422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-11T04:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"5302ff4090c0e1b20828da165fde70a79a8b7c64076d44104cfcd47a958d5146","abstract_canon_sha256":"ecb5ace75b912ce6350c6fe1a02a13e963b1049defabd1c5b969483020f4dc99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:19.070588Z","signature_b64":"nUYw6xo+Kyh5o4Vh8+SuYIIYIir/zsXiWT2K8XsWPi5OXYHBU/nQuu8N4XVTg66dAFikkOjo9DV7fTJIXBzCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa01791086c11e0251c1c327b148b71e79df25ab85017f3161e006c98a5c2a60","last_reissued_at":"2026-05-18T03:31:19.069862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:19.069862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Distributed Averaging in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Khanafer, Behrouz Touri, Tamer Ba\\c{s}ar","submitted_at":"2013-03-11T04:27:17Z","abstract_excerpt":"In this work, we consider two types of adversarial attacks on a network of nodes seeking to reach consensus. The first type involves an adversary that is capable of breaking a specific number of links at each time instant. In the second attack, the adversary is capable of corrupting the values of the nodes by adding a noise signal. In this latter case, we assume that the adversary is constrained by a power budget. We consider the optimization problem of the adversary and fully characterize its optimum strategy for each scenario."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2422","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":"1303.2422","created_at":"2026-05-18T03:31:19.069969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2422v1","created_at":"2026-05-18T03:31:19.069969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2422","created_at":"2026-05-18T03:31:19.069969+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IAXSEEGYEPA","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IAXSEEGYEPAEUOB","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IAXSEEG","created_at":"2026-05-18T12:27:36.564083+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/7IAXSEEGYEPAEUOBYMT3CSFXDZ","json":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ.json","graph_json":"https://pith.science/api/pith-number/7IAXSEEGYEPAEUOBYMT3CSFXDZ/graph.json","events_json":"https://pith.science/api/pith-number/7IAXSEEGYEPAEUOBYMT3CSFXDZ/events.json","paper":"https://pith.science/paper/7IAXSEEG"},"agent_actions":{"view_html":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ","download_json":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ.json","view_paper":"https://pith.science/paper/7IAXSEEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2422&json=true","fetch_graph":"https://pith.science/api/pith-number/7IAXSEEGYEPAEUOBYMT3CSFXDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7IAXSEEGYEPAEUOBYMT3CSFXDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/action/storage_attestation","attest_author":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/action/author_attestation","sign_citation":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/action/citation_signature","submit_replication":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/action/replication_record"}},"created_at":"2026-05-18T03:31:19.069969+00:00","updated_at":"2026-05-18T03:31:19.069969+00:00"}