{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VJG6PVLGA5BTXCMDUXS7DJIERR","short_pith_number":"pith:VJG6PVLG","schema_version":"1.0","canonical_sha256":"aa4de7d56607433b8983a5e5f1a5048c4a8f93c5ecdedb3672ef43dfb499fa34","source":{"kind":"arxiv","id":"2209.00750","version":3},"attestation_state":"computed","paper":{"title":"Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Jing Xu, Qiang Tang, Yingzi Gao, Yuan Lu, Zhenfeng Zhang, Zhenliang Lu","submitted_at":"2022-09-01T23:09:23Z","abstract_excerpt":"Despite recent progresses of practical asynchronous Byzantine fault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly, to obtain maximum throughput, most existing protocols with guaranteed linear amortized communication complexity require each participating node to broadcast a huge batch of transactions, which dramatically sacrifices latency. Worse still, the f slowest nodes' broadcasts might never be agreed to output and thus can be censored (where f is the number of faults). Implementable mitigation to the threat either uses computa"},"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":"2209.00750","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-09-01T23:09:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f06d83e01e0ac2c7044f5f56034bdd3eb6caac8cacacfe2779e9e51b49d6b6a3","abstract_canon_sha256":"29beb1fdc37df41f88343e132f45893475c0d83d8620c711483b5dcd09068960"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:39:56.401884Z","signature_b64":"v2PUTNzvI00UU8DJgJXqnf6irEijeybuP0YSorRmMQTgjMrlUFOjLea4l8esusyp7Wf0vrS/jL7Fz82PChItCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa4de7d56607433b8983a5e5f1a5048c4a8f93c5ecdedb3672ef43dfb499fa34","last_reissued_at":"2026-07-05T07:39:56.401453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:39:56.401453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Jing Xu, Qiang Tang, Yingzi Gao, Yuan Lu, Zhenfeng Zhang, Zhenliang Lu","submitted_at":"2022-09-01T23:09:23Z","abstract_excerpt":"Despite recent progresses of practical asynchronous Byzantine fault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly, to obtain maximum throughput, most existing protocols with guaranteed linear amortized communication complexity require each participating node to broadcast a huge batch of transactions, which dramatically sacrifices latency. Worse still, the f slowest nodes' broadcasts might never be agreed to output and thus can be censored (where f is the number of faults). Implementable mitigation to the threat either uses computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.00750","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/2209.00750/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":"2209.00750","created_at":"2026-07-05T07:39:56.401510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.00750v3","created_at":"2026-07-05T07:39:56.401510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.00750","created_at":"2026-07-05T07:39:56.401510+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJG6PVLGA5BT","created_at":"2026-07-05T07:39:56.401510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJG6PVLGA5BTXCMD","created_at":"2026-07-05T07:39:56.401510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJG6PVLG","created_at":"2026-07-05T07:39:56.401510+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/VJG6PVLGA5BTXCMDUXS7DJIERR","json":"https://pith.science/pith/VJG6PVLGA5BTXCMDUXS7DJIERR.json","graph_json":"https://pith.science/api/pith-number/VJG6PVLGA5BTXCMDUXS7DJIERR/graph.json","events_json":"https://pith.science/api/pith-number/VJG6PVLGA5BTXCMDUXS7DJIERR/events.json","paper":"https://pith.science/paper/VJG6PVLG"},"agent_actions":{"view_html":"https://pith.science/pith/VJG6PVLGA5BTXCMDUXS7DJIERR","download_json":"https://pith.science/pith/VJG6PVLGA5BTXCMDUXS7DJIERR.json","view_paper":"https://pith.science/paper/VJG6PVLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.00750&json=true","fetch_graph":"https://pith.science/api/pith-number/VJG6PVLGA5BTXCMDUXS7DJIERR/graph.json","fetch_events":"https://pith.science/api/pith-number/VJG6PVLGA5BTXCMDUXS7DJIERR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJG6PVLGA5BTXCMDUXS7DJIERR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJG6PVLGA5BTXCMDUXS7DJIERR/action/storage_attestation","attest_author":"https://pith.science/pith/VJG6PVLGA5BTXCMDUXS7DJIERR/action/author_attestation","sign_citation":"https://pith.science/pith/VJG6PVLGA5BTXCMDUXS7DJIERR/action/citation_signature","submit_replication":"https://pith.science/pith/VJG6PVLGA5BTXCMDUXS7DJIERR/action/replication_record"}},"created_at":"2026-07-05T07:39:56.401510+00:00","updated_at":"2026-07-05T07:39:56.401510+00:00"}