{"as_of":"2026-08-11T06:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b665e4b0763870adbbcc1231731518d9459deb2db735b7609a82e216e20fba18","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:55:46.340114Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-12T02:54:50.859497Z","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-12T02:56:18.929640Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"cited_work":{"arxiv_id":"2505.17400","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17400","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Minimax rate-optimal algorithms for high-dimensional stochastic linear bandits","venue":null,"work_id":"9e26285d-50d3-459c-a940-a329d08f5937","year":2025},"citing_paper":{"arxiv_id":"2605.10151","last_updated":"2026-05-11T07:57:37Z","snapshot_observed_at":"2026-08-02T16:48:29.759908Z","submitted_at":"2026-05-11T07:57:37Z","title":"Learning to Sparsify Stochastic Linear Bandits","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-12T02:54:50.859497Z"},"links":{"cited_paper":"/paper/2505.17400","citing_paper":"/paper/2605.10151"},"observation_digest":"sha256:f1ec400faeb2690826192dc71a4b74e428f3e79fd35253813851285af97afb96","observation_id":"292b7133-d9fb-46ba-8a43-b7d4a9ea002e","resolution":{"observed_at":"2026-05-12T02:56:18.932358Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2505.17400/citation-record","integrity":"/paper/2505.17400/integrity","json":"/paper/2505.17400/citation-record.json","paper":"/paper/2505.17400"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:58.571921Z","title":"and S ZEPESVÁRI , C","venue":null,"work_id":"05da0140-a9e6-42ae-8b96-f628f63d5dbb","year":2011},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.262298Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:c145f12d1dbb1c8a5b054c70b63e63846c0821fe4080ef9701dde9811ad570ed","observation_id":"515638a4-6116-4017-b9ca-719523d9afcd","resolution":{"observed_at":"2026-08-07T14:55:58.685369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:58.381388Z","title":"and G OYAL, N","venue":null,"work_id":"5fa61af9-1aee-4793-af68-716620b92aaf","year":2012},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.338179Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:9a9e8c8dc096ee348b594b37477afa438e5c4e588766d550bdb759940ba7b3a0","observation_id":"44df0d26-4c12-4ab5-80fd-bd8651309eb4","resolution":{"observed_at":"2026-08-07T14:55:58.464863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:58.190926Z","title":"and P ROUTIÈRE , A","venue":null,"work_id":"f01cfa72-7d44-4bcc-9e6c-360a34af0ee7","year":2022},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.388262Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:b463fdcd2b87d5e97b7c3ec5e44510f0a665a954f6a0b37bb67e407432f22988","observation_id":"38b64122-7926-40f7-a18a-d82ad16f3f39","resolution":{"observed_at":"2026-08-07T14:55:58.258336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:57.926690Z","title":"and B UBECK , S","venue":null,"work_id":"daef09b5-1391-4008-a9c8-b865f51f53be","year":2009},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.431501Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:7c45823669e94d3875d5098f150e65447fc995f9ed29e6ac7e4a080fc4ce8d2d","observation_id":"6ddcfd06-1920-4b26-9a67-821371d122a8","resolution":{"observed_at":"2026-08-07T14:55:58.038313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:57.704770Z","title":"and F ISCHER , P","venue":null,"work_id":"43505b53-bbae-424c-a2d4-100ad1048135","year":2002},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.509861Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:293159cdf639699aa734529334fd72adad8e9ac0f5c0be942f43b8728df5f2fb","observation_id":"d28d2c57-321b-4a26-bb1e-f2f7e30e9f5a","resolution":{"observed_at":"2026-08-07T14:55:57.809724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:57.456888Z","title":"and S CHAPIRE , R","venue":null,"work_id":"c0d05b44-475f-4ab4-ae00-f1c9ec7edbf3","year":2002},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.588798Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:95816e0134c41882e2e6ceea9490ddc03f2503ba4ecd12749d94bd4efe490365","observation_id":"1197f2c8-1369-4391-89ea-695a27e0eff0","resolution":{"observed_at":"2026-08-07T14:55:57.579076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:57.206478Z","title":"and B AYATI, M","venue":null,"work_id":"f439d643-c63b-4bac-a9e7-220762f26ab2","year":2020},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.677055Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:9051754e6617247a960b0bace0f450077ffb7b3111b9c617165874af1e9846d0","observation_id":"67212544-a335-4e07-aa96-df93c9869aa4","resolution":{"observed_at":"2026-08-07T14:55:57.315943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:56.982218Z","title":"and K HOSRAVI , K","venue":null,"work_id":"b59d9c72-e9b1-4bc6-a97f-957ca74372b6","year":2021},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.718565Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:b7f074fb5990e4c5b4cac257f37536840482d55dbcbdb887d943550fcc1a0ea8","observation_id":"df0aa54c-df50-43fa-9e58-621ded4c3c22","resolution":{"observed_at":"2026-08-07T14:55:57.108460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:56.775116Z","title":null,"venue":null,"work_id":"0cb1148d-2eab-4ca3-88bb-153c698923b9","year":2022},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.835968Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:04bd509b5e5fdbbdb95c40b35d959ade6d05c2c3e2fbde6ecaa4da238f276e20","observation_id":"5cdaba1c-f4d5-4ebf-8eae-938d5d752b57","resolution":{"observed_at":"2026-08-07T14:55:56.860162Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:56.648033Z","title":"and C HERNOZHUKOV , V","venue":null,"work_id":"d33c0347-a5b0-4e37-87b1-5f77666bdef9","year":2013},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.921844Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:450410a58ad33266d928fff3e805b34aa7ca78974039453a906b71bdafff5400","observation_id":"7349b0cf-29ff-4486-a022-04efa587ce9b","resolution":{"observed_at":"2026-08-07T14:55:56.691996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:41.990512Z","title":"and CESA -BIANCHI , N","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:41.990512Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:9c0269ad6e91214f6f1615b7c5473ae0b48acce549e79c44467a8f5afc65c0f7","observation_id":"a8560043-049f-4819-9b8e-15181ba05e2b","resolution":{"observed_at":"2026-08-07T14:55:41.990512Z","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-07T14:55:56.450306Z","title":"and VAN DE GEER , S","venue":null,"work_id":"187eb114-128a-45ee-825c-bb816a4bb111","year":2011},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.023581Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:d0239ccf1aba9a7c7acad82b00e6be5c8937ebb68eac9b3b9e09e58fa355e20a","observation_id":"4796eae4-decf-4f95-9d55-0a2e0b1f5bcd","resolution":{"observed_at":"2026-08-07T14:55:56.572633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:56.224959Z","title":"and L I, L","venue":null,"work_id":"1440dac1-762d-444c-98d9-56f945454fb2","year":2011},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.091950Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:1ce7e0e72252d773d902e4f01c904022823769e93cd71fe4467a95edc2962526","observation_id":"8a6743c9-be1b-497a-b521-9f1a1f217359","resolution":{"observed_at":"2026-08-07T14:55:56.379574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:55.916594Z","title":"and S HARPNACK , J","venue":null,"work_id":"49df5c3a-d933-4069-848b-f4be983240bd","year":2021},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.157134Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:dc35050ee6a3e6a69cbae303480a1c3539bed277bd8b962dd4dd79d72ee84990","observation_id":"daf8999e-770e-4cfc-a658-9b0584338fb2","resolution":{"observed_at":"2026-08-07T14:55:56.043122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:55.711686Z","title":null,"venue":null,"work_id":"b120b531-be93-4314-99b0-c2a0bd74c34c","year":1995},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.255948Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:eb8d89849c97d353c56c928143e979c05edb2489068bdde554c9e46625b50aa6","observation_id":"5869f109-900b-47ea-af7b-c9ccc0744031","resolution":{"observed_at":"2026-08-07T14:55:55.817086Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:55.592689Z","title":"and Z EEVI , A","venue":null,"work_id":"9c973eb4-15a9-42e1-bd2b-bc27b281b398","year":2013},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.303238Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:2c30d7beb902806ef628e85499a15d135f951843b23f78003375d731030fd3cb","observation_id":"6f89ae78-8b5a-4522-9158-625446928903","resolution":{"observed_at":"2026-08-07T14:55:55.644275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2002.05152","last_updated":"2022-03-31T22:56:43Z","snapshot_observed_at":"2026-08-03T21:43:44.929018Z","submitted_at":"2020-02-12T18:54:41Z","title":"A General Theory of the Stochastic Linear Bandit and Its Applications","version":4},"cited_work":{"arxiv_id":"2002.05152","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.05152","snapshot_observed_at":"2026-08-07T14:55:46.848141Z","title":"A General Theory of the Stochastic Linear Bandit and Its Applications","venue":"cs.LG","work_id":"58e1baf0-616b-42c6-b984-4e88b2acbf30","year":2020},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.368551Z"},"links":{"cited_paper":"/paper/2002.05152","citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:6007e90b0fc2255981e7e51cb6b295cd258aa8db8376f04136b26c35ed3639cf","observation_id":"72f01c82-2f53-4b40-b1c7-bb6606853bef","resolution":{"observed_at":"2026-08-07T14:55:46.949588Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:55.466260Z","title":"and W ANG , M","venue":null,"work_id":"f5612568-7c1a-4306-b5cb-998fc6ce13f1","year":2020},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.413077Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:e335d9e450c85f8bb72385cb67e06635ac316a2fd8c1662e92dcf95408f60314","observation_id":"b540f5d2-9853-4097-9a9b-e31f16894efe","resolution":{"observed_at":"2026-08-07T14:55:55.514592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1902.03736","last_updated":"2019-02-11T05:41:28Z","snapshot_observed_at":"2026-08-01T10:38:57.624492Z","submitted_at":"2019-02-11T05:41:28Z","title":"A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.03736","snapshot_observed_at":"2026-08-07T14:55:42.498133Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.498133Z"},"links":{"cited_paper":"/paper/1902.03736","citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:abca00a378842e5fc62f4c9ae9b4a8b7bcc6dbf9598e0d1d58376d3476077f47","observation_id":"c0270d7c-c03b-4f72-845b-d59b8b71296d","resolution":{"observed_at":"2026-08-07T14:55:42.498133Z","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-07T14:55:55.237976Z","title":"and W ILLETT , R","venue":null,"work_id":"a39afcfe-c608-4cb7-bd2e-3def5cf81d08","year":2017},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.582341Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:d1328f918e28f52c7caf0c8276603b7985aa9b236efb11adbfd45ee1fff811fb","observation_id":"b0a78d7e-6041-4d18-ad7e-69e2fd64ea44","resolution":{"observed_at":"2026-08-07T14:55:55.340897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:55.078369Z","title":"M., S HALEV -S HWARTZ , S","venue":null,"work_id":"8cb008ae-7257-4539-9527-5caa8babdd2b","year":2008},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.689799Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:88f990c4f74160f4ce06f71de5ebe3ef9cd44d7aec32a9142d7fb73830290cf4","observation_id":"04d689dc-f49f-48ef-8210-d25dd1ece567","resolution":{"observed_at":"2026-08-07T14:55:55.130842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:54.933588Z","title":"and P AIK , M","venue":null,"work_id":"f358f9c0-d601-401e-8108-bf13635d8ccd","year":2019},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.724626Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:7bd0f13169cfda6ded425c915f13ab6faeaf41fa489c2c02ced5c77ced260581","observation_id":"8c833a9f-d83a-408d-98fd-2337dc71c37b","resolution":{"observed_at":"2026-08-07T14:55:54.992291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:54.545563Z","title":"L., R OBBINS , H","venue":null,"work_id":"7563a980-bd5a-4b47-aef7-c6d011dcdfad","year":1985},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.771144Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:5bcd3655749aa83093f490265e3cd704b370e2e803caed3a0739b815b8098bad","observation_id":"acb2b1c6-bd55-457e-a653-1719f56199e9","resolution":{"observed_at":"2026-08-07T14:55:54.869784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:54.388232Z","title":"and S ZEPESVÁRI , C","venue":null,"work_id":"d75d3302-c529-418a-969f-076a661e48a6","year":2020},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.837946Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:a9aa02381babd65c7b8507469a18b57270c0a37de01168fff50dd9f64b15056d","observation_id":"652026f8-3687-4821-b13b-cbf11d2bae16","resolution":{"observed_at":"2026-08-07T14:55:54.465427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:54.085687Z","title":"and S CHAPIRE , R","venue":null,"work_id":"797cee45-14cc-4265-82d6-9e3c7cebfd58","year":2010},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:42.911255Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:a5ec80b8a5ea8fe21e07aa0227cb5efa0df1b10a2154f1d970472c47a6a8c31a","observation_id":"731160a4-611a-4a74-8d76-d541d5ab4109","resolution":{"observed_at":"2026-08-07T14:55:54.224775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:53.793025Z","title":"and S CHAPIRE , R","venue":null,"work_id":"69e91313-164c-4ecb-8a5b-a7c1da9efa0c","year":2010},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.001835Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:d63c65ce2f24d1c7315ff34277067ce1d137a0c4c687938189dbad225d843994","observation_id":"f38d98c9-a61b-4357-b4f4-5d7d443345ee","resolution":{"observed_at":"2026-08-07T14:55:53.906854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:53.543570Z","title":"and Z EEVI , A","venue":null,"work_id":"62a39c8d-43ec-4823-a645-f28c76ad323f","year":2021},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.090646Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:9ed961a3eadf8e70166528146fe246a71a27c82239890cd48c0778202c0d2318","observation_id":"e1e5f784-a63d-4137-9328-a3ba73706309","resolution":{"observed_at":"2026-08-07T14:55:53.636774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:53.227269Z","title":"and R IGOLLET , P","venue":null,"work_id":"d4b9f9f1-a46d-4e9d-8297-d37cdd2bbeeb","year":2013},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.146468Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:460435dc0c133792d785b9fe7287fa2667e8c2953ab0e3cdd8530a9205013eb9","observation_id":"5f40f897-0526-44e4-b053-6f6fdca6712d","resolution":{"observed_at":"2026-08-07T14:55:53.379305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:52.923664Z","title":null,"venue":null,"work_id":"4525645d-e91f-45e2-8a74-d497924cca09","year":2011},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.196307Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:5d8606cd7e1285d015daa8ae3acd661784b3b23c2d27719269171c15c3b53b11","observation_id":"13757d65-b819-4905-bd47-f94e82cd347b","resolution":{"observed_at":"2026-08-07T14:55:53.071911Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:52.653371Z","title":"and Z HOU , Z","venue":null,"work_id":"46593624-8e51-4879-891c-72c5f646cb55","year":2024},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.271846Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:0fcce418b2e61e9290072a6824494c5d05dfb380237305f06f6ba7f77eefac87","observation_id":"a69c909f-5b82-404b-b727-9c1a4f468d91","resolution":{"observed_at":"2026-08-07T14:55:52.764078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:52.417320Z","title":"and HÜTTER , J.-C","venue":null,"work_id":"b9044a6c-445b-41d9-9b73-b8c9ce3b5cb0","year":2023},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.349821Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:bb8b9458a4db12bc6a1f2094173ec66e09286e9412f2dec0f5ed9168464baad0","observation_id":"e79b2354-fdcc-4bd1-9e31-22c202e3bdef","resolution":{"observed_at":"2026-08-07T14:55:52.542308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:52.115924Z","title":null,"venue":null,"work_id":"0c64282b-03c7-40ad-bc5f-7330a2ad549d","year":1952},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.427133Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:5bb54995ba005a7501ddfe5fdabf6b7730045c8ad429efdb0bf3c08d153961bd","observation_id":"a823093c-0358-4395-a12c-5a3f8e2fa9db","resolution":{"observed_at":"2026-08-07T14:55:52.267773Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.922708Z","title":"and Z HOU , S","venue":null,"work_id":"2e50c3a0-61bc-4086-b256-61f0602908f9","year":2012},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.495149Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:af69ea9ce71e5f9a9625f60269844598e8b143009851abc6ef0f154808a1848b","observation_id":"027a1dff-8046-4c2e-b557-226d488d5ed7","resolution":{"observed_at":"2026-08-07T14:55:51.982353Z","resolver_source":"raw_fallback","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.720501Z","title":"and V AN ROY, B","venue":null,"work_id":"619ac3de-d8b5-47ba-8b53-cfdfd21316e1","year":2018},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.585305Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:02b144413390517be3c7ac5b541881b9b9f0b7e6ddc2455040856ef97eb3bc2a","observation_id":"41a31e05-bb43-4f1d-917e-d9d2100b70e2","resolution":{"observed_at":"2026-08-07T14:55:51.818760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.485226Z","title":null,"venue":null,"work_id":"7f120f84-af8a-410b-b2b1-710fa63346f7","year":2012},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.656187Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:bf95d68a5ec408fd77a052055fead7001da8729f9a6c4218defc763da125a3e0","observation_id":"792e8841-a131-483f-bf27-d06f703925e3","resolution":{"observed_at":"2026-08-07T14:55:51.594662Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2202.11735","last_updated":"2025-05-05T23:13:21Z","snapshot_observed_at":"2026-07-06T12:41:03.022395Z","submitted_at":"2022-02-23T19:01:27Z","title":"Truncated LinUCB for Stochastic Linear Bandits","version":4},"cited_work":{"arxiv_id":"2202.11735","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.11735","snapshot_observed_at":"2026-08-07T14:55:46.539006Z","title":"Truncated LinUCB for Stochastic Linear Bandits","venue":"stat.ML","work_id":"7bbaf814-5b06-444a-a6dc-edb2337209c6","year":2022},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.762009Z"},"links":{"cited_paper":"/paper/2202.11735","citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:75375f5722a7b5c92fdfa6737f24816727b0826c3365bdbfee5e823779b2a01d","observation_id":"fd7ca121-6d6e-40c2-a4f4-186bc4a0dabe","resolution":{"observed_at":"2026-08-07T14:55:46.614635Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.270640Z","title":"and M URPHY , S","venue":null,"work_id":"168b8761-2e67-4329-a8ab-9be83aa33a8f","year":2017},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.856883Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:d497951c750fef3dff89a8a91fece928224f2e1008693ef087bd47b91046d685","observation_id":"f846eaa7-e2f8-4021-a1be-358fbfdb08a2","resolution":{"observed_at":"2026-08-07T14:55:51.366911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:51.117538Z","title":null,"venue":null,"work_id":"65358269-cf3d-4f4a-8740-dd61f0442460","year":1933},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:43.948872Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:da31472ff580d0a66a85859aeb0c781a3b2ba695aef44554b4a41c9f14705155","observation_id":"867adf4e-9655-4a37-a4ac-cd5c37fd35c8","resolution":{"observed_at":"2026-08-07T14:55:51.173186Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.958497Z","title":null,"venue":null,"work_id":"5e77a400-0b25-4881-8de3-67cfecfb3d75","year":1996},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.042824Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:06fba5f7da1216ca39b59873f90ba1c6d19037de9ccc726a56113b4911673d9c","observation_id":"2d265c5d-8333-4fea-99d9-53e411e4cd68","resolution":{"observed_at":"2026-08-07T14:55:51.016162Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.808568Z","title":"and Z HOU , S","venue":null,"work_id":"d92eb540-817f-41b1-8179-dde33cf1bfca","year":2011},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.110781Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:0ad213dd034835709dafc68cffdb9e2f7192844639e6d7e602282add7fde267e","observation_id":"588d1a1e-4d35-4b1b-99d0-db58ab37837c","resolution":{"observed_at":"2026-08-07T14:55:50.873867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.677199Z","title":null,"venue":null,"work_id":"409d3c8d-71b5-4e26-a5ae-3da98f8fcc06","year":2008},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.202758Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:8063b16724b1d8853e22535101ad3ab66eabc917ab11529fab59e44e04d8f36d","observation_id":"85233d8d-eb91-4b11-aa9f-9e421164ea0e","resolution":{"observed_at":"2026-08-07T14:55:50.723007Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.519305Z","title":null,"venue":null,"work_id":"b258d015-05b3-4f59-926b-ec602b43f2d9","year":2016},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.301433Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:ef9ace26bb43c29e48feb79d7a1935e82c3bd02a3cd9e0472cc2373d622ad701","observation_id":"d3c2f0dd-a74f-49ed-a07c-9a1fe7f4071f","resolution":{"observed_at":"2026-08-07T14:55:50.583828Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:44.399556Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.399556Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:903cfec3972f44783790c4a64d101dcffd17552bdf8ec4adef636c00aa6278e4","observation_id":"d8c766d0-6c23-4a0e-8a5f-b0b09f11e14b","resolution":{"observed_at":"2026-08-07T14:55:44.399556Z","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-07T14:55:50.298142Z","title":null,"venue":null,"work_id":"acf9d883-a7ee-4a97-9453-4a49224c6977","year":2009},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.623629Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:86aa4d8388b09979720d9d670bd1b00b8904e86ade3aef6760c2f0d88a352622","observation_id":"125b78c7-e360-4914-8cc4-2b0610c76d6e","resolution":{"observed_at":"2026-08-07T14:55:50.378541Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:50.154253Z","title":null,"venue":null,"work_id":"e38c03e8-4c56-495c-9ed8-a6f36872a5a0","year":2019},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.730399Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:a7829686e8245326a0124721e06e2c90d0d97ec6b7eb07f77235539108bc1f9f","observation_id":"4525c3e5-14c5-486d-962e-9a997fb2a990","resolution":{"observed_at":"2026-08-07T14:55:50.222393Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.961355Z","title":"and Y AO, T","venue":null,"work_id":"5acc386b-aee6-4d22-972e-ee25f9e68ed9","year":2018},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.796717Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:21cb356a01a12704744523e02fc9877c1e21c1da2eec0e6a9e735f23a1422df4","observation_id":"1607f6d2-5b93-4a00-b24d-5902f16aa596","resolution":{"observed_at":"2026-08-07T14:55:50.044492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:44.475279Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.475279Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:2492717ac4e44dbc56eea84ab870258282c630d2d6ab84156b5de5fa09806843","observation_id":"7217383e-bb4b-4ba9-a7b9-9fbcd71aa9f7","resolution":{"observed_at":"2026-08-07T14:55:44.475279Z","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-07T14:55:49.851748Z","title":"and LIN, Y","venue":null,"work_id":"add20ca4-f502-4d8f-8eaf-5d6bc6833c03","year":2006},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.851924Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:42d7806e22f52f7d5b1dfa54d440668e78a706bea51c9245996220e06a5c3482","observation_id":"90e44ebc-3f67-4b4b-880b-a2e7c3fb97d1","resolution":{"observed_at":"2026-08-07T14:55:49.903386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:44.943086Z","title":"and H UANG , J","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:44.943086Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:939b2a7e3f7a14489a8e5c5312748ab0f626cd4dca84df630cfdeccfdae429e1","observation_id":"b0285e68-d32b-48c3-84a6-16e771ae0183","resolution":{"observed_at":"2026-08-07T14:55:44.943086Z","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-07T14:55:49.729876Z","title":"and Y U, B","venue":null,"work_id":"2bfe2386-a9e8-44bb-80e4-bd72d11855a8","year":2006},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.072275Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:ef4f85c795a3fcf189f66cd4965faa60b4bed734d04a910c6ba4ba044d23aa23","observation_id":"8861a00c-90a5-4721-b815-f124284bd081","resolution":{"observed_at":"2026-08-07T14:55:49.778775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.536744Z","title":null,"venue":null,"work_id":"06711963-f685-400e-a77a-d221aee44e4d","year":2006},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.183674Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:216ad1b4894ea3cd4340836ca3a0f5e2886ae8264976485ff38ce06f1752b84b","observation_id":"9e3a5e88-c2e3-451d-89b9-a9cb604f404b","resolution":{"observed_at":"2026-08-07T14:55:49.638790Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.346864Z","title":"and H ASTIE , T","venue":null,"work_id":"cf19f062-5d6c-404c-bca9-ba9eca2216f0","year":2005},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.254661Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:71fd9a1ceda5bc54d3faf780ec070398888c6f8e74936e30db69db03c6cd9d71","observation_id":"7d83d383-397e-468e-bb01-7b216516bee7","resolution":{"observed_at":"2026-08-07T14:55:49.403088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:49.158895Z","title":"By the same argument, we also have (22) Eθ∼ω2 bθn − θ ∥θ∥2 2 2 ! ≥ δ2 4(r2 + 2δ2) inf ψ∈FM 1 M MX i=1 Pαi(ψ(Y , Z) ̸= i)","venue":null,"work_id":"b1ee434b-35f5-469b-9c34-e8af3d4076b1","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.372908Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:343f7c7cacae7e02a32f7b3ef389d8fad8e7d14bbf413d122728123104cb3457","observation_id":"2fa558d8-20a0-41ef-a2a3-2cd29beeec06","resolution":{"observed_at":"2026-08-07T14:55:49.234292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:48.970021Z","title":"That is, the conditions (3.5)-(3.8) in Assumption 3.1 of [9] hold with a modified λ0 defined above","venue":null,"work_id":"aca15d29-9409-4a90-90f3-c75a72030081","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.476698Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:3adf62ace898eceaeac06a5982c62418755e682e4ecdeed27ab9abb8548a0965","observation_id":"6a6d932a-8142-4496-b23c-eda0920414b0","resolution":{"observed_at":"2026-08-07T14:55:49.018293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:48.818969Z","title":"P (X ′ [t],SX [t],S)−1/2W 2 2 > α2 b2 j s0 | X [t],S ! ; A1,t # ≤E","venue":null,"work_id":"114f86f0-a40a-4141-99a6-d5698d7ac31b","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.570647Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:e07c39b1564cf2888e1672f0d967713ea10a2272ff5f70880b5c726193364aad","observation_id":"464625af-8d77-450c-a239-1b78a10d0e7e","resolution":{"observed_at":"2026-08-07T14:55:48.857283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:48.640285Z","title":null,"venue":null,"work_id":"473a9f07-9864-4c8b-8c48-6fe028597611","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.640029Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:4cee45dbfef10e5cd0ca8ed7a1f5592d3abeb8ea73c827ab10038b15d7883acc","observation_id":"edc1fd08-95ea-4904-8226-3ece28a008b3","resolution":{"observed_at":"2026-08-07T14:55:48.717838Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:48.490130Z","title":null,"venue":null,"work_id":"bbac0b37-b656-4c1e-a480-922f7465fa3a","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.733789Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:bc62b9eb3db281a83ea0088547299e2bb44e3ade45f2f9deab11e03372f966d6","observation_id":"23144c19-9780-425a-a57c-d4e401c7d853","resolution":{"observed_at":"2026-08-07T14:55:48.540229Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:48.323665Z","title":null,"venue":null,"work_id":"2aefef7a-cd79-4b6e-abdd-28a5d42cb768","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.804565Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:64c9609985979d6a12e07834442c5fbd21722a6308923da68ff41a11412f125e","observation_id":"79062693-f1c4-4af7-bb4f-5aa13c313b0f","resolution":{"observed_at":"2026-08-07T14:55:48.399103Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:48.154336Z","title":null,"venue":null,"work_id":"763ab4d7-6ae9-45d2-a5cb-06a9c45de6dc","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.874727Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:acff7ff9b374932c72a6ea19325085807f60c361a882521bccce29f37f080fb9","observation_id":"8519794a-a2fb-4225-afe6-49b154d65bc9","resolution":{"observed_at":"2026-08-07T14:55:48.203790Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:47.965062Z","title":"too close","venue":null,"work_id":"5dda6eba-e1db-4c28-899b-483dfca87891","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:45.991634Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:0ed3f78543c3ca41201ffc7efc6d7a5120eb2948cf1f932337a6994c4a51180b","observation_id":"4791e194-b75f-4b1e-b386-47afab91362a","resolution":{"observed_at":"2026-08-07T14:55:48.046587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:47.759315Z","title":"By the definition of a∗ in (35), ℓ∗ 0 ≥ a∗K","venue":null,"work_id":"6ddf10bc-7503-4c08-95b3-9621061918da","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.066605Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:dea323f85f76b98d75fff4c96fcdccf47cf61457c8e531dbf11cee759cc15af1","observation_id":"3764b8dc-ac41-4e3e-a437-5b691717f88f","resolution":{"observed_at":"2026-08-07T14:55:47.855821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:47.563885Z","title":"Due to the assumption, L−1 ≤ v′AS,Sv ≤ L, which implies that L−1 − C × s ≤ v′BS,Sv ≤ L + C × s","venue":null,"work_id":"8d0e519b-c981-4a7c-9568-20f03d245762","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.158481Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:c8c187a6fa2f8962fcb2e445d28c154b3a4ef4c0408c9ab44e2870685ff7e4a3","observation_id":"ac0e28f0-ce01-4f8a-8993-e8950a5f4e00","resolution":{"observed_at":"2026-08-07T14:55:47.638294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:47.280997Z","title":"Now, we focus on the second claim","venue":null,"work_id":"6ca2b3d2-a3f7-4d23-ae8e-c6784ffdbc00","year":null},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.242052Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:24c18fb8ccf894b6f83042d2496aa61cdd9a670fd5ad6c9f209f2cbddc2412b6","observation_id":"8a462f7c-69ba-49b7-a328-12c1b254a47b","resolution":{"observed_at":"2026-08-07T14:55:47.420897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:55:47.089239Z","title":"Two-stage with Lasso","venue":null,"work_id":"24491631-40e7-4f16-b968-6953edd13047","year":2000},"citing_paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T14:55:46.340114Z"},"links":{"citing_paper":"/paper/2505.17400"},"observation_digest":"sha256:c90271294774307cf1f94d9681656f9361e81598c9e5a0f16b90a5a882424417","observation_id":"8dab667e-0db3-4503-a575-53c76c05bc5b","resolution":{"observed_at":"2026-08-07T14:55:47.146425Z","resolver_source":"raw_fallback","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"}}],"paper":{"arxiv_id":"2505.17400","last_updated":"2025-05-23T02:20:00Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-09T13:30:45.433310Z","submitted_at":"2025-05-23T02:20:00Z","title":"Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":2,"verified_fuzzy":39},"total_outbound_references":64},"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 64 of 64 outbound references and 1 inbound Pith citation observation for arXiv:2505.17400."}