{"as_of":"2026-08-08T14:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:691706853189c4db568a080231c8494933f0636fd135f9968acecf7177ee4278","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:15:45.432555Z","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-05-23T07:17:42.659808Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.01107","last_updated":"2022-01-04T12:28:40Z","snapshot_observed_at":"2026-08-03T21:28:31.263666Z","submitted_at":"2022-01-04T12:28:40Z","title":"Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model","version":1},"cited_work":{"arxiv_id":"2201.01107","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.01107","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"84df9c79-2134-4fe3-a96a-d116387dd0b0","year":2022},"citing_paper":{"arxiv_id":"2412.14061","last_updated":"2026-05-20T13:16:13Z","snapshot_observed_at":"2026-07-06T20:09:24.415233Z","submitted_at":"2024-12-18T17:07:57Z","title":"Fast Byzantine Total Order Broadcast","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-23T07:15:31.995897Z"},"links":{"cited_paper":"/paper/2201.01107","citing_paper":"/paper/2412.14061"},"observation_digest":"sha256:4ede94c4e93a277b619499116156fe69d62cb1007c9e12d3e115741e8a23f945","observation_id":"03e9b0eb-65c5-4412-9691-7840f11925c9","resolution":{"observed_at":"2026-05-23T07:17:42.662775Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.01107","last_updated":"2022-01-04T12:28:40Z","snapshot_observed_at":"2026-08-03T21:28:31.263666Z","submitted_at":"2022-01-04T12:28:40Z","title":"Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.01107","snapshot_observed_at":"2026-08-07T14:15:45.432555Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19989","last_updated":"2026-06-17T15:41:52Z","snapshot_observed_at":"2026-08-07T13:59:45.622146Z","submitted_at":"2025-05-26T13:44:19Z","title":"From Few to Many Faults: Optimal Adaptive Byzantine Agreement","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:15:45.432555Z"},"links":{"cited_paper":"/paper/2201.01107","citing_paper":"/paper/2505.19989"},"observation_digest":"sha256:1ac99da4a7aff1007b9f21c48721571762fea2f06aeed2b58af03a55751a3acf","observation_id":"9b50fdf6-74c2-466b-b77b-81699fcace47","resolution":{"observed_at":"2026-08-07T14:15:45.432555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.01107","last_updated":"2022-01-04T12:28:40Z","snapshot_observed_at":"2026-08-03T21:28:31.263666Z","submitted_at":"2022-01-04T12:28:40Z","title":"Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.01107","snapshot_observed_at":"2026-08-07T00:30:30.808658Z","title":"Quadratic worst-case message complexity for state machine replication in the partial synchrony model","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14124","last_updated":"2025-08-10T22:13:43Z","snapshot_observed_at":"2026-08-07T18:35:00.746646Z","submitted_at":"2025-06-17T02:37:40Z","title":"From Permissioned to Proof-of-Stake Consensus","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T00:30:30.808658Z"},"links":{"cited_paper":"/paper/2201.01107","citing_paper":"/paper/2506.14124"},"observation_digest":"sha256:db5c263df84d989a30e323759132c0d51c5dddf2ca81998567968c17f30094cf","observation_id":"6675a58b-9dcf-440c-bd05-0a85300cd460","resolution":{"observed_at":"2026-08-07T00:30:30.808658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.01107","last_updated":"2022-01-04T12:28:40Z","snapshot_observed_at":"2026-08-03T21:28:31.263666Z","submitted_at":"2022-01-04T12:28:40Z","title":"Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.01107","snapshot_observed_at":"2026-07-12T06:34:15.606663Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02856","last_updated":"2026-07-03T01:39:24Z","snapshot_observed_at":"2026-07-12T06:34:14.744470Z","submitted_at":"2026-07-03T01:39:24Z","title":"Cassandra: Consensus with Partial Progress via Robust Partitionable View Synchronization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-12T06:34:15.606663Z"},"links":{"cited_paper":"/paper/2201.01107","citing_paper":"/paper/2607.02856"},"observation_digest":"sha256:4d5b2592088558b286ae022eec312209131bf31c53e6529294bae19d53833481","observation_id":"a48e8f48-8569-493b-bbce-ba3a1d4ca4ff","resolution":{"observed_at":"2026-07-12T06:34:15.606663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2201.01107/citation-record","integrity":"/paper/2201.01107/integrity","json":"/paper/2201.01107/citation-record.json","paper":"/paper/2201.01107"},"outbound":[],"paper":{"arxiv_id":"2201.01107","last_updated":"2022-01-04T12:28:40Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-03T21:28:31.263666Z","submitted_at":"2022-01-04T12:28:40Z","title":"Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2201.01107."}