{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EH6QUWM7XSIFHKFYE2BZBASUAL","short_pith_number":"pith:EH6QUWM7","schema_version":"1.0","canonical_sha256":"21fd0a599fbc9053a8b8268390825402cbf2e703977aa31f14bf9bcbf8cf07e3","source":{"kind":"arxiv","id":"2504.18649","version":2},"attestation_state":"computed","paper":{"title":"Raptr: Prefix Consensus for Robust High-Performance BFT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Andrei Tonkikh, Balaji Arun, Zekun Li, Zhuolun Xiang","submitted_at":"2025-04-25T19:01:04Z","abstract_excerpt":"In this paper, we present Raptr--a Byzantine fault-tolerant state machine replication (BFT SMR) protocol that combines strong robustness with high throughput, while attaining near-optimal theoretical latency. Raptr delivers exceptionally low latency and high throughput under favorable conditions, and it degrades gracefully in the presence of Byzantine faults and network attacks.\n  Existing high-throughput BFT SMR protocols typically take either pessimistic or optimistic approaches to data dissemination: the former suffers from suboptimal latency in favorable conditions, while the latter deteri"},"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":"2504.18649","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-04-25T19:01:04Z","cross_cats_sorted":[],"title_canon_sha256":"47f2a2272d7af136940fdf36da4757360c2b44d780f68d8b9fcc46f4d96519a0","abstract_canon_sha256":"31b2f389baa0a82b20b6da5235a1f83e13759169db5f066e09d20a238d5bcff9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:35.266856Z","signature_b64":"ZtQksNc6PjCMbSEpjfBBBW7mYLidz9j4APtm3fOW17eoA0xfdbKs0G+32tA3lQzI7jEqfKquZ4jJkYpt3f0FBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21fd0a599fbc9053a8b8268390825402cbf2e703977aa31f14bf9bcbf8cf07e3","last_reissued_at":"2026-07-05T10:55:35.266354Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:35.266354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Raptr: Prefix Consensus for Robust High-Performance BFT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Andrei Tonkikh, Balaji Arun, Zekun Li, Zhuolun Xiang","submitted_at":"2025-04-25T19:01:04Z","abstract_excerpt":"In this paper, we present Raptr--a Byzantine fault-tolerant state machine replication (BFT SMR) protocol that combines strong robustness with high throughput, while attaining near-optimal theoretical latency. Raptr delivers exceptionally low latency and high throughput under favorable conditions, and it degrades gracefully in the presence of Byzantine faults and network attacks.\n  Existing high-throughput BFT SMR protocols typically take either pessimistic or optimistic approaches to data dissemination: the former suffers from suboptimal latency in favorable conditions, while the latter deteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18649","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/2504.18649/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":"2504.18649","created_at":"2026-07-05T10:55:35.266423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.18649v2","created_at":"2026-07-05T10:55:35.266423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18649","created_at":"2026-07-05T10:55:35.266423+00:00"},{"alias_kind":"pith_short_12","alias_value":"EH6QUWM7XSIF","created_at":"2026-07-05T10:55:35.266423+00:00"},{"alias_kind":"pith_short_16","alias_value":"EH6QUWM7XSIFHKFY","created_at":"2026-07-05T10:55:35.266423+00:00"},{"alias_kind":"pith_short_8","alias_value":"EH6QUWM7","created_at":"2026-07-05T10:55:35.266423+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/EH6QUWM7XSIFHKFYE2BZBASUAL","json":"https://pith.science/pith/EH6QUWM7XSIFHKFYE2BZBASUAL.json","graph_json":"https://pith.science/api/pith-number/EH6QUWM7XSIFHKFYE2BZBASUAL/graph.json","events_json":"https://pith.science/api/pith-number/EH6QUWM7XSIFHKFYE2BZBASUAL/events.json","paper":"https://pith.science/paper/EH6QUWM7"},"agent_actions":{"view_html":"https://pith.science/pith/EH6QUWM7XSIFHKFYE2BZBASUAL","download_json":"https://pith.science/pith/EH6QUWM7XSIFHKFYE2BZBASUAL.json","view_paper":"https://pith.science/paper/EH6QUWM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.18649&json=true","fetch_graph":"https://pith.science/api/pith-number/EH6QUWM7XSIFHKFYE2BZBASUAL/graph.json","fetch_events":"https://pith.science/api/pith-number/EH6QUWM7XSIFHKFYE2BZBASUAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EH6QUWM7XSIFHKFYE2BZBASUAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EH6QUWM7XSIFHKFYE2BZBASUAL/action/storage_attestation","attest_author":"https://pith.science/pith/EH6QUWM7XSIFHKFYE2BZBASUAL/action/author_attestation","sign_citation":"https://pith.science/pith/EH6QUWM7XSIFHKFYE2BZBASUAL/action/citation_signature","submit_replication":"https://pith.science/pith/EH6QUWM7XSIFHKFYE2BZBASUAL/action/replication_record"}},"created_at":"2026-07-05T10:55:35.266423+00:00","updated_at":"2026-07-05T10:55:35.266423+00:00"}