{"as_of":"2026-08-11T08:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d1d93a1f522aebe1b7599b2c188e56c19c9f2fd0c911b90cee3b50bed507de2d","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:54:49.723199Z","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-23T04:07:30.656098Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.05495","last_updated":"2025-08-29T14:16:00Z","snapshot_observed_at":"2026-08-11T02:06:38.445656Z","submitted_at":"2024-08-10T09:03:06Z","title":"Asynchronous Approximate Agreement with Quadratic Communication","version":4},"cited_work":{"arxiv_id":"2408.05495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.05495","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Asynchronous approximate agreement with quadratic communication","venue":null,"work_id":"30907df1-3c1c-48d0-9a50-3b55631d8854","year":2024},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T04:05:34.626512Z"},"links":{"cited_paper":"/paper/2408.05495","citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:7f8aed94a86e5d7fd0b903e7432517d73d89bdbdf42641894e3bcff4dbbb95c9","observation_id":"b21faf5b-2897-46f7-9921-411a184f8ab0","resolution":{"observed_at":"2026-05-23T04:07:30.659693Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05495","last_updated":"2025-08-29T14:16:00Z","snapshot_observed_at":"2026-08-11T02:06:38.445656Z","submitted_at":"2024-08-10T09:03:06Z","title":"Asynchronous Approximate Agreement with Quadratic Communication","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05495","snapshot_observed_at":"2026-08-08T18:54:49.723199Z","title":"Asynchronous approximate agreement with quadratic communication, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05591","last_updated":"2026-07-01T22:14:15Z","snapshot_observed_at":"2026-08-08T22:53:37.600568Z","submitted_at":"2025-02-08T14:39:28Z","title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T18:54:49.723199Z"},"links":{"cited_paper":"/paper/2408.05495","citing_paper":"/paper/2502.05591"},"observation_digest":"sha256:aa4beaa37faaac64ea3304c70d8517bdf6834062d9a2b22c3b89b97382630170","observation_id":"dabec76d-e410-41b2-b128-fa14cdf517c8","resolution":{"observed_at":"2026-08-08T18:54:49.723199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.05495/citation-record","integrity":"/paper/2408.05495/integrity","json":"/paper/2408.05495/citation-record.json","paper":"/paper/2408.05495"},"outbound":[],"paper":{"arxiv_id":"2408.05495","last_updated":"2025-08-29T14:16:00Z","latest_version":4,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-11T02:06:38.445656Z","submitted_at":"2024-08-10T09:03:06Z","title":"Asynchronous Approximate Agreement with Quadratic Communication"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.05495."}