{"as_of":"2026-08-10T00:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:091b8ae9b8cde43f33837b082116a4020be3ee5819f730d7af0f0a4c22133ecb","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-09T06:31:02.800959+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-06T22:52:39.072124Z","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-07-03T00:07:27.793760Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.15197","last_updated":"2020-10-14T19:08:30Z","snapshot_observed_at":"2026-08-08T17:39:40.518048Z","submitted_at":"2020-07-30T02:58:00Z","title":"Communication-Efficient Federated Learning via Optimal Client Sampling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.15197","snapshot_observed_at":"2026-08-06T22:52:39.072124Z","title":"Ribero, H","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20431","last_updated":"2025-06-25T13:42:30Z","snapshot_observed_at":"2026-08-09T06:29:01.259632Z","submitted_at":"2025-06-25T13:42:30Z","title":"Tackling Data Heterogeneity in Federated Learning through Knowledge Distillation with Inequitable Aggregation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:52:39.072124Z"},"links":{"cited_paper":"/paper/2007.15197","citing_paper":"/paper/2506.20431"},"observation_digest":"sha256:b8f708848b7b7df16ed1e2c5c52e21b6e5d936bb2f16ead4e3c5727e0a9e8a81","observation_id":"bdcd4d4e-1f8b-4394-aa86-ddbedd9a5db9","resolution":{"observed_at":"2026-08-06T22:52:39.072124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.15197","last_updated":"2020-10-14T19:08:30Z","snapshot_observed_at":"2026-08-08T17:39:40.518048Z","submitted_at":"2020-07-30T02:58:00Z","title":"Communication-Efficient Federated Learning via Optimal Client Sampling","version":2},"cited_work":{"arxiv_id":"2007.15197","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.15197","snapshot_observed_at":"2026-07-03T00:07:27.793760Z","title":"Communication-efficient federated learning via optimal client sampling","venue":null,"work_id":"4cfc2acf-565b-418e-bd27-5b1d14cab030","year":2007},"citing_paper":{"arxiv_id":"2605.20975","last_updated":"2026-05-21T11:42:35Z","snapshot_observed_at":"2026-08-03T01:51:37.246824Z","submitted_at":"2026-05-20T10:00:33Z","title":"Choose Wisely and Privately: Proactive Client Selection for Fair and Efficient Federated Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-21T06:09:45.435627Z"},"links":{"cited_paper":"/paper/2007.15197","citing_paper":"/paper/2605.20975"},"observation_digest":"sha256:cedd85cc90e670a5a7c1c36b6038d0938248179848b30c78419105d08242c5ec","observation_id":"5bf39266-a38f-425d-9d52-3d079dea2685","resolution":{"observed_at":"2026-05-21T06:13:59.721717Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.15197","last_updated":"2020-10-14T19:08:30Z","snapshot_observed_at":"2026-08-08T17:39:40.518048Z","submitted_at":"2020-07-30T02:58:00Z","title":"Communication-Efficient Federated Learning via Optimal Client Sampling","version":2},"cited_work":{"arxiv_id":"2007.15197","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.15197","snapshot_observed_at":"2026-07-03T00:07:27.793760Z","title":"Communication-efficient federated learning via optimal client sampling","venue":null,"work_id":"4cfc2acf-565b-418e-bd27-5b1d14cab030","year":2007},"citing_paper":{"arxiv_id":"2605.20975","last_updated":"2026-05-21T11:42:35Z","snapshot_observed_at":"2026-08-03T01:51:37.246824Z","submitted_at":"2026-05-20T10:00:33Z","title":"Choose Wisely and Privately: Proactive Client Selection for Fair and Efficient Federated Learning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-22T10:10:13.980897Z"},"links":{"cited_paper":"/paper/2007.15197","citing_paper":"/paper/2605.20975"},"observation_digest":"sha256:1bf59773c5b336f1a97f273c10c292c6eba74cc0d2fcfb6202f582a50bd8c54e","observation_id":"bf6c220d-6a78-4a68-b7ad-2b7bdd3d2ea7","resolution":{"observed_at":"2026-05-22T10:11:22.926744Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.15197","last_updated":"2020-10-14T19:08:30Z","snapshot_observed_at":"2026-08-08T17:39:40.518048Z","submitted_at":"2020-07-30T02:58:00Z","title":"Communication-Efficient Federated Learning via Optimal Client Sampling","version":2},"cited_work":{"arxiv_id":"2007.15197","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.15197","snapshot_observed_at":"2026-07-03T00:07:27.793760Z","title":"Communication-efficient federated learning via optimal client sampling","venue":null,"work_id":"4cfc2acf-565b-418e-bd27-5b1d14cab030","year":2007},"citing_paper":{"arxiv_id":"2606.10124","last_updated":"2026-06-22T21:05:40Z","snapshot_observed_at":"2026-08-01T17:42:39.050366Z","submitted_at":"2026-06-08T19:55:45Z","title":"FedSteer: Taming Extreme Gradient Staleness in Federated Learning with Corrective Projections and Caching","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-27T17:31:55.976607Z"},"links":{"cited_paper":"/paper/2007.15197","citing_paper":"/paper/2606.10124"},"observation_digest":"sha256:bee9fe764dd787edc389c67aa5d592a382a69fb0682faa87bf06dea0fa0221e6","observation_id":"a11aba05-e7bf-4ca5-96b8-4728c6cc064d","resolution":{"observed_at":"2026-07-03T00:07:27.795806Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2007.15197/citation-record","integrity":"/paper/2007.15197/integrity","json":"/paper/2007.15197/citation-record.json","paper":"/paper/2007.15197"},"outbound":[],"paper":{"arxiv_id":"2007.15197","last_updated":"2020-10-14T19:08:30Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T17:39:40.518048Z","submitted_at":"2020-07-30T02:58:00Z","title":"Communication-Efficient Federated Learning via Optimal Client 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2007.15197."}