{"as_of":"2026-08-09T16:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5db9e090c83c670df278ade3de18ace582cdddcbfcc82657e1b3827566d728f3","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T23:25:19.765126Z","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-11T09:56:03.825882Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.15195","last_updated":"2024-07-21T15:22:55Z","snapshot_observed_at":"2026-07-06T18:49:42.663028Z","submitted_at":"2024-07-21T15:22:55Z","title":"Exact Convergence rate of the subgradient method by using Polyak step size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15195","snapshot_observed_at":"2026-08-04T23:25:19.765126Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.765126Z"},"links":{"cited_paper":"/paper/2407.15195","citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:68684bc861f06b2b9e7bd0b49c84997e180f2e716d03c6f0ef8fac2e28de5a77","observation_id":"d3059cc5-fa47-47f6-86b8-9b016d440807","resolution":{"observed_at":"2026-08-04T23:25:19.765126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15195","last_updated":"2024-07-21T15:22:55Z","snapshot_observed_at":"2026-07-06T18:49:42.663028Z","submitted_at":"2024-07-21T15:22:55Z","title":"Exact Convergence rate of the subgradient method by using Polyak step size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15195","snapshot_observed_at":"2026-08-03T19:10:48.716290Z","title":"Exact convergence rate of the subgradient method by using polyak step size.arXiv preprint arXiv:2407.15195,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.02342","last_updated":"2026-06-01T07:48:25Z","snapshot_observed_at":"2026-08-06T14:41:54.013603Z","submitted_at":"2025-12-02T02:24:32Z","title":"Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T19:10:48.716290Z"},"links":{"cited_paper":"/paper/2407.15195","citing_paper":"/paper/2512.02342"},"observation_digest":"sha256:7abb5efd7cf9bf2a13ba9ed196aed87d6e586214f4dee1b66d9b5d6637ec5fe1","observation_id":"6795d28c-57ab-47a2-b63e-0eabc8755724","resolution":{"observed_at":"2026-08-03T19:10:48.716290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15195","last_updated":"2024-07-21T15:22:55Z","snapshot_observed_at":"2026-07-06T18:49:42.663028Z","submitted_at":"2024-07-21T15:22:55Z","title":"Exact Convergence rate of the subgradient method by using Polyak step size","version":1},"cited_work":{"arxiv_id":"2407.15195","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15195","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Glineur, F","venue":null,"work_id":"467e1045-27cb-4247-8bed-6775c8eb94ec","year":2024},"citing_paper":{"arxiv_id":"2604.10728","last_updated":"2026-04-12T17:02:08Z","snapshot_observed_at":"2026-07-06T22:59:18.756089Z","submitted_at":"2026-04-12T17:02:08Z","title":"Last Iterate Convergence of AdaGrad-Norm for Convex Non-Smooth Optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-10T15:44:30.926534Z"},"links":{"cited_paper":"/paper/2407.15195","citing_paper":"/paper/2604.10728"},"observation_digest":"sha256:e884e761d9223326545501e275ab74dabe88d1b65a2046b2f42c45b3720db026","observation_id":"1039132d-2ff0-4e8e-b7e3-4b072b19d40c","resolution":{"observed_at":"2026-05-11T09:56:03.829104Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.15195/citation-record","integrity":"/paper/2407.15195/integrity","json":"/paper/2407.15195/citation-record.json","paper":"/paper/2407.15195"},"outbound":[],"paper":{"arxiv_id":"2407.15195","last_updated":"2024-07-21T15:22:55Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T18:49:42.663028Z","submitted_at":"2024-07-21T15:22:55Z","title":"Exact Convergence rate of the subgradient method by using Polyak step size"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.15195."}