{"as_of":"2026-08-08T09:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b62ddf6b08e69009fb1afe2f5db58c050390ecabfda37605795e1086b558aa28","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-08T06:32:00.761636+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-07T04:54:05.164140Z","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-05-10T22:30:49.975645Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.13521","last_updated":"2021-12-27T05:41:14Z","snapshot_observed_at":"2026-08-01T16:05:23.189518Z","submitted_at":"2021-12-27T05:41:14Z","title":"Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13521","snapshot_observed_at":"2026-08-07T04:54:05.164140Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.09940","last_updated":"2025-06-11T17:06:57Z","snapshot_observed_at":"2026-08-07T04:34:49.017127Z","submitted_at":"2025-06-11T17:06:57Z","title":"The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:54:05.164140Z"},"links":{"cited_paper":"/paper/2112.13521","citing_paper":"/paper/2506.09940"},"observation_digest":"sha256:c5189a7f2a4250baa11f26f0308a3dc898b5535244d0743e60b4e81abaf20083","observation_id":"397c7713-7dff-4a4c-9669-ab4428628ab2","resolution":{"observed_at":"2026-08-07T04:54:05.164140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13521","last_updated":"2021-12-27T05:41:14Z","snapshot_observed_at":"2026-08-01T16:05:23.189518Z","submitted_at":"2021-12-27T05:41:14Z","title":"Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?","version":1},"cited_work":{"arxiv_id":"2112.13521","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13521","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Can reinforcement learning find stackelberg-nash equilibria in general-sum markov games with myopic followers?","venue":null,"work_id":"de26eae0-a720-4e7b-a529-3f1ac3935194","year":2021},"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":27,"source":"pdf_text","source_observed_at":"2026-05-10T19:49:31.844061Z"},"links":{"cited_paper":"/paper/2112.13521","citing_paper":"/paper/2604.04394"},"observation_digest":"sha256:31a5cbcace1ee51cadadf463a71bdde1aa62a8c76da9f2d6047cde4f83ca9284","observation_id":"38b35697-364b-4338-8336-d451cc31d168","resolution":{"observed_at":"2026-05-10T22:30:49.981507Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2112.13521/citation-record","integrity":"/paper/2112.13521/integrity","json":"/paper/2112.13521/citation-record.json","paper":"/paper/2112.13521"},"outbound":[],"paper":{"arxiv_id":"2112.13521","last_updated":"2021-12-27T05:41:14Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T16:05:23.189518Z","submitted_at":"2021-12-27T05:41:14Z","title":"Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?"},"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 2 inbound Pith citation observations for arXiv:2112.13521."}