{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7IAXSEEGYEPAEUOBYMT3CSFXDZ","short_pith_number":"pith:7IAXSEEG","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"},"canonical_sha256":"fa01791086c11e0251c1c327b148b71e79df25ab85017f3161e006c98a5c2a60","source":{"kind":"arxiv","id":"1303.2422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2422","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2422v1","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2422","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"7IAXSEEGYEPA","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7IAXSEEGYEPAEUOB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7IAXSEEG","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7IAXSEEGYEPAEUOBYMT3CSFXDZ","target":"record","payload":{"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"},"canonical_sha256":"fa01791086c11e0251c1c327b148b71e79df25ab85017f3161e006c98a5c2a60","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"},"source_kind":"arxiv","source_id":"1303.2422","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XIiEVJ2YAO6IW3xJ8qLjuY9ilp/1SV4WvdwDSkDtornWnST+dyd8ccZUTQGCF8SwIeuh5SCmMbKZ+UVtBeYOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T08:56:30.183698Z"},"content_sha256":"61f67e04852f46a972b8e942eeba42e0e5df8bb491673ce68fff82ebfbd0daef","schema_version":"1.0","event_id":"sha256:61f67e04852f46a972b8e942eeba42e0e5df8bb491673ce68fff82ebfbd0daef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7IAXSEEGYEPAEUOBYMT3CSFXDZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCT0t4IUFrYcKy/jGPrZzWsLSK8g3cRzXkiRWA9X9rDXhTo4t2xgiom+q8XVXveaMJa3YoWjzi/llJGi97iqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T08:56:30.184041Z"},"content_sha256":"12d66ac77a47859ac13b628768445664eb78877d691097f6a8795bcfe2851dfe","schema_version":"1.0","event_id":"sha256:12d66ac77a47859ac13b628768445664eb78877d691097f6a8795bcfe2851dfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/bundle.json","state_url":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T08:56:30Z","links":{"resolver":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ","bundle":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/bundle.json","state":"https://pith.science/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7IAXSEEGYEPAEUOBYMT3CSFXDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7IAXSEEGYEPAEUOBYMT3CSFXDZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ecb5ace75b912ce6350c6fe1a02a13e963b1049defabd1c5b969483020f4dc99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-11T04:27:17Z","title_canon_sha256":"5302ff4090c0e1b20828da165fde70a79a8b7c64076d44104cfcd47a958d5146"},"schema_version":"1.0","source":{"id":"1303.2422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2422","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2422v1","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2422","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"7IAXSEEGYEPA","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7IAXSEEGYEPAEUOB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7IAXSEEG","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:12d66ac77a47859ac13b628768445664eb78877d691097f6a8795bcfe2851dfe","target":"graph","created_at":"2026-05-18T03:31:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Ali Khanafer, Behrouz Touri, Tamer Ba\\c{s}ar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-11T04:27:17Z","title":"Robust Distributed Averaging in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2422","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61f67e04852f46a972b8e942eeba42e0e5df8bb491673ce68fff82ebfbd0daef","target":"record","created_at":"2026-05-18T03:31:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ecb5ace75b912ce6350c6fe1a02a13e963b1049defabd1c5b969483020f4dc99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-11T04:27:17Z","title_canon_sha256":"5302ff4090c0e1b20828da165fde70a79a8b7c64076d44104cfcd47a958d5146"},"schema_version":"1.0","source":{"id":"1303.2422","kind":"arxiv","version":1}},"canonical_sha256":"fa01791086c11e0251c1c327b148b71e79df25ab85017f3161e006c98a5c2a60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa01791086c11e0251c1c327b148b71e79df25ab85017f3161e006c98a5c2a60","first_computed_at":"2026-05-18T03:31:19.069862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:19.069862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nUYw6xo+Kyh5o4Vh8+SuYIIYIir/zsXiWT2K8XsWPi5OXYHBU/nQuu8N4XVTg66dAFikkOjo9DV7fTJIXBzCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:19.070588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61f67e04852f46a972b8e942eeba42e0e5df8bb491673ce68fff82ebfbd0daef","sha256:12d66ac77a47859ac13b628768445664eb78877d691097f6a8795bcfe2851dfe"],"state_sha256":"1f615a9bf796c5d514fb031eb3020ae06752837141a954e9b052d89fdd58558c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qU4+IWzlyqO2vorOsL663WfwU9oCmLY+3oNi2JTRpfxndLR3xtF0FCBge9LWBi7wQ/NbB5ws+GIHVM/7ReoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T08:56:30.186036Z","bundle_sha256":"23e98c2c4def73d4fdf50c0fe324a1cd0688da3f8eef0a12d87f3f549a3269c2"}}