{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QQJES66JPFXA2DSM34KL6WFYO3","short_pith_number":"pith:QQJES66J","schema_version":"1.0","canonical_sha256":"8412497bc9796e0d0e4cdf14bf58b876f5b7feef71880ad14dfee30a7c40f1aa","source":{"kind":"arxiv","id":"1203.1888","version":1},"attestation_state":"computed","paper":{"title":"Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nitin Vaidya","submitted_at":"2012-03-08T19:00:19Z","abstract_excerpt":"This paper presents a proof of correctness of an iterative approximate Byzantine consensus (IABC) algorithm for directed graphs. The iterative algorithm allows fault- free nodes to reach approximate conensus despite the presence of up to f Byzantine faults. Necessary conditions on the underlying network graph for the existence of a correct IABC algorithm were shown in our recent work [15, 16]. [15] also analyzed a specific IABC algorithm and showed that it performs correctly in any network graph that satisfies the necessary condition, proving that the necessary condition is also sufficient. In"},"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":"1203.1888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-03-08T19:00:19Z","cross_cats_sorted":[],"title_canon_sha256":"53ea9828dbcb1500308bdebf9d107cf877f8b05cbb41b6045a46cfb9fa11034a","abstract_canon_sha256":"675722ca0a1cd25300feb6e58e69157b62b347365da0ca9930e0a40cb5ede5d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:52.807608Z","signature_b64":"4tuB1a6io4ZfDCGmC/1Ejk5genga46GONCJJ7xXO4E8+GoagF8HF+SgkmX2NaYSpa96cgQpJT9IT7ikFktzWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8412497bc9796e0d0e4cdf14bf58b876f5b7feef71880ad14dfee30a7c40f1aa","last_reissued_at":"2026-05-18T00:56:52.807003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:52.807003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nitin Vaidya","submitted_at":"2012-03-08T19:00:19Z","abstract_excerpt":"This paper presents a proof of correctness of an iterative approximate Byzantine consensus (IABC) algorithm for directed graphs. The iterative algorithm allows fault- free nodes to reach approximate conensus despite the presence of up to f Byzantine faults. Necessary conditions on the underlying network graph for the existence of a correct IABC algorithm were shown in our recent work [15, 16]. [15] also analyzed a specific IABC algorithm and showed that it performs correctly in any network graph that satisfies the necessary condition, proving that the necessary condition is also sufficient. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1888","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":"1203.1888","created_at":"2026-05-18T00:56:52.807076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1888v1","created_at":"2026-05-18T00:56:52.807076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1888","created_at":"2026-05-18T00:56:52.807076+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQJES66JPFXA","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQJES66JPFXA2DSM","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQJES66J","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.03588","citing_title":"A New Approach to Distributed Hypothesis Testing and Non-Bayesian Learning: Improved Learning Rate and Byzantine-Resilience","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2502.07977","citing_title":"RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent","ref_index":101,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3","json":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3.json","graph_json":"https://pith.science/api/pith-number/QQJES66JPFXA2DSM34KL6WFYO3/graph.json","events_json":"https://pith.science/api/pith-number/QQJES66JPFXA2DSM34KL6WFYO3/events.json","paper":"https://pith.science/paper/QQJES66J"},"agent_actions":{"view_html":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3","download_json":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3.json","view_paper":"https://pith.science/paper/QQJES66J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1888&json=true","fetch_graph":"https://pith.science/api/pith-number/QQJES66JPFXA2DSM34KL6WFYO3/graph.json","fetch_events":"https://pith.science/api/pith-number/QQJES66JPFXA2DSM34KL6WFYO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/action/storage_attestation","attest_author":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/action/author_attestation","sign_citation":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/action/citation_signature","submit_replication":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/action/replication_record"}},"created_at":"2026-05-18T00:56:52.807076+00:00","updated_at":"2026-05-18T00:56:52.807076+00:00"}