{"as_of":"2026-08-22T22:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06a41776db619d6fac2dd816893fd7ef5a97eff598dd50e09aed462215c35ebf","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:09:34.397202Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T10:22:25.816867Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1802.02724","last_updated":"2019-06-17T18:01:22Z","snapshot_observed_at":"2026-08-19T18:30:03.144222Z","submitted_at":"2018-02-08T05:54:22Z","title":"Primal-dual stochastic gradient method for convex programs with many functional constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.02724","snapshot_observed_at":"2026-08-14T15:09:34.397202Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.01871","last_updated":"2023-03-23T04:05:54Z","snapshot_observed_at":"2026-08-19T18:26:09.400617Z","submitted_at":"2019-08-05T21:39:24Z","title":"Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T15:09:34.397202Z"},"links":{"cited_paper":"/paper/1802.02724","citing_paper":"/paper/1908.01871"},"observation_digest":"sha256:213b89d7d1af6e609ff61006592346054565851cd82279dd8a328f4c09c70cda","observation_id":"bb8c759c-4475-4990-83f7-3aeb1de25150","resolution":{"observed_at":"2026-08-14T15:09:34.397202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.02724","last_updated":"2019-06-17T18:01:22Z","snapshot_observed_at":"2026-08-19T18:30:03.144222Z","submitted_at":"2018-02-08T05:54:22Z","title":"Primal-dual stochastic gradient method for convex programs with many functional constraints","version":2},"cited_work":{"arxiv_id":"1802.02724","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.02724","snapshot_observed_at":"2026-08-14T10:22:25.816867Z","title":"Primal-dual stochastic gradient method for convex programs with many functional constraints","venue":"math.OC","work_id":"4d3476e9-b4c6-4cb0-a097-722d1ecede09","year":2018},"citing_paper":{"arxiv_id":"1908.11518","last_updated":"2020-12-01T14:23:29Z","snapshot_observed_at":"2026-08-17T20:01:19.175582Z","submitted_at":"2019-08-30T03:33:53Z","title":"Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization","version":4},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-14T10:22:25.721681Z"},"links":{"cited_paper":"/paper/1802.02724","citing_paper":"/paper/1908.11518"},"observation_digest":"sha256:982c8fd08d829f63d3bd4de5005fc5474c6c10f92cfd52d9a26324380203f394","observation_id":"377d0eec-cb6e-4252-9fe2-d7259cc6c1c2","resolution":{"observed_at":"2026-08-14T10:22:25.821464Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1802.02724/citation-record","integrity":"/paper/1802.02724/integrity","json":"/paper/1802.02724/citation-record.json","paper":"/paper/1802.02724"},"outbound":[],"paper":{"arxiv_id":"1802.02724","last_updated":"2019-06-17T18:01:22Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-19T18:30:03.144222Z","submitted_at":"2018-02-08T05:54:22Z","title":"Primal-dual stochastic gradient method for convex programs with many functional constraints"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1802.02724."}