{"as_of":"2026-08-15T14:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4709645773db02c751555a7b07c0cd82e92989ac3001ad042d3cddc9323681e1","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:22:25.468461Z","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:26.220674Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.02401","last_updated":"2019-07-04T13:45:49Z","snapshot_observed_at":"2026-08-15T12:03:06.805280Z","submitted_at":"2019-07-04T13:45:49Z","title":"Complexity and performance of an Augmented Lagrangian algorithm","version":1},"cited_work":{"arxiv_id":"1907.02401","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.02401","snapshot_observed_at":"2026-08-14T10:22:26.220674Z","title":"Complexity and performance of an Augmented Lagrangian algorithm","venue":"math.OC","work_id":"bd5bfdf4-1757-47db-8a3c-1e14370d8051","year":2019},"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":4,"source":"pdf_text","source_observed_at":"2026-08-14T10:22:25.468461Z"},"links":{"cited_paper":"/paper/1907.02401","citing_paper":"/paper/1908.11518"},"observation_digest":"sha256:a0cdf4eda7e2513d2f3d1fd1928c6effa1cfa47918eded2791bc501cd32fc6b7","observation_id":"8b75cf1c-a843-408c-9336-51b5064075fb","resolution":{"observed_at":"2026-08-14T10:22:26.224612Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1907.02401/citation-record","integrity":"/paper/1907.02401/integrity","json":"/paper/1907.02401/citation-record.json","paper":"/paper/1907.02401"},"outbound":[],"paper":{"arxiv_id":"1907.02401","last_updated":"2019-07-04T13:45:49Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T12:03:06.805280Z","submitted_at":"2019-07-04T13:45:49Z","title":"Complexity and performance of an Augmented Lagrangian algorithm"},"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 1 inbound Pith citation observation for arXiv:1907.02401."}