{"as_of":"2026-08-09T21:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:63d5cb222da15679fca502114361b2eced8a123145462a61f68261c829ac7f9d","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:39:39.285530Z","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-09T13:16:39.549013Z","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-09T12:41:11.903230Z","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:0e94ffd5d5289b6c7792ecb4dc6edc2a8ab84a521c2a9416bc226201da3aa411","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-09T13:16:39.549013Z","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-07T22:30:42.242398Z","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:4b809bfc7d0866fea13932a465c6014782dc4a58a8251c893d5ab04ba429d350","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-09T13:16:39.549013Z","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-03T07:01:19.507451Z","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:5d63cea1abb702712d9aad16fe9079df157d3c936dc7b399efec25cd89e52bd7","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-09T13:16:39.549013Z","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-06T23:30:56.974912Z","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:380b2f637a0d371e19b69bbdfc162cedd4902237f798980f98d8c75e0917968f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-09T13:16:39.549013Z","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-07-06T23:59:37.533078Z","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:054ac604af4ce537f88d86e749525da06b2f41199db1f82e78e24c9758ce9ca4","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05552","last_updated":"2021-01-22T17:03:01Z","snapshot_observed_at":"2026-08-09T13:16:39.549013Z","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-03T17:26:17Z","snapshot_observed_at":"2026-08-07T02:45:20.546464Z","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:9107237a929a14bd16d5953ef2f9cda0d638029f1f6240b2de94c73b16ecac02","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-09T13:16:39.549013Z","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-03T17:26:17Z","snapshot_observed_at":"2026-08-07T02:45:20.546464Z","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:0277c077b33c2280a9d633c183d83b46895b1113dbdaaf16bbcf6998effc0f5a","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-09T13:16:39.549013Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:1906.05552."}