{"as_of":"2026-08-12T08:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:81c5f0f5c174a8369e88e8b12aae9d609efa8e859778d5851638eae1a695c7c9","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:43:30.931390Z","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.808473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.08670","last_updated":"2024-10-17T14:06:29Z","snapshot_observed_at":"2026-08-04T19:32:44.239534Z","submitted_at":"2024-10-11T09:54:56Z","title":"Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08670","snapshot_observed_at":"2026-08-10T22:43:30.931390Z","title":"Mahi-mahi: Low-latency asynchronous BFT DAG-based consensus","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T22:43:30.931390Z"},"links":{"cited_paper":"/paper/2410.08670","citing_paper":"/paper/2501.01062"},"observation_digest":"sha256:a7999e10478059ba420da90fbe6b6e4ad6c345b6c16ece56d0e939c08182b33c","observation_id":"c7f64d44-7254-466d-a593-5979ed713d30","resolution":{"observed_at":"2026-08-10T22:43:30.931390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08670","last_updated":"2024-10-17T14:06:29Z","snapshot_observed_at":"2026-08-04T19:32:44.239534Z","submitted_at":"2024-10-11T09:54:56Z","title":"Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08670","snapshot_observed_at":"2026-08-07T22:47:48.658133Z","title":"Mahi-mahi: Low-latency asynchronous bft dag-based consensus","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09116","last_updated":"2025-05-26T09:16:19Z","snapshot_observed_at":"2026-08-12T01:17:41.197241Z","submitted_at":"2025-02-13T09:50:07Z","title":"Byzantine Consensus in the Random Asynchronous Model","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T22:47:48.658133Z"},"links":{"cited_paper":"/paper/2410.08670","citing_paper":"/paper/2502.09116"},"observation_digest":"sha256:a4a0e8cfe08938e171f63bd3129199f2d113ab2c2af5df394a08df8820fe989c","observation_id":"f7904659-a162-4a5e-9753-c68ae28b60a9","resolution":{"observed_at":"2026-08-07T22:47:48.658133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08670","last_updated":"2024-10-17T14:06:29Z","snapshot_observed_at":"2026-08-04T19:32:44.239534Z","submitted_at":"2024-10-11T09:54:56Z","title":"Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus","version":2},"cited_work":{"arxiv_id":"2410.08670","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08670","snapshot_observed_at":"2026-07-04T19:10:04.808473Z","title":null,"venue":null,"work_id":"7e0d61fb-72e8-4933-93c0-34f0a57724d5","year":2024},"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":58,"source":"pdf_text","source_observed_at":"2026-06-25T21:51:18.963269Z"},"links":{"cited_paper":"/paper/2410.08670","citing_paper":"/paper/2606.25099"},"observation_digest":"sha256:e8a0698ca92a1a9286cf50b9e900647c9d7c625a8989bcbd1acda7a0f51c357b","observation_id":"09e67047-698b-4c48-91fe-0a5510a2ae0f","resolution":{"observed_at":"2026-07-04T19:10:04.810110Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.08670/citation-record","integrity":"/paper/2410.08670/integrity","json":"/paper/2410.08670/citation-record.json","paper":"/paper/2410.08670"},"outbound":[],"paper":{"arxiv_id":"2410.08670","last_updated":"2024-10-17T14:06:29Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-04T19:32:44.239534Z","submitted_at":"2024-10-11T09:54:56Z","title":"Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2410.08670."}