{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:V7IM6AH34HXAT2FRQQXTYFOMQN","short_pith_number":"pith:V7IM6AH3","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"},"canonical_sha256":"afd0cf00fbe1ee09e8b1842f3c15cc8375634379b0e4db7252f13b67a74c2ba3","source":{"kind":"arxiv","id":"2009.10965","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10965","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10965v2","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10965","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"pith_short_12","alias_value":"V7IM6AH34HXA","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"pith_short_16","alias_value":"V7IM6AH34HXAT2FR","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"pith_short_8","alias_value":"V7IM6AH3","created_at":"2026-07-05T02:03:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:V7IM6AH34HXAT2FRQQXTYFOMQN","target":"record","payload":{"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"},"canonical_sha256":"afd0cf00fbe1ee09e8b1842f3c15cc8375634379b0e4db7252f13b67a74c2ba3","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"},"source_kind":"arxiv","source_id":"2009.10965","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-07-05T02:03:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5j3QLUoDR2vseHKVp4Y2IWozfQ/Ikreynxh+yNR8Gsc2PbQUkbcTjL1HivKI8oJuXqQVxwhotOQC2LHS3rUzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:53:09.346104Z"},"content_sha256":"43c779e90c61aeacfcdbf9f82bfe19a0a49f8c54ae22b05870e603142dec1435","schema_version":"1.0","event_id":"sha256:43c779e90c61aeacfcdbf9f82bfe19a0a49f8c54ae22b05870e603142dec1435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:V7IM6AH34HXAT2FRQQXTYFOMQN","target":"graph","payload":{"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"},"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-07-05T02:03:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mF01HXm4vQgrwnX0urSCJDl3ViP9aDLIA2eHC4/srbdlYZ4gIBgBePs0yjGCaFwj36iqz2gH7uEnMMAmeJaDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:53:09.346730Z"},"content_sha256":"e494f1ff6ff66e70fa71fa916c14f8d3d16d8d8fcd35e2f7a944fa5884e1f140","schema_version":"1.0","event_id":"sha256:e494f1ff6ff66e70fa71fa916c14f8d3d16d8d8fcd35e2f7a944fa5884e1f140"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/bundle.json","state_url":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/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-08-10T03:53:09Z","links":{"resolver":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN","bundle":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/bundle.json","state":"https://pith.science/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7IM6AH34HXAT2FRQQXTYFOMQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:V7IM6AH34HXAT2FRQQXTYFOMQN","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":"68bc8be63896a8dc9964f3a71bc906bb9a5c55d1e8941e206903397ca6ec668b","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-23T07:11:42Z","title_canon_sha256":"b15e20836ddf045ce0d24d4d9564c9a3fb8ea9082850000e95a895439f2e3e7f"},"schema_version":"1.0","source":{"id":"2009.10965","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10965","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10965v2","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10965","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"pith_short_12","alias_value":"V7IM6AH34HXA","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"pith_short_16","alias_value":"V7IM6AH34HXAT2FR","created_at":"2026-07-05T02:03:16Z"},{"alias_kind":"pith_short_8","alias_value":"V7IM6AH3","created_at":"2026-07-05T02:03:16Z"}],"graph_snapshots":[{"event_id":"sha256:e494f1ff6ff66e70fa71fa916c14f8d3d16d8d8fcd35e2f7a944fa5884e1f140","target":"graph","created_at":"2026-07-05T02:03:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.10965/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jinyuan Chen","cross_cats":["cs.CR","cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-23T07:11:42Z","title":"Fundamental Limits of Byzantine Agreement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10965","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:43c779e90c61aeacfcdbf9f82bfe19a0a49f8c54ae22b05870e603142dec1435","target":"record","created_at":"2026-07-05T02:03:16Z","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":"68bc8be63896a8dc9964f3a71bc906bb9a5c55d1e8941e206903397ca6ec668b","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-23T07:11:42Z","title_canon_sha256":"b15e20836ddf045ce0d24d4d9564c9a3fb8ea9082850000e95a895439f2e3e7f"},"schema_version":"1.0","source":{"id":"2009.10965","kind":"arxiv","version":2}},"canonical_sha256":"afd0cf00fbe1ee09e8b1842f3c15cc8375634379b0e4db7252f13b67a74c2ba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afd0cf00fbe1ee09e8b1842f3c15cc8375634379b0e4db7252f13b67a74c2ba3","first_computed_at":"2026-07-05T02:03:16.012408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:03:16.012408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oYvh/Obyqqli/rsZaDPbcEEYv1YAj6h3fbBfRwS+ioybk37O0eCdhNXKKYPAfqSYS/3UE+Rshfi5zZJpVyhmAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:03:16.012902Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.10965","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43c779e90c61aeacfcdbf9f82bfe19a0a49f8c54ae22b05870e603142dec1435","sha256:e494f1ff6ff66e70fa71fa916c14f8d3d16d8d8fcd35e2f7a944fa5884e1f140"],"state_sha256":"2dce523e48e882f2d77a656efa802fc830d8cc1cf34f8b2dfbc584a8c5897e57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RI4eaCe9NUlNrV+eSIgTUApj52cE0+ejrjqpaFQtLnrYcYb2q+/QV5p6l6iWwP/sHqgq5X4EM1myemp54raCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:53:09.352146Z","bundle_sha256":"950998fad38b08057efd0b45d6c8207bc6027f3ed159b46a4de50f0163e49199"}}