{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LZ2KHF5MMA7VZGE4J3XY65YTEQ","short_pith_number":"pith:LZ2KHF5M","schema_version":"1.0","canonical_sha256":"5e74a397ac603f5c989c4eef8f7713241af3a3a57591f0721242a6bb253f17dd","source":{"kind":"arxiv","id":"2410.12755","version":3},"attestation_state":"computed","paper":{"title":"Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Joachim Neu, Jovan Komatovic, Tim Roughgarden","submitted_at":"2024-10-16T17:20:35Z","abstract_excerpt":"Multi-valued validated Byzantine agreement (MVBA), a fundamental primitive of distributed computing, allows $n$ processes to agree on a valid $\\ell$-bit value, despite $t$ faulty processes behaving maliciously. Among hash-based solutions for the asynchronous setting with adaptive faults, the state-of-the-art HMVBA protocol achieves optimal $O(n^2)$ message complexity, (near-)optimal $O(n \\ell + n^2 \\lambda \\log n)$ bit complexity, and optimal $O(1)$ time complexity. However, it only tolerates $t < \\frac15 n$ failures. In contrast, the best-known optimally-resilient protocol, SQ, incurs a highe"},"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":"2410.12755","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-10-16T17:20:35Z","cross_cats_sorted":[],"title_canon_sha256":"4370eef3bcba13a4c794a4b3164aa4de18758773600b9abdc0c7d44f5c586888","abstract_canon_sha256":"4d21af0fd55c26d72bf6da125259676bf3e75183851d5400783e42775287b69f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.310335Z","signature_b64":"AaJwgZzihTnzhZw3AhOmHOCrcHodOb9VNMludd8wqGHRrIc0ZKQEoNOyJXm6BFcL3E3gYE/r4POIlNum8C4eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e74a397ac603f5c989c4eef8f7713241af3a3a57591f0721242a6bb253f17dd","last_reissued_at":"2026-05-17T23:39:18.309729Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.309729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Joachim Neu, Jovan Komatovic, Tim Roughgarden","submitted_at":"2024-10-16T17:20:35Z","abstract_excerpt":"Multi-valued validated Byzantine agreement (MVBA), a fundamental primitive of distributed computing, allows $n$ processes to agree on a valid $\\ell$-bit value, despite $t$ faulty processes behaving maliciously. Among hash-based solutions for the asynchronous setting with adaptive faults, the state-of-the-art HMVBA protocol achieves optimal $O(n^2)$ message complexity, (near-)optimal $O(n \\ell + n^2 \\lambda \\log n)$ bit complexity, and optimal $O(1)$ time complexity. However, it only tolerates $t < \\frac15 n$ failures. In contrast, the best-known optimally-resilient protocol, SQ, incurs a highe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12755","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":""},"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":"2410.12755","created_at":"2026-05-17T23:39:18.309817+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.12755v3","created_at":"2026-05-17T23:39:18.309817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12755","created_at":"2026-05-17T23:39:18.309817+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZ2KHF5MMA7V","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZ2KHF5MMA7VZGE4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZ2KHF5M","created_at":"2026-05-18T12:33:37.589309+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/LZ2KHF5MMA7VZGE4J3XY65YTEQ","json":"https://pith.science/pith/LZ2KHF5MMA7VZGE4J3XY65YTEQ.json","graph_json":"https://pith.science/api/pith-number/LZ2KHF5MMA7VZGE4J3XY65YTEQ/graph.json","events_json":"https://pith.science/api/pith-number/LZ2KHF5MMA7VZGE4J3XY65YTEQ/events.json","paper":"https://pith.science/paper/LZ2KHF5M"},"agent_actions":{"view_html":"https://pith.science/pith/LZ2KHF5MMA7VZGE4J3XY65YTEQ","download_json":"https://pith.science/pith/LZ2KHF5MMA7VZGE4J3XY65YTEQ.json","view_paper":"https://pith.science/paper/LZ2KHF5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.12755&json=true","fetch_graph":"https://pith.science/api/pith-number/LZ2KHF5MMA7VZGE4J3XY65YTEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LZ2KHF5MMA7VZGE4J3XY65YTEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZ2KHF5MMA7VZGE4J3XY65YTEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZ2KHF5MMA7VZGE4J3XY65YTEQ/action/storage_attestation","attest_author":"https://pith.science/pith/LZ2KHF5MMA7VZGE4J3XY65YTEQ/action/author_attestation","sign_citation":"https://pith.science/pith/LZ2KHF5MMA7VZGE4J3XY65YTEQ/action/citation_signature","submit_replication":"https://pith.science/pith/LZ2KHF5MMA7VZGE4J3XY65YTEQ/action/replication_record"}},"created_at":"2026-05-17T23:39:18.309817+00:00","updated_at":"2026-05-17T23:39:18.309817+00:00"}