{"as_of":"2026-08-16T04:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad9724a056b789c81c2e98c296671aa6789c587972bd7749463ce18e3885a64b","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-11T14:11:39.569813Z","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-11T14:11:28.513279Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.04250","last_updated":"2020-04-08T20:56:40Z","snapshot_observed_at":"2026-08-15T20:46:56.814403Z","submitted_at":"2020-04-08T20:56:40Z","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","version":1},"cited_work":{"arxiv_id":"2004.04250","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.04250","snapshot_observed_at":"2026-08-11T14:11:28.513279Z","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","venue":"cs.DS","work_id":"9c004fc6-0a02-4f76-959d-5e3a15cf9fbf","year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-14T10:50:03.099117Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.070032Z"},"links":{"cited_paper":"/paper/2004.04250","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:22224977101e8d5c35481338139887a5daeb32c522adb47bad2467ccbc78869e","observation_id":"3b552aee-6ac6-4d06-b9ac-9e8177ec3dfe","resolution":{"observed_at":"2026-08-11T14:11:28.516994Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04250","last_updated":"2020-04-08T20:56:40Z","snapshot_observed_at":"2026-08-15T20:46:56.814403Z","submitted_at":"2020-04-08T20:56:40Z","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04250","snapshot_observed_at":"2026-08-11T14:11:39.569813Z","title":"T.; Song, Z.; and wai Wong, S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12444","last_updated":"2025-03-21T15:52:39Z","snapshot_observed_at":"2026-08-13T18:47:02.447017Z","submitted_at":"2024-12-17T01:12:35Z","title":"LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers","version":3},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:39.569813Z"},"links":{"cited_paper":"/paper/2004.04250","citing_paper":"/paper/2412.12444"},"observation_digest":"sha256:ff1aaf6ed7275aa12191a47e5c7a9023df5702e36e46e49941b080b670439894","observation_id":"5df751c9-f59b-44e6-a1c4-d8082dad2550","resolution":{"observed_at":"2026-08-11T14:11:39.569813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2004.04250/citation-record","integrity":"/paper/2004.04250/integrity","json":"/paper/2004.04250/citation-record.json","paper":"/paper/2004.04250"},"outbound":[],"paper":{"arxiv_id":"2004.04250","last_updated":"2020-04-08T20:56:40Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T20:46:56.814403Z","submitted_at":"2020-04-08T20:56:40Z","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications"},"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:2004.04250."}