{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DB56SGGVBKFEI3TIWBTS3NIXOK","short_pith_number":"pith:DB56SGGV","schema_version":"1.0","canonical_sha256":"187be918d50a8a446e68b0672db5177292d8b9885299a53f94849b807d708c7c","source":{"kind":"arxiv","id":"2402.10059","version":5},"attestation_state":"computed","paper":{"title":"Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Igor Zablotchi, Jovan Komatovic, Manuel Vidigueira, Muhammad Ayaz Dzulfikar, Pierre Civit, Rachid Guerraoui, Seth Gilbert","submitted_at":"2024-02-15T16:29:24Z","abstract_excerpt":"Byzantine agreement allows n processes to decide on a common value, in spite of arbitrary failures. The seminal Dolev-Reischuk bound states that any deterministic solution to Byzantine agreement exchanges Omega(n^2) bits. In synchronous networks, solutions with optimal O(n^2) bit complexity, optimal fault tolerance, and no cryptography have been established for over three decades. However, these solutions lack robustness under adverse network conditions. Therefore, research has increasingly focused on Byzantine agreement for partially synchronous networks. Numerous solutions have been proposed"},"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":"2402.10059","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-02-15T16:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"7f8ae6acedf0b6cd253537f501c78fce5ed6cae8833a8443fe2e75f5edab463f","abstract_canon_sha256":"918a5beb1cb2897cf6be3caa03637c433e30bb9e32966a1a1f225393003b59c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:56.649113Z","signature_b64":"/APuZhR1k37Pjaf2ueX3IORSLTSP2mtYSDHeBMl1hu9JovnXtJvVnZs8+s4/SHLBC5uZE/dcwVF2udg0gJmvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"187be918d50a8a446e68b0672db5177292d8b9885299a53f94849b807d708c7c","last_reissued_at":"2026-07-05T09:24:56.648634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:56.648634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Igor Zablotchi, Jovan Komatovic, Manuel Vidigueira, Muhammad Ayaz Dzulfikar, Pierre Civit, Rachid Guerraoui, Seth Gilbert","submitted_at":"2024-02-15T16:29:24Z","abstract_excerpt":"Byzantine agreement allows n processes to decide on a common value, in spite of arbitrary failures. The seminal Dolev-Reischuk bound states that any deterministic solution to Byzantine agreement exchanges Omega(n^2) bits. In synchronous networks, solutions with optimal O(n^2) bit complexity, optimal fault tolerance, and no cryptography have been established for over three decades. However, these solutions lack robustness under adverse network conditions. Therefore, research has increasingly focused on Byzantine agreement for partially synchronous networks. Numerous solutions have been proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10059","kind":"arxiv","version":5},"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/2402.10059/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":"2402.10059","created_at":"2026-07-05T09:24:56.648692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10059v5","created_at":"2026-07-05T09:24:56.648692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10059","created_at":"2026-07-05T09:24:56.648692+00:00"},{"alias_kind":"pith_short_12","alias_value":"DB56SGGVBKFE","created_at":"2026-07-05T09:24:56.648692+00:00"},{"alias_kind":"pith_short_16","alias_value":"DB56SGGVBKFEI3TI","created_at":"2026-07-05T09:24:56.648692+00:00"},{"alias_kind":"pith_short_8","alias_value":"DB56SGGV","created_at":"2026-07-05T09:24:56.648692+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/DB56SGGVBKFEI3TIWBTS3NIXOK","json":"https://pith.science/pith/DB56SGGVBKFEI3TIWBTS3NIXOK.json","graph_json":"https://pith.science/api/pith-number/DB56SGGVBKFEI3TIWBTS3NIXOK/graph.json","events_json":"https://pith.science/api/pith-number/DB56SGGVBKFEI3TIWBTS3NIXOK/events.json","paper":"https://pith.science/paper/DB56SGGV"},"agent_actions":{"view_html":"https://pith.science/pith/DB56SGGVBKFEI3TIWBTS3NIXOK","download_json":"https://pith.science/pith/DB56SGGVBKFEI3TIWBTS3NIXOK.json","view_paper":"https://pith.science/paper/DB56SGGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10059&json=true","fetch_graph":"https://pith.science/api/pith-number/DB56SGGVBKFEI3TIWBTS3NIXOK/graph.json","fetch_events":"https://pith.science/api/pith-number/DB56SGGVBKFEI3TIWBTS3NIXOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DB56SGGVBKFEI3TIWBTS3NIXOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DB56SGGVBKFEI3TIWBTS3NIXOK/action/storage_attestation","attest_author":"https://pith.science/pith/DB56SGGVBKFEI3TIWBTS3NIXOK/action/author_attestation","sign_citation":"https://pith.science/pith/DB56SGGVBKFEI3TIWBTS3NIXOK/action/citation_signature","submit_replication":"https://pith.science/pith/DB56SGGVBKFEI3TIWBTS3NIXOK/action/replication_record"}},"created_at":"2026-07-05T09:24:56.648692+00:00","updated_at":"2026-07-05T09:24:56.648692+00:00"}