{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BSFOVUNBKPRPVOX7ZSJRJR3TTF","short_pith_number":"pith:BSFOVUNB","schema_version":"1.0","canonical_sha256":"0c8aead1a153e2fabaffcc9314c773995cc80477b73c3594b1220d59adfb0db3","source":{"kind":"arxiv","id":"2603.11797","version":2},"attestation_state":"computed","paper":{"title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrew Lewis-Pye, Patrick O'Grady","submitted_at":"2026-03-12T10:59:35Z","abstract_excerpt":"In leader-based State Machine Replication (SMR), the leader's outgoing bandwidth is a natural throughput bottleneck. Erasure coding can alleviate this by letting the leader send each processor one fragment of each block rather than a full copy. The data expansion rate, the ratio of total data sent to payload size, determines how close throughput can get to network bandwidth.\n  We investigate the fundamental limits of bandwidth-efficient leader-based consensus. We prove that protocols with 2-round finality (one voting round) cannot achieve a data expansion rate below approximately~$2.5$, matchi"},"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":"2603.11797","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-03-12T10:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"ddab6f7e5a81c12714af45b791bd422fdb0fd0009f58848dd5ef5b7765d991d5","abstract_canon_sha256":"b5450e496c4a9062bcb8483e583f9cd07d9ccc904f48008cb7556292eef8150b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:15.964454Z","signature_b64":"1BplkOnRZD7BnQv1VetxaDTk1awmzOBLh2AziLWJXS6KSzYUtWhXgWpWAdP3LrPYeZlkCxMMK29+NVZuvJWrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8aead1a153e2fabaffcc9314c773995cc80477b73c3594b1220d59adfb0db3","last_reissued_at":"2026-06-02T02:04:15.963942Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:15.963942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrew Lewis-Pye, Patrick O'Grady","submitted_at":"2026-03-12T10:59:35Z","abstract_excerpt":"In leader-based State Machine Replication (SMR), the leader's outgoing bandwidth is a natural throughput bottleneck. Erasure coding can alleviate this by letting the leader send each processor one fragment of each block rather than a full copy. The data expansion rate, the ratio of total data sent to payload size, determines how close throughput can get to network bandwidth.\n  We investigate the fundamental limits of bandwidth-efficient leader-based consensus. We prove that protocols with 2-round finality (one voting round) cannot achieve a data expansion rate below approximately~$2.5$, matchi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.11797","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/2603.11797/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":"2603.11797","created_at":"2026-06-02T02:04:15.964001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.11797v2","created_at":"2026-06-02T02:04:15.964001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.11797","created_at":"2026-06-02T02:04:15.964001+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSFOVUNBKPRP","created_at":"2026-06-02T02:04:15.964001+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSFOVUNBKPRPVOX7","created_at":"2026-06-02T02:04:15.964001+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSFOVUNB","created_at":"2026-06-02T02:04:15.964001+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/BSFOVUNBKPRPVOX7ZSJRJR3TTF","json":"https://pith.science/pith/BSFOVUNBKPRPVOX7ZSJRJR3TTF.json","graph_json":"https://pith.science/api/pith-number/BSFOVUNBKPRPVOX7ZSJRJR3TTF/graph.json","events_json":"https://pith.science/api/pith-number/BSFOVUNBKPRPVOX7ZSJRJR3TTF/events.json","paper":"https://pith.science/paper/BSFOVUNB"},"agent_actions":{"view_html":"https://pith.science/pith/BSFOVUNBKPRPVOX7ZSJRJR3TTF","download_json":"https://pith.science/pith/BSFOVUNBKPRPVOX7ZSJRJR3TTF.json","view_paper":"https://pith.science/paper/BSFOVUNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.11797&json=true","fetch_graph":"https://pith.science/api/pith-number/BSFOVUNBKPRPVOX7ZSJRJR3TTF/graph.json","fetch_events":"https://pith.science/api/pith-number/BSFOVUNBKPRPVOX7ZSJRJR3TTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSFOVUNBKPRPVOX7ZSJRJR3TTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSFOVUNBKPRPVOX7ZSJRJR3TTF/action/storage_attestation","attest_author":"https://pith.science/pith/BSFOVUNBKPRPVOX7ZSJRJR3TTF/action/author_attestation","sign_citation":"https://pith.science/pith/BSFOVUNBKPRPVOX7ZSJRJR3TTF/action/citation_signature","submit_replication":"https://pith.science/pith/BSFOVUNBKPRPVOX7ZSJRJR3TTF/action/replication_record"}},"created_at":"2026-06-02T02:04:15.964001+00:00","updated_at":"2026-06-02T02:04:15.964001+00:00"}