{"as_of":"2026-08-13T13:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35d93860908a06debbd8769bfaaa25e73a3ae1bdbd1ebb965de004cf9a2c947f","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:23:05.269460Z","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-04T18:40:02.586537Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.12277","snapshot_observed_at":"2026-08-11T00:23:05.269460Z","title":"Stochastic nonsmooth convex optimization with heavy-tailed noises","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.19529","last_updated":"2025-05-29T03:42:49Z","snapshot_observed_at":"2026-08-12T11:48:25.205232Z","submitted_at":"2024-12-27T08:46:46Z","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T00:23:05.269460Z"},"links":{"cited_paper":"/paper/2303.12277","citing_paper":"/paper/2412.19529"},"observation_digest":"sha256:593de22517e60b8cf7763c61bd31bb359b98f32146e5614dad45ca4f12389f4b","observation_id":"9b9e4e8e-941d-4737-9bfa-7d0161702bc8","resolution":{"observed_at":"2026-08-11T00:23:05.269460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","version":3},"cited_work":{"arxiv_id":"2303.12277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.12277","snapshot_observed_at":"2026-07-04T18:40:02.586537Z","title":"Liu and Z","venue":null,"work_id":"70674568-72bd-4ec8-b748-268917481d9e","year":2023},"citing_paper":{"arxiv_id":"2501.10258","last_updated":"2026-04-20T18:47:20Z","snapshot_observed_at":"2026-08-12T20:48:22.144102Z","submitted_at":"2025-01-17T15:40:03Z","title":"DADA: Dual Averaging with Distance Adaptation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T04:54:12.210472Z"},"links":{"cited_paper":"/paper/2303.12277","citing_paper":"/paper/2501.10258"},"observation_digest":"sha256:3fde836daade79db25b4c21b8fee2fcdc6e7b948158a114b7949e3b5e2416d7d","observation_id":"35ab731c-3735-46e6-ac27-b2b4b66e3ec7","resolution":{"observed_at":"2026-05-23T04:55:24.873247Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.12277","snapshot_observed_at":"2026-08-03T07:44:27.466206Z","title":"and Zhou, Z","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.20076","last_updated":"2026-05-29T02:49:05Z","snapshot_observed_at":"2026-08-08T02:51:57.466558Z","submitted_at":"2026-01-27T21:40:10Z","title":"Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-03T07:44:27.466206Z"},"links":{"cited_paper":"/paper/2303.12277","citing_paper":"/paper/2601.20076"},"observation_digest":"sha256:d095e55f83719ea8a208067b0e26479d7830b5630a6d7e2924d428e64c20cfa1","observation_id":"b45224a2-d311-4985-a6bc-cb8f1e308133","resolution":{"observed_at":"2026-08-03T07:44:27.466206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","version":3},"cited_work":{"arxiv_id":"2303.12277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.12277","snapshot_observed_at":"2026-07-04T18:40:02.586537Z","title":"Liu and Z","venue":null,"work_id":"70674568-72bd-4ec8-b748-268917481d9e","year":2023},"citing_paper":{"arxiv_id":"2605.26000","last_updated":"2026-07-30T19:19:20Z","snapshot_observed_at":"2026-08-05T23:10:43.686263Z","submitted_at":"2026-05-25T16:18:39Z","title":"Statistical Inference for Stochastic Gradient Descent: Beyond Finite Variance","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T20:11:28.707205Z"},"links":{"cited_paper":"/paper/2303.12277","citing_paper":"/paper/2605.26000"},"observation_digest":"sha256:5a3c886112bd34ef1b72c52d4d7b721b6460b1aecf869b1932d8aa1fe0dafd98","observation_id":"a3cfcbac-3dea-4a16-9c9e-225d03a53060","resolution":{"observed_at":"2026-06-29T20:13:58.895735Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.12277","snapshot_observed_at":"2026-08-03T00:56:16.940637Z","title":"Stochastic nonsmooth convex optimization with heavy-tailed noises: High-probability bound, in-expectation rate and initial distance adaptation.arXiv preprint arXiv:2303.12277, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26000","last_updated":"2026-07-30T19:19:20Z","snapshot_observed_at":"2026-08-05T23:10:43.686263Z","submitted_at":"2026-05-25T16:18:39Z","title":"Statistical Inference for Stochastic Gradient Descent: Beyond Finite Variance","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T00:56:16.940637Z"},"links":{"cited_paper":"/paper/2303.12277","citing_paper":"/paper/2605.26000"},"observation_digest":"sha256:49473d83ad1bfa797d886d026b871b097f002c12ac0c762ab208d168e71d2d48","observation_id":"d4b26d9e-e99e-45a2-a550-e7221c052180","resolution":{"observed_at":"2026-08-03T00:56:16.940637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","version":3},"cited_work":{"arxiv_id":"2303.12277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.12277","snapshot_observed_at":"2026-07-04T18:40:02.586537Z","title":"Liu and Z","venue":null,"work_id":"70674568-72bd-4ec8-b748-268917481d9e","year":2023},"citing_paper":{"arxiv_id":"2606.00520","last_updated":"2026-05-30T04:27:47Z","snapshot_observed_at":"2026-08-09T14:13:26.625234Z","submitted_at":"2026-05-30T04:27:47Z","title":"In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-28T18:36:17.784859Z"},"links":{"cited_paper":"/paper/2303.12277","citing_paper":"/paper/2606.00520"},"observation_digest":"sha256:cec128515817fd030f0fdb2825659a51c9f062086f500c1be7754f93b94d028a","observation_id":"f44b1ceb-7138-43e1-94f0-4acf2e179c72","resolution":{"observed_at":"2026-06-28T20:32:37.674524Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","version":3},"cited_work":{"arxiv_id":"2303.12277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.12277","snapshot_observed_at":"2026-07-04T18:40:02.586537Z","title":"Liu and Z","venue":null,"work_id":"70674568-72bd-4ec8-b748-268917481d9e","year":2023},"citing_paper":{"arxiv_id":"2606.18778","last_updated":"2026-06-17T07:41:41Z","snapshot_observed_at":"2026-07-06T23:54:09.140085Z","submitted_at":"2026-06-17T07:41:41Z","title":"Online Distributional Prediction via Latent Cluster Geometry Under Drift and Corruption","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-06-26T21:58:08.898515Z"},"links":{"cited_paper":"/paper/2303.12277","citing_paper":"/paper/2606.18778"},"observation_digest":"sha256:aa63a9e5dbce797559ddd482490449fceb96b19026a7a74a1ac5ad565c5d8c66","observation_id":"58844b60-4f15-4590-8b7a-6c067e0aa97b","resolution":{"observed_at":"2026-07-03T23:39:03.773339Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","version":3},"cited_work":{"arxiv_id":"2303.12277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.12277","snapshot_observed_at":"2026-07-04T18:40:02.586537Z","title":"Liu and Z","venue":null,"work_id":"70674568-72bd-4ec8-b748-268917481d9e","year":2023},"citing_paper":{"arxiv_id":"2606.24879","last_updated":"2026-06-23T17:55:18Z","snapshot_observed_at":"2026-08-09T07:22:37.616383Z","submitted_at":"2026-06-23T17:55:18Z","title":"New Bounds for the Last Iterate of the Stochastic subGradient Method","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-25T22:43:06.513763Z"},"links":{"cited_paper":"/paper/2303.12277","citing_paper":"/paper/2606.24879"},"observation_digest":"sha256:f7ba517e6eecdb396fb17585b2c40a36c76c4676c3975e1d64d11b8239df6618","observation_id":"e292ce47-6fb4-450d-9e70-4c0a1e6a2426","resolution":{"observed_at":"2026-07-04T18:40:02.588304Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2303.12277/citation-record","integrity":"/paper/2303.12277/integrity","json":"/paper/2303.12277/citation-record.json","paper":"/paper/2303.12277"},"outbound":[],"paper":{"arxiv_id":"2303.12277","last_updated":"2023-05-20T04:12:11Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T12:19:32.102852Z","submitted_at":"2023-03-22T03:05:28Z","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2303.12277."}