{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SA76XBMKHXE6BLXYDFK5D4KYFM","short_pith_number":"pith:SA76XBMK","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"},"canonical_sha256":"903feb858a3dc9e0aef81955d1f1582b147dedb762fde144c8226b6afcbab62b","source":{"kind":"arxiv","id":"2505.19989","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.19989","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.19989v3","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19989","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"pith_short_12","alias_value":"SA76XBMKHXE6","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"pith_short_16","alias_value":"SA76XBMKHXE6BLXY","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"pith_short_8","alias_value":"SA76XBMK","created_at":"2026-06-19T16:12:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SA76XBMKHXE6BLXYDFK5D4KYFM","target":"record","payload":{"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"},"canonical_sha256":"903feb858a3dc9e0aef81955d1f1582b147dedb762fde144c8226b6afcbab62b","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"},"source_kind":"arxiv","source_id":"2505.19989","source_version":3,"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-06-19T16:12:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ya4Tl4mw1+CxARzjVM3C74rMhjCjgdKzMMykMSqPYzyZLagBKfqhxm0ulnZGNT5Qe8iV7rOPT/Bx0bnMf0/1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:36:27.919236Z"},"content_sha256":"b3885ffc06c4c030383a9b7f23ab2cbaeaf3158762a6dd0e14634423a661b0c9","schema_version":"1.0","event_id":"sha256:b3885ffc06c4c030383a9b7f23ab2cbaeaf3158762a6dd0e14634423a661b0c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SA76XBMKHXE6BLXYDFK5D4KYFM","target":"graph","payload":{"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"},"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-06-19T16:12:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KoSaYEppqyWCSU4KrQdlr2t//bfQkivyojs7fwVzBgfQroSZskV9nUcJMgmv/4nKzaLiktEu68t+Vs96DGJnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:36:27.919739Z"},"content_sha256":"21211111eb6104535a77a0175116072cc3105b6c1004cdff93a713ccc92ee587","schema_version":"1.0","event_id":"sha256:21211111eb6104535a77a0175116072cc3105b6c1004cdff93a713ccc92ee587"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/bundle.json","state_url":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/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-09T01:36:27Z","links":{"resolver":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM","bundle":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/bundle.json","state":"https://pith.science/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SA76XBMKHXE6BLXYDFK5D4KYFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SA76XBMKHXE6BLXYDFK5D4KYFM","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":"600a57d04f4e9dc278e68273b7ea3f2503559a7e7a874882db336459aeb468c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-26T13:44:19Z","title_canon_sha256":"503fc1c31fd1f054c77407604d072f9be74e6ba13c76a71842539cfa3339e1ce"},"schema_version":"1.0","source":{"id":"2505.19989","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.19989","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.19989v3","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19989","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"pith_short_12","alias_value":"SA76XBMKHXE6","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"pith_short_16","alias_value":"SA76XBMKHXE6BLXY","created_at":"2026-06-19T16:12:03Z"},{"alias_kind":"pith_short_8","alias_value":"SA76XBMK","created_at":"2026-06-19T16:12:03Z"}],"graph_snapshots":[{"event_id":"sha256:21211111eb6104535a77a0175116072cc3105b6c1004cdff93a713ccc92ee587","target":"graph","created_at":"2026-06-19T16:12:03Z","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/2505.19989/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrei Constantinescu, Anton Paramonov, Marc Dufay, Roger Wattenhofer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-26T13:44:19Z","title":"From Few to Many Faults: Optimal Adaptive Byzantine Agreement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19989","kind":"arxiv","version":3},"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:b3885ffc06c4c030383a9b7f23ab2cbaeaf3158762a6dd0e14634423a661b0c9","target":"record","created_at":"2026-06-19T16:12:03Z","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":"600a57d04f4e9dc278e68273b7ea3f2503559a7e7a874882db336459aeb468c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-26T13:44:19Z","title_canon_sha256":"503fc1c31fd1f054c77407604d072f9be74e6ba13c76a71842539cfa3339e1ce"},"schema_version":"1.0","source":{"id":"2505.19989","kind":"arxiv","version":3}},"canonical_sha256":"903feb858a3dc9e0aef81955d1f1582b147dedb762fde144c8226b6afcbab62b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"903feb858a3dc9e0aef81955d1f1582b147dedb762fde144c8226b6afcbab62b","first_computed_at":"2026-06-19T16:12:03.584650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:03.584650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3jAiEyZQfohHPeYRcntYKpEfABHI25vIj/z1v64NlYHMXT4hQ496JOq8x+AXaSAbs0REszxo6BU/i+7ymBPJBA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:03.585147Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.19989","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3885ffc06c4c030383a9b7f23ab2cbaeaf3158762a6dd0e14634423a661b0c9","sha256:21211111eb6104535a77a0175116072cc3105b6c1004cdff93a713ccc92ee587"],"state_sha256":"ca602d956f9b6c25a436ca15a005ef8ef2d90feb49f50ef8fa0c52c3dcf8f9d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEoINiaBPUc37EZd639NaYAXQa1R549G9COIINCz/CiBceHlvhV+whLFwa8DmJLvjskjzBF6S2QRbJ4CKAdECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:36:27.923729Z","bundle_sha256":"86cbd7da8b22e43477eaf389f72983dc45dfeca7c3033d60e42143392baaa371"}}