{"as_of":"2026-08-10T14:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0eec5ddfa6cc7b18c69d079e0213f997c2fdd9aec4f91b7f641284604440ebda","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-10T06:31:04.303077+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-07T11:07:02.905677Z","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-07T11:07:06.976028Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.17625","last_updated":"2025-02-24T20:20:06Z","snapshot_observed_at":"2026-08-07T17:51:59.763334Z","submitted_at":"2025-02-24T20:20:06Z","title":"Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback","version":1},"cited_work":{"arxiv_id":"2502.17625","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.17625","snapshot_observed_at":"2026-08-07T11:07:06.976028Z","title":"Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback","venue":"cs.LG","work_id":"199858cd-1525-4940-9f0c-3e4be96fe689","year":2025},"citing_paper":{"arxiv_id":"2506.03802","last_updated":"2026-06-16T13:36:16Z","snapshot_observed_at":"2026-08-07T10:52:41.892791Z","submitted_at":"2025-06-04T10:15:51Z","title":"Learning in Matching Games with Bandit Feedback","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:07:02.905677Z"},"links":{"cited_paper":"/paper/2502.17625","citing_paper":"/paper/2506.03802"},"observation_digest":"sha256:8a6c7b34d9081c4960961d8517020f30a3edda264c449efa4c8ebea51673cd72","observation_id":"8aa4244a-7f95-4fe3-8a00-0c655f4cc1ea","resolution":{"observed_at":"2026-08-07T11:07:06.980695Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17625","last_updated":"2025-02-24T20:20:06Z","snapshot_observed_at":"2026-08-07T17:51:59.763334Z","submitted_at":"2025-02-24T20:20:06Z","title":"Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.17625","snapshot_observed_at":"2026-07-11T12:55:57.279598Z","title":"arXiv preprint arXiv:2502.17625 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04824","last_updated":"2026-07-06T08:57:30Z","snapshot_observed_at":"2026-07-11T12:55:53.730406Z","submitted_at":"2026-07-06T08:57:30Z","title":"Probably Correct Optimal Stable Matching under Two-Sided Uncertainty","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-11T12:55:57.279598Z"},"links":{"cited_paper":"/paper/2502.17625","citing_paper":"/paper/2607.04824"},"observation_digest":"sha256:287b827be435459c9f89ddbc72670ab2589e16257cfced4fa3763c155775ab00","observation_id":"a0eb3204-d47b-4932-989b-f31207c9fd14","resolution":{"observed_at":"2026-07-11T12:55:57.279598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.17625/citation-record","integrity":"/paper/2502.17625/integrity","json":"/paper/2502.17625/citation-record.json","paper":"/paper/2502.17625"},"outbound":[],"paper":{"arxiv_id":"2502.17625","last_updated":"2025-02-24T20:20:06Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:51:59.763334Z","submitted_at":"2025-02-24T20:20:06Z","title":"Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.17625."}