{"as_of":"2026-08-22T20:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:984caeeb4bba5859d86401828abfecab4f6077c9fa71b5b75c51831c61a62668","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:12:52.759124Z","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-11T09:56:01.460535Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.15328","last_updated":"2023-02-09T01:54:34Z","snapshot_observed_at":"2026-08-16T16:27:54.312768Z","submitted_at":"2022-09-30T09:11:09Z","title":"Sparse Random Networks for Communication-Efficient Federated Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.15328","snapshot_observed_at":"2026-08-04T21:12:52.759124Z","title":"Sparse random networks for communication-efficient federated learning.arXiv preprint arXiv:2209.15328, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08195","last_updated":"2025-09-09T23:59:20Z","snapshot_observed_at":"2026-08-18T23:02:38.802679Z","submitted_at":"2025-09-09T23:59:20Z","title":"Sketched Gaussian Mechanism for Private Federated Learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T21:12:52.759124Z"},"links":{"cited_paper":"/paper/2209.15328","citing_paper":"/paper/2509.08195"},"observation_digest":"sha256:40a6b457decb045a709fba7f99f3d34ef05c1e94a351185f7618115bd250d0e9","observation_id":"40a57b13-27ed-4d7c-bba4-2ae9b7704a70","resolution":{"observed_at":"2026-08-04T21:12:52.759124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.15328","last_updated":"2023-02-09T01:54:34Z","snapshot_observed_at":"2026-08-16T16:27:54.312768Z","submitted_at":"2022-09-30T09:11:09Z","title":"Sparse Random Networks for Communication-Efficient Federated Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.15328","snapshot_observed_at":"2026-08-03T20:29:48.829016Z","title":"Sparse ran- dom networks for communication-efficient federated learning.arXiv preprint arXiv:2209.15328, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.19959","last_updated":"2026-06-02T00:32:45Z","snapshot_observed_at":"2026-08-17T08:48:00.830219Z","submitted_at":"2025-11-25T06:09:21Z","title":"ParaBlock: Communication-Computation Parallel Block Coordinate Federated Learning for Large Language Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T20:29:48.829016Z"},"links":{"cited_paper":"/paper/2209.15328","citing_paper":"/paper/2511.19959"},"observation_digest":"sha256:b5ba7a5a2395589e1dbb32e423b45c1bf14e8669b0dcd4d4323132480fa2ea7f","observation_id":"c8d976a0-6469-4514-b147-6c996f2aecf7","resolution":{"observed_at":"2026-08-03T20:29:48.829016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.15328","last_updated":"2023-02-09T01:54:34Z","snapshot_observed_at":"2026-08-16T16:27:54.312768Z","submitted_at":"2022-09-30T09:11:09Z","title":"Sparse Random Networks for Communication-Efficient Federated Learning","version":2},"cited_work":{"arxiv_id":"2209.15328","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.15328","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sparse random networks for communication-efficient 9 Representation-Aligned Multi-Scale Personalization for Federated Learning federated learning.arXiv preprint arXiv:2209.15328","venue":null,"work_id":"8aa7c78c-2536-404e-b2c7-e6d29b2c5851","year":null},"citing_paper":{"arxiv_id":"2604.11278","last_updated":"2026-04-13T10:38:21Z","snapshot_observed_at":"2026-08-11T14:05:11.005462Z","submitted_at":"2026-04-13T10:38:21Z","title":"Representation-Aligned Multi-Scale Personalization for Federated Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T15:45:17.555896Z"},"links":{"cited_paper":"/paper/2209.15328","citing_paper":"/paper/2604.11278"},"observation_digest":"sha256:3f9147a43a3818273284b2e96e3f492cbd2e6cda9d659a4e5aed857fd826fd7c","observation_id":"5be43f83-e647-4865-b983-1703b57f3d15","resolution":{"observed_at":"2026-05-11T09:56:01.469172Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2209.15328/citation-record","integrity":"/paper/2209.15328/integrity","json":"/paper/2209.15328/citation-record.json","paper":"/paper/2209.15328"},"outbound":[],"paper":{"arxiv_id":"2209.15328","last_updated":"2023-02-09T01:54:34Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:27:54.312768Z","submitted_at":"2022-09-30T09:11:09Z","title":"Sparse Random Networks for Communication-Efficient 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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2209.15328."}