{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SA76XBMKHXE6BLXYDFK5D4KYFM","short_pith_number":"pith:SA76XBMK","schema_version":"1.0","canonical_sha256":"903feb858a3dc9e0aef81955d1f1582b147dedb762fde144c8226b6afcbab62b","source":{"kind":"arxiv","id":"2505.19989","version":3},"attestation_state":"computed","paper":{"title":"From Few to Many Faults: Optimal Adaptive Byzantine Agreement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrei Constantinescu, Anton Paramonov, Marc Dufay, Roger Wattenhofer","submitted_at":"2025-05-26T13:44:19Z","abstract_excerpt":"Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastructure, and fault tolerance in critical services. However, this task can be intensive, often requiring a large number of messages to be exchanged as well as many rounds of communication, especially in the presence of Byzantine faults. This makes efficiency a central challenge in the design of practical agreement protocols.\n  In this paper, we study the problem of Binary Agreement and give protocols that are simultaneous"},"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":"2505.19989","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-26T13:44:19Z","cross_cats_sorted":[],"title_canon_sha256":"503fc1c31fd1f054c77407604d072f9be74e6ba13c76a71842539cfa3339e1ce","abstract_canon_sha256":"600a57d04f4e9dc278e68273b7ea3f2503559a7e7a874882db336459aeb468c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:03.585147Z","signature_b64":"3jAiEyZQfohHPeYRcntYKpEfABHI25vIj/z1v64NlYHMXT4hQ496JOq8x+AXaSAbs0REszxo6BU/i+7ymBPJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"903feb858a3dc9e0aef81955d1f1582b147dedb762fde144c8226b6afcbab62b","last_reissued_at":"2026-06-19T16:12:03.584650Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:03.584650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Few to Many Faults: Optimal Adaptive Byzantine Agreement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrei Constantinescu, Anton Paramonov, Marc Dufay, Roger Wattenhofer","submitted_at":"2025-05-26T13:44:19Z","abstract_excerpt":"Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastructure, and fault tolerance in critical services. However, this task can be intensive, often requiring a large number of messages to be exchanged as well as many rounds of communication, especially in the presence of Byzantine faults. This makes efficiency a central challenge in the design of practical agreement protocols.\n  In this paper, we study the problem of Binary Agreement and give protocols that are simultaneous"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19989","kind":"arxiv","version":3},"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/2505.19989/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":"2505.19989","created_at":"2026-06-19T16:12:03.584710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.19989v3","created_at":"2026-06-19T16:12:03.584710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19989","created_at":"2026-06-19T16:12:03.584710+00:00"},{"alias_kind":"pith_short_12","alias_value":"SA76XBMKHXE6","created_at":"2026-06-19T16:12:03.584710+00:00"},{"alias_kind":"pith_short_16","alias_value":"SA76XBMKHXE6BLXY","created_at":"2026-06-19T16:12:03.584710+00:00"},{"alias_kind":"pith_short_8","alias_value":"SA76XBMK","created_at":"2026-06-19T16:12:03.584710+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/SA76XBMKHXE6BLXYDFK5D4KYFM","json":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM.json","graph_json":"https://pith.science/api/pith-number/SA76XBMKHXE6BLXYDFK5D4KYFM/graph.json","events_json":"https://pith.science/api/pith-number/SA76XBMKHXE6BLXYDFK5D4KYFM/events.json","paper":"https://pith.science/paper/SA76XBMK"},"agent_actions":{"view_html":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM","download_json":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM.json","view_paper":"https://pith.science/paper/SA76XBMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.19989&json=true","fetch_graph":"https://pith.science/api/pith-number/SA76XBMKHXE6BLXYDFK5D4KYFM/graph.json","fetch_events":"https://pith.science/api/pith-number/SA76XBMKHXE6BLXYDFK5D4KYFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/action/storage_attestation","attest_author":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/action/author_attestation","sign_citation":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/action/citation_signature","submit_replication":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/action/replication_record"}},"created_at":"2026-06-19T16:12:03.584710+00:00","updated_at":"2026-06-19T16:12:03.584710+00:00"}