{"as_of":"2026-08-10T13:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:555b97eb6b4619b86eb26005f889861bd161b7f51e90dfeb010295e1afe031c0","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T00:25:45.086636Z","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-05-21T20:20:34.589270Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-08-10T00:25:45.086636Z","title":"Methods for convex (l_0, l_1)-smooth optimization: Clipping, acceleration, and adaptivity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18198","last_updated":"2025-05-22T18:06:06Z","snapshot_observed_at":"2026-08-10T03:03:51.301696Z","submitted_at":"2025-01-30T08:34:04Z","title":"Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T00:25:45.086636Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2501.18198"},"observation_digest":"sha256:478365bb1d4f8549f8a9fb54f4a00a268d3843524b1ba066ea615bce460d4a93","observation_id":"2bd2e59b-9a04-4295-9045-c72692262dad","resolution":{"observed_at":"2026-08-10T00:25:45.086636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-08-08T11:35:29.642173Z","title":"Methods for convex (l_0, l_1)-smooth optimization: Clipping, acceleration, and adaptivity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07923","last_updated":"2025-05-27T15:31:20Z","snapshot_observed_at":"2026-08-08T23:26:23.316471Z","submitted_at":"2025-02-11T19:54:11Z","title":"Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T11:35:29.642173Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2502.07923"},"observation_digest":"sha256:e5128bc288cba6708adcb82b4ed6a07289d0c1bc2b3f554b6ada3ba3bf20d909","observation_id":"a1f71baf-9fff-4f0d-9ee9-5b1bda34b963","resolution":{"observed_at":"2026-08-08T11:35:29.642173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-08-08T04:56:54.545328Z","title":"Meth- ods for convex(L 0, L1)-smooth optimization: Clip- ping, acceleration, and adaptivity.arXiv preprint arXiv:2409.14989,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08532","last_updated":"2025-06-16T23:04:01Z","snapshot_observed_at":"2026-08-09T22:26:17.419171Z","submitted_at":"2025-02-12T16:12:17Z","title":"Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-08T04:56:54.545328Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2502.08532"},"observation_digest":"sha256:e130eb2e79f1a7398c5ccd86da52cb18b0057b8cae24232c45b0b06ce83af1a8","observation_id":"68ffc6e6-f75d-41be-948d-d456195b48e9","resolution":{"observed_at":"2026-08-08T04:56:54.545328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-08-04T12:38:55.256221Z","title":"Methods for convex (l\\_0, l\\_1) -smooth optimization: Clipping, acceleration, and adaptivity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.03164","last_updated":"2026-06-28T16:14:54Z","snapshot_observed_at":"2026-08-04T12:38:48.240318Z","submitted_at":"2025-10-03T16:35:56Z","title":"Why Do We Need Warm-up? A Theoretical Perspective","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T12:38:55.256221Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2510.03164"},"observation_digest":"sha256:6156adeff7e3978439e7d77c09f54737032448d54b5de1867a59c90a9eac43a8","observation_id":"72115b05-738f-407a-ae44-a5cd7453e73a","resolution":{"observed_at":"2026-08-04T12:38:55.256221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":"2409.14989","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2409.14989 (2024)","venue":null,"work_id":"02737a27-7cd5-4b7a-a102-1c2c4d87a916","year":2024},"citing_paper":{"arxiv_id":"2510.16468","last_updated":"2026-05-20T09:46:29Z","snapshot_observed_at":"2026-08-09T23:22:53.996244Z","submitted_at":"2025-10-18T12:26:28Z","title":"Frank-Wolfe Algorithms for (L0, L1)-smooth functions","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T06:18:52.290660Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2510.16468"},"observation_digest":"sha256:5bb77df832276a5ffd70bef7e6aa4076f9e1daf75c1a56de1578b1c8f5126b87","observation_id":"54a3ba8c-e914-46b8-a265-e9fb59c12825","resolution":{"observed_at":"2026-05-18T06:20:58.642480Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":"2409.14989","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2409.14989 (2024)","venue":null,"work_id":"02737a27-7cd5-4b7a-a102-1c2c4d87a916","year":2024},"citing_paper":{"arxiv_id":"2510.16468","last_updated":"2026-05-20T09:46:29Z","snapshot_observed_at":"2026-08-09T23:22:53.996244Z","submitted_at":"2025-10-18T12:26:28Z","title":"Frank-Wolfe Algorithms for (L0, L1)-smooth functions","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-21T20:19:34.726206Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2510.16468"},"observation_digest":"sha256:d7d4e71b79916ebde60f19d179257f890308bcf2046ef871350659f843e0f3de","observation_id":"45d2dbd3-e2bf-4861-a21a-3007e45b8621","resolution":{"observed_at":"2026-05-21T20:20:34.591793Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-08-03T22:20:05.519647Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.11466","last_updated":"2026-06-22T13:35:19Z","snapshot_observed_at":"2026-08-07T16:29:00.257881Z","submitted_at":"2025-11-14T16:38:15Z","title":"Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-03T22:20:05.519647Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2511.11466"},"observation_digest":"sha256:1aa3dced37307aed0f777d5bc1ba5d073dc27f75868e647980af23e46b86ba67","observation_id":"1cda66cf-d77e-4585-b2ab-91139169f005","resolution":{"observed_at":"2026-08-03T22:20:05.519647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":"2409.14989","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2409.14989 (2024)","venue":null,"work_id":"02737a27-7cd5-4b7a-a102-1c2c4d87a916","year":2024},"citing_paper":{"arxiv_id":"2605.15522","last_updated":"2026-05-26T17:45:23Z","snapshot_observed_at":"2026-08-02T14:53:38.254198Z","submitted_at":"2026-05-15T01:43:22Z","title":"Stochastic Non-Smooth Convex Optimization with Unbounded Gradients","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T15:17:01.028675Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2605.15522"},"observation_digest":"sha256:a1e693deab4f47f6c2649d7480735d1ce93aef15690e5a531ee775c250ef01b7","observation_id":"cce0ba99-4083-49dd-8a86-f826b2647637","resolution":{"observed_at":"2026-05-19T15:17:39.271516Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-07-30T15:28:01.796584Z","title":"arXiv preprint arXiv:2409.14989 (2024),https://arxiv.org/abs/ 2409.14989","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26969","last_updated":"2026-08-04T19:16:45Z","snapshot_observed_at":"2026-08-10T03:40:34.297184Z","submitted_at":"2026-07-29T14:31:24Z","title":"Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T15:28:01.796584Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2607.26969"},"observation_digest":"sha256:d38b60ae7dbf6363677a8428760c028c3dfdfb3575a3bfd6db7ea2984d526249","observation_id":"b775a862-dceb-4b67-95f1-2c412ac17a3a","resolution":{"observed_at":"2026-07-30T15:28:01.796584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.14989/citation-record","integrity":"/paper/2409.14989/integrity","json":"/paper/2409.14989/citation-record.json","paper":"/paper/2409.14989"},"outbound":[],"paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-01T19:23:09.616554Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2409.14989."}