{"as_of":"2026-08-15T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0320675e2cb7146308ef1ea2d1d33800b7b658ac0fe3760f9fb5fc8b1f3a00bb","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:24:27.006804Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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.05377/citation-record","integrity":"/paper/2501.05377/integrity","json":"/paper/2501.05377/citation-record.json","paper":"/paper/2501.05377"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-60603-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"An Analysis of Avalanche Consensus","venue":"Lecture notes in computer science","work_id":"b7d7bad1-9bf0-4fda-ae36-a1832e6640ad","year":2024},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.927456Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:25ccb26f6fb03257c499a5f0d18cfb181fc3cccc03a48f80c7dd007c3d803b39","observation_id":"20da5927-01c1-433f-ba83-2ae22ca53fab","resolution":{"observed_at":"2026-08-10T21:24:27.121362Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T21:24:26.933547Z","title":"A Tight Lower Bound for Rando mized Syn- chronous Consensus","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.933547Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:ab611501a9e35a15ecb8c1ac9abff0efb76657464a3d75cbe625a05743b25d72","observation_id":"49e22dcc-eb68-4655-8781-1de20bc723b0","resolution":{"observed_at":"2026-08-10T21:24:26.933547Z","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-10T21:24:27.985946Z","title":"Dynamic Probabilistic Reliable Broa dcast","venue":null,"work_id":"b2ce221a-ac5f-4c87-8142-ea2150bd0938","year":2024},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.938939Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:7fc7212a9a54240312d22625eb174f67fbdf0e558b1b26c3686994327c2ad866","observation_id":"529cc8f1-dfb4-4285-8c5b-16f1bd02d8b3","resolution":{"observed_at":"2026-08-10T21:24:27.990517Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T21:24:26.944510Z","title":"The industrial internet of things (IIoT): An anal ysis framework","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.944510Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:1737d94719816f69c5b5659f52192bd3cb7868a42e349dd677fef8d69ec64ac4","observation_id":"5e78a6d1-15b7-402b-aba0-0d32352657ea","resolution":{"observed_at":"2026-08-10T21:24:26.944510Z","resolver_source":null,"status":"malformed_identifier"},"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-10T21:24:26.949789Z","title":"An Asynchronous [(n-1)/3]-Resilient Consensus Protocol","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.949789Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:254aa2c8633cfd7e100a794ef9e4d9907be2b21780de38da89823c75317cd9eb","observation_id":"ea3eb9fb-5207-4cd8-8ab4-ebc3f370df78","resolution":{"observed_at":"2026-08-10T21:24:26.949789Z","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-10T21:24:26.954414Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.954414Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:631c76b14b6b8e19ea1676bde985cf93ec6590d81b3af937a72ad1a84b541032","observation_id":"9734c740-8d2a-4731-8064-b431410bfd92","resolution":{"observed_at":"2026-08-10T21:24:26.954414Z","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-10T21:24:26.959749Z","title":"Fast asynchronous Byzantine agreement w ith optimal resilience","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.959749Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:83084a4c32b982248359549788257981661b811392155033fdd3a0ffdd49e055","observation_id":"73cd4930-83fe-4a9a-ad4e-0de2a3d88111","resolution":{"observed_at":"2026-08-10T21:24:26.959749Z","resolver_source":null,"status":"malformed_identifier"},"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-10T21:24:26.964868Z","title":"Stabilizing consensus with the power of two c hoices","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.964868Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:ee4e6117b8f0bd1052d447c9389a65ea61e9e43755027667a6b69e715734559b","observation_id":"4bfcf39c-2ff5-453b-9e6c-6e3f0e7790b4","resolution":{"observed_at":"2026-08-10T21:24:26.964868Z","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-10T21:24:26.969437Z","title":"Bounds on Information Exchange for Byzantine Agreement","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.969437Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:b556d2b8ed0292869540d57fcf21be761286c6c401b915332c6163f82243a1c4","observation_id":"d81d0207-0e8e-43c1-8075-9541f85908f3","resolution":{"observed_at":"2026-08-10T21:24:26.969437Z","resolver_source":null,"status":"malformed_identifier"},"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-10T21:24:26.973558Z","title":"Impossib ility of Distributed Consensus with One Faulty Process","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.973558Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:da9905806b6091b262da95d47a6767fc40904c62696d46dc275d70aa1a534db2","observation_id":"0cbf61fd-4d0c-4b68-8515-ce8e7fe05ed3","resolution":{"observed_at":"2026-08-10T21:24:26.973558Z","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.1137/s0097539794265232","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:24:27.073303Z","title":"Fully Polynomial Byzantine Agr eement for n > 3t Processors in t + 1 Rounds","venue":null,"work_id":"837c7619-646e-4b05-93bd-d00fd62a7131","year":1998},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.977695Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:18833ebb0a592197116868c29423b2b400bfa1bb6887b777f73a89a5c3d4f26a","observation_id":"0eae3426-1548-4704-9d52-4c6dee34bc2e","resolution":{"observed_at":"2026-08-10T21:24:27.078444Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/313274","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:24:27.054671Z","title":"Algorand: Scaling Byzantine Agreements for C ryptocurrencies","venue":null,"work_id":"9332e26c-543d-4f97-abd6-8383c4253057","year":2017},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.982034Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:5b74beb4e96901d62aef4d9fea377dc8858bc63c1657181550d11d4568db67f1","observation_id":"194b33a5-7552-4ed0-a3f7-52e2ac890ed1","resolution":{"observed_at":"2026-08-10T21:24:27.061763Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T21:24:26.986445Z","title":"Signat ure-Free Asyn- chronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Ex- pected Time","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.986445Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:91201b52338daa422f16dd0d034bb62acb3785500c9a7579677aa256300eb5a4","observation_id":"50789ceb-38d1-49e0-bded-3703f691e62f","resolution":{"observed_at":"2026-08-10T21:24:26.986445Z","resolver_source":null,"status":"malformed_identifier"},"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-10T21:24:26.990814Z","title":"Reaching Agreement in the Presence of Faults","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.990814Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:c4c1e61d4a11344d33323b6ee03fa6d381e79aa88d8c85131acf45f8f1c72562","observation_id":"dd2a26f9-1cbb-4df6-bdfe-c7ebcf7a30d0","resolution":{"observed_at":"2026-08-10T21:24:26.990814Z","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-10T21:24:27.968162Z","title":"B reaking the Ω(√/u1D45B) Bar- rier: Fast Consensus under a Late Adversary","venue":null,"work_id":"7ee6a736-6814-4d71-8c6c-d38ac30abc2b","year":2018},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:26.995127Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:430824b135c0337243b79a4386f5234ee036409857ab40d73a8c5b7312a20d59","observation_id":"3e75d5d3-8678-484a-848f-2b578b83e0af","resolution":{"observed_at":"2026-08-10T21:24:27.973147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.08936","last_updated":"2020-08-24T14:54:44Z","snapshot_observed_at":"2026-08-14T16:12:43.994747Z","submitted_at":"2019-06-21T03:55:19Z","title":"Scalable and Probabilistic Leaderless BFT Consensus through Metastability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.08936","snapshot_observed_at":"2026-08-10T21:24:27.006804Z","title":"Scalable and Probabilistic Leaderless B FT Consensus through Metastability","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:27.006804Z"},"links":{"cited_paper":"/paper/1906.08936","citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:b46a55bf3b2334c7c8683fdc29fda6012f12ee7e844e666693b12585c35f4d8e","observation_id":"11ccd051-cddc-4dd8-bfbe-c6e90f9c1061","resolution":{"observed_at":"2026-08-10T21:24:27.006804Z","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":"0377.32103","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:24:27.336102Z","title":"by Christian Scheideler and Jeremy T","venue":null,"work_id":"c91addf8-fe87-4d3b-a7b1-d86aa3feac9c","year":2018},"citing_paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T21:24:27.000435Z"},"links":{"citing_paper":"/paper/2501.05377"},"observation_digest":"sha256:2f947b82066ee996bdb17201460a64e87ada1c74d122f5961755067640190654","observation_id":"b4e1e437-8d09-420b-910d-060c44ee095a","resolution":{"observed_at":"2026-08-10T21:24:27.346290Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.05377","last_updated":"2025-02-07T11:07:36Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-15T02:01:17.671625Z","submitted_at":"2025-01-09T16:59:56Z","title":"Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":5,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":3,"verified_fuzzy":1},"total_outbound_references":17},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2501.05377."}