{"as_of":"2026-08-09T07:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc5385948a9ba7d278fe85ea50ee1dc10593816013922b62d70a27e5bafb2c1d","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:22:14.071688Z","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-07-02T11:46:55.270200Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.01217","last_updated":"2019-11-06T23:31:48Z","snapshot_observed_at":"2026-07-06T07:57:43.002430Z","submitted_at":"2019-06-04T06:27:34Z","title":"Convergence of Learning Dynamics in Stackelberg Games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01217","snapshot_observed_at":"2026-08-04T21:22:14.071688Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.071688Z"},"links":{"cited_paper":"/paper/1906.01217","citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:3fbb9e701c9309d53d21106b906dd1439c0ba4d35c5eaee10c645833fb216563","observation_id":"2782d914-a3d3-4fc8-9b2b-3e640db6e1b0","resolution":{"observed_at":"2026-08-04T21:22:14.071688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01217","last_updated":"2019-11-06T23:31:48Z","snapshot_observed_at":"2026-07-06T07:57:43.002430Z","submitted_at":"2019-06-04T06:27:34Z","title":"Convergence of Learning Dynamics in Stackelberg Games","version":3},"cited_work":{"arxiv_id":"1906.01217","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01217","snapshot_observed_at":"2026-07-02T11:46:55.270200Z","title":"arXiv preprint arXiv:1906.01217 , year=","venue":null,"work_id":"e45d47f2-db1b-4e8b-acf6-1b40227dd796","year":2020},"citing_paper":{"arxiv_id":"2604.04394","last_updated":"2026-04-06T03:48:42Z","snapshot_observed_at":"2026-08-02T09:04:25.615806Z","submitted_at":"2026-04-06T03:48:42Z","title":"Finite-Time Analysis of Q-Value Iteration for General-Sum Stackelberg Games","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T19:49:31.844061Z"},"links":{"cited_paper":"/paper/1906.01217","citing_paper":"/paper/2604.04394"},"observation_digest":"sha256:cb069bce5712fc4a013d213fcb60812407ecf92b6821fae23633310d68feaa02","observation_id":"5a2e194d-9d0c-4b16-b7ae-a0be53d568ff","resolution":{"observed_at":"2026-05-10T22:30:50.032330Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01217","last_updated":"2019-11-06T23:31:48Z","snapshot_observed_at":"2026-07-06T07:57:43.002430Z","submitted_at":"2019-06-04T06:27:34Z","title":"Convergence of Learning Dynamics in Stackelberg Games","version":3},"cited_work":{"arxiv_id":"1906.01217","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01217","snapshot_observed_at":"2026-07-02T11:46:55.270200Z","title":"arXiv preprint arXiv:1906.01217 , year=","venue":null,"work_id":"e45d47f2-db1b-4e8b-acf6-1b40227dd796","year":2020},"citing_paper":{"arxiv_id":"2605.09363","last_updated":"2026-05-10T06:23:19Z","snapshot_observed_at":"2026-08-03T01:34:15.771125Z","submitted_at":"2026-05-10T06:23:19Z","title":"Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions","version":1},"reference_index":115,"source":"arxiv_source","source_observed_at":"2026-05-12T03:46:35.908522Z"},"links":{"cited_paper":"/paper/1906.01217","citing_paper":"/paper/2605.09363"},"observation_digest":"sha256:eb91d606d8f994cd95704bf94f5fb544055526a4206d8d417daae5fbdc9d3f53","observation_id":"153b44cd-6043-4952-b0b8-57c61848ea7c","resolution":{"observed_at":"2026-05-12T06:56:31.533852Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01217","last_updated":"2019-11-06T23:31:48Z","snapshot_observed_at":"2026-07-06T07:57:43.002430Z","submitted_at":"2019-06-04T06:27:34Z","title":"Convergence of Learning Dynamics in Stackelberg Games","version":3},"cited_work":{"arxiv_id":"1906.01217","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01217","snapshot_observed_at":"2026-07-02T11:46:55.270200Z","title":"arXiv preprint arXiv:1906.01217 , year=","venue":null,"work_id":"e45d47f2-db1b-4e8b-acf6-1b40227dd796","year":2020},"citing_paper":{"arxiv_id":"2606.06624","last_updated":"2026-06-08T15:12:03Z","snapshot_observed_at":"2026-08-02T09:46:22.331867Z","submitted_at":"2026-06-04T18:21:03Z","title":"Principles and Practice of Deep Representation Learning: or a Mathematical Theory of Memory","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T03:07:52.730713Z"},"links":{"cited_paper":"/paper/1906.01217","citing_paper":"/paper/2606.06624"},"observation_digest":"sha256:21509550a95caa96e124bfd3718e1379a1175ebe031ea2c952517879e1b904bd","observation_id":"81d92e8c-d72f-43e4-b2ba-0cab50f5eb79","resolution":{"observed_at":"2026-07-02T11:46:55.272247Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1906.01217/citation-record","integrity":"/paper/1906.01217/integrity","json":"/paper/1906.01217/citation-record.json","paper":"/paper/1906.01217"},"outbound":[],"paper":{"arxiv_id":"1906.01217","last_updated":"2019-11-06T23:31:48Z","latest_version":3,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T07:57:43.002430Z","submitted_at":"2019-06-04T06:27:34Z","title":"Convergence of Learning Dynamics in Stackelberg Games"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1906.01217."}