{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QO3CW7BVV224ZSHGHBCCNNK4EI","short_pith_number":"pith:QO3CW7BV","canonical_record":{"source":{"id":"2601.03390","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-01-06T19:56:15Z","cross_cats_sorted":[],"title_canon_sha256":"b5b947893fdf9ce639db68aba100f48b4eb7974dc8bb20f01056b65165d0ec20","abstract_canon_sha256":"cd0b673f060afc25478dcdf9b9e20bd64484f6b3eec5a02a9dccf378c91c66e6"},"schema_version":"1.0"},"canonical_sha256":"83b62b7c35aeb5ccc8e6384426b55c2221c4293aa67b6a9f80bc0b7415c46e68","source":{"kind":"arxiv","id":"2601.03390","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.03390","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"2601.03390v2","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.03390","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"QO3CW7BVV224","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"QO3CW7BVV224ZSHG","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"QO3CW7BV","created_at":"2026-07-03T01:17:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QO3CW7BVV224ZSHGHBCCNNK4EI","target":"record","payload":{"canonical_record":{"source":{"id":"2601.03390","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-01-06T19:56:15Z","cross_cats_sorted":[],"title_canon_sha256":"b5b947893fdf9ce639db68aba100f48b4eb7974dc8bb20f01056b65165d0ec20","abstract_canon_sha256":"cd0b673f060afc25478dcdf9b9e20bd64484f6b3eec5a02a9dccf378c91c66e6"},"schema_version":"1.0"},"canonical_sha256":"83b62b7c35aeb5ccc8e6384426b55c2221c4293aa67b6a9f80bc0b7415c46e68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:54.274980Z","signature_b64":"o4WqYfjrNp4PzZFgsiOVeO2glCfw2Ta7IA9mrm6pQIWFIM3R7kvPwbh7soi71bMNmzoJQBuA57iXal6KIreQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b62b7c35aeb5ccc8e6384426b55c2221c4293aa67b6a9f80bc0b7415c46e68","last_reissued_at":"2026-07-03T01:17:54.274472Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:54.274472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.03390","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T01:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWUDui3LHoxa2tJ2oRyYEx3pgyJWf2IVMO+uOU0y21VakkaVYuYUJ5/fKT85sNpYKwwQ5FDOFB5iij/bGJcQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:52:32.781743Z"},"content_sha256":"7e9c147f37af1cda43375283a368bfff3ffb07b06c6413c26fdfec13b677045b","schema_version":"1.0","event_id":"sha256:7e9c147f37af1cda43375283a368bfff3ffb07b06c6413c26fdfec13b677045b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QO3CW7BVV224ZSHGHBCCNNK4EI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical One-Round-Trip BFT Replication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anirudh Sivaraman, Aurojit Panda, Daniel Qian, Jinkun Geng, Jinyang Li, Xiyu Hao, Yuncheng Yao","submitted_at":"2026-01-06T19:56:15Z","abstract_excerpt":"As Byzantine Fault Tolerant (BFT) protocols are increasingly adopted for user-facing applications such as payments and smart contracts, it is crucial that they provide low latency. To reduce latency, some BFT consensus protocols use a leaderless, speculative, fast path where clients broadcast requests directly to replicas, enabling end-to-end commit latency of two message delays ($2\\Delta$). However, such a fast path is extremely fragile: concurrent requests can cause replicas to diverge when they receive requests in different orders, triggering costly recovery procedures.\n  This paper present"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.03390","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/2601.03390/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T01:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xU4Pv22BlMqpzm11gMQnpLCXzZSeN3LvkECNjv2EX43kYRwx0foIraZq/5yocOYRJN0Spwdzjkp/BmThGbVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:52:32.782484Z"},"content_sha256":"17d763dd4c17355022defeff97a2a4e38a90012b597381b7702c5e18c4414bb0","schema_version":"1.0","event_id":"sha256:17d763dd4c17355022defeff97a2a4e38a90012b597381b7702c5e18c4414bb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QO3CW7BVV224ZSHGHBCCNNK4EI/bundle.json","state_url":"https://pith.science/pith/QO3CW7BVV224ZSHGHBCCNNK4EI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QO3CW7BVV224ZSHGHBCCNNK4EI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T06:52:32Z","links":{"resolver":"https://pith.science/pith/QO3CW7BVV224ZSHGHBCCNNK4EI","bundle":"https://pith.science/pith/QO3CW7BVV224ZSHGHBCCNNK4EI/bundle.json","state":"https://pith.science/pith/QO3CW7BVV224ZSHGHBCCNNK4EI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QO3CW7BVV224ZSHGHBCCNNK4EI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QO3CW7BVV224ZSHGHBCCNNK4EI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cd0b673f060afc25478dcdf9b9e20bd64484f6b3eec5a02a9dccf378c91c66e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-01-06T19:56:15Z","title_canon_sha256":"b5b947893fdf9ce639db68aba100f48b4eb7974dc8bb20f01056b65165d0ec20"},"schema_version":"1.0","source":{"id":"2601.03390","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.03390","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"2601.03390v2","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.03390","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"QO3CW7BVV224","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"QO3CW7BVV224ZSHG","created_at":"2026-07-03T01:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"QO3CW7BV","created_at":"2026-07-03T01:17:54Z"}],"graph_snapshots":[{"event_id":"sha256:17d763dd4c17355022defeff97a2a4e38a90012b597381b7702c5e18c4414bb0","target":"graph","created_at":"2026-07-03T01:17:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.03390/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As Byzantine Fault Tolerant (BFT) protocols are increasingly adopted for user-facing applications such as payments and smart contracts, it is crucial that they provide low latency. To reduce latency, some BFT consensus protocols use a leaderless, speculative, fast path where clients broadcast requests directly to replicas, enabling end-to-end commit latency of two message delays ($2\\Delta$). However, such a fast path is extremely fragile: concurrent requests can cause replicas to diverge when they receive requests in different orders, triggering costly recovery procedures.\n  This paper present","authors_text":"Anirudh Sivaraman, Aurojit Panda, Daniel Qian, Jinkun Geng, Jinyang Li, Xiyu Hao, Yuncheng Yao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.03390","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7e9c147f37af1cda43375283a368bfff3ffb07b06c6413c26fdfec13b677045b","target":"record","created_at":"2026-07-03T01:17:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cd0b673f060afc25478dcdf9b9e20bd64484f6b3eec5a02a9dccf378c91c66e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-01-06T19:56:15Z","title_canon_sha256":"b5b947893fdf9ce639db68aba100f48b4eb7974dc8bb20f01056b65165d0ec20"},"schema_version":"1.0","source":{"id":"2601.03390","kind":"arxiv","version":2}},"canonical_sha256":"83b62b7c35aeb5ccc8e6384426b55c2221c4293aa67b6a9f80bc0b7415c46e68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83b62b7c35aeb5ccc8e6384426b55c2221c4293aa67b6a9f80bc0b7415c46e68","first_computed_at":"2026-07-03T01:17:54.274472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:54.274472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o4WqYfjrNp4PzZFgsiOVeO2glCfw2Ta7IA9mrm6pQIWFIM3R7kvPwbh7soi71bMNmzoJQBuA57iXal6KIreQDg==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:54.274980Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.03390","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e9c147f37af1cda43375283a368bfff3ffb07b06c6413c26fdfec13b677045b","sha256:17d763dd4c17355022defeff97a2a4e38a90012b597381b7702c5e18c4414bb0"],"state_sha256":"83a1bb928a94437304b6a502e0a8cd4030de14c003355a471969925218607e22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aA7OmG9bKwuw9UKBo5zJBvB17EfZJwCuKAyD8VXiER7kJJbLRWuNXbWbkb9zj/KtSb6ZnDX2nfewQ49mbinmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T06:52:32.788221Z","bundle_sha256":"fa300a3695f094ea72a07f9f13c0f1f027d97a9d2b37b86d7aac175a8d2d0abf"}}