{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NHABW6SSYIR5NSPZZHL4COL622","short_pith_number":"pith:NHABW6SS","schema_version":"1.0","canonical_sha256":"69c01b7a52c223d6c9f9c9d7c1397ed6a8dc416b9e2e2f6465b9b5b7b982a145","source":{"kind":"arxiv","id":"2501.11788","version":2},"attestation_state":"computed","paper":{"title":"OciorABA: Improved Error-Free Asynchronous Byzantine Agreement via Partial Vector Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Jinyuan Chen","submitted_at":"2025-01-20T23:36:11Z","abstract_excerpt":"In this work, we propose an error-free, information-theoretically secure multi-valued asynchronous Byzantine agreement (ABA) protocol, called OciorABA. This protocol achieves ABA consensus on an $\\ell$-bit message with an expected communication complexity of $O(n\\ell + n^3 \\log q )$ bits and an expected round complexity of $O(1)$ rounds, under the optimal resilience condition $n \\geq 3t + 1$ in an $n$-node network, where up to $t$ nodes may be dishonest. Here, $q$ denotes the alphabet size of the error correction code used in the protocol. In our protocol design, we introduce a new primitive: "},"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":"2501.11788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-01-20T23:36:11Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"8c24b33f6f69772789de0565cb46ec347956c6fee104c1638a7f983e12e4f3b1","abstract_canon_sha256":"cc3fc0d894aba44fcbbe52f2582e760cac6ab0eeeeb33463e44cdc01a07acc3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:16.910141Z","signature_b64":"owwVKzgzbsLD/DgDJAadiUMXLL3vc2hfe55Esf8wQPuh3zVUGZvVaxUbosMsq1S3GrRuilFtBhDQQMl1+7dFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c01b7a52c223d6c9f9c9d7c1397ed6a8dc416b9e2e2f6465b9b5b7b982a145","last_reissued_at":"2026-07-05T10:05:16.909607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:16.909607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OciorABA: Improved Error-Free Asynchronous Byzantine Agreement via Partial Vector Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Jinyuan Chen","submitted_at":"2025-01-20T23:36:11Z","abstract_excerpt":"In this work, we propose an error-free, information-theoretically secure multi-valued asynchronous Byzantine agreement (ABA) protocol, called OciorABA. This protocol achieves ABA consensus on an $\\ell$-bit message with an expected communication complexity of $O(n\\ell + n^3 \\log q )$ bits and an expected round complexity of $O(1)$ rounds, under the optimal resilience condition $n \\geq 3t + 1$ in an $n$-node network, where up to $t$ nodes may be dishonest. Here, $q$ denotes the alphabet size of the error correction code used in the protocol. In our protocol design, we introduce a new primitive: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11788","kind":"arxiv","version":2},"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/2501.11788/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":"2501.11788","created_at":"2026-07-05T10:05:16.909686+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11788v2","created_at":"2026-07-05T10:05:16.909686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11788","created_at":"2026-07-05T10:05:16.909686+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHABW6SSYIR5","created_at":"2026-07-05T10:05:16.909686+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHABW6SSYIR5NSPZ","created_at":"2026-07-05T10:05:16.909686+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHABW6SS","created_at":"2026-07-05T10:05:16.909686+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01118","citing_title":"Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622","json":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622.json","graph_json":"https://pith.science/api/pith-number/NHABW6SSYIR5NSPZZHL4COL622/graph.json","events_json":"https://pith.science/api/pith-number/NHABW6SSYIR5NSPZZHL4COL622/events.json","paper":"https://pith.science/paper/NHABW6SS"},"agent_actions":{"view_html":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622","download_json":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622.json","view_paper":"https://pith.science/paper/NHABW6SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11788&json=true","fetch_graph":"https://pith.science/api/pith-number/NHABW6SSYIR5NSPZZHL4COL622/graph.json","fetch_events":"https://pith.science/api/pith-number/NHABW6SSYIR5NSPZZHL4COL622/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622/action/storage_attestation","attest_author":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622/action/author_attestation","sign_citation":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622/action/citation_signature","submit_replication":"https://pith.science/pith/NHABW6SSYIR5NSPZZHL4COL622/action/replication_record"}},"created_at":"2026-07-05T10:05:16.909686+00:00","updated_at":"2026-07-05T10:05:16.909686+00:00"}