{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QQJES66JPFXA2DSM34KL6WFYO3","short_pith_number":"pith:QQJES66J","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"},"canonical_sha256":"8412497bc9796e0d0e4cdf14bf58b876f5b7feef71880ad14dfee30a7c40f1aa","source":{"kind":"arxiv","id":"1203.1888","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1888","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1888v1","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1888","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"QQJES66JPFXA","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QQJES66JPFXA2DSM","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QQJES66J","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QQJES66JPFXA2DSM34KL6WFYO3","target":"record","payload":{"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"},"canonical_sha256":"8412497bc9796e0d0e4cdf14bf58b876f5b7feef71880ad14dfee30a7c40f1aa","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"},"source_kind":"arxiv","source_id":"1203.1888","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-18T00:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/SK60u/hEQwNo3O+Lk2xDWzp0JODl8wwt4Bxcx39j4Njgz+yLbt7Px2eOAzHl0TIclC6D9PT8XJ6UHjMxfzkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:55:11.095343Z"},"content_sha256":"6e237d2093a8b02ebe03a26124428e851c9759c0d6ba25a6cdd5fb809537c5a0","schema_version":"1.0","event_id":"sha256:6e237d2093a8b02ebe03a26124428e851c9759c0d6ba25a6cdd5fb809537c5a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QQJES66JPFXA2DSM34KL6WFYO3","target":"graph","payload":{"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"},"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-18T00:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvvDYkA+B15iqHZWIfewjYaSrRb4I8wLWgRuOtUxXHEI0UJSjmzO4E+6XzcZtvwmkLGF5xddS5YZw+h1LFA1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:55:11.095961Z"},"content_sha256":"4f6233325905c621317cfa2588c46ea2acf4fc889200d7d0569d224008293e92","schema_version":"1.0","event_id":"sha256:4f6233325905c621317cfa2588c46ea2acf4fc889200d7d0569d224008293e92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/bundle.json","state_url":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQJES66JPFXA2DSM34KL6WFYO3/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-05-25T19:55:11Z","links":{"resolver":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3","bundle":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/bundle.json","state":"https://pith.science/pith/QQJES66JPFXA2DSM34KL6WFYO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQJES66JPFXA2DSM34KL6WFYO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QQJES66JPFXA2DSM34KL6WFYO3","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":"675722ca0a1cd25300feb6e58e69157b62b347365da0ca9930e0a40cb5ede5d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-03-08T19:00:19Z","title_canon_sha256":"53ea9828dbcb1500308bdebf9d107cf877f8b05cbb41b6045a46cfb9fa11034a"},"schema_version":"1.0","source":{"id":"1203.1888","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1888","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1888v1","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1888","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"QQJES66JPFXA","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QQJES66JPFXA2DSM","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QQJES66J","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:4f6233325905c621317cfa2588c46ea2acf4fc889200d7d0569d224008293e92","target":"graph","created_at":"2026-05-18T00:56:52Z","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 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","authors_text":"Nitin Vaidya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-03-08T19:00:19Z","title":"Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1888","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:6e237d2093a8b02ebe03a26124428e851c9759c0d6ba25a6cdd5fb809537c5a0","target":"record","created_at":"2026-05-18T00:56:52Z","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":"675722ca0a1cd25300feb6e58e69157b62b347365da0ca9930e0a40cb5ede5d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-03-08T19:00:19Z","title_canon_sha256":"53ea9828dbcb1500308bdebf9d107cf877f8b05cbb41b6045a46cfb9fa11034a"},"schema_version":"1.0","source":{"id":"1203.1888","kind":"arxiv","version":1}},"canonical_sha256":"8412497bc9796e0d0e4cdf14bf58b876f5b7feef71880ad14dfee30a7c40f1aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8412497bc9796e0d0e4cdf14bf58b876f5b7feef71880ad14dfee30a7c40f1aa","first_computed_at":"2026-05-18T00:56:52.807003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:52.807003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4tuB1a6io4ZfDCGmC/1Ejk5genga46GONCJJ7xXO4E8+GoagF8HF+SgkmX2NaYSpa96cgQpJT9IT7ikFktzWAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:52.807608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1888","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e237d2093a8b02ebe03a26124428e851c9759c0d6ba25a6cdd5fb809537c5a0","sha256:4f6233325905c621317cfa2588c46ea2acf4fc889200d7d0569d224008293e92"],"state_sha256":"7b447b5457250d65706278055a983065d534adebe93b2f192c30c523d8ca7d22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFwC/OKs9KOJIuNxfLl13SkXGIRbxabv2P1oxW6+aL7QCMX+Ys22GuSa9Rd1yVpgbcq9cy0LbeY57nvmrW3PAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:55:11.099635Z","bundle_sha256":"72fe10a85836fa28a892135ff549b76f40b7df65caffa8cefd40445e98045485"}}