{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FJKXX4IJLUQEPXNBLMXDZ3XZ63","short_pith_number":"pith:FJKXX4IJ","schema_version":"1.0","canonical_sha256":"2a557bf1095d2047dda15b2e3ceef9f6c196f9223c90f6862bfbc1b9a676823d","source":{"kind":"arxiv","id":"1511.08232","version":1},"attestation_state":"computed","paper":{"title":"Beyond One Third Byzantine Failures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anne-Marie Kermarrec, Carole Delporte-Gallet, Cheng Wang, Hugues Fauconnier, Rachid Guerraoui","submitted_at":"2015-11-25T21:25:42Z","abstract_excerpt":"The Byzantine agreement problem requires a set of $n$ processes to agree on a value sent by a transmitter, despite a subset of $b$ processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system. It is well known that the problem has a solution in a (an eventually) synchronous message passing distributed system iff the number of processes in the Byzantine subset is less than one third of the total number of processes, i.e. iff $n > 3b+1$. The rest of the processes are expected to be correct: they should never deviate from the algorithm a"},"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":"1511.08232","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2015-11-25T21:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"b9cca31a0b669dbc21eb44038c554cfe30de429d06aaf278654bc4a686e1aa87","abstract_canon_sha256":"c6bc891a2b7a66353d2548b946101b269964bb7881c331204ee0dbcd8332e8a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:56.244451Z","signature_b64":"cQ6Bt7qTkyiry9qPdbe9KOyRbRr/FJLzKm1ugmtGAeyzjUfXEfdXCVgJCeFNs8dfu4YlMyDaiaLqj1Wazso2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a557bf1095d2047dda15b2e3ceef9f6c196f9223c90f6862bfbc1b9a676823d","last_reissued_at":"2026-05-18T01:25:56.243672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:56.243672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond One Third Byzantine Failures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anne-Marie Kermarrec, Carole Delporte-Gallet, Cheng Wang, Hugues Fauconnier, Rachid Guerraoui","submitted_at":"2015-11-25T21:25:42Z","abstract_excerpt":"The Byzantine agreement problem requires a set of $n$ processes to agree on a value sent by a transmitter, despite a subset of $b$ processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system. It is well known that the problem has a solution in a (an eventually) synchronous message passing distributed system iff the number of processes in the Byzantine subset is less than one third of the total number of processes, i.e. iff $n > 3b+1$. The rest of the processes are expected to be correct: they should never deviate from the algorithm a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08232","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.08232","created_at":"2026-05-18T01:25:56.243818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08232v1","created_at":"2026-05-18T01:25:56.243818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08232","created_at":"2026-05-18T01:25:56.243818+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJKXX4IJLUQE","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJKXX4IJLUQEPXNB","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJKXX4IJ","created_at":"2026-05-18T12:29:19.899920+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/FJKXX4IJLUQEPXNBLMXDZ3XZ63","json":"https://pith.science/pith/FJKXX4IJLUQEPXNBLMXDZ3XZ63.json","graph_json":"https://pith.science/api/pith-number/FJKXX4IJLUQEPXNBLMXDZ3XZ63/graph.json","events_json":"https://pith.science/api/pith-number/FJKXX4IJLUQEPXNBLMXDZ3XZ63/events.json","paper":"https://pith.science/paper/FJKXX4IJ"},"agent_actions":{"view_html":"https://pith.science/pith/FJKXX4IJLUQEPXNBLMXDZ3XZ63","download_json":"https://pith.science/pith/FJKXX4IJLUQEPXNBLMXDZ3XZ63.json","view_paper":"https://pith.science/paper/FJKXX4IJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08232&json=true","fetch_graph":"https://pith.science/api/pith-number/FJKXX4IJLUQEPXNBLMXDZ3XZ63/graph.json","fetch_events":"https://pith.science/api/pith-number/FJKXX4IJLUQEPXNBLMXDZ3XZ63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJKXX4IJLUQEPXNBLMXDZ3XZ63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJKXX4IJLUQEPXNBLMXDZ3XZ63/action/storage_attestation","attest_author":"https://pith.science/pith/FJKXX4IJLUQEPXNBLMXDZ3XZ63/action/author_attestation","sign_citation":"https://pith.science/pith/FJKXX4IJLUQEPXNBLMXDZ3XZ63/action/citation_signature","submit_replication":"https://pith.science/pith/FJKXX4IJLUQEPXNBLMXDZ3XZ63/action/replication_record"}},"created_at":"2026-05-18T01:25:56.243818+00:00","updated_at":"2026-05-18T01:25:56.243818+00:00"}