{"as_of":"2026-08-16T22:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:535591a8860a45064be9d101ddcb22229eb5f6826952d4ce7784728b11918d94","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-16T06:30:59.297886+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-15T20:44:56.961994Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T14:39:16.542699Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.03240","last_updated":"2023-06-05T20:50:36Z","snapshot_observed_at":"2026-08-16T15:26:22.446924Z","submitted_at":"2023-06-05T20:50:36Z","title":"Improving Accelerated Federated Learning with Compression and Importance Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03240","snapshot_observed_at":"2026-08-15T20:44:56.961994Z","title":"Grudzień, G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.961994Z"},"links":{"cited_paper":"/paper/2306.03240","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:b41848c0705a31c5822d1bff8cc5364a43fd775c7686ea3de3b87989347eaf07","observation_id":"14025093-402e-4d22-bfca-c20462c0e79c","resolution":{"observed_at":"2026-08-15T20:44:56.961994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03240","last_updated":"2023-06-05T20:50:36Z","snapshot_observed_at":"2026-08-16T15:26:22.446924Z","submitted_at":"2023-06-05T20:50:36Z","title":"Improving Accelerated Federated Learning with Compression and Importance Sampling","version":1},"cited_work":{"arxiv_id":"2306.03240","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.03240","snapshot_observed_at":"2026-08-15T14:39:16.542699Z","title":"Improving Accelerated Federated Learning with Compression and Importance Sampling","venue":"cs.LG","work_id":"3c3464ab-19a6-41d9-ae2e-c3866e16d5de","year":2023},"citing_paper":{"arxiv_id":"2608.06563","last_updated":"2026-08-06T20:20:52Z","snapshot_observed_at":"2026-08-16T12:45:20.732938Z","submitted_at":"2026-08-06T20:20:52Z","title":"Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-15T14:39:14.542277Z"},"links":{"cited_paper":"/paper/2306.03240","citing_paper":"/paper/2608.06563"},"observation_digest":"sha256:0d0e1858f0b586ef7a3e29ab57543eabf313224cb228b71603c1f2b22072e767","observation_id":"7a3bcec7-2b3e-4a9e-974a-551b5cd79bf5","resolution":{"observed_at":"2026-08-15T14:39:16.546131Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.03240/citation-record","integrity":"/paper/2306.03240/integrity","json":"/paper/2306.03240/citation-record.json","paper":"/paper/2306.03240"},"outbound":[],"paper":{"arxiv_id":"2306.03240","last_updated":"2023-06-05T20:50:36Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:26:22.446924Z","submitted_at":"2023-06-05T20:50:36Z","title":"Improving Accelerated Federated Learning with Compression and Importance Sampling"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.03240."}