{"as_of":"2026-08-14T07:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7c4f627f57feb0236d76df9dffbf45951c36b7e3326a83a17f11511bfb9515f6","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-14T06:32:32.682623+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-11T05:03:40.603438Z","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-03T23:19:03.753780Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.14126","last_updated":"2022-04-13T20:44:18Z","snapshot_observed_at":"2026-08-13T16:14:51.292523Z","submitted_at":"2022-03-26T18:12:40Z","title":"Robust No-Regret Learning in Min-Max Stackelberg Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.14126","snapshot_observed_at":"2026-08-11T05:03:40.603438Z","title":"Robust no -regret learning in min-max stackelberg games","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.18297","last_updated":"2025-02-20T07:17:45Z","snapshot_observed_at":"2026-08-11T21:00:26.571936Z","submitted_at":"2024-12-24T09:05:06Z","title":"Learning to Play Against Unknown Opponents","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.603438Z"},"links":{"cited_paper":"/paper/2203.14126","citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:6cbb9268618c6f663b47f1a7df5e7cd031e36edae6978329ace1754331d7d22f","observation_id":"4537f570-cf94-40de-9980-a03cdbbacb93","resolution":{"observed_at":"2026-08-11T05:03:40.603438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.14126","last_updated":"2022-04-13T20:44:18Z","snapshot_observed_at":"2026-08-13T16:14:51.292523Z","submitted_at":"2022-03-26T18:12:40Z","title":"Robust No-Regret Learning in Min-Max Stackelberg Games","version":2},"cited_work":{"arxiv_id":"2203.14126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.14126","snapshot_observed_at":"2026-07-03T23:19:03.753780Z","title":"In: Proceedings of the 21st International Conference on Autonomous Agents and Multi- agent Systems (AAMAS) (2022)","venue":null,"work_id":"cf7f5f54-2c09-4273-8993-fe4631dc11ad","year":2022},"citing_paper":{"arxiv_id":"2606.17415","last_updated":"2026-06-16T01:56:10Z","snapshot_observed_at":"2026-08-13T12:00:08.397394Z","submitted_at":"2026-06-16T01:56:10Z","title":"Pure or Unstable: A Generic Dichotomy for Strong Stackelberg Commitments","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T22:31:02.219689Z"},"links":{"cited_paper":"/paper/2203.14126","citing_paper":"/paper/2606.17415"},"observation_digest":"sha256:a5115cc062b070feb0123844aa8f432cf12de91c37fa3a91b0c0499dc9500e80","observation_id":"765af1d4-7696-4e59-8b36-920b12afb0ba","resolution":{"observed_at":"2026-07-03T23:19:03.757181Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2203.14126/citation-record","integrity":"/paper/2203.14126/integrity","json":"/paper/2203.14126/citation-record.json","paper":"/paper/2203.14126"},"outbound":[],"paper":{"arxiv_id":"2203.14126","last_updated":"2022-04-13T20:44:18Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-13T16:14:51.292523Z","submitted_at":"2022-03-26T18:12:40Z","title":"Robust No-Regret Learning in Min-Max 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2203.14126."}