{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:57GFRBM3DYWDQVIF5ZSDRCRGVE","short_pith_number":"pith:57GFRBM3","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"},"canonical_sha256":"efcc58859b1e2c385505ee64388a26a9236e44c8cbb7b290936035711ef41baa","source":{"kind":"arxiv","id":"1205.4809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4809","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4809v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4809","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"57GFRBM3DYWD","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"57GFRBM3DYWDQVIF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"57GFRBM3","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:57GFRBM3DYWDQVIF5ZSDRCRGVE","target":"record","payload":{"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"},"canonical_sha256":"efcc58859b1e2c385505ee64388a26a9236e44c8cbb7b290936035711ef41baa","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"},"source_kind":"arxiv","source_id":"1205.4809","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:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45YVLMtDEdM4McKeSnrbeTIfJuawsFho3qPnmFtjYRUbKlK9Z1FWOv4rOE1+JCvz9unuuXoSMChEZQmGxrQeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:25:47.708991Z"},"content_sha256":"747a3de11a774de8c0f75dbd7ae6e32140fb68fbde1df1ac74801c883754600b","schema_version":"1.0","event_id":"sha256:747a3de11a774de8c0f75dbd7ae6e32140fb68fbde1df1ac74801c883754600b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:57GFRBM3DYWDQVIF5ZSDRCRGVE","target":"graph","payload":{"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"},"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:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2HVJuYz5w4uIjTXkvsCdFOVQPzykFfouzBohrcP2EoGGC2VQcfqtBla6+inAWEii7CqNaaC07F/Wql4xyI9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:25:47.709334Z"},"content_sha256":"68233f661ac2d56c6934e9e7cc444fd587b5fe806313e448a7f5e7adcefbb56c","schema_version":"1.0","event_id":"sha256:68233f661ac2d56c6934e9e7cc444fd587b5fe806313e448a7f5e7adcefbb56c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/bundle.json","state_url":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/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-02T18:25:47Z","links":{"resolver":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE","bundle":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/bundle.json","state":"https://pith.science/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57GFRBM3DYWDQVIF5ZSDRCRGVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:57GFRBM3DYWDQVIF5ZSDRCRGVE","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":"6e99cb73aadfc7e8abbe8ceb42f541965e361203eac05245b39fa75a2c81a467","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-22T05:43:53Z","title_canon_sha256":"52f38432fb3e145942c209a8df28b86e17e771f6e6acc7abf80130a09b26cc0c"},"schema_version":"1.0","source":{"id":"1205.4809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4809","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4809v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4809","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"57GFRBM3DYWD","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"57GFRBM3DYWDQVIF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"57GFRBM3","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:68233f661ac2d56c6934e9e7cc444fd587b5fe806313e448a7f5e7adcefbb56c","target":"graph","created_at":"2026-05-18T03:55:11Z","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 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","authors_text":"Lewis Tseng, Nitin Vaidya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-22T05:43:53Z","title":"Iterative Approximate Byzantine Consensus under a Generalized Fault Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4809","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:747a3de11a774de8c0f75dbd7ae6e32140fb68fbde1df1ac74801c883754600b","target":"record","created_at":"2026-05-18T03:55:11Z","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":"6e99cb73aadfc7e8abbe8ceb42f541965e361203eac05245b39fa75a2c81a467","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-22T05:43:53Z","title_canon_sha256":"52f38432fb3e145942c209a8df28b86e17e771f6e6acc7abf80130a09b26cc0c"},"schema_version":"1.0","source":{"id":"1205.4809","kind":"arxiv","version":1}},"canonical_sha256":"efcc58859b1e2c385505ee64388a26a9236e44c8cbb7b290936035711ef41baa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efcc58859b1e2c385505ee64388a26a9236e44c8cbb7b290936035711ef41baa","first_computed_at":"2026-05-18T03:55:11.606156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:11.606156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lJYW71C+voaw9ScSKaf/PiKDN06xf4rxCHq4/0V30GYhLScenF8FByDzXJrx59yjgY6Y34zKM+p0z3jWRCFRBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:11.606714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:747a3de11a774de8c0f75dbd7ae6e32140fb68fbde1df1ac74801c883754600b","sha256:68233f661ac2d56c6934e9e7cc444fd587b5fe806313e448a7f5e7adcefbb56c"],"state_sha256":"37dad7ce2283237d866ecf1ea0cdab33623b724c13f4b7edced4caf52f53ad3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JUAw8nHkuQzQKp1Mr8eDMOicvLIxP0THd3dkLQOXngEyqY/AYFZCgaDMhS5UiqVQs8GyVtjBQFkwtm9V/RmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:25:47.711150Z","bundle_sha256":"489147b925cc561bf16ecafe446f946893573763fc342b3aa83807f2788096fe"}}