{"as_of":"2026-08-13T23:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd61cb1f423a1359d60d78212db16d8e10993f5fc2de65b0e1d97b510fa78b1e","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:32:37.560747Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-08-10T12:20:08.175912Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.07143","snapshot_observed_at":"2026-08-05T11:32:37.560747Z","title":"Subgradient regularization: A descent-oriented subgradient method for nonsmooth optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-09T15:28:02.625762Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T11:32:37.560747Z"},"links":{"cited_paper":"/paper/2505.07143","citing_paper":"/paper/2509.02804"},"observation_digest":"sha256:0c8b9c888f9253b44a8498e64a4a1d5fee5e41e379ca8b21d7885d852667c2f4","observation_id":"636e0625-f8a1-468e-8415-89bfce61f1df","resolution":{"observed_at":"2026-08-05T11:32:37.560747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-08-10T12:20:08.175912Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.07143","snapshot_observed_at":"2026-08-03T09:22:12.918497Z","title":"Li and Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.14680","last_updated":"2026-06-02T02:28:42Z","snapshot_observed_at":"2026-08-10T00:17:40.274611Z","submitted_at":"2026-01-21T05:51:32Z","title":"Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization I: Convex Optimization","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T09:22:12.918497Z"},"links":{"cited_paper":"/paper/2505.07143","citing_paper":"/paper/2601.14680"},"observation_digest":"sha256:be3f7953375ab6dff284347d78429a7a5245445d82cb6e26bca925033899eaa9","observation_id":"207bb346-5fd0-4872-937a-4f603aa5ec2e","resolution":{"observed_at":"2026-08-03T09:22:12.918497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-08-10T12:20:08.175912Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":"2505.07143","doi":"10.48550/arxiv.2505.07143","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.07143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Subgradient Regularization: A descent-oriented subgradient method for nonsmooth optimization.arXiv preprint arXiv:2505.07143","venue":"ArXiv.org","work_id":"699c6870-ba61-4465-888e-09c1b59a7555","year":null},"citing_paper":{"arxiv_id":"2605.10219","last_updated":"2026-05-22T05:06:22Z","snapshot_observed_at":"2026-08-13T05:42:08.123734Z","submitted_at":"2026-05-11T08:59:57Z","title":"Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-12T03:35:58.798501Z"},"links":{"cited_paper":"/paper/2505.07143","citing_paper":"/paper/2605.10219"},"observation_digest":"sha256:31ddf84a9c7e186960b9eed427cb05eb60fcc1afc36eabb5465fa25f6fe95a3a","observation_id":"fd245201-0331-445e-a24d-1d3d19c0be22","resolution":{"observed_at":"2026-05-12T07:11:28.267343Z","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":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-08-10T12:20:08.175912Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":"2505.07143","doi":"10.48550/arxiv.2505.07143","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.07143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Subgradient Regularization: A descent-oriented subgradient method for nonsmooth optimization.arXiv preprint arXiv:2505.07143","venue":"ArXiv.org","work_id":"699c6870-ba61-4465-888e-09c1b59a7555","year":null},"citing_paper":{"arxiv_id":"2605.10219","last_updated":"2026-05-22T05:06:22Z","snapshot_observed_at":"2026-08-13T05:42:08.123734Z","submitted_at":"2026-05-11T08:59:57Z","title":"Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T06:08:51.372994Z"},"links":{"cited_paper":"/paper/2505.07143","citing_paper":"/paper/2605.10219"},"observation_digest":"sha256:1bb32d797f86a4816ed1518a0bfccdfb813ef2ea0614d21c7feb3e374126fe0b","observation_id":"461b657d-7e7d-4c2c-a51f-0208cbc39ca1","resolution":{"observed_at":"2026-05-25T06:10:23.782142Z","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":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-08-10T12:20:08.175912Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":"2505.07143","doi":"10.48550/arxiv.2505.07143","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.07143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Subgradient Regularization: A descent-oriented subgradient method for nonsmooth optimization.arXiv preprint arXiv:2505.07143","venue":"ArXiv.org","work_id":"699c6870-ba61-4465-888e-09c1b59a7555","year":null},"citing_paper":{"arxiv_id":"2605.10219","last_updated":"2026-05-22T05:06:22Z","snapshot_observed_at":"2026-08-13T05:42:08.123734Z","submitted_at":"2026-05-11T08:59:57Z","title":"Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T06:08:51.372994Z"},"links":{"cited_paper":"/paper/2505.07143","citing_paper":"/paper/2605.10219"},"observation_digest":"sha256:9085ef1d5cc399846b4fe1d381ee77e741f1227fd008db416e0cc32709fd3068","observation_id":"1e6cdd41-6fda-4509-8554-08224122fc96","resolution":{"observed_at":"2026-05-25T06:10:23.270781Z","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":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-08-10T12:20:08.175912Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.07143","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Subgradient regularization: A descent-oriented subgradient method for nonsmooth optimization.arXiv preprint arXiv:2505.07143, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-08-13T19:02:30.164749Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2505.07143","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:68c2fe12c184f72ab99ac0fa3f39d37da4ccaa61fd44e19be2817711b028bb41","observation_id":"f2df2f9c-cf3d-4f3a-9485-491485d70129","resolution":{"observed_at":"2026-07-14T02:28:43.704810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.07143/citation-record","integrity":"/paper/2505.07143/integrity","json":"/paper/2505.07143/citation-record.json","paper":"/paper/2505.07143"},"outbound":[],"paper":{"arxiv_id":"2505.07143","last_updated":"2025-05-11T23:03:45Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T12:20:08.175912Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth 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-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 6 inbound Pith citation observations for arXiv:2505.07143."}