{"as_of":"2026-08-12T15:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1bc60f4adb75cceb70d3124acaf9fe0e33b79c2027ffcc4422d2982489491ff4","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-12T06:34:41.77262+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-11T15:45:26.620998Z","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-10T18:30:58.693681Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.04156","last_updated":"2018-01-13T18:39:22Z","snapshot_observed_at":"2026-07-06T05:46:41.806948Z","submitted_at":"2017-06-13T16:49:13Z","title":"Gradient descent GAN optimization is locally stable","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.04156","snapshot_observed_at":"2026-08-11T15:45:26.620998Z","title":"Gradient descent GAN optimization is locally stable","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.10716","last_updated":"2024-12-14T07:20:33Z","snapshot_observed_at":"2026-08-11T15:38:29.258805Z","submitted_at":"2024-12-14T07:20:33Z","title":"Control of Overfitting with Physics","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:26.620998Z"},"links":{"cited_paper":"/paper/1706.04156","citing_paper":"/paper/2412.10716"},"observation_digest":"sha256:cbcbc3b20bd9334162a69feca7a09350808c7d50d871d7c86a3b89bfdee4fb8c","observation_id":"b402f0db-c81f-4982-b8d9-d65113f581c8","resolution":{"observed_at":"2026-08-11T15:45:26.620998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.04156","last_updated":"2018-01-13T18:39:22Z","snapshot_observed_at":"2026-07-06T05:46:41.806948Z","submitted_at":"2017-06-13T16:49:13Z","title":"Gradient descent GAN optimization is locally stable","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.04156","snapshot_observed_at":"2026-08-10T18:36:29.262130Z","title":"arXiv preprint arXiv:1706.04156 (2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.11236","last_updated":"2025-01-20T02:48:07Z","snapshot_observed_at":"2026-08-12T02:29:12.187567Z","submitted_at":"2025-01-20T02:48:07Z","title":"A New Formulation of Lipschitz Constrained With Functional Gradient Learning for GANs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T18:36:29.262130Z"},"links":{"cited_paper":"/paper/1706.04156","citing_paper":"/paper/2501.11236"},"observation_digest":"sha256:f2bef05cabf6bb7f206c683e4b95807cb85b346aa65e46f9c3492db7c0a647de","observation_id":"0a7939cc-99a0-462c-a29d-cd0136c478a6","resolution":{"observed_at":"2026-08-10T18:36:29.262130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.04156","last_updated":"2018-01-13T18:39:22Z","snapshot_observed_at":"2026-07-06T05:46:41.806948Z","submitted_at":"2017-06-13T16:49:13Z","title":"Gradient descent GAN optimization is locally stable","version":3},"cited_work":{"arxiv_id":"1706.04156","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.04156","snapshot_observed_at":"2026-08-10T18:30:58.693681Z","title":"Gradient descent GAN optimization is locally stable","venue":"cs.LG","work_id":"2d819f2c-7b89-4457-bce8-c3594ec4ceb3","year":2017},"citing_paper":{"arxiv_id":"2501.11318","last_updated":"2025-01-20T07:44:09Z","snapshot_observed_at":"2026-08-10T23:53:26.867949Z","submitted_at":"2025-01-20T07:44:09Z","title":"Nested Annealed Training Scheme for Generative Adversarial Networks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T18:30:58.541245Z"},"links":{"cited_paper":"/paper/1706.04156","citing_paper":"/paper/2501.11318"},"observation_digest":"sha256:cb04bd34ccc643177c2796de2c7bb00e635ec7ea2699c62234d6ee34cd258095","observation_id":"96653c31-3b57-4bd6-b95c-e9af46190b4d","resolution":{"observed_at":"2026-08-10T18:30:58.698286Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1706.04156/citation-record","integrity":"/paper/1706.04156/integrity","json":"/paper/1706.04156/citation-record.json","paper":"/paper/1706.04156"},"outbound":[],"paper":{"arxiv_id":"1706.04156","last_updated":"2018-01-13T18:39:22Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T05:46:41.806948Z","submitted_at":"2017-06-13T16:49:13Z","title":"Gradient descent GAN optimization is locally stable"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1706.04156."}