{"as_of":"2026-08-08T17:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3cf3907a168c66fe0c9cc39a2777bd1a20fd669b5fa65b80576917f663de3634","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-08T06:32:00.761636+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-04T13:26:08.805869Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1210.3039","last_updated":"2022-06-17T22:48:04Z","snapshot_observed_at":"2026-08-06T04:14:45.743065Z","submitted_at":"2012-10-10T20:01:29Z","title":"Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1210.3039","snapshot_observed_at":"2026-08-04T13:26:08.805869Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.01168","last_updated":"2026-05-26T16:22:06Z","snapshot_observed_at":"2026-08-07T21:21:07.733263Z","submitted_at":"2025-10-01T17:54:27Z","title":"A first-order method for constrained nonconvex-nonconcave minimax optimization","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:08.805869Z"},"links":{"cited_paper":"/paper/1210.3039","citing_paper":"/paper/2510.01168"},"observation_digest":"sha256:63ad2abc8792834ab18ca0e451703f0f93fd40187f84afb53ddeee1885dcc3b1","observation_id":"79fa2521-2463-4582-b856-4cdb3feca835","resolution":{"observed_at":"2026-08-04T13:26:08.805869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1210.3039/citation-record","integrity":"/paper/1210.3039/integrity","json":"/paper/1210.3039/citation-record.json","paper":"/paper/1210.3039"},"outbound":[],"paper":{"arxiv_id":"1210.3039","last_updated":"2022-06-17T22:48:04Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T04:14:45.743065Z","submitted_at":"2012-10-10T20:01:29Z","title":"Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1210.3039."}