{"as_of":"2026-08-16T23:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2c913bf9cf6d06671e738c52a1aa8273f63907c51d57d46270bccfd8055dff50","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:39:51.943258Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T18:33:08.182516Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-10T23:47:10.809251Z","title":"Variance-reduced clipping for non-convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.809251Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:67b2447b73e898439300b2045edf2449483d440a96d81c7b4b3295c4dac0fdb7","observation_id":"de1156d2-aaa9-4398-8000-fffb2616a6fa","resolution":{"observed_at":"2026-08-10T23:47:10.809251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-10T23:02:28.325872Z","title":"Reisizadeh, H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.00265","last_updated":"2024-12-31T04:19:53Z","snapshot_observed_at":"2026-08-12T17:54:08.498595Z","submitted_at":"2024-12-31T04:19:53Z","title":"Outlier-Robust Training of Machine Learning Models","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-10T23:02:28.325872Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2501.00265"},"observation_digest":"sha256:bc38a1edb9e2e87374e5b5f2524739f1afa483282cefb71a0bd9fd640bc687c1","observation_id":"f2b12f9d-0766-4e8f-aaa7-fb006b7b7af0","resolution":{"observed_at":"2026-08-10T23:02:28.325872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-15T23:30:24.984392Z","title":"V ariance-reduced clipping for non-convex optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04599","last_updated":"2025-05-07T17:40:12Z","snapshot_observed_at":"2026-08-16T19:42:40.483998Z","submitted_at":"2025-05-07T17:40:12Z","title":"Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:30:24.984392Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2505.04599"},"observation_digest":"sha256:b2dbb9c3429d53ccc085c85b9d89fff592bc1b93758dce41a2814047e449d93d","observation_id":"70402f0a-9d47-4096-b2f3-c8db8dc97d71","resolution":{"observed_at":"2026-08-15T23:30:24.984392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-15T23:39:51.943258Z","title":"Variance-reduced clipping for non-convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.04807","last_updated":"2026-02-17T11:09:26Z","snapshot_observed_at":"2026-08-15T23:18:31.382406Z","submitted_at":"2025-05-07T21:16:11Z","title":"A Fast Newton Method Under Local Lipschitz Smoothness","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:51.943258Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2505.04807"},"observation_digest":"sha256:5affa89df41e3c98babf55b7dfdf95b6abb51acfe5ef42b659a83314e68d27c3","observation_id":"f0edf0b1-92a7-49d0-ab89-89e787e690e4","resolution":{"observed_at":"2026-08-15T23:39:51.943258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":"2303.00883","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-06T18:33:08.182516Z","title":"Variance-reduced Clipping for Non-convex Optimization","venue":"cs.LG","work_id":"dbd7ab9f-ce8a-4eb1-bcf3-13c520e2ca58","year":2023},"citing_paper":{"arxiv_id":"2507.08913","last_updated":"2025-07-11T15:36:48Z","snapshot_observed_at":"2026-08-12T06:39:59.193452Z","submitted_at":"2025-07-11T15:36:48Z","title":"Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:33:07.494593Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2507.08913"},"observation_digest":"sha256:d1568a6aeb2cf7373d9f1008cc49ea1642a7bc3ff814bac60e1bc633626d7889","observation_id":"4a1895d6-f73c-4bda-97d0-59034e8515a7","resolution":{"observed_at":"2026-08-06T18:33:08.210849Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-15T17:22:55.374619Z","title":"Variance-reduced clipping for non-convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.374619Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:4d9326be29d20d00842d7bfe1d92472e625b3580c7524bb600ed5cb8864a4664","observation_id":"267930ab-61af-4287-8bd2-7c05ca38ceab","resolution":{"observed_at":"2026-08-15T17:22:55.374619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-11T15:48:32.823113Z","title":"Reisizadeh, H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09523","last_updated":"2026-08-10T12:24:29Z","snapshot_observed_at":"2026-08-16T17:03:01.143812Z","submitted_at":"2026-08-10T12:24:29Z","title":"Generalized Convexity and Smoothness via Conjugate Duality: Optimization Theory for Deep Neural Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:48:32.823113Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2608.09523"},"observation_digest":"sha256:72babaa1f38b6e24813796e7bf21d23f4573b17a6ac295b28c714ef3dd62aef8","observation_id":"f25e0a5c-681d-48af-a8bd-bf01ca13d2d5","resolution":{"observed_at":"2026-08-11T15:48:32.823113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2303.00883/citation-record","integrity":"/paper/2303.00883/integrity","json":"/paper/2303.00883/citation-record.json","paper":"/paper/2303.00883"},"outbound":[],"paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2303.00883."}