{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:27VU7I2URELM4K3DCWXTCQCVLP","short_pith_number":"pith:27VU7I2U","schema_version":"1.0","canonical_sha256":"d7eb4fa3548916ce2b6315af3140555bd7998562e1aa91b7224a9458592dfed1","source":{"kind":"arxiv","id":"2606.03754","version":1},"attestation_state":"computed","paper":{"title":"Fast TetraBFT: Optimizing Latency Where It Matters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexey Gotsman, Antonio J. Fern\\'andez-Pinto, Gregory Chockler, Manuel Bravo","submitted_at":"2026-06-02T15:03:25Z","abstract_excerpt":"Unauthenticated Byzantine consensus protocols achieve optimal failure resilience while relying only on authenticated point-to-point channels, not authenticated messages. They are an attractive building block for blockchains that do not mandate symmetric trust assumptions as well as for future post-quantum settings. We consider unauthenticated Byzantine consensus in partially synchronous networks and focus on optimizing its good-case latency - the worst-case time for correct processes to reach a decision under favorable conditions. A recently proposed ForgetIT protocol achieves an optimal good-"},"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":"2606.03754","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-02T15:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"79bb7e7146e8a485d6372a6e61116cee9e56617b2c6c5cfcca92f90820f16f5e","abstract_canon_sha256":"655186ea8db0e6185a744598fe2d7cc16ab4384f0f7ea3dbca77e372aa83fe06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:06:06.538064Z","signature_b64":"tBsdhnaB2GVP5GveZjy5NZfe1V6UIVVaBSRrlDWPnVahJ/LHPsk4Uq+C8WMb55ymsTCnjPjISREp7U6savREBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7eb4fa3548916ce2b6315af3140555bd7998562e1aa91b7224a9458592dfed1","last_reissued_at":"2026-06-03T01:06:06.537647Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:06:06.537647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast TetraBFT: Optimizing Latency Where It Matters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexey Gotsman, Antonio J. Fern\\'andez-Pinto, Gregory Chockler, Manuel Bravo","submitted_at":"2026-06-02T15:03:25Z","abstract_excerpt":"Unauthenticated Byzantine consensus protocols achieve optimal failure resilience while relying only on authenticated point-to-point channels, not authenticated messages. They are an attractive building block for blockchains that do not mandate symmetric trust assumptions as well as for future post-quantum settings. We consider unauthenticated Byzantine consensus in partially synchronous networks and focus on optimizing its good-case latency - the worst-case time for correct processes to reach a decision under favorable conditions. A recently proposed ForgetIT protocol achieves an optimal good-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03754","kind":"arxiv","version":1},"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/2606.03754/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":"2606.03754","created_at":"2026-06-03T01:06:06.537705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03754v1","created_at":"2026-06-03T01:06:06.537705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03754","created_at":"2026-06-03T01:06:06.537705+00:00"},{"alias_kind":"pith_short_12","alias_value":"27VU7I2URELM","created_at":"2026-06-03T01:06:06.537705+00:00"},{"alias_kind":"pith_short_16","alias_value":"27VU7I2URELM4K3D","created_at":"2026-06-03T01:06:06.537705+00:00"},{"alias_kind":"pith_short_8","alias_value":"27VU7I2U","created_at":"2026-06-03T01:06:06.537705+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/27VU7I2URELM4K3DCWXTCQCVLP","json":"https://pith.science/pith/27VU7I2URELM4K3DCWXTCQCVLP.json","graph_json":"https://pith.science/api/pith-number/27VU7I2URELM4K3DCWXTCQCVLP/graph.json","events_json":"https://pith.science/api/pith-number/27VU7I2URELM4K3DCWXTCQCVLP/events.json","paper":"https://pith.science/paper/27VU7I2U"},"agent_actions":{"view_html":"https://pith.science/pith/27VU7I2URELM4K3DCWXTCQCVLP","download_json":"https://pith.science/pith/27VU7I2URELM4K3DCWXTCQCVLP.json","view_paper":"https://pith.science/paper/27VU7I2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03754&json=true","fetch_graph":"https://pith.science/api/pith-number/27VU7I2URELM4K3DCWXTCQCVLP/graph.json","fetch_events":"https://pith.science/api/pith-number/27VU7I2URELM4K3DCWXTCQCVLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27VU7I2URELM4K3DCWXTCQCVLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27VU7I2URELM4K3DCWXTCQCVLP/action/storage_attestation","attest_author":"https://pith.science/pith/27VU7I2URELM4K3DCWXTCQCVLP/action/author_attestation","sign_citation":"https://pith.science/pith/27VU7I2URELM4K3DCWXTCQCVLP/action/citation_signature","submit_replication":"https://pith.science/pith/27VU7I2URELM4K3DCWXTCQCVLP/action/replication_record"}},"created_at":"2026-06-03T01:06:06.537705+00:00","updated_at":"2026-06-03T01:06:06.537705+00:00"}