{"as_of":"2026-08-09T18:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff94b0c23e0675ba532048c67f653acb66e274e1e37e2883a130b0a2be75ee46","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T08:18:01.465048Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2606.03754/citation-record","integrity":"/paper/2606.03754/integrity","json":"/paper/2606.03754/citation-record.json","paper":"/paper/2606.03754"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:18:01.465048Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:916bc5b5571984be2a1473715b19bead81e5d84fa1d28048a3786fbde77e84b2","observation_id":"28304a4a-690d-4290-a18e-9712b7a92890","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T08:18:01.465048Z","title":"Quantum computing & blockchain","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:615c7638ad2e50ec7fb9708765960bcd11d3691a845b23ea62917ab82c3fac9e","observation_id":"d18afb11-98aa-42cb-9bd6-85cae17fddd6","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Forget-IT : Optimal good-case latency for information-theoretic BFT","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:06c891b1be4a60ea60aa42568c06c67066338d1ca3041f39ed494e10bde7ca8c","observation_id":"ce6294cc-8932-4b56-85fa-88448466c97c","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Good-case and bad-case latency of unauthenticated B yzantine broadcast: A complete categorization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:b526ea121f4426c3e32cd1498f27171c9dc9384d893396e300e0c92ed2f60d14","observation_id":"db4ac415-db42-4246-a465-561589aa040b","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Information theoretic HotStuff","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:1bd680d70b28ccff18ba346dce3907fb7e061432fd68667f742068fbaf379814","observation_id":"9ae99b18-075d-4d5a-8069-25c3af9f4ac3","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Tenderbake - a solution to dynamic repeated consensus for blockchains","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:433df84350741038bca013179ec7d3c70198e676718f0de756cec99324111b74","observation_id":"d32aec94-a711-41d6-8354-cf8262c44848","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Security analysis of R ipple consensus","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:a79506861965a84be8dacfce52171a8b6581e9e82d7bebad0479d06758372bec","observation_id":"3e04b6d0-7f65-463f-9cea-015b29463b4d","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Asynchronous consensus and broadcast protocols","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:ad4270fe1c783fd168c25da4709e1e07f1cc0a5c5b492b3840c9475d4aa09070","observation_id":"2b86541e-c317-4d17-b94b-f292a517c1f8","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Making B yzantine consensus live","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:5db2f122f012b715fb3fc77e544931b914ee2990641ff41e44d4edadb8ceb835","observation_id":"e152b5da-1c61-44a6-b84f-27ff659b6df8","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.04938","last_updated":"2019-11-22T10:21:27Z","snapshot_observed_at":"2026-07-06T06:49:58.018213Z","submitted_at":"2018-07-13T06:53:53Z","title":"The latest gossip on BFT consensus","version":3},"cited_work":{"arxiv_id":"1807.04938","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1807.04938","snapshot_observed_at":"2026-07-02T11:16:53.072684Z","title":"The latest gossip on BFT consensus","venue":null,"work_id":"2234ace0-348a-44ff-9810-df324b2e6ea9","year":2018},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"cited_paper":"/paper/1807.04938","citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:3bf0a482b020923b10c6093946ce1c871739e8336f9865bc0345465c6e5d6665","observation_id":"2ff5a229-dd23-4939-9caa-28d849a6f7aa","resolution":{"observed_at":"2026-07-02T05:16:39.902970Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:18:01.465048Z","title":"Secure and efficient asynchronous broadcast protocols","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:8facfa670edf2cb03e0127e8f82dc7bea25fbb7af1da40f32d49b86a9aca0862","observation_id":"0a93dee3-57a5-4f04-a40d-5c9bba292a51","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Practical B yzantine Fault Tolerance","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:6ef1d6251da393f4f9dfe223997be401291066f3d80d2b6d9638b8fdfe0b66ce","observation_id":"a535d7b1-b03d-450a-944e-e01a1943c1b7","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Unreliable failure detectors for reliable distributed systems","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:14e13d91a035024b5bc08c83b60e73e480bb51ac9a9c9c131618a0d75f73a9b1","observation_id":"f5c398a9-3052-4f34-bb4d-54077346f3db","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Lynch, and Larry J","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:33889dbb60f0886568491a4dce8574b9c8f754e1b07e14201449a6e4f3723a2d","observation_id":"bf406ee2-9334-410e-bf65-02b2dfff42ad","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Fast isolation of arbitrary forwarding faults","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:7dc28e40fff426acf612a04c72f7332fffad9d3a49934a17081b19ec0260999f","observation_id":"1d5a7e45-47b2-44fd-8faf-dfea17c4cac5","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Fast and secure global payments with S tellar","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:4e198e836024f955abcd456b0bde4495a65623b0a5ae166d091d01204dcdd728","observation_id":"8b0f2f5f-142a-424f-9bf5-251a28e3d061","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Stellar consensus by instantiation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:ed621ccf00b62ac4dd05d7824925a58f4ce69fd3a8adae4cc69f705f3382f292","observation_id":"af24b235-6d63-45c1-b32a-4635154c39a5","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"Hybrid consensus: Efficient consensus in the permissionless model","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:977f4bc9f9c99ecdd83f509f2fc8b609d66922d667ce584ba07a04bb48eafc5e","observation_id":"2efdedb2-f1d8-4517-926c-5b18d0af7400","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"T hunderella: Blockchains with optimistic instant confirmation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:f02a98e42191c1469a3adba3d4fa78090d5409d8db21e1b0ac6fdccbf7b9cadc","observation_id":"c352ab59-5f7f-4988-a5e7-9acdcce1d190","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","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-06-28T08:18:01.465048Z","title":"TetraBFT : Reducing latency of unauthenticated, responsive BFT consensus","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-28T08:18:01.465048Z"},"links":{"citing_paper":"/paper/2606.03754"},"observation_digest":"sha256:946389cc8b87b71d1c75349d8e48ba5a212df6a425d14ccb6c60c62a89cf5d51","observation_id":"cfbcd6cf-981a-401e-934a-b8b8239aeab2","resolution":{"observed_at":"2026-06-28T08:18:01.465048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.03754","last_updated":"2026-06-02T15:03:25Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-09T05:43:24.716233Z","submitted_at":"2026-06-02T15:03:25Z","title":"Fast TetraBFT: Optimizing Latency Where It Matters"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":18,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":20},"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 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2606.03754."}