{"as_of":"2026-08-20T00:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3128e932bd518dc0802ed8a9ae35459abbc78f558ab118de4b9ecced515a6599","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:45:07.175028Z","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-15T02:23:31.774978Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.11687","last_updated":"2022-12-23T14:51:18Z","snapshot_observed_at":"2026-08-14T16:01:52.632423Z","submitted_at":"2019-07-26T17:39:32Z","title":"Incremental Methods for Weakly Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11687","snapshot_observed_at":"2026-08-14T10:45:07.175028Z","title":"Incremental methods for weakly convex optimization","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.175028Z"},"links":{"cited_paper":"/paper/1907.11687","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:abfa5c35a5716ca002c7fb3092a754fedc0fc7fee4b608773c5538dc281eae72","observation_id":"f854c36d-00df-4614-bbe6-50cabc926e89","resolution":{"observed_at":"2026-08-14T10:45:07.175028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11687","last_updated":"2022-12-23T14:51:18Z","snapshot_observed_at":"2026-08-14T16:01:52.632423Z","submitted_at":"2019-07-26T17:39:32Z","title":"Incremental Methods for Weakly Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11687","snapshot_observed_at":"2026-08-07T13:07:43.671793Z","title":"cc/paper_files/paper/2022/file/ 7bc4f74e35bcfe8cfe43b0a860786d6a- Paper-Conference.pdf","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-18T19:23:43.052348Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.671793Z"},"links":{"cited_paper":"/paper/1907.11687","citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:75f3f1f46fee92ecbd3cbb55c1146262ba3f41795dec02de909a855ba47c5175","observation_id":"9afae420-f153-4eda-b9dd-847475b27e49","resolution":{"observed_at":"2026-08-07T13:07:43.671793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11687","last_updated":"2022-12-23T14:51:18Z","snapshot_observed_at":"2026-08-14T16:01:52.632423Z","submitted_at":"2019-07-26T17:39:32Z","title":"Incremental Methods for Weakly Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11687","snapshot_observed_at":"2026-08-07T10:24:39.405994Z","title":"Incremental methods for weakly convex optimization,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2506.05974","last_updated":"2026-07-07T09:00:45Z","snapshot_observed_at":"2026-08-19T20:33:04.501884Z","submitted_at":"2025-06-06T10:57:40Z","title":"A Proximal Variable Smoothing for Minimization of Nonlinearly Composite Nonsmooth Function -- Finite-Max Minimization and MIMO Applications","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:24:39.405994Z"},"links":{"cited_paper":"/paper/1907.11687","citing_paper":"/paper/2506.05974"},"observation_digest":"sha256:9e555db887258ccef767421efaf230d5db852a9bb1e9239f8d41052f6fad7ea3","observation_id":"261f352a-a28d-4ceb-9e1f-f7d823185904","resolution":{"observed_at":"2026-08-07T10:24:39.405994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11687","last_updated":"2022-12-23T14:51:18Z","snapshot_observed_at":"2026-08-14T16:01:52.632423Z","submitted_at":"2019-07-26T17:39:32Z","title":"Incremental Methods for Weakly Convex Optimization","version":2},"cited_work":{"arxiv_id":"1907.11687","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.11687","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1907.11687 , year=","venue":null,"work_id":"9d90ed01-b605-45c7-ba10-e1c07df61940","year":1907},"citing_paper":{"arxiv_id":"2605.14345","last_updated":"2026-05-14T04:09:51Z","snapshot_observed_at":"2026-08-17T14:31:07.692261Z","submitted_at":"2026-05-14T04:09:51Z","title":"Convergence of difference inclusions via a diameter criterion","version":1},"reference_index":300,"source":"arxiv_source","source_observed_at":"2026-05-15T02:21:30.228735Z"},"links":{"cited_paper":"/paper/1907.11687","citing_paper":"/paper/2605.14345"},"observation_digest":"sha256:6571ca2e992795e2d3d5e2d51ef4476325f723c76446a1a6d7cf13447a2bb947","observation_id":"3e76d2e4-86b6-4c77-9b3a-4f3524aef867","resolution":{"observed_at":"2026-05-15T02:23:31.777638Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1907.11687/citation-record","integrity":"/paper/1907.11687/integrity","json":"/paper/1907.11687/citation-record.json","paper":"/paper/1907.11687"},"outbound":[],"paper":{"arxiv_id":"1907.11687","last_updated":"2022-12-23T14:51:18Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T16:01:52.632423Z","submitted_at":"2019-07-26T17:39:32Z","title":"Incremental Methods for Weakly 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1907.11687."}