{"as_of":"2026-08-11T12:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e7d3e1a40aca533f2940918cce37973cf1e212785e934609ce1edbb7284fc32e","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":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":35,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:57:03.256822Z","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-04T10:09:44.784535Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-10T14:57:03.256822Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14928","last_updated":"2025-01-24T21:31:50Z","snapshot_observed_at":"2026-08-11T00:53:47.993816Z","submitted_at":"2025-01-24T21:31:50Z","title":"Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T14:57:03.256822Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2501.14928"},"observation_digest":"sha256:1d9aff66330fdf45d3cf64d1928886ba7f26c67d034d19d626e3b21c62e5097e","observation_id":"aef0ad32-66d6-4671-a3ed-835349b9e30b","resolution":{"observed_at":"2026-08-10T14:57:03.256822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-08T17:24:36.461658Z","title":"The statistical complexity of interactive decision making","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05974","last_updated":"2025-04-30T18:53:12Z","snapshot_observed_at":"2026-08-10T10:01:40.302822Z","submitted_at":"2025-02-09T17:59:42Z","title":"Decision Making in Hybrid Environments: A Model Aggregation Approach","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T17:24:36.461658Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2502.05974"},"observation_digest":"sha256:64649424bd73449ddf24af438aa3e948d1fae17557cd6c0f3656639144664c19","observation_id":"d8ef6d7e-7030-4a39-ae2e-6b51e5cc7c89","resolution":{"observed_at":"2026-08-08T17:24:36.461658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-07T19:20:12.598167Z","title":"J., Kakade, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.10158","last_updated":"2025-06-05T01:30:34Z","snapshot_observed_at":"2026-08-09T08:55:20.940990Z","submitted_at":"2025-02-14T13:37:02Z","title":"Combinatorial Reinforcement Learning with Preference Feedback","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T19:20:12.598167Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2502.10158"},"observation_digest":"sha256:6115cdc880dffe953d5a9dadb57162f21aaaaa9208b3be737c80c6fa431e3d88","observation_id":"2f8a65c8-fb8b-4f3f-8849-0f9032f82e28","resolution":{"observed_at":"2026-08-07T19:20:12.598167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-07T14:10:41.018786Z","title":"The statistical complexity of interactive decision making","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.20268","last_updated":"2025-07-24T14:21:12Z","snapshot_observed_at":"2026-08-08T15:11:42.219804Z","submitted_at":"2025-05-26T17:44:08Z","title":"Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T14:10:41.018786Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2505.20268"},"observation_digest":"sha256:ddb52fb3745fb504bf268ffa39cba138d4be4877506072085e94d20f1d4344de","observation_id":"6175d15b-2341-4241-97de-71e84f8e76d0","resolution":{"observed_at":"2026-08-07T14:10:41.018786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-07T13:35:52.527298Z","title":"The statistical complexity of interactive decision making","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21666","last_updated":"2025-05-27T18:46:21Z","snapshot_observed_at":"2026-08-11T06:17:30.949826Z","submitted_at":"2025-05-27T18:46:21Z","title":"Efficient Controllable Diffusion via Optimal Classifier Guidance","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T13:35:52.527298Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2505.21666"},"observation_digest":"sha256:b51aa512ba6f2aaaf0582658b91b4a65ae99b6fad22349ffde491c1ea12b6b53","observation_id":"a368d61a-bd03-4875-8d09-8fc017794761","resolution":{"observed_at":"2026-08-07T13:35:52.527298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-07T10:35:33.596382Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05295","last_updated":"2025-06-12T16:25:06Z","snapshot_observed_at":"2026-08-11T06:13:15.157161Z","submitted_at":"2025-06-05T17:48:19Z","title":"Sample Complexity and Representation Ability of Test-time Scaling Paradigms","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T10:35:33.596382Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2506.05295"},"observation_digest":"sha256:88e684093fe68c3b5b33f280acdd21524942e031c911aaf9eddfecaa8e917548","observation_id":"bd1cf12c-0a9d-4040-8465-c2e8df431de4","resolution":{"observed_at":"2026-08-07T10:35:33.596382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-07T04:54:03.157341Z","title":"J., Kakade, S","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.09940","last_updated":"2025-06-11T17:06:57Z","snapshot_observed_at":"2026-08-11T00:04:02.140237Z","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":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:54:03.157341Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2506.09940"},"observation_digest":"sha256:7c34ecf01c3254092c65fb18843583962e525e54588a23f9be97b27073ccae84","observation_id":"72a59660-db8a-49c2-aad2-4e1a3f2553bb","resolution":{"observed_at":"2026-08-07T04:54:03.157341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-06T22:16:40.263471Z","title":"Foster, D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.22401","last_updated":"2025-06-27T17:18:43Z","snapshot_observed_at":"2026-08-09T23:52:30.102251Z","submitted_at":"2025-06-27T17:18:43Z","title":"Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T22:16:40.263471Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2506.22401"},"observation_digest":"sha256:1e28eed54d7951189900e9cc2c946c9c9a1427be7ded676b1e1cff09fda13e44","observation_id":"514554d3-7a2a-4049-bfd0-f334b90c48a4","resolution":{"observed_at":"2026-08-06T22:16:40.263471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-06T21:17:36.383575Z","title":"arXiv preprint arXiv:2112.13487","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.00851","last_updated":"2025-07-01T15:22:56Z","snapshot_observed_at":"2026-08-06T21:02:50.338224Z","submitted_at":"2025-07-01T15:22:56Z","title":"Aligning Learning and Endogenous Decision-Making","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T21:17:36.383575Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2507.00851"},"observation_digest":"sha256:dd61c1c5cf3659d269477cb2c58f7203bd10408d0e362d1661915ab61ae19df7","observation_id":"53fc70dc-f320-4f15-8064-53f57bb66d6c","resolution":{"observed_at":"2026-08-06T21:17:36.383575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-06T16:15:15.683085Z","title":"arXiv preprint arXiv:2112.13487","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.14444","last_updated":"2025-07-19T02:42:41Z","snapshot_observed_at":"2026-08-06T15:53:50.693798Z","submitted_at":"2025-07-19T02:42:41Z","title":"Statistical and Algorithmic Foundations of Reinforcement Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:15.683085Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2507.14444"},"observation_digest":"sha256:7ac84684d73f2daa1d3f540a7d89b172ca329aaa5d7461aac95afc5a23665510","observation_id":"87b205ca-c24e-4ca0-8376-572f95508cd7","resolution":{"observed_at":"2026-08-06T16:15:15.683085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-04T22:59:14.485864Z","title":"The statistical complexity of interactive decision making.arXiv:2112.13487,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.06941","last_updated":"2025-09-08T17:52:56Z","snapshot_observed_at":"2026-08-07T12:11:53.268632Z","submitted_at":"2025-09-08T17:52:56Z","title":"Outcome-based Exploration for LLM Reasoning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T22:59:14.485864Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2509.06941"},"observation_digest":"sha256:12884ccd42765b43087f1501fe5c37a86446751610ff6239538656c1cdf06c43","observation_id":"4e0d72bb-28eb-42d3-b440-06304a84dbfb","resolution":{"observed_at":"2026-08-04T22:59:14.485864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2510.21060","last_updated":"2026-05-13T01:55:58Z","snapshot_observed_at":"2026-08-08T09:53:07.021031Z","submitted_at":"2025-10-24T00:21:38Z","title":"On the Sample Complexity of Differentially Private Policy Optimization","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-05-18T04:43:58.646419Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2510.21060"},"observation_digest":"sha256:eff2fc38bfc999de6c6ba706d606277c87eeeac199ff3744e5f117c1c2a4a934","observation_id":"0dba9850-a5bb-45d4-be86-48bca3d4b3f2","resolution":{"observed_at":"2026-05-18T04:45:54.795550Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-03T00:05:18.807556Z","title":"J., Kakade, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-10T14:41:03.221548Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.807556Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:87fc548bbdba20ca123c05b645b37f1d34e29967fe40b0f95eeeae08e44277a7","observation_id":"c94e0e3c-0efa-48ba-a635-bdad8d11c124","resolution":{"observed_at":"2026-08-03T00:05:18.807556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2604.13966","last_updated":"2026-04-15T15:17:40Z","snapshot_observed_at":"2026-08-08T02:57:57.796032Z","submitted_at":"2026-04-15T15:17:40Z","title":"Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T12:55:12.531822Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2604.13966"},"observation_digest":"sha256:9d377da9565dafbf2a581580c2a29c1ad09a0a36fe238a0c92db90d105f2aa22","observation_id":"0ca8176c-65fb-4edb-a34b-ff273d8463e2","resolution":{"observed_at":"2026-05-10T12:55:24.142838Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.00393","last_updated":"2026-05-01T04:32:23Z","snapshot_observed_at":"2026-07-06T23:13:47.082550Z","submitted_at":"2026-05-01T04:32:23Z","title":"Model-Based Reinforcement Learning with Double Oracle Efficiency in Policy Optimization and Offline Estimation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-09T20:27:03.746672Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.00393"},"observation_digest":"sha256:946f9ec5caf1c86fe043670ac570c8b3f38a1c148b59b42412716c8aae6f5de4","observation_id":"2b3c28a6-3198-4c56-98da-4c054d175b86","resolution":{"observed_at":"2026-05-11T15:16:05.113377Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.01778","last_updated":"2026-05-03T08:31:24Z","snapshot_observed_at":"2026-08-10T21:26:03.912668Z","submitted_at":"2026-05-03T08:31:24Z","title":"Adversarial Imitation Learning with General Function Approximation: Theoretical Analysis and Practical Algorithms","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:34.582807Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.01778"},"observation_digest":"sha256:a47946ed1afa9fc7c339a9f7fee78824e249f05498a7940c7cae84413a309cfb","observation_id":"bf1c70b9-1da1-43f5-ad63-86e7653d541f","resolution":{"observed_at":"2026-05-11T10:41:02.762180Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.02141","last_updated":"2026-05-04T01:46:35Z","snapshot_observed_at":"2026-08-11T01:20:14.028287Z","submitted_at":"2026-05-04T01:46:35Z","title":"On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T19:35:59.832868Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.02141"},"observation_digest":"sha256:7e88f45d3758580a11af98e958ed232da3dd035b89a6946566314a1935ab2d59","observation_id":"4c5e4011-9df5-454c-93b7-c394a3249e31","resolution":{"observed_at":"2026-05-09T05:45:22.288095Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.05791","last_updated":"2026-05-07T07:26:58Z","snapshot_observed_at":"2026-07-06T23:18:22.301347Z","submitted_at":"2026-05-07T07:26:58Z","title":"A Measure-Theoretic Finite-Sample Theory for Adaptive-Data Fitted Q-Iteration","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-09T15:44:02.195783Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.05791"},"observation_digest":"sha256:86b49d5beeac7d620d746359c958d7b99bb8a77af1d7cde4a8723275c4bfd1a0","observation_id":"c1d7bca8-0efd-4e66-84e4-bf20ff7760ce","resolution":{"observed_at":"2026-05-11T16:36:09.943214Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.07155","last_updated":"2026-05-08T02:41:23Z","snapshot_observed_at":"2026-08-11T12:11:20.747187Z","submitted_at":"2026-05-08T02:41:23Z","title":"Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-11T01:21:59.268084Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.07155"},"observation_digest":"sha256:0380a3f69c966b3b3a3e318505dc2008c8e448f021afdc988a74300bf6a5174e","observation_id":"9d9a938a-8d61-486c-8d62-912b4776db4c","resolution":{"observed_at":"2026-05-11T04:25:58.860706Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.09200","last_updated":"2026-06-30T16:11:31Z","snapshot_observed_at":"2026-08-10T07:29:54.039961Z","submitted_at":"2026-05-09T22:40:40Z","title":"A Complete Characterization of Learnability for Adversarial Noisy Bandits","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-12T02:02:48.212653Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.09200"},"observation_digest":"sha256:d2091a5a680543d0347d321769071959bf88186b050b18a2978ad621dc7a885f","observation_id":"63b893e9-ed82-488b-9abe-c463b1effeed","resolution":{"observed_at":"2026-05-12T02:06:15.443311Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.09200","last_updated":"2026-06-30T16:11:31Z","snapshot_observed_at":"2026-08-10T07:29:54.039961Z","submitted_at":"2026-05-09T22:40:40Z","title":"A Complete Characterization of Learnability for Adversarial Noisy Bandits","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-01T07:23:53.260504Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.09200"},"observation_digest":"sha256:673734dcf6bd804ae383bfd7134bdaf5fd9e214cc0bb9fda67400c069e0a8cbe","observation_id":"f626952e-a6f7-4767-915c-006b9f882869","resolution":{"observed_at":"2026-07-01T08:15:32.494600Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.12316","last_updated":"2026-05-12T16:01:29Z","snapshot_observed_at":"2026-08-08T17:36:33.886659Z","submitted_at":"2026-05-12T16:01:29Z","title":"Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-13T06:55:33.934110Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.12316"},"observation_digest":"sha256:c0192f29bbd11c5c428ef5793262c60a22185cf6a8485254f713fdbfc104efdf","observation_id":"63bbe911-60d1-48a2-95b3-8b054b1ead58","resolution":{"observed_at":"2026-05-13T06:57:27.846931Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2605.29645","last_updated":"2026-05-28T09:12:20Z","snapshot_observed_at":"2026-07-06T23:39:01.234601Z","submitted_at":"2026-05-28T09:12:20Z","title":"The Sample Complexity of Multiclass and Sparse Contextual Bandits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T09:17:56.858336Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2605.29645"},"observation_digest":"sha256:fb12ce9b456c920537eb3dad9c6ebb70f79750dc9390a148575fffba05e97471","observation_id":"42f0dcc2-882c-4883-a139-2e8daf16d3cf","resolution":{"observed_at":"2026-06-29T09:23:16.500563Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2606.01382","last_updated":"2026-05-31T18:11:26Z","snapshot_observed_at":"2026-08-06T07:55:08.019280Z","submitted_at":"2026-05-31T18:11:26Z","title":"Efficient Exploration for Iterative Nash Preference Optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-28T17:33:36.210383Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.01382"},"observation_digest":"sha256:e6be391e4846baaa04deff65386357a5540882210375b90c103a374cf10ff86f","observation_id":"31a1e1f2-4b59-4bb5-b69b-115c1aa3c06a","resolution":{"observed_at":"2026-07-01T21:06:13.273759Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2606.02363","last_updated":"2026-08-09T14:26:06Z","snapshot_observed_at":"2026-08-11T11:21:37.456347Z","submitted_at":"2026-06-01T15:11:51Z","title":"Minimax-Optimal Policy Regret in Partially Observable Markov Games","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-28T15:51:51.011171Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.02363"},"observation_digest":"sha256:ad2ed0b217a949bb29692d2174ae7035d8db3bd3c34b4be599c30fb354455a3a","observation_id":"ea994175-9c6e-4298-9d7d-db20b757d732","resolution":{"observed_at":"2026-07-01T21:56:16.605134Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2606.07931","last_updated":"2026-07-02T11:57:03Z","snapshot_observed_at":"2026-08-02T02:38:07.014999Z","submitted_at":"2026-06-06T01:50:06Z","title":"Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T19:47:01.533756Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.07931"},"observation_digest":"sha256:c7025e0a95beedf5e86ff4dea42f945a5aec97d12543bac38a1ee15c0c5eca35","observation_id":"f0c0f863-0ab2-4129-8238-2afcaf6e7ad9","resolution":{"observed_at":"2026-07-02T21:27:24.290656Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2606.07931","last_updated":"2026-07-02T11:57:03Z","snapshot_observed_at":"2026-08-02T02:38:07.014999Z","submitted_at":"2026-06-06T01:50:06Z","title":"Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-04T00:06:37.737448Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.07931"},"observation_digest":"sha256:d15dd6c562111d0289151e69c4d6cdfc4e20222ae0fecfb72bf88eb4a9efd8d5","observation_id":"4bfb3df0-2b9b-4b5d-b9fd-d2aa55230a01","resolution":{"observed_at":"2026-07-04T00:09:13.877305Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2606.11171","last_updated":"2026-07-25T21:50:01Z","snapshot_observed_at":"2026-08-02T11:53:46.153456Z","submitted_at":"2026-06-09T17:49:09Z","title":"Bellman-sufficient Information Complexity","version":5},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T13:39:24.488442Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.11171"},"observation_digest":"sha256:497caced7d4be36a95c2596177ef9f619cdbd6dd6e9ac6147206df94d9541d86","observation_id":"81b248d7-509b-4599-a6c8-374a4d49391b","resolution":{"observed_at":"2026-07-03T04:47:38.220920Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2606.11171","last_updated":"2026-07-25T21:50:01Z","snapshot_observed_at":"2026-08-02T11:53:46.153456Z","submitted_at":"2026-06-09T17:49:09Z","title":"Bellman-sufficient Information Complexity","version":6},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-03T23:44:25.951719Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.11171"},"observation_digest":"sha256:d0e7fa316acdf04453a0c57ccd8d5b2972fa7af9fc098d14f1f8d8f680a24f33","observation_id":"6c98591b-7fc4-4a52-8533-fe48f36e188f","resolution":{"observed_at":"2026-07-03T23:49:01.907513Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-12T14:23:15.089919Z","title":"Foster, Sham M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11171","last_updated":"2026-07-25T21:50:01Z","snapshot_observed_at":"2026-08-02T11:53:46.153456Z","submitted_at":"2026-06-09T17:49:09Z","title":"Bellman-sufficient Information Complexity","version":7},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T14:23:15.089919Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.11171"},"observation_digest":"sha256:d2749eded824c08244b8d9cb7262b1e90c8865a31954f295f2bb8b6a6e6a25d8","observation_id":"21e39845-975e-4492-81fa-fecd1d162956","resolution":{"observed_at":"2026-07-12T14:23:15.089919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-02T11:53:50.464739Z","title":"Foster, Sham M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.11171","last_updated":"2026-07-25T21:50:01Z","snapshot_observed_at":"2026-08-02T11:53:46.153456Z","submitted_at":"2026-06-09T17:49:09Z","title":"Bellman-sufficient Information Complexity","version":9},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T11:53:50.464739Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.11171"},"observation_digest":"sha256:f224c9b64190258f9d78db804c4aade1524059dd4ad61199d25b2ed2ebedd64f","observation_id":"c61c458a-8827-46d4-a446-6ffd9bbf14e6","resolution":{"observed_at":"2026-08-02T11:53:50.464739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2606.23096","last_updated":"2026-06-22T09:41:48Z","snapshot_observed_at":"2026-08-08T14:15:20.970228Z","submitted_at":"2026-06-22T09:41:48Z","title":"Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T09:08:12.265743Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.23096"},"observation_digest":"sha256:9383b723f9cf59f1e42ab1ef47e6a3aa6d0b13e588d444f581a92294060f0aef","observation_id":"8dad71f1-51bc-4847-b092-7e0c4ee70d2c","resolution":{"observed_at":"2026-07-04T10:09:44.785943Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":"2112.13487","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-04T10:09:44.784535Z","title":"Limitations","venue":null,"work_id":"acfee5c7-1660-4c22-af44-7051eb52bc00","year":2021},"citing_paper":{"arxiv_id":"2606.30923","last_updated":"2026-06-29T21:18:21Z","snapshot_observed_at":"2026-08-02T18:20:53.813564Z","submitted_at":"2026-06-29T21:18:21Z","title":"Behavior Cloning is Not All You Need: The Optimality of On-Policy Distillation for Noisy Expert Feedback","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-01T06:21:48.752660Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2606.30923"},"observation_digest":"sha256:e92f4c377adf57f5b57defa12c35f28e36ca6fc1421c914328307cd009c2a39a","observation_id":"a8fb321c-9df3-4542-a87f-7995e04d9b49","resolution":{"observed_at":"2026-07-01T09:45:39.384270Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-07-13T01:00:14.236570Z","title":"The statistical complexity of interactive decision making.arXiv preprint arXiv:2112.13487, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09015","last_updated":"2026-07-10T00:42:10Z","snapshot_observed_at":"2026-08-06T16:16:37.929128Z","submitted_at":"2026-07-10T00:42:10Z","title":"Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T01:00:14.236570Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2607.09015"},"observation_digest":"sha256:35dc487aefc64a4bfee56f8b38061bf4e54041f66622ae323819f98f370115a5","observation_id":"7959661f-ed1c-4527-88cf-95d33fb829f6","resolution":{"observed_at":"2026-07-13T01:00:14.236570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-01T17:37:49.225830Z","title":"arXiv preprint arXiv:2112.13487 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17607","last_updated":"2026-08-05T04:57:10Z","snapshot_observed_at":"2026-08-10T17:42:07.622592Z","submitted_at":"2026-07-20T06:53:59Z","title":"Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T17:37:49.225830Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2607.17607"},"observation_digest":"sha256:86d4c503d26f326f59c91fcdac16a22438e9a9259a59adf1091742c117011281","observation_id":"cec2f21c-47e1-4e66-a803-064564e9beb5","resolution":{"observed_at":"2026-08-01T17:37:49.225830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2112.13487/citation-record","integrity":"/paper/2112.13487/integrity","json":"/paper/2112.13487/citation-record.json","paper":"/paper/2112.13487"},"outbound":[],"paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T14:40:29.128964Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 35 inbound Pith citation observations for arXiv:2112.13487."}