{"as_of":"2026-08-09T08:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6dd6d82f96c5b68e68fb5a70ea1f514181c7c79f03cebb0e4ba968855c8d958b","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T12:23:31.460224Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T05:36:50.239737Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.03390","snapshot_observed_at":"2026-08-01T05:36:50.239737Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-03T16:33:29.927781Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:50.239737Z"},"links":{"cited_paper":"/paper/2601.03390","citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:dfa8428445ed0a747223e2c329eb25d3e166d87bd0be4190868547ae28397323","observation_id":"6457cb48-5d63-45ad-9d48-333adeb31126","resolution":{"observed_at":"2026-08-01T05:36:50.239737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.03390/citation-record","integrity":"/paper/2601.03390/integrity","json":"/paper/2601.03390/citation-record.json","paper":"/paper/2601.03390"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:25.646743Z","title":"https : / / developers.neo.org / docs / n3 / foundation / consensus / dbft","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:25.646743Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:cd9bc61ce87314ceaa763255540781459a840843b33572646c5d4754b6d43485","observation_id":"acb55c01-e49f-4798-a2c2-92c46103f2db","resolution":{"observed_at":"2026-08-03T12:23:25.646743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:25.774210Z","title":"Ganger, Garth R","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:25.774210Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:69507e847963f3377b58633a8e0ef7499f0056a79bfee801c11045d64d1ad29a","observation_id":"48cb9d59-8a8a-4374-9771-90fe0daebb6f","resolution":{"observed_at":"2026-08-03T12:23:25.774210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:25.840161Z","title":"Revisit- ing fast practical byzantine fault tolerance, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:25.840161Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:da26444f0391524f96af884d7c715c2abbe68f58f4cff94363bb1af178563ffc","observation_id":"dc5670d6-149d-467b-8752-603e03f2159f","resolution":{"observed_at":"2026-08-03T12:23:25.840161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:25.943124Z","title":"Good-case latency of byzantine broadcast: a complete categorization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:25.943124Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:d91a3ea1379255403c3af100abf670db4b5f2cb02e286a7b95baa68c7d06e028","observation_id":"9989c40d-7197-4579-8669-d4bc0c422083","resolution":{"observed_at":"2026-08-03T12:23:25.943124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:26.109281Z","title":"Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John R","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:26.109281Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:9d8b3472a18f10630633de215eb5ee1f619b723a5751ee1a4a34b7c2d5541899","observation_id":"90f0060a-1b17-4641-bb62-1d72c38b3fdd","resolution":{"observed_at":"2026-08-03T12:23:26.109281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:26.153534Z","title":"Aguilera, Naama Ben-David, Rachid Guer- raoui, Antoine Murat, Athanasios Xygkis, and Igor Zablotchi","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:26.153534Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:049a2b1a31d0679c3fa4895fde173b3a36b6c686098141bf1ba3d97f6acc20ba","observation_id":"94fffa28-b563-44a6-892b-0ed4943da5d0","resolution":{"observed_at":"2026-08-03T12:23:26.153534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:26.223682Z","title":"Hyper- ledger fabric: a distributed operating system for permis- sioned blockchains","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:26.223682Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:45de01d2382248275b2c0bc5b648c94f266ebf77eae9fefdcf5f77bcaf1ee73f","observation_id":"839f6a97-12ea-4f8c-8a61-544541c81222","resolution":{"observed_at":"2026-08-03T12:23:26.223682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:26.454977Z","title":"The next 700 bft protocols.ACM Trans","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:26.454977Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:9208e90987457d8cb3c512a496909700b5e39314e17bc7301d419e1513f7b0cb","observation_id":"73a4a971-c571-4575-b346-e192fb94ae01","resolution":{"observed_at":"2026-08-03T12:23:26.454977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:26.657717Z","title":"Amazon Time Sync Service expands Microsecond-Accurate time to 87 additonal EC2 in- stance types","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:26.657717Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:d06feb1edc98e5b3c6a2b1592f1a1756fea93237c0ac1dad40a7abdcf5dd4213","observation_id":"972f2f30-63e1-4b05-9361-927bce73fc77","resolution":{"observed_at":"2026-08-03T12:23:26.657717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:26.896809Z","title":"Deploying intrusion-tolerant scada for the power grid","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:26.896809Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:b60f7c583376240f94504f3760e6c2580bf72d4a51407bddba18225beb52b89d","observation_id":"eb7a6910-62af-4d67-bcb6-a0ed4f7249c7","resolution":{"observed_at":"2026-08-03T12:23:26.896809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:27.070879Z","title":"Mysticeti: Reach- ing the limits of latency with uncertified dags, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:27.070879Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:2ddb8359f15a22cb76f33331091d8989a5cb5436459e1e4a4b7e85b83b1773f0","observation_id":"1c8a426b-b833-4e14-aa36-cf573e114b02","resolution":{"observed_at":"2026-08-03T12:23:27.070879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:27.231466Z","title":"Hy- brids on steroids: Sgx-based high performance bft","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:27.231466Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:21b3c5a41b693bd22154bd4626767bf6eff74ff8a7c0c96bfe8b3f5a1aa13d81","observation_id":"c49040e1-2348-4365-be34-cc50eff6f463","resolution":{"observed_at":"2026-08-03T12:23:27.231466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:27.327691Z","title":"Practical byzantine fault tolerance","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:27.327691Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:2fa2c9dfda80512848e5011d69dad5e8e537c2fbf2f50bcd1882ba2dfde7de58","observation_id":"bd12acfc-f056-4eb4-8af7-e1fc5c01d977","resolution":{"observed_at":"2026-08-03T12:23:27.327691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:27.481485Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:27.481485Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:9d67b81abf3a808d7f7dece92c0c5ffbdbc8fa1e6f99988df85d48202167c411","observation_id":"0ce06ed9-df4a-4f4f-850d-28c0cd0a3465","resolution":{"observed_at":"2026-08-03T12:23:27.481485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:27.708260Z","title":"Upright cluster services","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:27.708260Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:3c622cf219e27ed12657fd31c21d5429f9da683981f3d013f471a9f985ce7faf","observation_id":"0aa49e77-2cb1-4f44-a276-60474aa06a7c","resolution":{"observed_at":"2026-08-03T12:23:27.708260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.018270Z","title":"Corbett, Jeffrey Dean, Michael Epstein, An- drew Fikes, Christopher Frost, JJ Furman, Sanjay Ghe- mawat, Andrey Gubarev, and et al","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.018270Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:40501634e3b59db83a8cbd85d8a546f301b84ce07ec9bbd64d6c06696ac4e079","observation_id":"6efc6a71-a826-4743-aef0-402edb33b55e","resolution":{"observed_at":"2026-08-03T12:23:28.018270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.126782Z","title":"Hq replication: A hybrid quorum protocol for byzantine fault tolerance","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.126782Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:038867e8e5379cc5cede012b7ebef18d4150fa9d49742097397b2aff00721c87","observation_id":"9ecc83d8-5d9a-4c82-b238-c74bd61b574e","resolution":{"observed_at":"2026-08-03T12:23:28.126782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.236687Z","title":"Consensus in the presence of partial synchrony.J","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.236687Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:736043d9f5da6673895677ef7bde75d751f54c3e7143c151aec006d20605cc4f","observation_id":"b2cf6e25-beef-4ca0-885e-d79aae09043f","resolution":{"observed_at":"2026-08-03T12:23:28.236687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.391181Z","title":"Tiga: Accelerating geo-distributed transac- tions with synchronized clocks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.391181Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:55eefff43179cdfa4d9d1bf2c3935b9d08bd8de2712f0d318f3731ec6a590b6a","observation_id":"8bdfba57-2db6-4fef-9b38-f5781aec5a08","resolution":{"observed_at":"2026-08-03T12:23:28.391181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.504695Z","title":"Nezha: Deployable and high-performance consensus using synchronized clocks, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.504695Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:41439cb891d5e92ab1f1f7c47547a512aef5d8fd9c43ac6c7bce6c3a29613d4f","observation_id":"56992086-7784-457b-af42-bfa2affd3dd3","resolution":{"observed_at":"2026-08-03T12:23:28.504695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.630301Z","title":"Exploiting a natural network effect for scalable, fine- grained clock synchronization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.630301Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:04af96f167d8913364366f66d10cc731547638eb3a9390dfb0b0d53d8e42a80c","observation_id":"56f9abd8-00c7-45bc-ae9a-41c8096239d7","resolution":{"observed_at":"2026-08-03T12:23:28.630301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.726196Z","title":"Autobahn: Seam- less high speed bft","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.726196Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:95409eff8aa5d1e2a515af66c033a882f64b3640a9b17b45e15461e63c1c42dc","observation_id":"0318a218-fe57-4ecb-9c59-6c7d07763e98","resolution":{"observed_at":"2026-08-03T12:23:28.726196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.817927Z","title":"Sbft: A scalable and decentralized trust infrastructure","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.817927Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:84cdaa5ea72142a6ea071c024e8fab9c31461b756a53628ad8ab786cb64fc1d0","observation_id":"f39cf5f9-03dd-4180-88f8-9a549637f743","resolution":{"observed_at":"2026-08-03T12:23:28.817927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:28.971502Z","title":"The next 700 bft protocols","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:28.971502Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:00c2f47a3c74b696a2dc06b7eaf8b1c26ceeedd1072422ef0ed60700f506e8f0","observation_id":"02c91556-d724-434e-8f8f-fc65b5cc6be8","resolution":{"observed_at":"2026-08-03T12:23:28.971502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.047615Z","title":"Resilientdb: global scale resilient blockchain fabric.Proc","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.047615Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:70c88f78dc824c06d9f271e51e4332e7e273449f42184f8355c2567d0d1937af","observation_id":"15583341-99e1-4e88-a660-d47b66a2878b","resolution":{"observed_at":"2026-08-03T12:23:29.047615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.170658Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.170658Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:e777e6003d668f8d161e5241ae880942d9ae2fd99ac5dfa4f8a7cbe9111702de","observation_id":"61b8150d-1048-4dd8-a524-288d788fdbbf","resolution":{"observed_at":"2026-08-03T12:23:29.170658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.244242Z","title":"Hotstuff-1: Linear consensus with one-phase speculation.Proc","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.244242Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:9a1e6253ae5bae07f0b1bb16194ba0602e4953c43c2e71ff34e81bc3cf239fed","observation_id":"ff50126a-5009-46de-afaf-12af8919d84c","resolution":{"observed_at":"2026-08-03T12:23:29.244242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.411920Z","title":"Cheapbft: resource-efficient byzantine fault tolerance","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.411920Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:aea949294c5b1c488cc249469540495b74dbd6e4c4eec0f408c0a426a8d6335a","observation_id":"b90cc540-e625-4f03-ab5a-b95a1bebe4ea","resolution":{"observed_at":"2026-08-03T12:23:29.411920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.582423Z","title":"Zyzzyva: Speculative byzantine fault tolerance.ACM Trans","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.582423Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:6a2c1cfd908a29535e1f1c145ad027b9b5c25b739b7496d4f067eacb1d8ca027","observation_id":"8b37b62a-dc02-4452-a76f-d05481800914","resolution":{"observed_at":"2026-08-03T12:23:29.582423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.632659Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.632659Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:85178b20fcc900dcc3be0911f505b94df47ae7e2862467d592c886986588c557","observation_id":"7214fc27-1fb9-44b9-8425-7a794070b059","resolution":{"observed_at":"2026-08-03T12:23:29.632659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.709984Z","title":"Revisiting optimal resilience of fast byzantine consen- sus","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.709984Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:a8e8b801f9e218480c8f2c4956d4b9159eddfa5d2da61666e7916e797424307d","observation_id":"b6d8bf00-d320-46af-809d-aed663fc112b","resolution":{"observed_at":"2026-08-03T12:23:29.709984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.793879Z","title":"The byzantine generals problem.ACM Trans","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.793879Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:c382ca1963b3498e1d92fa4b0191f00270edb1025ee8e54c7e903f24a2ae5095","observation_id":"233fe072-21da-469d-a1e7-63e4e830fc14","resolution":{"observed_at":"2026-08-03T12:23:29.793879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.855629Z","title":"Sundial: Fault-tolerant clock synchroniza- tion for datacenters","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.855629Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:3457c06e0ecacbe4373122e1e2227e31c92c56bd7c93cc673a3f10a3a4ad4198","observation_id":"235d24f2-7a0d-44e7-8d18-f76b05093674","resolution":{"observed_at":"2026-08-03T12:23:29.855629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:29.947791Z","title":"Practical Uses of Synchronized Clocks in Distributed Systems","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:29.947791Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:fda145991afd39b6444431a8796d4777e815dfdfe10e737f83d5bea808960f13","observation_id":"fb385266-5625-4cfe-8d25-f54f3bd0f53b","resolution":{"observed_at":"2026-08-03T12:23:29.947791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.031555Z","title":"Martin and L","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.031555Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:4b8a0fdfe2827f96bca7dfed452af008d81bfff0a77c63e0dd036671331b9adb","observation_id":"29c3c024-81c1-4a5e-9d02-38fc3577ec49","resolution":{"observed_at":"2026-08-03T12:23:30.031555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.122961Z","title":"The stellar consensus protocol: A federated model for internet-level consensus","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.122961Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:e1fd6cf6dce2446619aacf9f19c25a941ebc77294cfa98d7ac5618253f13216d","observation_id":"33da0dc9-995d-4478-b767-8ecb31c3b100","resolution":{"observed_at":"2026-08-03T12:23:30.122961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.214606Z","title":"Fast leaderless byzantine total order broadcast, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.214606Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:aba90f528fbd36f3414120659cb77674377d0f1d704cfbe2e8228fb14e03ebf4","observation_id":"e9715bc8-66a2-49c8-be78-838675396c55","resolution":{"observed_at":"2026-08-03T12:23:30.214606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.302118Z","title":"Graham: Synchronizing clocks by leveraging local clock properties","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.302118Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:590df55459b41d3e9cc7e6c80e4ae47c03845f5dc9e9b2211d9bb49b6edecdde","observation_id":"e574ca0b-1630-4f42-a329-2461de4ff312","resolution":{"observed_at":"2026-08-03T12:23:30.302118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.362981Z","title":"Firefly: Scalable, ultra- accurate clock synchronization for datacenters","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.362981Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:73fdd61d245e1d8bbea3734f9c920d0e17902c70c14e1aad591c83c82bd7c5b6","observation_id":"e0e146e0-5d60-4267-b845-099ea47f5863","resolution":{"observed_at":"2026-08-03T12:23:30.362981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.418588Z","title":"Achilles: Efficient tee-assisted bft consensus via rollback resilient recovery","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.418588Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:a45b9e78d7c84536e7173a3b3a3644794d53f2eaadb9e47a8d127d65f1461e04","observation_id":"18ca1b53-57a1-4b3d-aad1-3c2e5310051b","resolution":{"observed_at":"2026-08-03T12:23:30.418588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.518284Z","title":"Win- tersteiger","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.518284Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:f753a992c8f0a21a87588614f4e06e3ae0440660f5da9c4d21722b6eef04c274","observation_id":"0f6af948-a240-4a5b-82e5-0aebc6df0a6a","resolution":{"observed_at":"2026-08-03T12:23:30.518284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.602764Z","title":"Schneider","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.602764Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:ff26c8283e226784ec4f4e88de6e01df81dbddfb77b17d8ced39bcac4e82ea2a","observation_id":"40aca8d4-f2b9-41b0-9d28-e481eafb7316","resolution":{"observed_at":"2026-08-03T12:23:30.602764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.695787Z","title":"Kudzu: Fast and Simple High-Throughput BFT","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.695787Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:dc4692ca68d06e5e394e0b68ded29889a59ce716f465ee173fb4ff27249ec262","observation_id":"cc38863c-ea92-46bc-ae5c-c2f2c002fcbf","resolution":{"observed_at":"2026-08-03T12:23:30.695787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.784505Z","title":"K2: On optimizing distributed transactions in a multi-region data store with truetime clocks.Proc","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.784505Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:e4049910d8759002c1f317f3c128e9da4e293036c88cca7a22596b35ffbccc14","observation_id":"fa787b63-74da-441b-b634-66f06cade88c","resolution":{"observed_at":"2026-08-03T12:23:30.784505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.851477Z","title":"Bullshark: Dag bft protocols made practical","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.851477Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:9884626f801cf902b44e3d29f542cfa02772597d47fa5482991155241fcf75e0","observation_id":"0d609df2-fe6d-4178-b866-4b58ac76a7ad","resolution":{"observed_at":"2026-08-03T12:23:30.851477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:30.925803Z","title":"Neobft: Accelerating byzantine fault tolerance using authenticated in-network ordering","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:30.925803Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:6b5c74adb8be57399a09b5d31fbb266161e9b5444e1d07af9187702ce78ccc30","observation_id":"51d34bac-314b-482f-8224-3a15ebdc7027","resolution":{"observed_at":"2026-08-03T12:23:30.925803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:31.025064Z","title":"EPaxos revisited","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:31.025064Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:394b021796c80e6f454f57f92884613f856626c8d35f246cc7cae163cd93624d","observation_id":"9477c294-b883-4bcd-bcf2-70868b8e5f95","resolution":{"observed_at":"2026-08-03T12:23:31.025064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:31.125150Z","title":"Banyan: Fast rotating leader bft","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:31.125150Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:45e99962db16be4c14642bea2fe156ede345beb4cc15a92f1be4caa6ffcae136","observation_id":"f6ee4655-eb4d-43b6-8bd6-2cf8ef1d4c3e","resolution":{"observed_at":"2026-08-03T12:23:31.125150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:31.214285Z","title":"White rabbit project","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:31.214285Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:63ba02243fa6006973fe3d7b7920d2c635cde15550733552ab5414b792744f96","observation_id":"c81c8f0b-92ec-417d-a6fc-339c06b58af5","resolution":{"observed_at":"2026-08-03T12:23:31.214285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:31.322359Z","title":"Domino: using network measurements to reduce state machine replication latency in wans","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:31.322359Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:671e83d0d247736686f6ac40f5cf0d3b23fe6962da73f5be4ef887868ada6668","observation_id":"2f2a1fa7-f0d8-417b-ab9c-abf82ece0c78","resolution":{"observed_at":"2026-08-03T12:23:31.322359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:31.460224Z","title":"Reiter, Guy Golan Gueta, and Ittai Abraham","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:31.460224Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:3650851c90e2dc40446c678a84c6da7ef0cbc45fa926d3bb1fea71c43df732b0","observation_id":"10493acb-a366-49b5-aa2d-ccc0d28c4535","resolution":{"observed_at":"2026-08-03T12:23:31.460224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:23:27.947834Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-03T12:23:27.947834Z"},"links":{"citing_paper":"/paper/2601.03390"},"observation_digest":"sha256:1a2a989482061d0b9dd5850178b68a093b68abeef39ffa11ad0bc201f17a29a3","observation_id":"db508061-54d8-4609-9e97-f13821075bb2","resolution":{"observed_at":"2026-08-03T12:23:27.947834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":52},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 1 inbound Pith citation observation for arXiv:2601.03390."}