{"as_of":"2026-08-11T12:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e936d6a269efb1f88b0af83a5ee20d3613f7790944f76a16293badb2bdc14bc3","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:32:14.063997Z","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-01T22:06:15.760131Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-10T13:02:59.551125Z","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:99edef91698b319b297bd82362d4f800a7716cfcee437203953dd57d69519751","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":{"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":"2305.04912","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04912","snapshot_observed_at":"2026-07-01T22:06:15.760131Z","title":"arXiv preprint arXiv:2305.04912 , year=","venue":null,"work_id":"3262ba5a-10f5-4f4b-b165-2d371e1e1517","year":null},"citing_paper":{"arxiv_id":"2606.01527","last_updated":"2026-06-01T01:19:04Z","snapshot_observed_at":"2026-08-07T12:07:56.869470Z","submitted_at":"2026-06-01T01:19:04Z","title":"Near-Optimal Pure Machine Unlearning for Smooth Strongly Convex Losses","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-28T15:51:13.831817Z"},"links":{"cited_paper":"/paper/2305.04912","citing_paper":"/paper/2606.01527"},"observation_digest":"sha256:58ed458e1db6596f008645a088270a6b205e20d534df87433323ebe56d8ce62d","observation_id":"32b046a4-a4ed-4627-9f4d-4f6abf1d5cc9","resolution":{"observed_at":"2026-07-01T22:06:15.761761Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.04912/citation-record","integrity":"/paper/2305.04912/integrity","json":"/paper/2305.04912/citation-record.json","paper":"/paper/2305.04912"},"outbound":[],"paper":{"arxiv_id":"2305.04912","last_updated":"2023-05-08T17:47:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:24:42.200476Z","submitted_at":"2023-05-08T17:47:28Z","title":"On User-Level Private Convex Optimization"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2305.04912."}