{"as_of":"2026-08-08T13:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:651b269d9d2c6a06383d3d0f69088ee17c8013e535c9e13ed4dc3a083ae14283","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:32:14.132646Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2502.08889/citation-record","integrity":"/paper/2502.08889/integrity","json":"/paper/2502.08889/citation-record.json","paper":"/paper/2502.08889"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.725326Z","title":"Private stochastic convex optimization: Optimal rates in l1 geometry","venue":null,"work_id":"7d74f633-afaa-4360-90ed-8c25e8f7444d","year":2021},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:13.960500Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:1d41ce4e4f091304eaf65c5783f68ff10543dae29e849af7e4667c74a79af8dc","observation_id":"24c25b6e-cb9a-4751-83bb-1899f53ac5a6","resolution":{"observed_at":"2026-08-07T23:32:14.730391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.708871Z","title":"User-level differentially private stochastic convex optimization: Efficient algorithms with optimal rates","venue":null,"work_id":"e2e490b7-ad1f-487d-b31a-2898e34068b6","year":2024},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:13.966622Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:fe5dba9c28c33eea9a27b0c19cbd817425aad2780998f2bf94923b6324146fd0","observation_id":"b9ec761c-f1b6-41e8-8c4c-e8e7ad7eb7c5","resolution":{"observed_at":"2026-08-07T23:32:14.714107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02789","last_updated":"2024-06-04T21:26:29Z","snapshot_observed_at":"2026-08-07T04:58:45.284374Z","submitted_at":"2024-06-04T21:26:29Z","title":"Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions","version":1},"cited_work":{"arxiv_id":"2406.02789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.02789","snapshot_observed_at":"2026-08-07T23:32:14.238500Z","title":"Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions","venue":"cs.DS","work_id":"a542f6ae-1f15-4880-a0ad-73a6b2748929","year":2024},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:13.971954Z"},"links":{"cited_paper":"/paper/2406.02789","citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:40ba1da59e3748e60fcc29ff5536528859b645ccf1d7649c7eadcede26a5072e","observation_id":"4b663058-1031-4a6c-be7c-2ac7fd45cc67","resolution":{"observed_at":"2026-08-07T23:32:14.245977Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.692736Z","title":"From robustness to privacy and back","venue":null,"work_id":"bd9b2663-e5a5-4c44-b3e3-b38a1d61d9d4","year":2023},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:13.977807Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:98ccd576dac40e02ae2a50dc83125292a98fc75d0008849dc11155d7d2d59249","observation_id":"27054927-cde9-4e0b-92ea-7658edfa0738","resolution":{"observed_at":"2026-08-07T23:32:14.697913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.676554Z","title":"Information-theoretic lower bounds on the oracle complexity of convex optimization","venue":null,"work_id":"8f200540-fc7a-4ac8-a957-ceb4c43dd681","year":2009},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:13.983324Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:5a48e0ceb42a9f8094af6156983f2d5125e6b2e05ef87fec1797b08dfc10c255","observation_id":"60965546-da1d-490f-af10-4bc5b2b474ca","resolution":{"observed_at":"2026-08-07T23:32:14.681752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2006.06914","last_updated":"2020-06-12T02:45:21Z","snapshot_observed_at":"2026-08-04T23:39:17.985764Z","submitted_at":"2020-06-12T02:45:21Z","title":"Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.06914","snapshot_observed_at":"2026-08-07T23:32:13.988581Z","title":"Stability of stochastic gradient descent on nonsmooth convex losses","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:13.988581Z"},"links":{"cited_paper":"/paper/2006.06914","citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:5dd56da54c742fd6252315b7bb6e8fca1c1a037f28f1d4f61c7de6527a96dd0f","observation_id":"5cfaff41-dfaf-45d9-b0f4-93e32f02e739","resolution":{"observed_at":"2026-08-07T23:32:13.988581Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.660111Z","title":"Private stochastic convex optimization with optimal rates","venue":null,"work_id":"1171969e-bc21-46c4-bc8a-90ec4c14cb6b","year":2019},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:13.994750Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:0ba1f420bb3207c8a487025507765b12f897a8193a36e1a1b1a93ed5e949b692","observation_id":"dbca089b-0444-4b6c-9f7c-3df5ccd0bfb7","resolution":{"observed_at":"2026-08-07T23:32:14.665288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.644380Z","title":"Non-euclidean differentially private stochastic convex optimization","venue":null,"work_id":"af90b61b-5411-42ff-a2e8-799f759b5751","year":2021},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:13.999572Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:0e4464fc5c83e4e11ec59d9fd725f7d88908ed80bc1fcc0ce970ba3f534e99d0","observation_id":"2981c22d-29cf-4913-b757-7ffbc0b73c39","resolution":{"observed_at":"2026-08-07T23:32:14.649417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.628147Z","title":"Practical gauss-newton optimisation for deep learning","venue":null,"work_id":"39952a79-a822-46f7-bf15-c360dc01a802","year":2017},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.004750Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:edfd53b00206d0bde886a556aa0a2334d1a7eb7b13f9db5a571e9dbb27fef486","observation_id":"2c10ed38-3f65-4e93-bc65-0e3a03c67ad5","resolution":{"observed_at":"2026-08-07T23:32:14.633826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.611932Z","title":"User-level private stochastic convex optimization with optimal rates","venue":null,"work_id":"6dc0ad13-aee6-4247-9fe5-0683cea64112","year":2023},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.009908Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:5ad24ff11f0ab5bf6bf6013fd3dd307cdde96c08911207b8a155cd53aa4d3ebb","observation_id":"022ef1f0-82b9-4622-b2c0-1f91087d4263","resolution":{"observed_at":"2026-08-07T23:32:14.617238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.596215Z","title":"Private empirical risk minimization: Efficient algorithms and tight error bounds","venue":null,"work_id":"ee0035ac-501b-44e4-b0fa-f2e4205c0911","year":2014},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.014779Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:b0432fac7ec8d75024ac716a5f12c95b5f8a6d213fb181ff55fb2795b0b66bcf","observation_id":"329b9531-f48e-4d46-8f04-94ab79e777a4","resolution":{"observed_at":"2026-08-07T23:32:14.601313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.581462Z","title":"Convex optimization: Algorithms and complexity","venue":null,"work_id":"e26fb00e-ee5c-47e2-aabb-d30f120298b6","year":2015},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.020158Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:7758bd5c2fa250fd632b16263f46a15fb579e22d116b642c8b61f8a8de0cc6f0","observation_id":"e7061bcf-4948-48d4-8b8a-aa55dea387a4","resolution":{"observed_at":"2026-08-07T23:32:14.585928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.565507Z","title":"Optimal rates for o (1)-smooth dp-sco with a single epoch and large batches","venue":null,"work_id":"effdfd53-682a-443e-a4d4-9d597d747b06","year":2024},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.025242Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:3f518c0e642634aab3167ae3f1302eccdb2549c1e2c7ba9359812eba3538781b","observation_id":"ba4d6bb2-13a6-4014-8e16-91e86cc1f404","resolution":{"observed_at":"2026-08-07T23:32:14.570608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.549318Z","title":"Extracting training data from large language models","venue":null,"work_id":"17e81de7-2801-41df-a4be-94a93e40773a","year":2021},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.030249Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:b971c122f6354560e4fc802ca1660ae15a549ad4f555e6dffabed45fb009530d","observation_id":"f7a03e5c-947a-4914-8ef5-ae61a6f533f8","resolution":{"observed_at":"2026-08-07T23:32:14.554528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07114","last_updated":"2024-02-11T06:21:18Z","snapshot_observed_at":"2026-07-06T17:28:31.413289Z","submitted_at":"2024-02-11T06:21:18Z","title":"Towards Quantifying the Preconditioning Effect of Adam","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07114","snapshot_observed_at":"2026-08-07T23:32:14.035214Z","title":"Towards quantifying the preconditioning effect of adam","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.035214Z"},"links":{"cited_paper":"/paper/2402.07114","citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:ccd5a92bfcd7690d107908f330c08d02e8b0c956c55c5e0232f5b29ffa9a6467","observation_id":"c07890ce-ceed-4e50-948e-df0cfabdd803","resolution":{"observed_at":"2026-08-07T23:32:14.035214Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.533266Z","title":"The projection median of a set of points","venue":null,"work_id":"13e55e93-9b4e-4e2c-9e29-53c3c915b70e","year":2009},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.040688Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:6fd0238ba5f5782416c4bf72af77d10703d7009992067e511d33bb4510bc8951","observation_id":"bd99c2d6-1e4c-4dfa-90a1-3ce1eb0cd644","resolution":{"observed_at":"2026-08-07T23:32:14.538265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.516251Z","title":"Differential privacy and robust statistics","venue":null,"work_id":"560b549f-fd4a-4db9-9b67-9ddb13e346a6","year":2009},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.045549Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:df0a223b78bcf385af2ec61d14851db6f4a0abe29502a54996c9d37337b309ee","observation_id":"95ccfebb-5ca5-43ec-b00c-89ee0b8e964f","resolution":{"observed_at":"2026-08-07T23:32:14.521319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.499941Z","title":"Calibrating noise to sensitivity in private data analysis","venue":null,"work_id":"7741f9e3-b424-47a4-859a-70b21c24c908","year":2006},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.050571Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:f23892d0e2156393af31536cfc56fb15dc2994d701d787a2f3bc886781700b28","observation_id":"a4bdb948-a773-4ce7-8e6c-d6c1ea48c053","resolution":{"observed_at":"2026-08-07T23:32:14.505368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.484541Z","title":"The algorithmic foundations of differential privacy","venue":null,"work_id":"efe23fef-218a-4b04-a3e5-c18272a221db","year":2014},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.054964Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:194629cb8eb9422f7528912d862d29b68ba026200f1de127a2a06e6ad44ee69f","observation_id":"7aac0ea0-1dc5-4249-a58d-7761369f3370","resolution":{"observed_at":"2026-08-07T23:32:14.489458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.469084Z","title":"Private stochastic convex optimization: optimal rates in linear time","venue":null,"work_id":"ec8aca2e-0ed8-48fd-b58e-d1f492cfc8fa","year":2020},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.059523Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:7d590a622c13796e8c9245ddcb03a145be9739d0ad3954ba2582dc0344bf14e7","observation_id":"919df5c7-6bbe-4cae-be7b-a340a51a81be","resolution":{"observed_at":"2026-08-07T23:32:14.474336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04912","last_updated":"2023-05-08T17:47:28Z","snapshot_observed_at":"2026-07-06T15:24:42.200476Z","submitted_at":"2023-05-08T17:47:28Z","title":"On User-Level Private Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.04912","snapshot_observed_at":"2026-08-07T23:32:14.063997Z","title":"On user-level private convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.063997Z"},"links":{"cited_paper":"/paper/2305.04912","citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:2b950cb5c7f8f0702ddb10301575d6e7cfa453bd0dc38964ebcd21355c1ebc60","observation_id":"be60ecd6-a37c-44c0-bde0-a581ccbda534","resolution":{"observed_at":"2026-08-07T23:32:14.063997Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.453126Z","title":"Private convex optimization via exponential mechanism","venue":null,"work_id":"1a4efa95-1f8f-494d-b1e2-263720fb14ed","year":1948},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.068770Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:7d1bce0f65a47e5b00031914e356397f0db98880d3a27fc8588f250a0802012c","observation_id":"db451345-3bd6-4f25-9db1-5e6b1c44d02f","resolution":{"observed_at":"2026-08-07T23:32:14.458104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1902.03736","last_updated":"2019-02-11T05:41:28Z","snapshot_observed_at":"2026-08-01T10:38:57.624492Z","submitted_at":"2019-02-11T05:41:28Z","title":"A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.03736","snapshot_observed_at":"2026-08-07T23:32:14.073211Z","title":"A short note on concentration inequalities for random vectors with subgaussian norm","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.073211Z"},"links":{"cited_paper":"/paper/1902.03736","citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:56fac75589cfa442ecbafda41568e205f9456228fa491aae42532008b6b22b6c","observation_id":"4e78d2b6-b12d-47d4-9753-31ad6b599935","resolution":{"observed_at":"2026-08-07T23:32:14.073211Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.437285Z","title":"Privately learning high-dimensional distributions","venue":null,"work_id":"610d24fd-d897-41e9-a152-12d57b7f55de","year":1902},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.078812Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:63dcfa5d4556f5bce8ce9988780b67e18f17ca79cc5cf6fbccb51364673dec85","observation_id":"9427d7b0-172f-4dad-9acc-91f247a09b4a","resolution":{"observed_at":"2026-08-07T23:32:14.442688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.421876Z","title":"Differential privacy and robust statistics in high dimensions","venue":null,"work_id":"1c0165d0-c24e-4fc3-90c1-8cf1eed30acc","year":2022},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.083668Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:9f3ee16dad98255151c745dfcceb4e4db13e32d77ca881ce1330d52163c2d093","observation_id":"ee2eee6f-9f59-4f2e-b2c4-002866f2f25a","resolution":{"observed_at":"2026-08-07T23:32:14.426800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.405623Z","title":"Faster algorithms for user-level private stochastic convex optimization","venue":null,"work_id":"af0907a9-2e03-4b91-8f9b-0f915aa0d385","year":2024},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.088545Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:5e04740256dcb19ecfa43deca107d6c75e9dcca3efb724c33dff4f699acb71c0","observation_id":"abc97b26-2679-430e-92b6-4a420ac82853","resolution":{"observed_at":"2026-08-07T23:32:14.410761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.390415Z","title":"Learning with user-level privacy","venue":null,"work_id":"1f425c62-3643-4c48-b523-d7ef5eff062d","year":2021},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.093557Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:a8d31631063952bcb41600e569275f66faa3f30e8d9b95c577931e8b8abb42e3","observation_id":"a0405b5a-ed92-42af-b3ff-c9a53ed7c532","resolution":{"observed_at":"2026-08-07T23:32:14.394917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.375147Z","title":"Analyzing leakage of personally identifiable information in language models","venue":null,"work_id":"724d6a0c-e7be-44ab-abc2-e56eeb437c99","year":2023},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.098683Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:2aeae5d19a8427900e57dbb29cd493cb53d2e5b0a80ff3f258435ec71e7dbd52","observation_id":"7c0361e8-dc2c-4170-88d3-6999d3432fdb","resolution":{"observed_at":"2026-08-07T23:32:14.380034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.359867Z","title":"On the linearity of large non-linear models: when and why the tangent kernel is constant","venue":null,"work_id":"1cdd27fc-6aa6-41f3-a3ab-f43209693838","year":2020},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.103376Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:970ad2c48948d9555c10b9cb1ead770a067aa30c4708866aad139328fb04c61a","observation_id":"4c8591e0-8e59-43fb-9ec1-3fa1bb3459ad","resolution":{"observed_at":"2026-08-07T23:32:14.364512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.344500Z","title":"Optimizing neural networks with kronecker-factored approximate curvature","venue":null,"work_id":"ff8b549a-a6e0-40ee-ac88-6e4f5d3ae3cb","year":2015},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.108165Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:809c3423fac060da17e64906e2acbb935f8b55aa7d6121b9bffa42343357a582","observation_id":"1624a7c1-3396-47d3-bca3-80e7fbf8cdc2","resolution":{"observed_at":"2026-08-07T23:32:14.349287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.325502Z","title":"Faster rates of private stochastic convex optimization","venue":null,"work_id":"7ad46eb0-e46f-4bd2-aac6-bc6c6784000a","year":2022},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.113342Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:b26d04169950a3fdbdcb082645083599c6146077fa9d9b8748befc0063b875c0","observation_id":"abf0c5e4-a899-4763-9279-951999307a81","resolution":{"observed_at":"2026-08-07T23:32:14.331228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.309321Z","title":"Perturbed m-estimation: A further investigation of robust statistics for differential privacy","venue":null,"work_id":"feed7c12-bf0d-4668-8688-6993813b640d","year":2012},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.118047Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:e9fbdb29de959cef76ef4b4d8004bfaaba55c20a255db1a06a7b54dd858da9e4","observation_id":"e44de061-e8be-4b22-a812-d3c14fc4e710","resolution":{"observed_at":"2026-08-07T23:32:14.314512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.292542Z","title":"Convergence rates of stochastic gradient descent under infinite noise variance","venue":null,"work_id":"8081b569-be4f-494a-9f79-1f0e6d799aa1","year":2021},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.123020Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:ba828354e6ae2098609731122f1bb12b9b4ea0b25a83dd535ecacc6f6a515152","observation_id":"c60bde61-ac18-4f5e-9ffe-244e66497345","resolution":{"observed_at":"2026-08-07T23:32:14.298101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.275664Z","title":"Advances in private training for production on-device language models","venue":null,"work_id":"433f7695-1de2-422b-8436-0193314b84fa","year":2024},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.127701Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:439f94497a3eda6302fbf786f00b2809a9b6f8235c812476016c97efbad3bb8a","observation_id":"fbd30e1b-4a57-4b5e-8570-b9b981c2b0f3","resolution":{"observed_at":"2026-08-07T23:32:14.280696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:32:14.258530Z","title":"Differentially private online-to-batch for smooth losses","venue":null,"work_id":"74f9eb0e-491c-40fa-b1aa-8207ec091e99","year":2022},"citing_paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T23:32:14.132646Z"},"links":{"citing_paper":"/paper/2502.08889"},"observation_digest":"sha256:c819466def0bdb8a5553a1c43aab9b4a6abb810e72c447eb7a1c76c527323d6d","observation_id":"7ec3190a-f22f-4fdc-9564-85c34aa4a5b7","resolution":{"observed_at":"2026-08-07T23:32:14.263912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2502.08889","last_updated":"2025-02-13T02:05:45Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T23:17:18.004421Z","submitted_at":"2025-02-13T02:05:45Z","title":"Linear-Time User-Level DP-SCO via Robust Statistics"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":30},"total_outbound_references":35},"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 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2502.08889."}