{"as_of":"2026-08-15T17:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:759397f8c86059d20b560d5bf42c781d45af36f4af196718836dad7b6618906b","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-15T06:32:42.880941+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-14T10:22:25.631160Z","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-23T23:03:34.386406Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.08048","last_updated":"2020-06-14T22:51:55Z","snapshot_observed_at":"2026-08-15T09:58:10.994436Z","submitted_at":"2020-06-14T22:51:55Z","title":"Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.08048","snapshot_observed_at":"2026-08-14T10:22:25.631160Z","title":"arXiv preprint arXiv:2006.08048 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"1908.11518","last_updated":"2020-12-01T14:23:29Z","snapshot_observed_at":"2026-08-15T01:15:42.120675Z","submitted_at":"2019-08-30T03:33:53Z","title":"Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T10:22:25.631160Z"},"links":{"cited_paper":"/paper/2006.08048","citing_paper":"/paper/1908.11518"},"observation_digest":"sha256:645446bae497dc9a475b0bd3545e153ea4383b65af26a3e23ff6315d4bf63266","observation_id":"802c79d0-272a-4bde-a533-31ed01a22571","resolution":{"observed_at":"2026-08-14T10:22:25.631160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.08048","last_updated":"2020-06-14T22:51:55Z","snapshot_observed_at":"2026-08-15T09:58:10.994436Z","submitted_at":"2020-06-14T22:51:55Z","title":"Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems","version":1},"cited_work":{"arxiv_id":"2006.08048","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.08048","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e7bc9644-b9d7-446d-a49a-d13aef0a3439","year":2006},"citing_paper":{"arxiv_id":"2407.09927","last_updated":"2026-04-30T20:18:19Z","snapshot_observed_at":"2026-08-14T12:26:56.404409Z","submitted_at":"2024-07-13T15:48:33Z","title":"An Adaptive Proximal ADMM for Nonconvex Linearly Constrained Composite Programs","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-23T23:03:09.743745Z"},"links":{"cited_paper":"/paper/2006.08048","citing_paper":"/paper/2407.09927"},"observation_digest":"sha256:5430797837197cebe829e5b5dec99085caadda11c5049960dc8cc7d5ad3650f5","observation_id":"52443126-4b38-4c8c-81aa-9a3dfeaa93b9","resolution":{"observed_at":"2026-05-23T23:03:34.389437Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2006.08048","last_updated":"2020-06-14T22:51:55Z","snapshot_observed_at":"2026-08-15T09:58:10.994436Z","submitted_at":"2020-06-14T22:51:55Z","title":"Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.08048","snapshot_observed_at":"2026-08-08T01:04:55.089513Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.05682","last_updated":"2026-08-06T07:17:12Z","snapshot_observed_at":"2026-08-15T17:01:07.286711Z","submitted_at":"2026-08-06T07:17:12Z","title":"A Damped Subspace Splitting Algorithm for Constrained Density Functional Theory","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T01:04:55.089513Z"},"links":{"cited_paper":"/paper/2006.08048","citing_paper":"/paper/2608.05682"},"observation_digest":"sha256:d1ed3fb8c6db4c91fa71c9d74853b0873c6ee5efbf352923a312c1553bb033db","observation_id":"a3b7ed16-b895-4449-86de-5cc7430d0650","resolution":{"observed_at":"2026-08-08T01:04:55.089513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2006.08048/citation-record","integrity":"/paper/2006.08048/integrity","json":"/paper/2006.08048/citation-record.json","paper":"/paper/2006.08048"},"outbound":[],"paper":{"arxiv_id":"2006.08048","last_updated":"2020-06-14T22:51:55Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T09:58:10.994436Z","submitted_at":"2020-06-14T22:51:55Z","title":"Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems"},"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 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2006.08048."}