{"as_of":"2026-08-07T17:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7755101773f663dc89dac1d495a04ee868890988bfa6b8e83ed54d3861babaaf","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T01:23:38.000279Z","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":"2108.06869","last_updated":"2023-04-16T16:53:18Z","snapshot_observed_at":"2026-08-04T12:42:35.759626Z","submitted_at":"2021-08-16T02:57:06Z","title":"FedChain: Chained Algorithms for Near-Optimal Communication Cost in Federated Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.06869","snapshot_observed_at":"2026-08-02T01:23:38.000279Z","title":"Fedchain: Chained algorithms for near-optimal communication cost in federated learning.arXiv preprint arXiv:2108.06869, 2021.(Cited on page 13)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.14731","last_updated":"2026-07-16T08:56:45Z","snapshot_observed_at":"2026-08-03T18:32:12.673941Z","submitted_at":"2026-07-16T08:56:45Z","title":"What's in a Smoothness Constant? Tighter Rates for Local SGD with Bounded Second-order Heterogeneity","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-02T01:23:38.000279Z"},"links":{"cited_paper":"/paper/2108.06869","citing_paper":"/paper/2607.14731"},"observation_digest":"sha256:9bbbb5045831e381261bedbd07f678397e53637e5449f8a601af3d5b0eecdccc","observation_id":"c539fe00-4a7c-441c-9992-d8e19325b983","resolution":{"observed_at":"2026-08-02T01:23:38.000279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2108.06869/citation-record","integrity":"/paper/2108.06869/integrity","json":"/paper/2108.06869/citation-record.json","paper":"/paper/2108.06869"},"outbound":[],"paper":{"arxiv_id":"2108.06869","last_updated":"2023-04-16T16:53:18Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T12:42:35.759626Z","submitted_at":"2021-08-16T02:57:06Z","title":"FedChain: Chained Algorithms for Near-Optimal Communication Cost in Federated Learning"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2108.06869."}