{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:57GFRBM3DYWDQVIF5ZSDRCRGVE","short_pith_number":"pith:57GFRBM3","schema_version":"1.0","canonical_sha256":"efcc58859b1e2c385505ee64388a26a9236e44c8cbb7b290936035711ef41baa","source":{"kind":"arxiv","id":"1205.4809","version":1},"attestation_state":"computed","paper":{"title":"Iterative Approximate Byzantine Consensus under a Generalized Fault Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lewis Tseng, Nitin Vaidya","submitted_at":"2012-05-22T05:43:53Z","abstract_excerpt":"In this work, we consider a generalized fault model that can be used to represent a wide range of failure scenarios, including correlated failures and non-uniform node reliabilities. This fault model is general in the sense that fault models studied in prior related work, such as f -total and f -local models, are special cases of the generalized fault model. Under the generalized fault model, we explore iterative approximate Byzantine consensus (IABC) algorithms in arbitrary directed networks. We prove a necessary and sufficient condition for the existence of IABC algorithms. The use of the ge"},"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":"1205.4809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-22T05:43:53Z","cross_cats_sorted":[],"title_canon_sha256":"52f38432fb3e145942c209a8df28b86e17e771f6e6acc7abf80130a09b26cc0c","abstract_canon_sha256":"6e99cb73aadfc7e8abbe8ceb42f541965e361203eac05245b39fa75a2c81a467"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:11.606714Z","signature_b64":"lJYW71C+voaw9ScSKaf/PiKDN06xf4rxCHq4/0V30GYhLScenF8FByDzXJrx59yjgY6Y34zKM+p0z3jWRCFRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efcc58859b1e2c385505ee64388a26a9236e44c8cbb7b290936035711ef41baa","last_reissued_at":"2026-05-18T03:55:11.606156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:11.606156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Approximate Byzantine Consensus under a Generalized Fault Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lewis Tseng, Nitin Vaidya","submitted_at":"2012-05-22T05:43:53Z","abstract_excerpt":"In this work, we consider a generalized fault model that can be used to represent a wide range of failure scenarios, including correlated failures and non-uniform node reliabilities. This fault model is general in the sense that fault models studied in prior related work, such as f -total and f -local models, are special cases of the generalized fault model. Under the generalized fault model, we explore iterative approximate Byzantine consensus (IABC) algorithms in arbitrary directed networks. We prove a necessary and sufficient condition for the existence of IABC algorithms. The use of the ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4809","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":"1205.4809","created_at":"2026-05-18T03:55:11.606248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4809v1","created_at":"2026-05-18T03:55:11.606248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4809","created_at":"2026-05-18T03:55:11.606248+00:00"},{"alias_kind":"pith_short_12","alias_value":"57GFRBM3DYWD","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"57GFRBM3DYWDQVIF","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"57GFRBM3","created_at":"2026-05-18T12:26:53.410803+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/57GFRBM3DYWDQVIF5ZSDRCRGVE","json":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE.json","graph_json":"https://pith.science/api/pith-number/57GFRBM3DYWDQVIF5ZSDRCRGVE/graph.json","events_json":"https://pith.science/api/pith-number/57GFRBM3DYWDQVIF5ZSDRCRGVE/events.json","paper":"https://pith.science/paper/57GFRBM3"},"agent_actions":{"view_html":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE","download_json":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE.json","view_paper":"https://pith.science/paper/57GFRBM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4809&json=true","fetch_graph":"https://pith.science/api/pith-number/57GFRBM3DYWDQVIF5ZSDRCRGVE/graph.json","fetch_events":"https://pith.science/api/pith-number/57GFRBM3DYWDQVIF5ZSDRCRGVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/action/storage_attestation","attest_author":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/action/author_attestation","sign_citation":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/action/citation_signature","submit_replication":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/action/replication_record"}},"created_at":"2026-05-18T03:55:11.606248+00:00","updated_at":"2026-05-18T03:55:11.606248+00:00"}