{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:V7IM6AH34HXAT2FRQQXTYFOMQN","short_pith_number":"pith:V7IM6AH3","schema_version":"1.0","canonical_sha256":"afd0cf00fbe1ee09e8b1842f3c15cc8375634379b0e4db7252f13b67a74c2ba3","source":{"kind":"arxiv","id":"2009.10965","version":2},"attestation_state":"computed","paper":{"title":"Fundamental Limits of Byzantine Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Jinyuan Chen","submitted_at":"2020-09-23T07:11:42Z","abstract_excerpt":"Byzantine agreement (BA) is a distributed consensus problem where $n$ processors want to reach agreement on an $\\ell$-bit message or value, but up to $t$ of the processors are dishonest or faulty. The challenge of this BA problem lies in achieving agreement despite the presence of dishonest processors who may arbitrarily deviate from the designed protocol. The quality of a BA protocol is measured primarily by using the following three parameters: the number of processors $n$ as a function of $t$ allowed (resilience); the number of rounds (round complexity, denoted by $r$); and the total number"},"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":"2009.10965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-23T07:11:42Z","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"title_canon_sha256":"b15e20836ddf045ce0d24d4d9564c9a3fb8ea9082850000e95a895439f2e3e7f","abstract_canon_sha256":"68bc8be63896a8dc9964f3a71bc906bb9a5c55d1e8941e206903397ca6ec668b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:03:16.012902Z","signature_b64":"oYvh/Obyqqli/rsZaDPbcEEYv1YAj6h3fbBfRwS+ioybk37O0eCdhNXKKYPAfqSYS/3UE+Rshfi5zZJpVyhmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd0cf00fbe1ee09e8b1842f3c15cc8375634379b0e4db7252f13b67a74c2ba3","last_reissued_at":"2026-07-05T02:03:16.012408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:03:16.012408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Limits of Byzantine Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Jinyuan Chen","submitted_at":"2020-09-23T07:11:42Z","abstract_excerpt":"Byzantine agreement (BA) is a distributed consensus problem where $n$ processors want to reach agreement on an $\\ell$-bit message or value, but up to $t$ of the processors are dishonest or faulty. The challenge of this BA problem lies in achieving agreement despite the presence of dishonest processors who may arbitrarily deviate from the designed protocol. The quality of a BA protocol is measured primarily by using the following three parameters: the number of processors $n$ as a function of $t$ allowed (resilience); the number of rounds (round complexity, denoted by $r$); and the total number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10965","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.10965/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.10965","created_at":"2026-07-05T02:03:16.012470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.10965v2","created_at":"2026-07-05T02:03:16.012470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10965","created_at":"2026-07-05T02:03:16.012470+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7IM6AH34HXA","created_at":"2026-07-05T02:03:16.012470+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7IM6AH34HXAT2FR","created_at":"2026-07-05T02:03:16.012470+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7IM6AH3","created_at":"2026-07-05T02:03:16.012470+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01118","citing_title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN","json":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN.json","graph_json":"https://pith.science/api/pith-number/V7IM6AH34HXAT2FRQQXTYFOMQN/graph.json","events_json":"https://pith.science/api/pith-number/V7IM6AH34HXAT2FRQQXTYFOMQN/events.json","paper":"https://pith.science/paper/V7IM6AH3"},"agent_actions":{"view_html":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN","download_json":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN.json","view_paper":"https://pith.science/paper/V7IM6AH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.10965&json=true","fetch_graph":"https://pith.science/api/pith-number/V7IM6AH34HXAT2FRQQXTYFOMQN/graph.json","fetch_events":"https://pith.science/api/pith-number/V7IM6AH34HXAT2FRQQXTYFOMQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/action/storage_attestation","attest_author":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/action/author_attestation","sign_citation":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/action/citation_signature","submit_replication":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/action/replication_record"}},"created_at":"2026-07-05T02:03:16.012470+00:00","updated_at":"2026-07-05T02:03:16.012470+00:00"}