{"as_of":"2026-08-09T08:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8de11c112a41476713b4da990289c3ffe6e225cbc5f8ada7b570102486114684","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-09T06:31:02.800959+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-07T14:53:04.288496Z","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-04T15:39:57.002653Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-08-07T14:53:04.288496Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17885","last_updated":"2025-05-26T10:49:14Z","snapshot_observed_at":"2026-08-08T04:19:40.874842Z","submitted_at":"2025-05-23T13:32:37Z","title":"Transaction Fee Mechanism Design for Leaderless Blockchain Protocols","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:53:04.288496Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2505.17885"},"observation_digest":"sha256:5d9092b7321785e6b6d28128716f8af64aca6c623f1ab41b19ca3f04f47c4a5e","observation_id":"505a79b4-0195-44cc-8907-5a5ec98b0518","resolution":{"observed_at":"2026-08-07T14:53:04.288496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-08-03T21:30:43.703421Z","title":"Shoal++: High throughput dag bft can be fast!","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15361","last_updated":"2026-07-06T15:47:38Z","snapshot_observed_at":"2026-08-08T15:40:29.862442Z","submitted_at":"2025-11-19T11:42:43Z","title":"BlueBottle: Fast and Robust Blockchains through Subsystem Specialization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T21:30:43.703421Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2511.15361"},"observation_digest":"sha256:ad80ed6e0de3676d2b5eed038015a8a453e29f9b424215ae05cee3d3b3563f02","observation_id":"a5695056-0a69-4c4d-a598-9eeed0a20d3b","resolution":{"observed_at":"2026-08-03T21:30:43.703421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-08-03T21:28:55.604882Z","title":"Shoal++: High throughput dag bft can be fast!","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.15517","last_updated":"2026-06-29T12:01:25Z","snapshot_observed_at":"2026-08-03T21:28:50.012356Z","submitted_at":"2025-11-19T15:12:16Z","title":"Beluga: Block Synchronization for BFT Consensus Protocols","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T21:28:55.604882Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2511.15517"},"observation_digest":"sha256:bbcb4e27d61821e23f67b22bb150711a591f12e4ae115805a7970a52ab8e9b1a","observation_id":"e2470c47-56b5-46ea-80a9-017154365ef3","resolution":{"observed_at":"2026-08-03T21:28:55.604882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-08-03T05:22:17.617650Z","title":null,"venue":null,"work_id":null,"year":2024},"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":9,"source":"pdf_text","source_observed_at":"2026-08-03T05:22:17.617650Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2602.02892"},"observation_digest":"sha256:c94b876d2246c16e1c24546827b65d035eef90d163a202c4cd8f177cc973b67f","observation_id":"94167319-0cfb-4803-b4fc-6eb8393b555f","resolution":{"observed_at":"2026-08-03T05:22:17.617650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":"2405.20488","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-07-04T15:39:57.002653Z","title":"Shoal++: High throughput DAG BFT can be fast!","venue":null,"work_id":"a6a38827-725a-4939-a3c0-1e0f98c7ebc0","year":2024},"citing_paper":{"arxiv_id":"2604.03974","last_updated":"2026-04-05T05:40:59Z","snapshot_observed_at":"2026-07-06T22:53:01.835843Z","submitted_at":"2026-04-05T05:40:59Z","title":"Lemonshark: Asynchronous DAG-BFT With Early Finality","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-13T17:35:58.785013Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2604.03974"},"observation_digest":"sha256:dee88d5f71dbdc9ca23b4bf8b5a27d340e62b9654209fb74aa2e00a71237674b","observation_id":"479d23b9-8329-4dda-9505-41cc6ef030ed","resolution":{"observed_at":"2026-05-13T17:38:02.745917Z","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":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":"2405.20488","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-07-04T15:39:57.002653Z","title":"Shoal++: High throughput DAG BFT can be fast!","venue":null,"work_id":"a6a38827-725a-4939-a3c0-1e0f98c7ebc0","year":2024},"citing_paper":{"arxiv_id":"2605.10372","last_updated":"2026-05-29T15:40:33Z","snapshot_observed_at":"2026-08-06T11:14:21.501446Z","submitted_at":"2026-05-11T11:14:04Z","title":"Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T22:41:19.434159Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2605.10372"},"observation_digest":"sha256:c0318e9f9b48d944a0c33c561e756162a5f7f77833419f3eb26506f881742fe1","observation_id":"3b414680-a473-4427-a4df-6aca1cc9441e","resolution":{"observed_at":"2026-07-01T13:45:46.431725Z","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":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":"2405.20488","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-07-04T15:39:57.002653Z","title":"Shoal++: High throughput DAG BFT can be fast!","venue":null,"work_id":"a6a38827-725a-4939-a3c0-1e0f98c7ebc0","year":2024},"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":6,"source":"pdf_text","source_observed_at":"2026-05-25T02:56:33.831382Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2605.23677"},"observation_digest":"sha256:da912ada394bdb65bd8c7f5fd1db106ffac608b0fff50f8d72c7e5dc7c7a2cbc","observation_id":"6d11841b-fdbd-4841-bafa-f9a9d77ae8cc","resolution":{"observed_at":"2026-05-25T03:00:16.110918Z","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":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":"2405.20488","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-07-04T15:39:57.002653Z","title":"Shoal++: High throughput DAG BFT can be fast!","venue":null,"work_id":"a6a38827-725a-4939-a3c0-1e0f98c7ebc0","year":2024},"citing_paper":{"arxiv_id":"2606.10982","last_updated":"2026-06-25T18:47:38Z","snapshot_observed_at":"2026-08-07T20:34:43.138106Z","submitted_at":"2026-06-09T15:19:23Z","title":"FairWave : A Fairness-Aware Asynchronous DAG-BFT Consensus","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T11:32:48.836784Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2606.10982"},"observation_digest":"sha256:6f55140e81c9fe03b06a0a65aeac16facdb60fa4d5f7f749f4d7fbf9b2cec22e","observation_id":"5c73aa22-e839-4863-afa8-6ccd49e5f7fe","resolution":{"observed_at":"2026-07-03T07:57:44.703245Z","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":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":"2405.20488","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-07-04T15:39:57.002653Z","title":"Shoal++: High throughput DAG BFT can be fast!","venue":null,"work_id":"a6a38827-725a-4939-a3c0-1e0f98c7ebc0","year":2024},"citing_paper":{"arxiv_id":"2606.10982","last_updated":"2026-06-25T18:47:38Z","snapshot_observed_at":"2026-08-07T20:34:43.138106Z","submitted_at":"2026-06-09T15:19:23Z","title":"FairWave : A Fairness-Aware Asynchronous DAG-BFT Consensus","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T02:18:49.603521Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2606.10982"},"observation_digest":"sha256:3146e4f00dbca810b72dd270a6c6205dfbdd57787881eeea3cd647d57d9e3f2a","observation_id":"1df0b7e5-316b-45ff-a856-4f99e24a9356","resolution":{"observed_at":"2026-07-01T18:15:58.392126Z","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":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":"2405.20488","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-07-04T15:39:57.002653Z","title":"Shoal++: High throughput DAG BFT can be fast!","venue":null,"work_id":"a6a38827-725a-4939-a3c0-1e0f98c7ebc0","year":2024},"citing_paper":{"arxiv_id":"2606.26292","last_updated":"2026-06-24T18:37:03Z","snapshot_observed_at":"2026-08-07T19:34:04.427472Z","submitted_at":"2026-06-24T18:37:03Z","title":"FinWhale: An Optimally Resilient Two-Round Terminating DAG Protocol","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T01:29:38.983310Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2606.26292"},"observation_digest":"sha256:7a7fb807a381828659fd0f7712c38d59e99f6b186fcf2e7d5ec5b7768c414b70","observation_id":"6120734a-5364-49cb-9285-581d61f18deb","resolution":{"observed_at":"2026-07-04T15:39:57.004397Z","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":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-08-01T08:52:35.642804Z","title":"Shoal++: High throughput DAG BFT can be fast!arXiv preprint arXiv:2405.20488, 2024","venue":null,"work_id":null,"year":2024},"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":6,"source":"pdf_text","source_observed_at":"2026-08-01T08:52:35.642804Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2607.21021"},"observation_digest":"sha256:8b461cb5e56be0c0a5938d7fe698a9d61d3bcdb1075ecc05bdce6eef774ba811","observation_id":"92066359-1eb0-40b1-95b9-4d92bea40bfb","resolution":{"observed_at":"2026-08-01T08:52:35.642804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20488","last_updated":"2025-03-05T00:55:16Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20488","snapshot_observed_at":"2026-08-04T04:12:31.332065Z","title":"Shoal++: High throughput DAG BFT can be fast!arXiv preprint arXiv:2405.20488, 2024","venue":null,"work_id":null,"year":2024},"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":6,"source":"pdf_text","source_observed_at":"2026-08-04T04:12:31.332065Z"},"links":{"cited_paper":"/paper/2405.20488","citing_paper":"/paper/2607.21021"},"observation_digest":"sha256:0c18cc19f1281ff2dae900014797dde2eb4e6b56639bde070b5ae45b056782bc","observation_id":"39898b4a-bb04-49cd-bb68-f573e8776d21","resolution":{"observed_at":"2026-08-04T04:12:31.332065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.20488/citation-record","integrity":"/paper/2405.20488/integrity","json":"/paper/2405.20488/citation-record.json","paper":"/paper/2405.20488"},"outbound":[],"paper":{"arxiv_id":"2405.20488","last_updated":"2025-03-05T00:55:16Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T21:23:34Z","title":"Shoal++: High Throughput DAG BFT Can Be Fast!"},"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 12 inbound Pith citation observations for arXiv:2405.20488."}