{"as_of":"2026-08-23T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6711e38c76878c1ecf338bdb6042319379012cf485c271c648b3886f75894522","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:20:53.027190Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T19:10:04.804613Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-12T00:07:15.968342Z","title":"Mir-BFT: High- throughput bft for blockchains,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2412.01999","last_updated":"2025-06-10T04:13:03Z","snapshot_observed_at":"2026-08-11T23:54:23.787505Z","submitted_at":"2024-12-02T22:07:23Z","title":"Hamava: Fault-tolerant Reconfigurable Geo-Replication on Heterogeneous Clusters","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T00:07:15.968342Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2412.01999"},"observation_digest":"sha256:df86be6f2f4b3bc0a537ffb36b85ee2415c890f632a9cbc088f6c07d34b7c285","observation_id":"ba7ae6f3-c93a-4b67-8f98-6205883db3a4","resolution":{"observed_at":"2026-08-12T00:07:15.968342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-10T19:11:53.119604Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.10612","last_updated":"2025-01-18T00:22:22Z","snapshot_observed_at":"2026-08-17T21:58:30.236741Z","submitted_at":"2025-01-18T00:22:22Z","title":"Zaptos: Towards Optimal Blockchain Latency","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T19:11:53.119604Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2501.10612"},"observation_digest":"sha256:58f6bfefd84f1ca4e935bbecfe8bf27d3f925a88c3ce0692224e101f3b477ba8","observation_id":"c755e17a-d32d-4c45-aa79-01dd77d94ff9","resolution":{"observed_at":"2026-08-10T19:11:53.119604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-16T10:20:53.027190Z","title":"Mir-bft: High-throughput BFT for blockchains","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2504.18649","last_updated":"2025-04-29T16:14:07Z","snapshot_observed_at":"2026-08-16T10:10:56.139068Z","submitted_at":"2025-04-25T19:01:04Z","title":"Raptr: Prefix Consensus for Robust High-Performance BFT","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T10:20:53.027190Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2504.18649"},"observation_digest":"sha256:caa93fa336fa5ae2771bc37f920b965582f947c41174d42ed9b0b08a89b5c1f1","observation_id":"86b7c95f-61d7-48c2-9db5-c357a9fe88ce","resolution":{"observed_at":"2026-08-16T10:20:53.027190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-16T05:10:06.892471Z","title":"Mir-BFT: High- throughput BFT for blockchains,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2504.21410","last_updated":"2025-04-30T08:10:10Z","snapshot_observed_at":"2026-08-18T20:41:20.305696Z","submitted_at":"2025-04-30T08:10:10Z","title":"Tolerating Disasters with Hierarchical Consensus","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T05:10:06.892471Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2504.21410"},"observation_digest":"sha256:9e8020e912bdf42fc98b410c04f56f4a3ca0bb02bc06985ddbb1cb0959da5a71","observation_id":"900beb98-6ea7-46f4-918b-4c0959030026","resolution":{"observed_at":"2026-08-16T05:10:06.892471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-06T19:39:39.285530Z","title":"Stathakopoulou, T","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2507.04956","last_updated":"2025-07-07T12:56:45Z","snapshot_observed_at":"2026-08-19T11:58:35.809480Z","submitted_at":"2025-07-07T12:56:45Z","title":"Bullshark on Narwhal: Implementation-level Workflow Analysis of Round-based DAG Consensus in Theory and Practice","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T19:39:39.285530Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2507.04956"},"observation_digest":"sha256:396944485cec618116a6105a33d92d3bd112f203e10e7cf57176c278399c2ce3","observation_id":"d403bb9d-a21d-4b1d-94ac-f783dbab511d","resolution":{"observed_at":"2026-08-06T19:39:39.285530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-15T15:58:45.068711Z","title":"Mir-bft: High-throughput bft for blockchains","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2509.15847","last_updated":"2026-06-01T21:37:18Z","snapshot_observed_at":"2026-08-20T01:23:37.759945Z","submitted_at":"2025-09-19T10:30:25Z","title":"Angelfish: Leader, DAG, or Anywhere in Between","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T15:58:45.068711Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2509.15847"},"observation_digest":"sha256:a5118ea16d963f683e9252db31e8460f85b541ae04b0ca12afb11ac101d6b88e","observation_id":"24e36bfd-5227-4a96-a619-2b81dae912b9","resolution":{"observed_at":"2026-08-15T15:58:45.068711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-03T05:22:23.770307Z","title":"arXiv preprint arXiv:1906.0555292(2019)","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2602.02892","last_updated":"2026-07-16T22:26:03Z","snapshot_observed_at":"2026-08-19T19:40:07.413741Z","submitted_at":"2026-02-02T22:55:29Z","title":"Prefix Consensus For Censorship Resistant BFT","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:23.770307Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2602.02892"},"observation_digest":"sha256:165ad4e96a1367b36d84bccb8f43741b5720479d4589c8cd12031ce1e74c5e9a","observation_id":"a4e65a2f-d04f-4541-84ee-20ee7e7a5574","resolution":{"observed_at":"2026-08-03T05:22:23.770307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":"1906.05552","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-07-04T19:10:04.804613Z","title":"Mir-BFT: High-throughput robust BFT for decentralized networks","venue":null,"work_id":"677cc995-c589-46df-9716-1484edb9a7c1","year":2019},"citing_paper":{"arxiv_id":"2605.23677","last_updated":"2026-05-22T14:26:10Z","snapshot_observed_at":"2026-08-18T17:15:41.705723Z","submitted_at":"2026-05-22T14:26:10Z","title":"AMP: Arc Multi-Proposer Protocol with Bounded Inclusion Guarantees","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-25T02:56:33.831382Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2605.23677"},"observation_digest":"sha256:b7234b78b2cd9fd8b8141632a0b4b7b05791bc5f693d1cb674015fb307c6c200","observation_id":"87003a69-d451-45a0-bf06-565780e33128","resolution":{"observed_at":"2026-05-25T03:00:16.152480Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":"1906.05552","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-07-04T19:10:04.804613Z","title":"Mir-BFT: High-throughput robust BFT for decentralized networks","venue":null,"work_id":"677cc995-c589-46df-9716-1484edb9a7c1","year":2019},"citing_paper":{"arxiv_id":"2606.04687","last_updated":"2026-06-03T10:11:50Z","snapshot_observed_at":"2026-08-16T19:07:21.620037Z","submitted_at":"2026-06-03T10:11:50Z","title":"Clownfish: Scaling DAG-based BFT Consensus via Sparse Edges","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-28T04:26:04.670835Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2606.04687"},"observation_digest":"sha256:b3eb12111b73feb96862aa7ac1c93180307587113d034d06365424f6c3e99b16","observation_id":"f324202f-321a-4a1a-b196-7cbf6dd2ecfc","resolution":{"observed_at":"2026-07-02T11:16:53.071494Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":"1906.05552","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-07-04T19:10:04.804613Z","title":"Mir-BFT: High-throughput robust BFT for decentralized networks","venue":null,"work_id":"677cc995-c589-46df-9716-1484edb9a7c1","year":2019},"citing_paper":{"arxiv_id":"2606.25099","last_updated":"2026-06-23T19:13:38Z","snapshot_observed_at":"2026-08-14T22:02:39.053623Z","submitted_at":"2026-06-23T19:13:38Z","title":"Ambulance: saving BFT through racing","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-06-25T21:51:18.963269Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2606.25099"},"observation_digest":"sha256:93292a952a256d970328b3e6d290d0c719850e89ae05978b8771cf6fa53ca333","observation_id":"80ff5ec1-440d-46dc-9c1c-8d6ad259b7a0","resolution":{"observed_at":"2026-07-04T19:10:04.806075Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-01T08:52:42.031272Z","title":"Mir-BFT: High-throughput BFT for blockchains.arXiv preprint arXiv:1906.05552, 2019","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.21021","last_updated":"2026-08-20T13:40:25Z","snapshot_observed_at":"2026-08-23T06:11:02.594745Z","submitted_at":"2026-07-23T08:05:29Z","title":"Multimmit: Extending Blocks for Faster Finality","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-01T08:52:42.031272Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2607.21021"},"observation_digest":"sha256:daf821aa9c21c9080b45c9fef81892f4b2d184df9672f3ae882e2e4b26264a14","observation_id":"55790cac-809e-4baa-9e3a-315218228006","resolution":{"observed_at":"2026-08-01T08:52:42.031272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05552","snapshot_observed_at":"2026-08-04T04:12:32.153662Z","title":"Mir-BFT: High-throughput BFT for blockchains.arXiv preprint arXiv:1906.05552, 2019","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.21021","last_updated":"2026-08-20T13:40:25Z","snapshot_observed_at":"2026-08-23T06:11:02.594745Z","submitted_at":"2026-07-23T08:05:29Z","title":"Multimmit: Extending Blocks for Faster Finality","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T04:12:32.153662Z"},"links":{"cited_paper":"/paper/1906.05552","citing_paper":"/paper/2607.21021"},"observation_digest":"sha256:0b1893c48d77a9d2c0d422e6051534899e8b0b076a4945f3d8fb6882ed3ce05f","observation_id":"253ec837-edf7-4668-9091-d33bb1c15572","resolution":{"observed_at":"2026-08-04T04:12:32.153662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1906.05552/citation-record","integrity":"/paper/1906.05552/integrity","json":"/paper/1906.05552/citation-record.json","paper":"/paper/1906.05552"},"outbound":[],"paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","latest_version":3,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-15T17:02:55.015676Z","submitted_at":"2019-06-13T08:58:33Z","title":"Mir-BFT: High-Throughput Robust BFT for Decentralized Networks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:1906.05552."}