{"as_of":"2026-08-08T13:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7cacde056b3bd7ac328fd2b41ae83abbf15078de35fb75a6d630858ccb301f5e","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:48:25.160427Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T18:15:19.879507Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T20:36:12.305666Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"cited_work":{"arxiv_id":"2511.13999","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2511.13999","snapshot_observed_at":"2026-07-10T02:19:33.747884Z","title":"RATQ: A universal fixed-length quantizer for stochastic optimization","venue":null,"work_id":"80f339ea-2a4f-4e60-b2ac-13f11feca522","year":null},"citing_paper":{"arxiv_id":"2606.00703","last_updated":"2026-05-30T12:22:20Z","snapshot_observed_at":"2026-07-06T23:41:19.955034Z","submitted_at":"2026-05-30T12:22:20Z","title":"Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T18:15:19.879507Z"},"links":{"cited_paper":"/paper/2511.13999","citing_paper":"/paper/2606.00703"},"observation_digest":"sha256:0a8c2f275e01d8f7d7e0281024ee710edc3f7567d440108ee1cd5b9b37d361b5","observation_id":"8c9ef854-4019-412e-86c1-b3a73ec2a6e6","resolution":{"observed_at":"2026-07-10T02:19:33.747884Z","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/2511.13999/citation-record","integrity":"/paper/2511.13999/integrity","json":"/paper/2511.13999/citation-record.json","paper":"/paper/2511.13999"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:48:18.830800Z","title":"Differentially private generalized linear models revisited","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:18.830800Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:81e18b4c7b718544f4412164b8af6b6824db016d7aceb790efde44970ff3d546","observation_id":"367fbbed-b799-430d-86a5-52abe6d10fe1","resolution":{"observed_at":"2026-08-03T21:48:18.830800Z","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-08-03T21:48:18.923973Z","title":"Faster rates of convergence to stationary points in differentially private optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:18.923973Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:0026393b7cdbc245a771b7451a99fdd7fa6fc5f845628db8df25f5c924385823","observation_id":"3dc735e5-0897-4d85-954f-0e21784ccce1","resolution":{"observed_at":"2026-08-03T21:48:18.923973Z","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-08-03T21:48:19.084877Z","title":"Bartlett, Pradeep Ravikumar, and Martin J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:19.084877Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:d0407ec371f3be5b55e7b3d0e1d32a81c5b23a105f948e16144f592ba28512ff","observation_id":"24e8b26f-b81d-4992-965a-0621a4dc6a33","resolution":{"observed_at":"2026-08-03T21:48:19.084877Z","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-08-03T21:48:19.232381Z","title":"Deep learning with differential privacy","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:19.232381Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:3faebd428487f4b623fffbf481d0544c7fd1ab25cd80b689991e884e619ea469","observation_id":"19ff2fd9-7a8f-409e-8e49-af2d3af7d3e8","resolution":{"observed_at":"2026-08-03T21:48:19.232381Z","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-08-03T21:48:19.458534Z","title":"Information-constrained optimization: can adaptive processing of gradients help? In M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:19.458534Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:f94f277037e738591c51f0863022022ddaa41ba7caf53d46fdac16260e3c64c1","observation_id":"08c9f521-7a6b-46bb-af2f-1f3a00b7d8fb","resolution":{"observed_at":"2026-08-03T21:48:19.458534Z","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-08-03T21:48:19.611482Z","title":"Private stochastic convex optimization: Optimal rates in l1 geometry","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:19.611482Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:b49e96d3a00fcf0514ce52473e0b998818eebf8056501d570abf62e281180ae1","observation_id":"d11c1208-693b-4336-b1f0-14f4092cddf9","resolution":{"observed_at":"2026-08-03T21:48:19.611482Z","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-08-03T21:48:19.773500Z","title":"Qsgd: Communication-efficient sgd via gradient quantization and encoding","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:19.773500Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:26dcb68479f090f5c9d44a43c4fcc375f72e76f09e3c022f95d38ce8d45ed431","observation_id":"2bee1cd7-7afe-476b-b074-458021bdce0d","resolution":{"observed_at":"2026-08-03T21:48:19.773500Z","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-08-03T21:48:19.937275Z","title":"Communication complexity of distributed convex learning and optimization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:19.937275Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:8ada879a00e4d35f1064d747a7d6d7469471c61b3e1923f22c67f18abfe7e4c1","observation_id":"a8f1033c-0024-46f4-be6b-da217f62489b","resolution":{"observed_at":"2026-08-03T21:48:19.937275Z","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-08-03T21:48:20.133527Z","title":"Privacy amplification by subsampling: Tight analyses via couplings and divergences","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.133527Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:207a7777756d63e0e5cd2e40b89d60c67113349c64da208f5a68b5c0d0a8877d","observation_id":"21336621-340a-4487-bfa1-c0d6ed0959c7","resolution":{"observed_at":"2026-08-03T21:48:20.133527Z","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-08-03T21:48:20.269265Z","title":"Rothblum, and Thomas Steinke","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.269265Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:804cf1fffb60668bffd4e257ad6e09a977f9772f8d968b648d0f58810b833155","observation_id":"d4a1d4da-0f9d-4e2d-ae15-348f889b6d4a","resolution":{"observed_at":"2026-08-03T21:48:20.269265Z","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-08-03T21:48:20.316881Z","title":"Stability and generalization","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.316881Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:c573bd03adcbb61f0019fa84fb8a02e774e4b29e170ba44ce406461c4e0bb933","observation_id":"e182274a-e815-413c-98d8-19f4ae9e8cd8","resolution":{"observed_at":"2026-08-03T21:48:20.316881Z","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-08-03T21:48:20.342888Z","title":"Stability of stochastic gradient descent on nonsmooth convex losses","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.342888Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:0b1f705dd650d2b8476e60eef73cdd267fc9123b96d510813166ab06c2b926b8","observation_id":"a6d4019e-b84f-45d0-ae0f-0ca27e3dde82","resolution":{"observed_at":"2026-08-03T21:48:20.342888Z","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-08-03T21:48:20.413111Z","title":"Private stochastic convex optimization with optimal rates","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.413111Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:0ac2d4baf23fecc03fbbd55137c5fb13ec06f3c14f289287799870ff13358b26","observation_id":"1962cf5a-1176-4a77-b274-a140ddbbd81d","resolution":{"observed_at":"2026-08-03T21:48:20.413111Z","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-08-03T21:48:20.486940Z","title":"Differentially private algorithms for the stochastic saddle point problem with optimal rates for the strong gap","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.486940Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:eddf07ffbe407c532b1c8dfe4432bbd6b5be38dbc764e0ae5acd4fc33f1ed6da","observation_id":"ea5c2352-37ac-4624-9b75-56152d2f6910","resolution":{"observed_at":"2026-08-03T21:48:20.486940Z","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-08-03T21:48:20.593921Z","title":"Private algorithms for stochastic saddle points and variational inequalities: Beyond euclidean geometry","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.593921Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:a52ea1e31a7ef5836ba32e7e81b82436bdc804959888ed9b8e725d793b37395d","observation_id":"1a727bf7-3d25-42b8-b1aa-b411826d32e3","resolution":{"observed_at":"2026-08-03T21:48:20.593921Z","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-08-03T21:48:20.659531Z","title":"Lower bounds on the oracle complexity of nonsmooth convex optimization via information theory","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.659531Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:623e2d70a388a6e072b7d918a8424a953a1f864ba3bb35ea1b4df4beceaf7290","observation_id":"494ab03f-229c-499d-98b6-00b3d31828f4","resolution":{"observed_at":"2026-08-03T21:48:20.659531Z","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-08-03T21:48:20.768412Z","title":"Complexity of highly parallel non-smooth convex optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.768412Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:9e564b30129939d89fb7b39ceb070bace7bbcb8785c9a07341c894c1466a8d29","observation_id":"46a47cf2-b3c1-40e2-a17c-8ede2e8e0561","resolution":{"observed_at":"2026-08-03T21:48:20.768412Z","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":"10.1109/focs.2015.45","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Differentially Private Release and Learning of Threshold Functions","venue":null,"work_id":"6740a018-88a2-48d0-bc8d-0d0ac4fa587d","year":2015},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:20.924484Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:b0c050cc9af944f6737834f50b3e3caed5e62014864d1dad09786455a9c930fa","observation_id":"5db9729a-937b-4eb7-ac6a-4969adb4b302","resolution":{"observed_at":"2026-08-03T21:54:06.606603Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:48:21.012706Z","title":"Concentrated differential privacy: Simplifications, extensions, and lower bounds","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.012706Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:36447710ae6dca96942bbc9fa7bb430691177c9daccd5cf750e305d3cb5298b4","observation_id":"930ba145-43ab-4241-9618-4a4b1d69b7ba","resolution":{"observed_at":"2026-08-03T21:48:21.012706Z","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-08-03T21:48:21.065154Z","title":"Private empirical risk minimization: Efficient algorithms and tight error bounds","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.065154Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:c5e91436789abb87ac4510ee13da603a380fad535991c6e9cff07e1484f7b790","observation_id":"0110e2d2-c5c1-459d-a862-1a651691b49f","resolution":{"observed_at":"2026-08-03T21:48:21.065154Z","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":"10.1137/15m1033587","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fingerprinting codes and the price of approximate differential privacy","venue":"SIAM Journal on Computing","work_id":"feb4b427-18bc-4290-bc7e-cbe6690241f3","year":1938},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.160472Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:ac854f6b4329c5bf8fb85ed713eed4c98df8135dd3b1d642209915e3fed6aeff","observation_id":"6ced245a-dc5a-4456-92e8-8295280647f6","resolution":{"observed_at":"2026-08-03T21:54:06.399255Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:48:21.312131Z","title":"Choquette-Choo, Arun Ganesh, and Abhradeep Guha Thakurta","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.312131Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:f248b5d80190117c6eaff218b27e5d48e83786b01bde794748d68fa23e45b293","observation_id":"03b5fb4a-3107-423c-9a60-ee04cd40f13e","resolution":{"observed_at":"2026-08-03T21:48:21.312131Z","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-08-03T21:48:21.483605Z","title":"Choquette-Choo, H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.483605Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:c3656b965c838f740a0e5fbc97a79c5367000fd4b6fc7e144e67872cd277f876","observation_id":"c0014d3e-63f2-445e-a7fb-49498f22b3d6","resolution":{"observed_at":"2026-08-03T21:48:21.483605Z","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-08-03T21:48:21.543269Z","title":"Advancing Differential Privacy : Where We Are Now and Future Directions for Real - World Deployment","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.543269Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:0b7ef67ce3475bdced9a96e18b497411f9484280bb73c5a4de3f6e9ad4e1e886","observation_id":"4a2aa61e-7c01-4194-8723-0a5d2e7d41be","resolution":{"observed_at":"2026-08-03T21:48:21.543269Z","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-08-03T21:48:21.607968Z","title":"Resqueing parallel and private stochastic convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.607968Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:af9a613ecbaf5834917923ee62ee2c7e9b74f0e4c7bbaf1a242b2f0de239565a","observation_id":"3f7130cb-7921-4353-9478-651e7d8a2531","resolution":{"observed_at":"2026-08-03T21:48:21.607968Z","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-08-03T21:48:21.709994Z","title":"Differentially private empirical risk minimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.709994Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:c52f6dc4f337636e16c695c4c8af1d2d2e66bb56e43c5e2cfdccf146f20a431d","observation_id":"e15eccc7-0d53-4ad0-a4f7-af3e8c0bb4e7","resolution":{"observed_at":"2026-08-03T21:48:21.709994Z","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-08-03T21:48:21.826325Z","title":"Cover and Joy A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.826325Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:ce2731f81c5a4cc89ae65b080230cb709fa3e11f0121222dfee6a3bcea4ffe46","observation_id":"54e0869a-2d56-4b7d-8fe3-7e6c04b4c391","resolution":{"observed_at":"2026-08-03T21:48:21.826325Z","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-08-03T21:48:21.904311Z","title":"Calibrating noise to sensitivity in private data analysis","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:21.904311Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:4ae47151bbbac2ccba9c78981f7719372de819fb1f10f0ac486d72d662a1425b","observation_id":"d5a27e6f-1031-4cc7-9a67-1ed6da035fb2","resolution":{"observed_at":"2026-08-03T21:48:21.904311Z","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":"10.1109/focs.2015.46","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Robust traceability from trace amounts","venue":null,"work_id":"88708588-f74b-47b7-bcf0-d73f1d353002","year":2015},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.055692Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:7e1f0de378392c81ee8d2e3b190c856b1c71a856faa4195c2177ffe0c68b41d9","observation_id":"ecdbcbdd-2d25-4588-8a98-26d1e139b991","resolution":{"observed_at":"2026-08-03T21:54:06.228621Z","resolver_source":"doi","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":{"arxiv_id":"1311.2669","last_updated":"2013-12-31T02:48:25Z","snapshot_observed_at":"2026-07-06T03:27:56.367862Z","submitted_at":"2013-11-12T04:38:18Z","title":"Distance-based and continuum Fano inequalities with applications to statistical estimation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.2669","snapshot_observed_at":"2026-08-03T21:48:22.188443Z","title":"Duchi and Martin J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.188443Z"},"links":{"cited_paper":"/paper/1311.2669","citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:53aefdb40ebf36783aa51280865aab49aff186b4a6a6d86e1d05bf33d079374e","observation_id":"e695bfc3-2646-4dc7-8cda-ffe2c05ce22c","resolution":{"observed_at":"2026-08-03T21:48:22.188443Z","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-08-03T21:48:22.322398Z","title":"Private stochastic convex optimization: optimal rates in linear time","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.322398Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:5d7948002ab375d97bdc9adf278fb8f25185773b918a35b906083b58dbc4c3f2","observation_id":"6c6f11d5-e6c9-43a0-841f-f9f99c481340","resolution":{"observed_at":"2026-08-03T21:48:22.322398Z","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-08-03T21:48:22.405241Z","title":"Roy, and Ali Ramezani-Kebrya","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.405241Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:7bf4ee8548fff9faa834e1af1fa605319529402d420cc852b05596587e6d080a","observation_id":"f0c409ee-d64e-4745-80f1-9d4b6e6b78d4","resolution":{"observed_at":"2026-08-03T21:48:22.405241Z","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-08-03T21:48:22.511505Z","title":"Private convex optimization via exponential mechanism","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.511505Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:4a16ef8c7fabcf6e005179cd03e53d5587cea54992617ade10285a36eef0e4f6","observation_id":"efc83629-c5e5-4b7f-a0f4-c48f25d89930","resolution":{"observed_at":"2026-08-03T21:48:22.511505Z","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-08-03T21:48:22.573090Z","title":"Lower bounds and nearly optimal algorithms in distributed learning with communication compression","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.573090Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:d52052710f40ed0a20bb60e935ab1fc1c588ebba9502c241a5721b7b309351b7","observation_id":"ff9e549a-f4a8-4c51-a159-361715c84da3","resolution":{"observed_at":"2026-08-03T21:48:22.573090Z","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-08-03T21:48:22.626812Z","title":"Train faster, generalize better: stability of stochastic gradient descent","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.626812Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:8f96b35a0b7ebbf67fd38cf45d6c71ceb5418084d8305fdac0c17044629befd5","observation_id":"beddd7c6-08bc-42eb-b789-01be119d761f","resolution":{"observed_at":"2026-08-03T21:48:22.626812Z","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-08-03T21:48:22.806045Z","title":"Accelerating stochastic gradient descent using predictive variance reduction","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.806045Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:67cd66c9f108099a7d6d941545ada817385a1a567fdad7c0ac88aa453065f759","observation_id":"89cfe399-aa39-4d80-b4ec-6bb4983a9374","resolution":{"observed_at":"2026-08-03T21:48:22.806045Z","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-08-03T21:48:22.951539Z","title":"Private non-smooth erm and sco in subquadratic steps","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:22.951539Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:5159b0402a6120a50614d485056461604eb3975fb14f6574b794b38e6a50c631","observation_id":"a11ee421-42b7-48b9-a2d6-42e588a6cbc3","resolution":{"observed_at":"2026-08-03T21:48:22.951539Z","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-08-03T21:48:23.001591Z","title":"Brendan McMahan","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.001591Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:b87d73140b814277a5222e085fffbc4f81cef7ba33546f4c2d00388da21a855d","observation_id":"5b5101f1-141e-4263-9764-3df95432d35b","resolution":{"observed_at":"2026-08-03T21:48:23.001591Z","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-08-03T21:48:23.107520Z","title":"Practical and private (deep) learning without sampling or shuffling","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.107520Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:72341c07fe0c7940a67a471cd344722a63f7607530fb1801b02edfcdf510a765","observation_id":"ab4dfe43-c82e-44b6-ab66-8804069f0137","resolution":{"observed_at":"2026-08-03T21:48:23.107520Z","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-08-03T21:48:23.172010Z","title":"Private federated learning without a trusted server: Optimal algorithms for convex losses","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.172010Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:2d3e80b42d65f457147a9f61d073b45a060b956e4c7276736f5d995c567e1642","observation_id":"d2cba8a5-2294-4454-80cf-722e5ded5b49","resolution":{"observed_at":"2026-08-03T21:48:23.172010Z","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-08-03T21:48:23.322204Z","title":"Limits on gradient compression for stochastic optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.322204Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:1a15298f5702c0eb9d66c1094bcea5d5994f9d344648d520a70160b688a51845","observation_id":"6fb2a30a-7185-45f1-b7fa-ab6352c18684","resolution":{"observed_at":"2026-08-03T21:48:23.322204Z","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-08-03T21:48:23.445500Z","title":"Ratq: A universal fixed-length quantizer for stochastic optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.445500Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:2e37dcb040c9c880f69341fe0a8f32ed05b1101115882da63696628526df7e6f","observation_id":"59e5a10b-4cb1-45fc-a807-ea095e6149ae","resolution":{"observed_at":"2026-08-03T21:48:23.445500Z","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-08-03T21:48:23.514219Z","title":"Differentially private non-convex optimization under the kl condition with optimal rates","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.514219Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:b455555f2eac2683d0a3d5d576894eeb59bf5adf449c5c2f1f3b9a70b2fed114","observation_id":"5727be26-da96-494e-afc8-94398f20e0ac","resolution":{"observed_at":"2026-08-03T21:48:23.514219Z","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-08-03T21:48:23.640056Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.640056Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:800bae71286fef30f53f3f8754f8725fb899e648c06b6bd9edfafc064f7802e1","observation_id":"8e44c610-0d3e-479f-8e53-1c21da3dbce2","resolution":{"observed_at":"2026-08-03T21:48:23.640056Z","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-08-03T21:48:23.774643Z","title":"How to dp-fy ml: A practical tutorial to machine learning with differential privacy","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.774643Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:00cf2a5fa0c05caa588be4d0874a84ab2cf7cb8aba6537398913045536540654","observation_id":"f5667ee7-f232-428b-85c7-7cce5e22fcba","resolution":{"observed_at":"2026-08-03T21:48:23.774643Z","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-08-03T21:48:23.906121Z","title":"a is\\\" a , Joonas J\\","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:23.906121Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:0203548a0806976b37db59ff3bf23423daeb70e281732e20f815b1911e7bee45","observation_id":"102aa8bb-ff31-4092-9e6e-c19f6cb3ff1a","resolution":{"observed_at":"2026-08-03T21:48:23.906121Z","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-08-03T21:48:24.033027Z","title":"Optimal convergence rates for convex distributed optimization in networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.033027Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:18b7e15e4132e008f5ce74e25a2ab6306770b3eb9d3076ec2b195a5aca692d04","observation_id":"99dbc85e-5043-4398-aa46-4612c1f87935","resolution":{"observed_at":"2026-08-03T21:48:24.033027Z","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-08-03T21:48:24.099393Z","title":"Stich, Jean-Baptiste Cordonnier, and Martin Jaggi","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.099393Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:b183ef3459738f58d3e2899d04c6a431bf5da7a22089a1aa4b9cf9e1ba534e2c","observation_id":"5d8f965e-2cfd-4910-b947-abb1791d1b06","resolution":{"observed_at":"2026-08-03T21:48:24.099393Z","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-08-03T21:48:24.238577Z","title":"Characterizing the accuracy-communication-privacy trade-off in distributed stochastic convex optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.238577Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:e2237aa45d4087ce051dd438e248761ec1dbaddbd41a1a1f18f287212675e4c9","observation_id":"d304c4b9-0f55-423d-950a-b2278ce8f0c5","resolution":{"observed_at":"2026-08-03T21:48:24.238577Z","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-08-03T21:48:24.340434Z","title":"Understanding machine learning: From theory to algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.340434Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:ca1beb889e16829a25efcfac0fdb6f91b35ac9fdf8f5940dc778c7e7c6f80435","observation_id":"667acb71-d590-4edf-845a-90bcbfb2fbee","resolution":{"observed_at":"2026-08-03T21:48:24.340434Z","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-08-03T21:48:24.446786Z","title":"Public-data assisted private stochastic optimization: Power and limitations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.446786Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:c47c7be714c23747943655b94eda849ad54f53e9662340ca70ff3c28acff9012","observation_id":"04f4d392-6010-4b01-aefa-1ade0bece36f","resolution":{"observed_at":"2026-08-03T21:48:24.446786Z","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-08-03T21:48:24.491393Z","title":"High-Dimensional Probability: An Introduction with Applications in Data Science","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.491393Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:fc09f0dafa85431ad11c8ea2f106ac5851ca1dcbb49a318f9cbf8b839027d4f4","observation_id":"c7dcf2f0-41dd-4057-938f-6540a58a940e","resolution":{"observed_at":"2026-08-03T21:48:24.491393Z","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-08-03T21:48:24.601590Z","title":"The min-max complexity of distributed stochastic convex optimization with intermittent communication","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.601590Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:e4cbccf6959322d8ea89a2f7b1829b341691e30f404bd5ee42a506dd79eeb548","observation_id":"1dc7972b-1817-4c85-87de-904ed8fd54b2","resolution":{"observed_at":"2026-08-03T21:48:24.601590Z","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-08-03T21:48:24.793828Z","title":"Tight complexity bounds for optimizing composite objectives","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.793828Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:cdc20c327d6e963a2aba7d124c4e8bc569127c0482e5bb5826f5d319ba44c279","observation_id":"2d906b5d-d2ff-4298-8eeb-eae7416125d7","resolution":{"observed_at":"2026-08-03T21:48:24.793828Z","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-08-03T21:48:24.866088Z","title":"Communication compression techniques in distributed deep learning: A survey","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.866088Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:80929b40ac8da040b0af6eb4f4ebf28fd64a9d82a726f3d566752c22253e0543","observation_id":"ecc12186-4656-4e58-90fc-c25c5d69d2fb","resolution":{"observed_at":"2026-08-03T21:48:24.866088Z","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-08-03T21:48:24.937642Z","title":"Gradient perturbation is underrated for differentially private convex optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:24.937642Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:8dea0ca894a19599778a4d2561c6611ede4fc239758d48ca3afa25b90b1cd8d3","observation_id":"f12d8a2a-fc2c-40f9-95c9-60846720b50e","resolution":{"observed_at":"2026-08-03T21:48:24.937642Z","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-08-03T21:48:25.160427Z","title":"Bring your own algorithm for optimal differentially private stochastic minimax optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-03T21:48:25.160427Z"},"links":{"citing_paper":"/paper/2511.13999"},"observation_digest":"sha256:5ebf90a993ee35678a8877c3becaf92ef8a6c467f6c4f81686fa8bd3b0a3e4a0","observation_id":"42210c96-378b-4459-8ec1-112c845b991a","resolution":{"observed_at":"2026-08-03T21:48:25.160427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.13999","last_updated":"2026-07-09T16:14:12Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T21:48:16.364010Z","submitted_at":"2025-11-17T23:58:11Z","title":"On the Gradient Complexity of Private Optimization with Private Oracles"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":57},"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 57 of 57 outbound references and 1 inbound Pith citation observation for arXiv:2511.13999."}