{"as_of":"2026-08-11T15:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f1207cc4004b6d52fec6516ecf3080b42cdc550c11f9b7f5f3bed0368d9a5945","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T03:30:14.064467Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2606.30425/citation-record","integrity":"/paper/2606.30425/integrity","json":"/paper/2606.30425/citation-record.json","paper":"/paper/2606.30425"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Federated learning with local differential privacy: Trade-offs between privacy, utility, and communication,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:b306fec5e5e31067891df247e5b9cbf0dd2907e412716cdfaf74e2f5e6b7e276","observation_id":"9d7bf452-8265-44ee-aab0-58671b848e94","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Advances and open problems in federated learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:9569eb99e934a28cba5409eaa248bd79c7d95694a369e0ad9d98bc9544bb67b6","observation_id":"24f91842-ae91-4d68-8101-e3168515e2f6","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Eden: Communication-efficient and robust distributed mean estimation for federated learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:e1ecbb9af2fe93da28bcce5f9d9f230b5905fade78d32d3f2902299c776f6983","observation_id":"d1d3ccc0-b6e0-4e2c-9b40-d1f742894ff0","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"vqsgd: Vector quantized stochastic gradient descent,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:d263b5c73823f31db7949f2202f2d10368962539ddfa445e07243598b294f043","observation_id":"ba3eb648-c09c-4b10-9a5d-09e021c710f1","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Communication-efficient learning of deep networks from decentralized data,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:16e824b475a0b5b53e6ac235ac9c06023e63db615523afb4422c7753c606797a","observation_id":"6aef5e80-ac61-45b7-bad2-8002241c037f","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Diat: A scalable distributed architecture for iot,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:b9ae6ac4353ab6cab8c4ea60c3a04ca96aa9e4b297a3623a259c9397584f9495","observation_id":"f3c73244-5349-435b-b101-a281b0d5614c","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Scalable distributed DNN training using commodity GPU cloud computing,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:bee2ecaa7b44173433dde26b88293df5970c347816ad118ba4679956bbe36bef","observation_id":"dbde1e11-8e94-4a99-91f0-72ca38bd41df","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Sparse communication for distributed gradient descent,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:983e30b5d5baa17d09a99d2237895b64d81c11995b23ee2613f57abfddf15b77","observation_id":"ba238ac7-235f-4936-9156-c1cb0f22fea8","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Sparse binary compression: Towards distributed deep learning with minimal communication,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:d7b80061d87facb32d08042f305d914c4ba39e62b31d5540e3b8f5d3b1831df0","observation_id":"17ff7e5d-3885-4073-bd74-0e9f8486564e","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Communication-efficient federated learning based on compressed sensing,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:754a57f5861323eb76fa1c64152e8b410c8181c8d50c31963df84c38b1834ff6","observation_id":"108c5631-09db-4df0-8f71-fda20a5ea8be","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Fetchsgd: Communication-efficient federated learning with sketching,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:914c295bd70d96c739471f9df602b090783c9eac244922e0c23e311dd1bac5b1","observation_id":"b7482f66-a2db-45f0-b396-e7823525f7e4","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.06058","last_updated":"2018-02-20T04:13:14Z","snapshot_observed_at":"2026-08-06T03:20:51.763830Z","submitted_at":"2018-02-16T18:15:33Z","title":"Variance-based Gradient Compression for Efficient Distributed Deep Learning","version":2},"cited_work":{"arxiv_id":"1802.06058","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.06058","snapshot_observed_at":"2026-06-30T03:34:13.302252Z","title":"Variance-based Gradient Compression for Efficient Distributed Deep Learning","venue":"cs.LG","work_id":"7adb212f-426f-4b84-ad55-96cb1de4f02d","year":2018},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"cited_paper":"/paper/1802.06058","citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:deb99f877399bfe3c8d754ab1fde7084b4b10ddcb8e0b9446dac1d68b8f92ba6","observation_id":"994d395c-a74f-4d8b-92e5-a68841245bc5","resolution":{"observed_at":"2026-06-30T03:34:13.303585Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Federated learning over wireless fading channels,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:2c1e75ca9393d3b9f6c82b760fcd04c2dae9ff47b0cf0a43c7b3a67c8b43c506","observation_id":"401023f9-0d1f-4280-a232-7df094b19aa2","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.02254","last_updated":"2019-11-11T14:07:41Z","snapshot_observed_at":"2026-07-06T08:35:04.464590Z","submitted_at":"2019-11-06T08:49:23Z","title":"Secure Federated Submodel Learning","version":2},"cited_work":{"arxiv_id":"1911.02254","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.02254","snapshot_observed_at":"2026-06-30T03:34:13.295782Z","title":"Secure federated submodel learning,","venue":null,"work_id":"73d8dba2-1760-4fb0-9ba7-b0d89c0cbace","year":1911},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"cited_paper":"/paper/1911.02254","citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:f1a16ade99a58ea33afb58298ee5521ba15d113f5b7c2fd829a75e5e8b4004fe","observation_id":"c77a2689-2e07-4609-b212-54dfb8f14135","resolution":{"observed_at":"2026-06-30T03:34:13.297252Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Deepreduce: A sparse-tensor communication framework for federated deep learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:c0ff0ffc2f68e972232837f45f73c149a1fedef079c8405b5014015ab821614c","observation_id":"f7dbd8a1-e414-401c-9579-5e27832eb23f","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Communication complexity in locally private distribution estimation and heavy hitters,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:f9d745e8dc430ffb8f2eb853654c9eb1f23f648233de5b7543528255dfb6074e","observation_id":"eb19fe0b-2d0f-4141-9027-ecd1573b389f","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Locally differentially private sparse vector aggregation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:fbf1d5a2dcf46cd66278962d4dccdd00eca6c611bbeaee392bdeb2f129e2749b","observation_id":"67238c1f-e8df-4662-95ec-0f12ea655e9b","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"The communication cost of security and privacy in federated frequency estimation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:159e17dcae1e88f5f1c2ece84ed11285a87d20e606679cc10fb66578fa281926","observation_id":"da01175f-a65b-4977-8d2e-017bfcffdc56","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Noiseless coding of correlated information sources,","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:ca03b3ccfb6ab112225bbb7cd461a3af10651d5d6cbd7de1aa2100bcf3260b42","observation_id":"7ed3b660-c689-42c7-b600-5e06123f1544","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:0600260531d2777838266bc38fc32e8d8d317731ef4c456677c7586ceec22175","observation_id":"ad9d934e-30bc-4cb6-90d9-44db2147ff50","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Mean estimation from one-bit measurements,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:a0b09ca99bb3956c453482a73ccd79987c472af25f82c3d4ca5fd095d362cc9a","observation_id":"9670f905-fec1-4b56-91d2-17d59559dbc1","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Distributed statistical estimation of high-dimensional and nonparametric distributions with communication constraints, february 2018,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:30d1cf67c53e6e07c8a0089055461177926a1d631361e5db1fa4939353d9cbcf","observation_id":"9cc300ed-428c-465f-8223-127e2735d240","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Inference under information constraints ii: Communication constraints and shared randomness,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:9f7bd8e03f97f889f0e70d140d29120297adad630dc71f9315d99ebf88bc0763","observation_id":"da697669-da3e-4281-948c-631ab468eccc","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Collaborative learning of discrete distributions under heterogeneity and communication constraints,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:e8536d0fd334ad841e48b56eb988e7e35e0e8c7eb8ea7186d747f81d85bf79e9","observation_id":"5bff747b-bb98-40d6-82ee-a6fb41a9cbbd","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11005","last_updated":"2023-10-17T05:21:19Z","snapshot_observed_at":"2026-07-06T16:34:19.351760Z","submitted_at":"2023-10-17T05:21:19Z","title":"Optimal Private Discrete Distribution Estimation with One-bit Communication","version":1},"cited_work":{"arxiv_id":"2310.11005","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11005","snapshot_observed_at":"2026-06-30T03:34:13.298532Z","title":"Optimal private discrete distribution estimation with one-bit communication,","venue":null,"work_id":"4650a9b8-76fc-43a8-ad12-94ac7c80ccb0","year":2023},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"cited_paper":"/paper/2310.11005","citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:3e1ea46d397df7eedfbf8a2a4c85dbceae9f433af0b83b15af01a3700916dba1","observation_id":"e08db690-c4fa-48e2-b3de-f626573d9e29","resolution":{"observed_at":"2026-06-30T03:34:13.300574Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Breaking the communication-privacy-accuracy trilemma,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:0faf45fd368c3286d695c42e716a2bee68b31c81e18384a38ca73132b417e9fb","observation_id":"eaa2e287-a593-48ee-a8db-d50f12a80459","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Exact optimality of communication-privacy-utility tradeoffs in distributed mean estimation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:1493a1145608819cf1c6bad1aa2db464b2f9d4159c89ec99450e611bbc4abb2e","observation_id":"7db6fb97-673b-4bf1-809d-a2d9418a4d1c","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Distributed mean estimation with limited communication,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:b75722c297c0e448c6427fc3daf1798e4614679b4b7efb54c7fa75c086f02b30","observation_id":"53d6271b-de75-4d09-afe2-38bb0568ac73","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Fedpaq: A communication-efficient federated learning method with periodic averaging and quantization,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:d6354b4cb1ee7e49fadbf8b57eb4c07bf732841f7541689c932ba611a19aadb2","observation_id":"8a7b5eb2-946d-4649-8c50-7eb415c38bd6","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Federated learning with compression: Unified analysis and sharp guarantees,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:e66cf228bf07658bcdaf6de244bacac1b578eacc977f7f7bfdc0212dee9a074c","observation_id":"2be6ed1c-980d-46b1-95d7-03bb5b86cad3","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Correlated quantization for distributed mean estimation and optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:002d1a99d63aa28015a1fa48e68c26fe66d86bd078906dd895019147d3658493","observation_id":"fcccd0e6-2e3d-4fa0-bb17-23fd3e523367","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Finding frequent items in data streams,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:85fadcddd2ffeecdf0344301c8a10b0d9509994f84aef3d113001f0891c1e531","observation_id":"a6eac74f-30a0-4195-b0f8-f85f40803ef0","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"An improved data stream summary: the count-min sketch and its applications,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:41ca431d1df6a90d6c05b489997fde1375c94ad5bf4413f7e79883a7dd8ae338","observation_id":"1e25e4a9-c035-4e2d-98ad-d2be84d9f978","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01812","last_updated":"2019-11-05T14:38:18Z","snapshot_observed_at":"2026-08-08T11:56:32.586239Z","submitted_at":"2019-11-05T14:38:18Z","title":"Enhancing the Privacy of Federated Learning with Sketching","version":1},"cited_work":{"arxiv_id":"1911.01812","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.01812","snapshot_observed_at":"2026-06-30T03:34:13.305168Z","title":"Enhancing the privacy of federated learning with sketching,","venue":null,"work_id":"91089613-26aa-44d1-91b8-a09a1deae04d","year":1911},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"cited_paper":"/paper/1911.01812","citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:7f888a75f7566e315ced46afb43d07552821b9a39359c24f71b785c432d91018","observation_id":"2bfc33d9-0194-4023-afe0-5f640d7d9f33","resolution":{"observed_at":"2026-06-30T03:34:13.306975Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"On finite alphabet compressive sensing,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:32476b636611af2a17193599ab547daeb26c78d628ac3b2ea13c4c8b2edd3afd","observation_id":"f1efd30b-26d2-47db-af25-92e11b313d47","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Machine unlearning of federated clusters,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:c8d674cabccac26da7c8963cbaff2612413d353c48b3676ee0610c9df571719c","observation_id":"c8c341d2-8139-4915-9071-98b272ddebd0","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Model compression by count-sketch for over-the-air stateless federated learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:16420aaec47b39bbd8cbdca315eb9483e1cf6aa360cf43ddbb227a3c12380093","observation_id":"f0d6fcfe-dfcb-47ab-a29f-675d9bdfbfe5","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"Private multi-group aggregation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:f8665837b5321903cbae3a1fecf443d5548696837e8d63223dc49a7c47ab5d2f","observation_id":"7078a5c2-be8a-4a39-bf63-d50d0e3d1a2c","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"A general class of coefficients of divergence of one distribution from another,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:c7852222ab46a01abcad9a38edb751ef6e4e4ed74c8d4c68ae79c0e05c9dc042","observation_id":"6f21ab0d-de78-4923-a6cb-fa9b25fd5d05","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"On information-type measure of difference of probability distributions and indirect observations,","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:0166683ebd6b128ddd70d8514cee00bb4f42de1bd2e802392d12750199811cbc","observation_id":"fd25a87a-4550-4241-85e7-a2186e64f904","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"f-divergences and their applications in lossy compression and bounding generalization error,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:1c88d239b2b22e70bfda12808db5958eb3a59982dd4350136874167cb89f9a40","observation_id":"854bafa9-1246-46e7-8de5-f9370452d346","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00555","last_updated":"2019-11-25T05:34:42Z","snapshot_observed_at":"2026-07-06T07:24:36.552330Z","submitted_at":"2019-01-02T23:56:10Z","title":"An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation","version":3},"cited_work":{"arxiv_id":"1901.00555","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.00555","snapshot_observed_at":"2026-07-03T18:48:49.867724Z","title":"An introductory guide to Fano’s inequality with appli- cations in statistical estimation","venue":null,"work_id":"c05ff8ea-a111-411d-8201-2b6add177200","year":1901},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"cited_paper":"/paper/1901.00555","citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:f91073c3be398eb2ea22aa1d22f210e8c4aab5cd665888a16e3b97eca453d2c6","observation_id":"41efe990-c53e-4187-b15b-920c99f21861","resolution":{"observed_at":"2026-06-30T03:34:13.309900Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":"R ´enyi divergence and kullback-leibler divergence,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:7777cf078b7f7ac34841a547012abaa54ea45e3ec1febdc59095d77eb2c1eb64","observation_id":"2fa06478-dff6-4499-9249-15e58eaeb578","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T03:30:14.064467Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-30T03:30:14.064467Z"},"links":{"citing_paper":"/paper/2606.30425"},"observation_digest":"sha256:ec8ac6d61da3867762d64487c44bc1fb2a20968a3729d42836686ff7c7a3fac8","observation_id":"230a3354-6b58-422a-9b8b-ddfa787090e8","resolution":{"observed_at":"2026-06-30T03:30:14.064467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.30425","last_updated":"2026-06-29T15:08:08Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-08T02:09:12.840176Z","submitted_at":"2026-06-29T15:08:08Z","title":"Lossy Compression for Sparse Aggregation"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":44},"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 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2606.30425."}