{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TRIFAZEYVNV33SX6BQ4JFGG2CK","short_pith_number":"pith:TRIFAZEY","schema_version":"1.0","canonical_sha256":"9c50506498ab6bbdcafe0c389298da12bac21166d798ad3386af7aa357be985b","source":{"kind":"arxiv","id":"1208.5075","version":4},"attestation_state":"computed","paper":{"title":"Exact Byzantine Consensus in Directed Graphs","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-08-24T22:17:23Z","abstract_excerpt":"Consider a synchronous point-to-point network of n nodes connected by directed links, wherein each node has a binary input. This paper proves a tight necessary and sufficient condition on the underlying communication topology for achieving Byzantine consensus among these nodes in the presence of up to f Byzantine faults. We derive a necessary condition, and then we provide a constructive proof of sufficiency by presenting a Byzantine consensus algorithm for directed graphs that satisfy the necessary condition.\n  Prior work has developed analogous necessary and sufficient conditions for undirec"},"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":"1208.5075","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-24T22:17:23Z","cross_cats_sorted":[],"title_canon_sha256":"d75205fe298b26609d94bb7f0e64ec7f2eafcf79334d7e1ee77127c0c6e64c12","abstract_canon_sha256":"d26d66d84fbc1a7e675828a90b757b3cf10dbea98b38658c5ea8966bb77babf6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:32.800784Z","signature_b64":"ZgQreeNhlC65ZTt8K8tW2Wk97V/G9ehrMJZ2msUX1rN93fP+6PoSD2eJDB8JTFEbE9vqYu7VKOl12Mi6F1fJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c50506498ab6bbdcafe0c389298da12bac21166d798ad3386af7aa357be985b","last_reissued_at":"2026-05-18T02:58:32.800154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:32.800154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Byzantine Consensus in Directed Graphs","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-08-24T22:17:23Z","abstract_excerpt":"Consider a synchronous point-to-point network of n nodes connected by directed links, wherein each node has a binary input. This paper proves a tight necessary and sufficient condition on the underlying communication topology for achieving Byzantine consensus among these nodes in the presence of up to f Byzantine faults. We derive a necessary condition, and then we provide a constructive proof of sufficiency by presenting a Byzantine consensus algorithm for directed graphs that satisfy the necessary condition.\n  Prior work has developed analogous necessary and sufficient conditions for undirec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5075","kind":"arxiv","version":4},"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":"1208.5075","created_at":"2026-05-18T02:58:32.800263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5075v4","created_at":"2026-05-18T02:58:32.800263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5075","created_at":"2026-05-18T02:58:32.800263+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRIFAZEYVNV3","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRIFAZEYVNV33SX6","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRIFAZEY","created_at":"2026-05-18T12:27:23.164592+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/TRIFAZEYVNV33SX6BQ4JFGG2CK","json":"https://pith.science/pith/TRIFAZEYVNV33SX6BQ4JFGG2CK.json","graph_json":"https://pith.science/api/pith-number/TRIFAZEYVNV33SX6BQ4JFGG2CK/graph.json","events_json":"https://pith.science/api/pith-number/TRIFAZEYVNV33SX6BQ4JFGG2CK/events.json","paper":"https://pith.science/paper/TRIFAZEY"},"agent_actions":{"view_html":"https://pith.science/pith/TRIFAZEYVNV33SX6BQ4JFGG2CK","download_json":"https://pith.science/pith/TRIFAZEYVNV33SX6BQ4JFGG2CK.json","view_paper":"https://pith.science/paper/TRIFAZEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5075&json=true","fetch_graph":"https://pith.science/api/pith-number/TRIFAZEYVNV33SX6BQ4JFGG2CK/graph.json","fetch_events":"https://pith.science/api/pith-number/TRIFAZEYVNV33SX6BQ4JFGG2CK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRIFAZEYVNV33SX6BQ4JFGG2CK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRIFAZEYVNV33SX6BQ4JFGG2CK/action/storage_attestation","attest_author":"https://pith.science/pith/TRIFAZEYVNV33SX6BQ4JFGG2CK/action/author_attestation","sign_citation":"https://pith.science/pith/TRIFAZEYVNV33SX6BQ4JFGG2CK/action/citation_signature","submit_replication":"https://pith.science/pith/TRIFAZEYVNV33SX6BQ4JFGG2CK/action/replication_record"}},"created_at":"2026-05-18T02:58:32.800263+00:00","updated_at":"2026-05-18T02:58:32.800263+00:00"}