{"as_of":"2026-08-15T19:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ea40358b7941bc385394c8fb33241849a07477f82de72e5e91fe65890cc5aed","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-15T06:32:42.880941+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-04T04:12:31.888480Z","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":[{"citation":{"cited_paper":{"arxiv_id":"1810.05256","last_updated":"2019-08-29T16:51:01Z","snapshot_observed_at":"2026-08-15T06:23:38.550573Z","submitted_at":"2018-10-11T21:27:45Z","title":"Aleph: A Leaderless, Asynchronous, Byzantine Fault Tolerant Consensus Protocol","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05256","snapshot_observed_at":"2026-08-02T18:29:51.692970Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-14T17:40:00.165805Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.692970Z"},"links":{"cited_paper":"/paper/1810.05256","citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:1c3dbe2962da2cba453df16ac98d0ed06f64f48cff96484e2157c95e9011513d","observation_id":"d91fc22f-62b3-40b7-a3a9-9079f813ef60","resolution":{"observed_at":"2026-08-02T18:29:51.692970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05256","last_updated":"2019-08-29T16:51:01Z","snapshot_observed_at":"2026-08-15T06:23:38.550573Z","submitted_at":"2018-10-11T21:27:45Z","title":"Aleph: A Leaderless, Asynchronous, Byzantine Fault Tolerant Consensus Protocol","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05256","snapshot_observed_at":"2026-08-01T08:52:37.265192Z","title":"Aleph: A leaderless, asynchronous, byzantine fault toler- ant consensus protocol.arXiv preprint arXiv:1810.05256, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.21021","last_updated":"2026-08-03T17:26:17Z","snapshot_observed_at":"2026-08-15T18:41:12.819647Z","submitted_at":"2026-07-23T08:05:29Z","title":"Multimmit: Extending Blocks for Faster Finality","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T08:52:37.265192Z"},"links":{"cited_paper":"/paper/1810.05256","citing_paper":"/paper/2607.21021"},"observation_digest":"sha256:c1e1dd7b3a543a91da038714526e5bb5f982f7a742cce7f51fce8d12d06213b6","observation_id":"d4fc24e0-27a1-4fad-8f66-390dd467bf0d","resolution":{"observed_at":"2026-08-01T08:52:37.265192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05256","last_updated":"2019-08-29T16:51:01Z","snapshot_observed_at":"2026-08-15T06:23:38.550573Z","submitted_at":"2018-10-11T21:27:45Z","title":"Aleph: A Leaderless, Asynchronous, Byzantine Fault Tolerant Consensus Protocol","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05256","snapshot_observed_at":"2026-08-04T04:12:31.888480Z","title":"Aleph: A leaderless, asynchronous, byzantine fault toler- ant consensus protocol.arXiv preprint arXiv:1810.05256, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.21021","last_updated":"2026-08-03T17:26:17Z","snapshot_observed_at":"2026-08-15T18:41:12.819647Z","submitted_at":"2026-07-23T08:05:29Z","title":"Multimmit: Extending Blocks for Faster Finality","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T04:12:31.888480Z"},"links":{"cited_paper":"/paper/1810.05256","citing_paper":"/paper/2607.21021"},"observation_digest":"sha256:560b83c82bd1772c57185481ab5a46bbe2d20c1f64c289e712ecd6cb1c9b4721","observation_id":"68c04366-02fb-400f-8431-ff832ddf6146","resolution":{"observed_at":"2026-08-04T04:12:31.888480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1810.05256/citation-record","integrity":"/paper/1810.05256/integrity","json":"/paper/1810.05256/citation-record.json","paper":"/paper/1810.05256"},"outbound":[],"paper":{"arxiv_id":"1810.05256","last_updated":"2019-08-29T16:51:01Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-15T06:23:38.550573Z","submitted_at":"2018-10-11T21:27:45Z","title":"Aleph: A Leaderless, Asynchronous, Byzantine Fault Tolerant Consensus Protocol"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1810.05256."}