{"as_of":"2026-08-11T11:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6123c21446f3b26d6e8f9a933a43b5c8e1fd983c980261d825f827b757cd561","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:54:54.766342Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2501.11051/citation-record","integrity":"/paper/2501.11051/integrity","json":"/paper/2501.11051/citation-record.json","paper":"/paper/2501.11051"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/98163","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:54.952625Z","title":"Implementing fault-tolerant services using the state machine approach: A tutorial,","venue":null,"work_id":"147e3f24-eb6d-44e5-a2af-db53ec401ed6","year":1990},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.446070Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:309e71f11ba26e94968d6a6ea37db308b72a9c054c8db62080cfe8676966154a","observation_id":"e2acd083-5fbe-4b47-b4b2-5fa172e3df2f","resolution":{"observed_at":"2026-08-10T18:54:54.956614Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.450676Z","title":"Blockchain technology as a mechanism for digital railway ticketing,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.450676Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:cce5ec26f92d6b0f2b47a3504c9b418dd0615dc27f39795233d4acf752b8dc9c","observation_id":"e73bee98-b3ff-405b-a58d-27c294eb907c","resolution":{"observed_at":"2026-08-10T18:54:54.450676Z","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":"10.1007/978-3-658-39438-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:54.941289Z","title":"Leveraging Distributed Ledger Technology for Decentralized Mobility- as-a-Service Ticket Systems,","venue":null,"work_id":"853bd59b-1bd4-4cbd-a35a-49bfc6622cc1","year":2023},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.550111Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:48e1a5b35737816cbd4fee69617df5fa31f72a5fcb3cc5aef239c4c284ec0588","observation_id":"78b9458e-ee8f-4691-b6b5-33a339d25ec4","resolution":{"observed_at":"2026-08-10T18:54:54.945072Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.221640Z","title":"Blockchain for future smart grid: A comprehensive survey,","venue":null,"work_id":"f6010d10-219f-4015-a8e8-9ba651db3079","year":null},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.554445Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:f4f89826e376b1e0f69ac7a73a2e77c87bfc0843b08f0b47d06ced3024ef5309","observation_id":"e9b48b14-204f-43c5-895e-1e35be10f1ee","resolution":{"observed_at":"2026-08-10T18:54:57.225724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4337/9781784719227","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:54.930425Z","title":"Chapter 22: Digital currencies, decentralized ledgers and the future of central banking,","venue":null,"work_id":"1dd42daa-761f-4118-ae60-852609c9b562","year":2018},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.563151Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:17aad707d50bc2db5410e671b07f9c5c3ec1d8d5ebbab73263d72057738ad6d7","observation_id":"74d0a6ad-82b2-4326-9376-3bfbbb12b4a2","resolution":{"observed_at":"2026-08-10T18:54:54.934474Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1108/jmlc-11-2021-0126","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:54.919364Z","title":"Central bank digital currency research around the world: a review of literature,","venue":null,"work_id":"4cfed8c3-6dbd-4df4-97fe-b2a1bdaf3d23","year":2023},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.567036Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:569da05008ace1e7811af4ba47156a646f224a110e929fee3000bb1128fd9a88","observation_id":"6a929f3b-0a2f-47ef-bc1f-5353417c9439","resolution":{"observed_at":"2026-08-10T18:54:54.923421Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4176.30642","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:56.923947Z","title":"Hybrids on steroids: SGX-based high performance BFT,","venue":null,"work_id":"f4bc6f6c-5e0e-4718-98ac-66f8b3c6e448","year":2017},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.571267Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:389f76c50cd53cbebb6aaa64288825cfdd61eaa0199052a17f26cda15aced116","observation_id":"b7325c89-5706-4c71-b008-8baa524a3d24","resolution":{"observed_at":"2026-08-10T18:54:56.929741Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.574793Z","title":"ENGRAFT: enclave-guarded Raft on Byzantine faulty nodes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.574793Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:4bafe56308bd42547a51f89ed8cbec89879bfe3f306d107e7da1d6ac79952121","observation_id":"a74a45fb-311c-432b-b09f-841980edfd37","resolution":{"observed_at":"2026-08-10T18:54:54.574793Z","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-10T18:54:54.578504Z","title":"Oneshot: View-adapting streamlined BFT protocols with trusted execution environments,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.578504Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:6c6152ae8f4f5162aa64b193b24c48435a6514542ee02f4d466ba3967f935c67","observation_id":"5b63d962-09a4-40b8-a66b-eefd85b5af87","resolution":{"observed_at":"2026-08-10T18:54:54.578504Z","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":"10.4230/lipics.disc.2023.43","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:54.908382Z","title":"Brief announcement: Let it TEE: asynchronous Byzantine atomic broadcast with n ≥ 2f+1,","venue":null,"work_id":"35434a18-af27-4e80-b153-4a37763f34a3","year":2023},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.587614Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:e504dd4bf3844c1c0c6156c11ff5ae32baff606405ab63c5319c249993868a8f","observation_id":"82d57f9e-d65d-4668-97f0-2d3b9f922768","resolution":{"observed_at":"2026-08-10T18:54:54.912203Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.591413Z","title":"All you need is DAG,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.591413Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:8ca0996d16e6759923d1d7ee87a44539b2855df4e846a391892996007228743a","observation_id":"e844a0fe-b14b-4446-89b3-9f2c9fd62bbd","resolution":{"observed_at":"2026-08-10T18:54:54.591413Z","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-10T18:54:54.595099Z","title":"DAMYSUS: streamlined BFT consensus leveraging trusted components,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.595099Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:c32d1dfb8f96b602840c3c1ab62a50e4e8cac63d4cefdc57d02d0ec64731b7bb","observation_id":"a747a57b-4cdc-4eeb-b4c6-9dd412e4a6f7","resolution":{"observed_at":"2026-08-10T18:54:54.595099Z","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-10T18:54:54.598744Z","title":"Efficient Byzantine fault-tolerance,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.598744Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:5d5a1fc79ee3ba9c43769360db8560c41b3a7fc4f76ee651d21c26948579bdcd","observation_id":"5407785c-1928-495b-80e3-805588911931","resolution":{"observed_at":"2026-08-10T18:54:54.598744Z","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":"1637.57164","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:56.558053Z","title":"Practical Byzantine fault tolerance and proactive recovery,","venue":null,"work_id":"6124ee2e-f16b-45dd-8a60-7c1f7dd12df1","year":2002},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.602403Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:d000744abc3298961f738b371298465a2a628afa45510b7d6bb8d47ecbd00811","observation_id":"ec71c1ff-ab37-4693-892f-da801ffb25fd","resolution":{"observed_at":"2026-08-10T18:54:56.564585Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13530","last_updated":"2020-05-06T09:06:57Z","snapshot_observed_at":"2026-08-02T15:24:38.863355Z","submitted_at":"2020-04-28T13:57:21Z","title":"Introducing a framework to assess newly created questions with Natural Language Processing","version":2},"cited_work":{"arxiv_id":"2004.13530","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.13530","snapshot_observed_at":"2026-08-10T18:54:56.485939Z","title":"Introducing a framework to assess newly created questions with Natural Language Processing","venue":"cs.CL","work_id":"28b5dade-ff69-4c62-8658-6cb710f8d3c4","year":2020},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.606164Z"},"links":{"cited_paper":"/paper/2004.13530","citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:ba8787fe23f6fe34b49dc0f83164a7bb0fda53b22611337a9d103204b9f35089","observation_id":"c70cd4ad-14f1-4732-9130-799716b8fca2","resolution":{"observed_at":"2026-08-10T18:54:56.490122Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.611313Z","title":"Attested append-only memory: making adversaries stick to their word,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.611313Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:57c096218e1ea447f1429672ab252b96b86e472284704450acdc883a7480426c","observation_id":"a3509b31-93ea-40ed-84fa-aa5b2e1b00e2","resolution":{"observed_at":"2026-08-10T18:54:54.611313Z","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":"4088.17741","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:56.386115Z","title":"Asynchronous Byzantine consensus with 2f+1 processes,","venue":null,"work_id":"180d598f-bb5a-4d71-9e49-f198d230ebea","year":2010},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.614942Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:45ca0e23df1cef75bde35d7e7ec665217bcfcbd7afd19cabfb8e82b903882b30","observation_id":"1bcd5e2b-649a-4ac8-820a-211848e934e3","resolution":{"observed_at":"2026-08-10T18:54:56.392120Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.618358Z","title":"On the (limited) power of non-equivocation,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.618358Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:13b454268c0f70cb3a3cfef746a63a83d4473ed855e6a3c8bb8ee7a37013361b","observation_id":"11632c24-7157-4a0e-a168-b29851ec8994","resolution":{"observed_at":"2026-08-10T18:54:54.618358Z","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-10T18:54:54.621951Z","title":"On the subject of non-equivocation: Defining non-equivocation in synchronous agreement systems,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.621951Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:05db3ab59c30e72df6a3abe7faf10f16f8b6d23b4f6271ce73e0536135591d72","observation_id":"5291ebd6-623e-4018-a553-9caa31a876c5","resolution":{"observed_at":"2026-08-10T18:54:54.621951Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.209700Z","title":"Intel SGX explained,","venue":null,"work_id":"3a179069-6c47-4872-8b60-1f1295e7d524","year":2016},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.625537Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:eb27194d06de8a3af2d41441384663010474968f3f97b06b2cd641b73fab7a6e","observation_id":"1eff2be7-7999-4178-b5be-401bd2d71e02","resolution":{"observed_at":"2026-08-10T18:54:57.213914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.197921Z","title":"TrInc: Small trusted hardware for large distributed systems,","venue":null,"work_id":"dc9f1ee5-2a2d-42ae-9ce1-10bce7231cd2","year":2009},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.630501Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:16549addf3135b24e60fcef22a7d881ae4a88d63a505973f6d54e77fbe7fcb8c","observation_id":"4146ae63-cc15-4b85-b821-c6230ac2d2c3","resolution":{"observed_at":"2026-08-10T18:54:57.202328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2018.28600","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:56.161719Z","title":"Scalable Byzantine consensus via hardware-assisted secret sharing,","venue":null,"work_id":"d70e93a0-f009-44c3-970c-4a8292ead1f2","year":2019},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.634402Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:39b418af59757c8060f8fb43e813d746e407637877b332631d68d3afae0daf2c","observation_id":"682935ea-c31c-40fe-af71-4eda2b33377b","resolution":{"observed_at":"2026-08-10T18:54:56.167512Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.638136Z","title":"Teegraph: A blockchain consensus algorithm based on TEE and DAG for data sharing in IoT,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.638136Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:12b3629e903a3b88f8ea9bcfa84f0a86367a2b2cad54ed3d54f6edec8c8c2e37","observation_id":"cbb01c2e-b531-42d9-aeb7-30295771aefa","resolution":{"observed_at":"2026-08-10T18:54:54.638136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01062","last_updated":"2026-06-02T18:27:38Z","snapshot_observed_at":"2026-08-10T22:33:36.669397Z","submitted_at":"2025-01-02T05:13:22Z","title":"Fides: Secure and Scalable Asynchronous DAG Consensus via Trusted Components","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.01062","snapshot_observed_at":"2026-08-10T18:54:54.641670Z","title":"Fides: Scalable censorship-resistant DAG consensus via trusted components,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.641670Z"},"links":{"cited_paper":"/paper/2501.01062","citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:30920019e6afcaaa7f99019824dd64742ed23bc4dc21f1e8410ac9aff79d2ad5","observation_id":"51520bc1-5137-485c-b8b2-0cdc0249686a","resolution":{"observed_at":"2026-08-10T18:54:54.641670Z","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-10T18:54:54.646116Z","title":"uBFT: Microsecond-scale BFT using disaggregated memory,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.646116Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:b92358030a62ab220c64a35a2a769ebe1cc0c048676fb66992dd2d7dded74f35","observation_id":"97dbe1e7-fe91-4d21-b5f8-23bf389ae6d3","resolution":{"observed_at":"2026-08-10T18:54:54.646116Z","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-10T18:54:54.649666Z","title":"Dissecting BFT consensus: In trusted components we trust!","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.649666Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:38b790862ac9f12e7b14eb1b298d153a1e43af6db9c2940a1b23efdbf3976207","observation_id":"48f181a1-9600-4592-b2d9-657514d2c3b2","resolution":{"observed_at":"2026-08-10T18:54:54.649666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05714","last_updated":"2023-12-10T00:39:22Z","snapshot_observed_at":"2026-08-05T13:50:35.172110Z","submitted_at":"2023-12-10T00:39:22Z","title":"Vivisecting the Dissection: On the Role of Trusted Components in BFT Protocols","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05714","snapshot_observed_at":"2026-08-10T18:54:54.654273Z","title":"Vivisecting the dissection: On the role of trusted components in BFT protocols,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.654273Z"},"links":{"cited_paper":"/paper/2312.05714","citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:13733ef5a651495d5147f0c3576c2b3ee17f98aefca085c0f7a124f388ef334a","observation_id":"86012a5b-a9c2-4331-9ffe-c46b35ab811a","resolution":{"observed_at":"2026-08-10T18:54:54.654273Z","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-10T18:54:54.658315Z","title":"The honey badger of BFT protocols,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.658315Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:bade1ac9148fe7137dde045b2d0e0e81177fa84275ccb405f06100c955af7aa6","observation_id":"c8eef8db-e349-4c29-95d0-26e37e780058","resolution":{"observed_at":"2026-08-10T18:54:54.658315Z","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":"9042.2020","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:55.762192Z","title":"The hashgraph protocol: Efficient asynchronous BFT for high-throughput distributed ledgers,","venue":null,"work_id":"809aeccc-862f-43fa-96ec-28d080c9e24b","year":2020},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.662086Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:8ffd8f59d0fb548015b6364fa221344a72671656afa43effc274d492d312aabb","observation_id":"f95a81fe-7a14-485e-bc4c-ec9831d3d0f8","resolution":{"observed_at":"2026-08-10T18:54:55.768523Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08048","last_updated":"2025-04-10T18:07:23Z","snapshot_observed_at":"2026-08-07T16:06:44.814827Z","submitted_at":"2025-04-10T18:07:23Z","title":"On Quorum Sizes in DAG-Based BFT Protocols","version":1},"cited_work":{"arxiv_id":"2504.08048","doi":"10.48550/arxiv.2504.08048","metadata_source":"pith","pith_arxiv_id":"2504.08048","snapshot_observed_at":"2026-08-11T00:16:15.729268Z","title":"On Quorum Sizes in DAG-Based BFT Protocols","venue":"cs.DC","work_id":"2b8fa223-0bce-4dbc-bb2b-77ce65202bcd","year":2025},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.665682Z"},"links":{"cited_paper":"/paper/2504.08048","citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:fe47548a9fac484ba9bbc8c936e1b6d12691935f24f87dbb907206581909ade6","observation_id":"44b88bcd-74d7-4ccd-8e07-8a722aeac150","resolution":{"observed_at":"2026-08-10T18:54:54.873892Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.opodis.2022.24","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:54.853128Z","title":"Communication-efficient BFT using small trusted hardware to tolerate minority corruption,","venue":null,"work_id":"cc9beeb3-fb19-4182-b77e-83d1f0e331ad","year":2022},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.669758Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:7b109a1c5b04848d96806b3e726a8b4180aa70b998b063457ff5cdffa87ff210","observation_id":"49663804-871a-4e5f-80d5-1dbacfa2f177","resolution":{"observed_at":"2026-08-10T18:54:54.857493Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.673347Z","title":"Byzantine fault-tolerant state-machine replication from a systems perspective,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.673347Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:9f6d7a5e77c89d713655986f5e7bb01d44fe7877d44b20091a8d1882978c7d20","observation_id":"b4631433-4672-4794-b0e4-2bfa9d5a4c70","resolution":{"observed_at":"2026-08-10T18:54:54.673347Z","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-10T18:54:54.678746Z","title":"Confidential consortium framework: Secure multiparty applications with confidentiality, integrity, and high availability,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.678746Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:ea2c2d5df6b69c2c35da25f195982623951db1dbdd762010ce6bd8ca3c9ae4ee","observation_id":"ce18a593-def8-4a33-a946-71ffd4b28894","resolution":{"observed_at":"2026-08-10T18:54:54.678746Z","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-10T18:54:54.682699Z","title":"Achilles: Efficient TEE-assisted BFT consensus via rollback resilient recovery,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.682699Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:0c2d2a884d62eed41f0b213ec3625a770fd7fcd9071539b27a806c0451c26676","observation_id":"88651aa9-0fc3-4961-ba53-6e04299af587","resolution":{"observed_at":"2026-08-10T18:54:54.682699Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.186439Z","title":"Cachin, R","venue":null,"work_id":"77076fb3-0b7f-403d-b486-98f863734383","year":null},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.686244Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:7b8f328164d69f3468ce1419164380e9e90a9bdc7a2ff083aeb946d151834156","observation_id":"257d278e-8a3e-4874-bfd1-ea8b60cfae82","resolution":{"observed_at":"2026-08-10T18:54:57.190212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.693968Z","title":"Reaching agreement in the presence of faults,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.693968Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:5b1973e16f070889f256a2fcd95d87329f728025aabd0987f43fd8eab3dff1de","observation_id":"d2d2464e-2071-4913-a6be-b64443fc0fdd","resolution":{"observed_at":"2026-08-10T18:54:54.693968Z","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-10T18:54:54.699124Z","title":"Impossibility of distributed consensus with one faulty process,","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.699124Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:25883630f98586d9ee5c7549a68960ef893bbd1b7884f1e59e5e76bb32cd7464","observation_id":"f988cc70-8ede-4981-bce3-77af4c92807b","resolution":{"observed_at":"2026-08-10T18:54:54.699124Z","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-10T18:54:54.702714Z","title":"Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract),","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.702714Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:5722531cc333b0bfcb005ff7dd528fde4cef3ef92809772fb5f0113b609c46b7","observation_id":"07e6cb34-1276-40b6-80f3-1c73d29da38f","resolution":{"observed_at":"2026-08-10T18:54:54.702714Z","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":"10.1007/3-540-36288-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:54.826710Z","title":"Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-Group signature scheme,","venue":null,"work_id":"3ba09d9e-b0e0-479a-a2f0-ec2cf4d59712","year":2003},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.706338Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:bfdf3fa994f2b188d8d37246ec9dcd24160a494a3fe908f33fca0554ac1bf57e","observation_id":"0bbd29cf-a877-4eaf-acac-6286b91a154b","resolution":{"observed_at":"2026-08-10T18:54:54.831041Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03247","last_updated":"2025-02-05T15:03:59Z","snapshot_observed_at":"2026-08-09T05:20:23.582687Z","submitted_at":"2025-02-05T15:03:59Z","title":"Thetacrypt: A Distributed Service for Threshold Cryptography","version":1},"cited_work":{"arxiv_id":"2502.03247","doi":"10.48550/arxiv.2502.03247","metadata_source":"pith","pith_arxiv_id":"2502.03247","snapshot_observed_at":"2026-08-11T00:16:15.729268Z","title":"Thetacrypt: A Distributed Service for Threshold Cryptography","venue":"cs.CR","work_id":"83934e79-a8c2-42b6-9f50-ee36bac10e0a","year":2025},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.710294Z"},"links":{"cited_paper":"/paper/2502.03247","citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:78c0d7b39fca8f4678a5601df071851ee4563eb543cd77c947cf887f24db5cd8","observation_id":"c402e217-109c-471e-a6ba-49daa1c18395","resolution":{"observed_at":"2026-08-10T18:54:54.818628Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6564.36291","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:55.326210Z","title":"ABCperf: Performance evaluation of fault tolerant state machine replication made simple: Demo abstract,","venue":null,"work_id":"1161e9dd-dc23-4fb3-abbc-91913bca57f7","year":2023},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.714185Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:efc85a43b373466f4d36221a8afd599b75bdd46d7b2faee9acabd0f4c25c92c5","observation_id":"4cf23232-b965-481e-bab3-4611b2f8ddd7","resolution":{"observed_at":"2026-08-10T18:54:55.332430Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.174518Z","title":"Foreshadow: Extracting the keys to the intel SGX kingdom with transient out-of-order execution,","venue":null,"work_id":"381ab27f-1484-40f8-8cc0-c70e0d7f02a2","year":2018},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.717728Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:d2f6c3d5d77907335868b3af7d9ad64bb7caa162a6d51848bd9b393e53f202ab","observation_id":"55b5b38b-8d23-40d8-a085-9fa2848c25c7","resolution":{"observed_at":"2026-08-10T18:54:57.178693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.162910Z","title":"Decouchant, D","venue":null,"work_id":"592f3dae-b0e9-4cae-8a21-51f1ac1028f7","year":2022},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.722671Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:5391cea0d04c21235721bcc62628f5153aaebcbc1471032cd393a691d9f3fecc","observation_id":"412fa6a5-405b-4793-8831-c6b963affada","resolution":{"observed_at":"2026-08-10T18:54:57.166925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.151186Z","title":"Enabling parallel voting in streamlined consensus protocols,","venue":null,"work_id":"9e17a882-6723-4cf5-b4e0-d607e073b4fc","year":2024},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.726100Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:7fe8c4e36e69c17ab5ee7a80f15994dc952ab307b8d71d7ade17e25a3fcb2eb4","observation_id":"a641a9a5-366f-403a-920c-fc5dbfc7f362","resolution":{"observed_at":"2026-08-10T18:54:57.155398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.138751Z","title":"Malkhi and O","venue":null,"work_id":"436f8fcb-2c60-4e14-89aa-45dee6fd1572","year":2022},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.729876Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:570fe7f8c7b9995c0064edd0666dcb457efd7ef350d5f83e30a8d80ddd0a6751","observation_id":"fffeed24-6137-4ee9-9ae5-728f4d44d330","resolution":{"observed_at":"2026-08-10T18:54:57.142628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.733314Z","title":"Consensus-agnostic state- machine replication,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.733314Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:87a5cde3454bfd5ebe2bb0c38035748499ded67a0df04e8dc06e89733758f9e3","observation_id":"853db091-d081-43d7-a741-69d9178ff105","resolution":{"observed_at":"2026-08-10T18:54:54.733314Z","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-10T18:54:54.736975Z","title":"BBCA-CHAIN: one- message, low latency BFT consensus on a DAG,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.736975Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:1a48feb49aed4db0e84969db2c33027d228fdf77818fcbee443b5f0ca6288f33","observation_id":"dac667cb-b694-45dd-896f-ac39557ee1cc","resolution":{"observed_at":"2026-08-10T18:54:54.736975Z","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-10T18:54:54.740977Z","title":"Sailfish: Towards improving latency of DAG-based BFT,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.740977Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:a00457f31e3f0331b566a359bbe7c717e99fb77f751182da6c5e401871102244","observation_id":"9fc50074-c080-488c-b9e8-514dd926f540","resolution":{"observed_at":"2026-08-10T18:54:54.740977Z","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-10T18:54:54.744561Z","title":"Autobahn: Seamless high speed BFT,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.744561Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:1f12618c29c80b5655deb822d3efa324aac1bf93869cdc7bf0ab2e3214b54801","observation_id":"85793c9c-9847-4d99-8556-8f7caea6e98a","resolution":{"observed_at":"2026-08-10T18:54:54.744561Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.127392Z","title":"Shoal++: High throughput DAG BFT can be fast and robust!","venue":null,"work_id":"58104c9f-4700-4679-80bd-a850c0c626e2","year":2025},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.748096Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:f162a3f096d320fb9cfddce6fd58ced465703fa68ef62d40fd4e0449d1e3e54b","observation_id":"b7da9903-174f-4cff-b421-1738f88e53b6","resolution":{"observed_at":"2026-08-10T18:54:57.131416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.751592Z","title":"Bandle: Asynchronous state machine replication made efficient,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.751592Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:40dac8a6bdffac4b7af403cc4433498c5caa9864da584d4d848814e0b9ea92a1","observation_id":"98af6e76-ab25-4ba3-b99b-be8d951b541c","resolution":{"observed_at":"2026-08-10T18:54:54.751592Z","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-10T18:54:54.755332Z","title":"Attiya and J","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.755332Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:4c3850da0bb408f09a7a621dd0389f235f771b9f4470a3d23ed09dc79c6b5782","observation_id":"54958818-0410-4325-8301-61e963df6cb2","resolution":{"observed_at":"2026-08-10T18:54:54.755332Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.116264Z","title":"IV-A3 transforms the best effort broadcast to a reliable broadcast","venue":null,"work_id":"703b7a73-3af0-4b79-a574-1e2c4f6eac7b","year":null},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.758849Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:3e5a179ed4c4f93e5b429a8ce926fa208004c7e0d6b5792baa672e74f69be45a","observation_id":"939360c7-4ed6-49c8-8016-96e340108d32","resolution":{"observed_at":"2026-08-10T18:54:57.120366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.105164Z","title":"The enclave will not reveal a toss unless at least one correct replica requests a toss","venue":null,"work_id":"2618f147-db16-44cc-be9d-b8837566b453","year":null},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.762705Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:580c7f06ae376e90008b24d5c0766f854c4a232297c170acce334772aa179faf","observation_id":"49340df0-32f8-41ea-8ecd-7fac6242ba43","resolution":{"observed_at":"2026-08-10T18:54:57.109004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:54:57.092638Z","title":"connectivity guarantees","venue":null,"work_id":"1a2c2145-627e-4b3c-bd2f-b4915d76e533","year":null},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.766342Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:fc69ff0b4bafc91767fe691d017b7db5375bac0c90306ff5d2bbf3bf757577ef","observation_id":"6d6eb2ec-3355-4622-9d0d-885c9a0a7e4c","resolution":{"observed_at":"2026-08-10T18:54:57.096764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-10T18:54:54.689948Z","title":"Available: https://doi.org/10.1007/978-3-642-15260-3","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.689948Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:e80d550042c30cf03ddd7a3c4971b97d18fc936f93a62694a3b5216cef02afab","observation_id":"ab64a651-b216-48f4-8364-e54f2094a9cf","resolution":{"observed_at":"2026-08-10T18:54:54.689948Z","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-10T18:54:54.558701Z","title":"Available: https://doi.org/10.1109/JIOT.2020.2993601","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T18:54:54.558701Z"},"links":{"citing_paper":"/paper/2501.11051"},"observation_digest":"sha256:6b331f52f326e15cd8d13eee18bf594ed5559754d80ce444c1f35a2c8b915555","observation_id":"ee87a95e-f53d-4ad1-852b-f2c9274305f6","resolution":{"observed_at":"2026-08-10T18:54:54.558701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.11051","last_updated":"2025-07-02T15:04:59Z","latest_version":3,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-10T18:38:45.988863Z","submitted_at":"2025-01-19T13:52:15Z","title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":1,"metadata_mismatch":6,"parse_uncertain":0,"unresolved":29,"verified_exact":9,"verified_fuzzy":12},"total_outbound_references":57},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2501.11051."}