{"as_of":"2026-08-16T23:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7493f6b325de9dbcb6f0b04feae29c946651fc9220e9599a99961d14e293160","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:03:40.622076Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T03:56:44.748069Z","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-23T03:57:29.481422Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2412.18297","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.18297","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"431f9cd7-850a-4dd2-aa57-abd1e6a4ee14","year":2024},"citing_paper":{"arxiv_id":"2502.08597","last_updated":"2026-05-01T09:39:08Z","snapshot_observed_at":"2026-07-06T20:35:30.739339Z","submitted_at":"2025-02-12T17:34:04Z","title":"Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T03:56:44.748069Z"},"links":{"cited_paper":"/paper/2412.18297","citing_paper":"/paper/2502.08597"},"observation_digest":"sha256:14c5aae1b0a9ccf77066739fb6d8f9b6fdcd6c7fb66641c8a52fcd38b8d7b69f","observation_id":"7af548de-ff1b-4b1c-b28e-934d5d3cf598","resolution":{"observed_at":"2026-05-23T03:57:29.484278Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.18297/citation-record","integrity":"/paper/2412.18297/integrity","json":"/paper/2412.18297/citation-record.json","paper":"/paper/2412.18297"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.19786","last_updated":"2025-02-24T02:58:57Z","snapshot_observed_at":"2026-08-16T14:47:31.672248Z","submitted_at":"2023-10-30T17:50:29Z","title":"From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.19786","snapshot_observed_at":"2026-08-11T05:03:40.579923Z","title":"From external to swap regret 2.0: An efficient reduction and oblivious adversary fo r large action spaces","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":5,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.579923Z"},"links":{"cited_paper":"/paper/2310.19786","citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:3ba49ca6b3fad58c0febe8b53e82788ff650cd109bf80c64687a7306407ec5da","observation_id":"b88f7005-cd2e-41f8-9dca-4475fbb683ba","resolution":{"observed_at":"2026-08-11T05:03:40.579923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20291","last_updated":"2024-12-28T22:05:04Z","snapshot_observed_at":"2026-08-13T10:56:32.940273Z","submitted_at":"2024-12-28T22:05:04Z","title":"Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20291","snapshot_observed_at":"2026-08-11T05:03:40.585081Z","title":"Efficient learning and computation of linear correlated equilibrium in general convex 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":6,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.585081Z"},"links":{"cited_paper":"/paper/2412.20291","citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:7073296cbb28713fa11cfe91ce4700f3124bb0897e98a8c5de09c39dd707b3d6","observation_id":"3e72ccac-119d-4753-bb96-c3ba9fc7accd","resolution":{"observed_at":"2026-08-11T05:03:40.585081Z","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-16T17:11:35.690063Z","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:1f37fb1611fbafd0d9378330525898990c7824977b71c693fc5a27ea66ab3306","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:03:40.821980Z","title":"Auctions between regret-m inimizing agents","venue":null,"work_id":"354dfad8-2af1-4b75-8924-70a6b05ea08b","year":2022},"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":10,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.610550Z"},"links":{"citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:ab08679813052260b18b167650919a86311534cafbd0e9e97f226cc02b3722e6","observation_id":"d4b95969-f665-4d1a-9463-ecff2a9d238b","resolution":{"observed_at":"2026-08-11T05:03:40.826994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16198","last_updated":"2024-01-29T14:53:22Z","snapshot_observed_at":"2026-08-16T14:23:37.830689Z","submitted_at":"2024-01-29T14:53:22Z","title":"Contracting with a Learning Agent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16198","snapshot_observed_at":"2026-08-11T05:03:40.596984Z","title":"C ontracting with a learning agent","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":1997,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.596984Z"},"links":{"cited_paper":"/paper/2401.16198","citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:913a41196a467faf8e9293ef85331002a46622f82d841ff55693519e54cc3a77","observation_id":"0b7796b2-cd7c-4877-873d-6c0066de131b","resolution":{"observed_at":"2026-08-11T05:03:40.596984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03719","last_updated":"2024-02-22T05:43:12Z","snapshot_observed_at":"2026-08-16T15:56:59.797921Z","submitted_at":"2023-02-07T19:12:46Z","title":"Persuading a Behavioral Agent: Approximately Best Responding and Learning","version":2},"cited_work":{"arxiv_id":"2302.03719","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.03719","snapshot_observed_at":"2026-08-11T05:03:40.757343Z","title":"Persuading a Behavioral Agent: Approximately Best Responding and Learning","venue":"cs.GT","work_id":"a875aa58-3f5b-4aad-ac57-17fc48a3f86b","year":2023},"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":2006,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.573868Z"},"links":{"cited_paper":"/paper/2302.03719","citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:a0002e1a3a37024dee94713ed2b38c41c381b29e477bbcd27cf63e407d449314","observation_id":"84d1f68c-b719-4669-bcf0-ddb5d17175b6","resolution":{"observed_at":"2026-08-11T05:03:40.764946Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:03:40.878080Z","title":"Selling to a no-regret buyer","venue":null,"work_id":"0e9bfaea-411b-4189-bc44-fcf65d5570ce","year":2018},"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":2007,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.562257Z"},"links":{"citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:8da167ed163a7e620dec5e0345a9990b307db275a42b6ee0cb7db06849f7f355","observation_id":"c9e37b0e-17e6-460d-bfe0-3ca038945730","resolution":{"observed_at":"2026-08-11T05:03:40.883890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.19647","last_updated":"2023-11-14T17:39:27Z","snapshot_observed_at":"2026-08-16T14:47:35.546512Z","submitted_at":"2023-10-30T15:35:24Z","title":"Fast swap regret minimization and applications to approximate correlated equilibria","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.19647","snapshot_observed_at":"2026-08-11T05:03:40.622076Z","title":"Fast swap regret minimizat ion and applications to approx- imate correlated equilibria","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":2008,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.622076Z"},"links":{"cited_paper":"/paper/2310.19647","citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:0cf798a4fd4f169fe2fa7102b2cdd60d8b34ffb27dcb45d7b6159b5dac0e2d5d","observation_id":"2d7b059b-6c03-47de-a391-dd806e907e8b","resolution":{"observed_at":"2026-08-11T05:03:40.622076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:03:40.839028Z","title":"Schapire","venue":null,"work_id":"e9b1980f-4229-4694-90cb-7cdad7668f9a","year":1996},"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":2019,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.590953Z"},"links":{"citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:e8577e48d2ae29fb485d7db1ca10554aabbb7712d8e2be1c4c9d5dc1be4a5dde","observation_id":"8cb02de5-e867-4b09-8585-1f94432226bf","resolution":{"observed_at":"2026-08-11T05:03:40.844330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:03:40.803245Z","title":"Learning and approximating the optimal strategy to commit to","venue":null,"work_id":"05e89aa1-cace-496f-a67c-a39d0bd2bab9","year":2009},"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":2022,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.616881Z"},"links":{"citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:a0a21600a8a946282acaecac5b8906916509e835a05007aced013d6e0f52a42a","observation_id":"bfc556dc-b3a5-4184-9566-ca609a2aeaf0","resolution":{"observed_at":"2026-08-11T05:03:40.809396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:03:40.857047Z","title":"Efficient stackelberg strategies for finitely repeated games","venue":null,"work_id":"937dcee9-204d-49af-b8ed-c45d0530d1d1","year":2023},"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":2023,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.568587Z"},"links":{"citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:824d6c7361c268ddbf4dec52256d620b9c36376a37b42b4fefe73c1465ae360c","observation_id":"bde92b77-3b4d-40b8-a996-828198fa463b","resolution":{"observed_at":"2026-08-11T05:03:40.864533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08272","last_updated":"2024-11-20T07:35:07Z","snapshot_observed_at":"2026-08-16T13:26:12.145905Z","submitted_at":"2024-08-15T17:17:56Z","title":"Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactions","version":2},"cited_work":{"arxiv_id":"2408.08272","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.08272","snapshot_observed_at":"2026-08-11T05:03:40.784035Z","title":"Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactions","venue":"cs.GT","work_id":"aac00a8e-e5f8-4ab1-a00a-8ee628deb946","year":2024},"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":2024,"source":"pdf_text","source_observed_at":"2026-08-11T05:03:40.554977Z"},"links":{"cited_paper":"/paper/2408.08272","citing_paper":"/paper/2412.18297"},"observation_digest":"sha256:8f8648128213dd376a28e6199e065bf66e19abd53b5be0453e198df9de3aa18e","observation_id":"da2f6b44-6dff-41a1-a119-a314815c9735","resolution":{"observed_at":"2026-08-11T05:03:40.790189Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.18297","last_updated":"2025-02-20T07:17:45Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-11T21:00:26.571936Z","submitted_at":"2024-12-24T09:05:06Z","title":"Learning to Play Against Unknown Opponents"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":12},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 1 inbound Pith citation observation for arXiv:2412.18297."}