{"as_of":"2026-08-16T00:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbc6e8cfd18b1f1a6b7e9755991a16f2f0743e16d581748812eca34eb952e8d1","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-15T06:32:42.880941+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-14T14:45:51.725782Z","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-14T05:44:01.482969Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1802.03504","last_updated":"2019-07-16T04:48:48Z","snapshot_observed_at":"2026-08-14T19:47:14.065790Z","submitted_at":"2018-02-10T02:35:06Z","title":"Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03504","snapshot_observed_at":"2026-08-14T14:45:51.725782Z","title":"G., and Monteiro, R","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.02734","last_updated":"2022-01-27T00:38:36Z","snapshot_observed_at":"2026-08-15T20:12:31.772332Z","submitted_at":"2019-08-07T17:10:52Z","title":"Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:45:51.725782Z"},"links":{"cited_paper":"/paper/1802.03504","citing_paper":"/paper/1908.02734"},"observation_digest":"sha256:3841f067795ffb21289d569cfc2c89753dbe891413b847be78fe58836e2e94db","observation_id":"bd52e1b2-b746-4633-be93-bac5f9a36172","resolution":{"observed_at":"2026-08-14T14:45:51.725782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03504","last_updated":"2019-07-16T04:48:48Z","snapshot_observed_at":"2026-08-14T19:47:14.065790Z","submitted_at":"2018-02-10T02:35:06Z","title":"Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs","version":3},"cited_work":{"arxiv_id":"1802.03504","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.03504","snapshot_observed_at":"2026-08-14T05:44:01.482969Z","title":"Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs","venue":"math.OC","work_id":"1d18d7c3-a6c0-405a-b230-ffdb1161730a","year":2018},"citing_paper":{"arxiv_id":"1909.00918","last_updated":"2019-09-03T02:11:11Z","snapshot_observed_at":"2026-08-15T06:19:58.300411Z","submitted_at":"2019-09-03T02:11:11Z","title":"Efficiency of Coordinate Descent Methods For Structured Nonconvex Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T05:44:01.313518Z"},"links":{"cited_paper":"/paper/1802.03504","citing_paper":"/paper/1909.00918"},"observation_digest":"sha256:97cd916a2e1fa64400060726821cda82f38fa7f75ddef4b62f8e2002220fca8d","observation_id":"b083b574-d58a-4f4a-82c1-e404a09ef02f","resolution":{"observed_at":"2026-08-14T05:44:01.488564Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1802.03504/citation-record","integrity":"/paper/1802.03504/integrity","json":"/paper/1802.03504/citation-record.json","paper":"/paper/1802.03504"},"outbound":[],"paper":{"arxiv_id":"1802.03504","last_updated":"2019-07-16T04:48:48Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T19:47:14.065790Z","submitted_at":"2018-02-10T02:35:06Z","title":"Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1802.03504."}