{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5DYYBXUA7YKKARFHVOGBZ4ZNFM","short_pith_number":"pith:5DYYBXUA","canonical_record":{"source":{"id":"1202.6094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-28T00:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"14c84999f5fd1127685eed6ed6155919fda94e65a157fac4529842c365c729c8","abstract_canon_sha256":"f1e0fb26990d4d6f4f46506e90ea2bf34baee486fc4b4ee99875da30fbe0f6c7"},"schema_version":"1.0"},"canonical_sha256":"e8f180de80fe14a044a7ab8c1cf32d2b203f9792cb39f01aa929051bef060755","source":{"kind":"arxiv","id":"1202.6094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6094","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6094v2","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6094","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"5DYYBXUA7YKK","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5DYYBXUA7YKKARFH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5DYYBXUA","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5DYYBXUA7YKKARFHVOGBZ4ZNFM","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-28T00:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"14c84999f5fd1127685eed6ed6155919fda94e65a157fac4529842c365c729c8","abstract_canon_sha256":"f1e0fb26990d4d6f4f46506e90ea2bf34baee486fc4b4ee99875da30fbe0f6c7"},"schema_version":"1.0"},"canonical_sha256":"e8f180de80fe14a044a7ab8c1cf32d2b203f9792cb39f01aa929051bef060755","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.745953Z","signature_b64":"Wyw+bVxVrJ/NGAHNvZ40zsF4h1bwbQ49CGnyTrPxu4F5QWd1FQ29rIgVesRCFr569O+afdpBmazl69vg76bACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8f180de80fe14a044a7ab8c1cf32d2b203f9792cb39f01aa929051bef060755","last_reissued_at":"2026-05-18T04:00:00.745416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.745416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6094","source_version":2,"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-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7FsmSWqKDt4rMJESjYhd4aubxd+Sz+hd5NS4r65l3GM7FdzAggJZSFEAvVqaSK87g8IUnQx1gh/GegI2/xlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:25:32.214914Z"},"content_sha256":"f319567f5daaa2afb8b383d0d0e09449a2d79fff9d9186668608ca81809bb2e1","schema_version":"1.0","event_id":"sha256:f319567f5daaa2afb8b383d0d0e09449a2d79fff9d9186668608ca81809bb2e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5DYYBXUA7YKKARFHVOGBZ4ZNFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs - Part II: Synchronous and Asynchronous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Lewis Tseng, Nitin Vaidya","submitted_at":"2012-02-28T00:01:48Z","abstract_excerpt":"This report contains two related sets of results with different assumptions on synchrony. The first part is about iterative algorithms in synchronous systems. Following our previous work on synchronous iterative approximate Byzantine consensus (IABC) algorithms, we provide a more intuitive tight necessary and sufficient condition for the existence of such algorithms in synchronous networks1. We believe this condition and the previous results also hold in partially asynchronous algorithmic model.\n  In the second part of the report, we explore the problem in asynchronous networks. While the trad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6094","kind":"arxiv","version":2},"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-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9/8ePgZMocEpRTXhhCof9KJai8ayosSepLJh165miI/za5HNvRDWXa/0z9+hiG0FaMwWQzlvZtrPPhC7waSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:25:32.215265Z"},"content_sha256":"62feab09233dcb5267478a3f9938dc360050f68a1510c34224b2542a0d209dfa","schema_version":"1.0","event_id":"sha256:62feab09233dcb5267478a3f9938dc360050f68a1510c34224b2542a0d209dfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DYYBXUA7YKKARFHVOGBZ4ZNFM/bundle.json","state_url":"https://pith.science/pith/5DYYBXUA7YKKARFHVOGBZ4ZNFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DYYBXUA7YKKARFHVOGBZ4ZNFM/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-07-03T21:25:32Z","links":{"resolver":"https://pith.science/pith/5DYYBXUA7YKKARFHVOGBZ4ZNFM","bundle":"https://pith.science/pith/5DYYBXUA7YKKARFHVOGBZ4ZNFM/bundle.json","state":"https://pith.science/pith/5DYYBXUA7YKKARFHVOGBZ4ZNFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DYYBXUA7YKKARFHVOGBZ4ZNFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5DYYBXUA7YKKARFHVOGBZ4ZNFM","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":"f1e0fb26990d4d6f4f46506e90ea2bf34baee486fc4b4ee99875da30fbe0f6c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-28T00:01:48Z","title_canon_sha256":"14c84999f5fd1127685eed6ed6155919fda94e65a157fac4529842c365c729c8"},"schema_version":"1.0","source":{"id":"1202.6094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6094","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6094v2","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6094","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"5DYYBXUA7YKK","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5DYYBXUA7YKKARFH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5DYYBXUA","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:62feab09233dcb5267478a3f9938dc360050f68a1510c34224b2542a0d209dfa","target":"graph","created_at":"2026-05-18T04:00:00Z","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":"This report contains two related sets of results with different assumptions on synchrony. The first part is about iterative algorithms in synchronous systems. Following our previous work on synchronous iterative approximate Byzantine consensus (IABC) algorithms, we provide a more intuitive tight necessary and sufficient condition for the existence of such algorithms in synchronous networks1. We believe this condition and the previous results also hold in partially asynchronous algorithmic model.\n  In the second part of the report, we explore the problem in asynchronous networks. While the trad","authors_text":"Guanfeng Liang, Lewis Tseng, Nitin Vaidya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-28T00:01:48Z","title":"Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs - Part II: Synchronous and Asynchronous Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6094","kind":"arxiv","version":2},"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:f319567f5daaa2afb8b383d0d0e09449a2d79fff9d9186668608ca81809bb2e1","target":"record","created_at":"2026-05-18T04:00:00Z","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":"f1e0fb26990d4d6f4f46506e90ea2bf34baee486fc4b4ee99875da30fbe0f6c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-28T00:01:48Z","title_canon_sha256":"14c84999f5fd1127685eed6ed6155919fda94e65a157fac4529842c365c729c8"},"schema_version":"1.0","source":{"id":"1202.6094","kind":"arxiv","version":2}},"canonical_sha256":"e8f180de80fe14a044a7ab8c1cf32d2b203f9792cb39f01aa929051bef060755","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8f180de80fe14a044a7ab8c1cf32d2b203f9792cb39f01aa929051bef060755","first_computed_at":"2026-05-18T04:00:00.745416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:00.745416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wyw+bVxVrJ/NGAHNvZ40zsF4h1bwbQ49CGnyTrPxu4F5QWd1FQ29rIgVesRCFr569O+afdpBmazl69vg76bACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:00.745953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f319567f5daaa2afb8b383d0d0e09449a2d79fff9d9186668608ca81809bb2e1","sha256:62feab09233dcb5267478a3f9938dc360050f68a1510c34224b2542a0d209dfa"],"state_sha256":"cadcaa0c2f2fe9edcc6d0e82b274012e1a5b4d3c84369e42c348bb8dd47ace46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8ytumGAgNMhgtXNh9mVVMWPNofO4EMjzSDJmyT4N4Y9+2wH0sArKJRDYSY/nrNMZJ/ONRFygtPE4qdU2wBKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:25:32.217248Z","bundle_sha256":"47c3c08ba450c5614679b74386f2e4c50340cbe10c231960f8613dd1ef9b54f6"}}