{"as_of":"2026-08-08T12:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8188a326ec9624abc07d75a3d2a7f72c7e33eccd05e4dc75a6a6d1ca51eff83b","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-08T06:32:00.761636+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-07T11:22:20.077582Z","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-22T03:30:59.549818Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.03900","last_updated":"2020-12-06T00:30:30Z","snapshot_observed_at":"2026-08-07T14:37:25.572192Z","submitted_at":"2020-11-08T04:27:21Z","title":"The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.03900","snapshot_observed_at":"2026-08-07T11:22:20.077582Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.03044","last_updated":"2025-06-03T16:26:30Z","snapshot_observed_at":"2026-08-07T11:07:30.525725Z","submitted_at":"2025-06-03T16:26:30Z","title":"On the Benefits of Accelerated Optimization in Robust and Private Estimation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:20.077582Z"},"links":{"cited_paper":"/paper/2011.03900","citing_paper":"/paper/2506.03044"},"observation_digest":"sha256:4c4cd5e1c076866b945f0d8b1632fca7b6a1ef280328ffafd94c0d2ffae952b0","observation_id":"707b9999-112e-4350-8616-fbd1b15dba15","resolution":{"observed_at":"2026-08-07T11:22:20.077582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.03900","last_updated":"2020-12-06T00:30:30Z","snapshot_observed_at":"2026-08-07T14:37:25.572192Z","submitted_at":"2020-11-08T04:27:21Z","title":"The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.03900","snapshot_observed_at":"2026-08-06T18:10:16.387112Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.09388","last_updated":"2025-07-12T20:09:28Z","snapshot_observed_at":"2026-08-08T11:31:46.699496Z","submitted_at":"2025-07-12T20:09:28Z","title":"Optimal Differentially Private Ranking from Pairwise Comparisons","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:10:16.387112Z"},"links":{"cited_paper":"/paper/2011.03900","citing_paper":"/paper/2507.09388"},"observation_digest":"sha256:a05e9b8a55aa6a117e8bc46500c02fb983c7b4a6f8166e346a41aed7ec108535","observation_id":"e95c9810-5601-4843-b53d-f3c8e29a196a","resolution":{"observed_at":"2026-08-06T18:10:16.387112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.03900","last_updated":"2020-12-06T00:30:30Z","snapshot_observed_at":"2026-08-07T14:37:25.572192Z","submitted_at":"2020-11-08T04:27:21Z","title":"The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds","version":2},"cited_work":{"arxiv_id":"2011.03900","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.03900","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.03900 , year =","venue":null,"work_id":"9492d63e-2f9d-4345-b18f-4978fb9e6686","year":2011},"citing_paper":{"arxiv_id":"2605.21860","last_updated":"2026-05-21T01:13:52Z","snapshot_observed_at":"2026-07-06T23:32:15.891169Z","submitted_at":"2026-05-21T01:13:52Z","title":"Robust Statistical Estimators with Bounded Empirical Sensitivity","version":1},"reference_index":253,"source":"arxiv_source","source_observed_at":"2026-05-22T03:28:45.663789Z"},"links":{"cited_paper":"/paper/2011.03900","citing_paper":"/paper/2605.21860"},"observation_digest":"sha256:c6d4c2f32d302ec310cc9c70414dd8dc59cfbee3aea836f4c866a7e74b76bcb3","observation_id":"61431138-4f60-4ea1-9138-a4dd4c5f7aca","resolution":{"observed_at":"2026-05-22T03:30:59.552507Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2011.03900/citation-record","integrity":"/paper/2011.03900/integrity","json":"/paper/2011.03900/citation-record.json","paper":"/paper/2011.03900"},"outbound":[],"paper":{"arxiv_id":"2011.03900","last_updated":"2020-12-06T00:30:30Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T14:37:25.572192Z","submitted_at":"2020-11-08T04:27:21Z","title":"The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2011.03900."}