{"as_of":"2026-08-16T15:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df98b91c3fc508a4ab5207951684639305df4c34688f19c92205636ee8725d2b","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:34:32.004227Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.02386/citation-record","integrity":"/paper/2506.02386/integrity","json":"/paper/2506.02386/citation-record.json","paper":"/paper/2506.02386"},"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-07T11:34:39.412578Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":"b0983475-97a7-4364-9e38-fbf953db20ab","year":2011},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:26.709974Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:067d70204005b80dbfa27d73e9f4926509d76ac341753b8d64107a4327290cbb","observation_id":"912e3b82-67f2-482c-97e9-75813bc9735b","resolution":{"observed_at":"2026-08-07T11:34:39.522009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:39.141255Z","title":"Thompson sampling for contextual bandits with linear payoffs","venue":null,"work_id":"a6345bcb-3d42-4e06-81e1-f4f55857f811","year":2013},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:26.880992Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:5ad39efd4e21492f572ce6f1260a1e5f93f7e6191c03482a1951883db33bc24f","observation_id":"d2d61340-9c7b-41ac-824a-a2efc43ee861","resolution":{"observed_at":"2026-08-07T11:34:39.286239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:38.872207Z","title":"Linear stochastic bandits under safety constraints","venue":null,"work_id":"28adeb91-c10a-4b63-aa04-801b925e0e11","year":2019},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:27.031614Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:2f5e48080cefacfc9ed2fc24b4d3acbadb81cda4e96f10480ebc5771ac91dc1a","observation_id":"829606f3-9629-4a98-a9d2-ce360183a67f","resolution":{"observed_at":"2026-08-07T11:34:39.018373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:38.575308Z","title":"Best arm identification in multi-armed bandits","venue":null,"work_id":"bdb3b20c-f291-47bd-94ae-4af08e9c2861","year":2010},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:27.150771Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:1c703765b31fca08adcf2a334da575d17dbb9e624a65564c79746813b314998a","observation_id":"f93bb132-cc6f-46e5-88fc-5d1b26c7e9fa","resolution":{"observed_at":"2026-08-07T11:34:38.743299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:38.296055Z","title":"Finite-time analysis of the multiarmed bandit problem","venue":null,"work_id":"fb4e3f14-ceda-4fb3-a27d-6cfd87cd5697","year":2002},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:27.260179Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:e9bed89b8ebd35b96c6ff0b51c4fc15326d5d72d4b62afdd6ddbb4ad4ca87758","observation_id":"180aa042-2c61-4a94-b078-4009d0ee6031","resolution":{"observed_at":"2026-08-07T11:34:38.418546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04763","last_updated":"2023-07-04T19:22:17Z","snapshot_observed_at":"2026-08-13T19:07:28.209579Z","submitted_at":"2021-06-09T01:32:43Z","title":"Fixed-Budget Best-Arm Identification in Structured Bandits","version":8},"cited_work":{"arxiv_id":"2106.04763","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.04763","snapshot_observed_at":"2026-08-07T11:34:32.678667Z","title":"Fixed-Budget Best-Arm Identification in Structured Bandits","venue":"cs.LG","work_id":"e01c49f2-f588-4ce9-a428-89abed48a52e","year":2021},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:27.411161Z"},"links":{"cited_paper":"/paper/2106.04763","citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:6c9fda1cfa0438e33c1acb2004c01f9d0914904af9becb75f9723485fea46637","observation_id":"18e8f7f6-ab22-400d-9aa6-b1dceffd4b33","resolution":{"observed_at":"2026-08-07T11:34:32.814917Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10040","last_updated":"2019-04-02T14:17:40Z","snapshot_observed_at":"2026-08-14T16:52:57.977160Z","submitted_at":"2019-04-02T14:17:40Z","title":"A Survey on Practical Applications of Multi-Armed and Contextual Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.10040","snapshot_observed_at":"2026-08-07T11:34:27.535000Z","title":"A survey on practical applications of multi-armed and contextual bandits","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:27.535000Z"},"links":{"cited_paper":"/paper/1904.10040","citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:e59d6f81a1b8bda8a029b07eecc04eb0930c807a9433a428ed4c688d40a749a9","observation_id":"d9803b0c-e5e8-4b7a-8e1f-e12ecda7f190","resolution":{"observed_at":"2026-08-07T11:34:27.535000Z","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-07T11:34:38.012765Z","title":"Active learning with safety constraints","venue":null,"work_id":"86ca0131-f97b-4140-b6fd-e056ddbf3d03","year":2022},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:27.682863Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:6517088523cbc2a1b2d0fc153203a0dbafbf61e783fd17a59cee613c5b1a796a","observation_id":"f7b8a86f-e961-41c0-bf16-7436a75879cf","resolution":{"observed_at":"2026-08-07T11:34:38.150040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:37.773419Z","title":"Follow the leader if you can, hedge if you must","venue":null,"work_id":"a883c04d-93c4-448b-a1a6-ec1df7ede61c","year":2014},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:27.827426Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:d9b23c3d20c1d592dc408625a25ab3b7c3ba5406f1d6a08172c7dab029d80810","observation_id":"b0a137ae-783e-4fe9-a018-b2242aaa8fb0","resolution":{"observed_at":"2026-08-07T11:34:37.897973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14768","last_updated":"2022-11-27T08:58:16Z","snapshot_observed_at":"2026-08-14T20:24:02.967004Z","submitted_at":"2022-11-27T08:58:16Z","title":"Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14768","snapshot_observed_at":"2026-08-07T11:34:27.963120Z","title":"Constrained pure exploration multi-armed bandits with a fixed budget","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:27.963120Z"},"links":{"cited_paper":"/paper/2211.14768","citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:f9fd485b1e11adf2bb57a3a2da1c1b79f14a9327c1201879dd0c9d265e9575f4","observation_id":"c001aeb1-edf8-496b-89c3-2b9abad70799","resolution":{"observed_at":"2026-08-07T11:34:27.963120Z","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-07T11:34:37.499249Z","title":"Best arm identification: A unified approach to fixed budget and fixed confidence","venue":null,"work_id":"2fa8a911-03a8-46fc-ad70-27bc3b6dde5f","year":2012},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:28.116879Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:32d7601fabaa085cd9f1ba57f21c54999bc9690cdb5d3336bead38972d124ff0","observation_id":"cd129130-eb8a-4d2d-b823-0784244b415e","resolution":{"observed_at":"2026-08-07T11:34:37.619347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:37.250961Z","title":null,"venue":null,"work_id":"099bda64-6bc2-49df-9a93-d27d0b589e41","year":2023},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:28.264212Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:0c601a9585131fba4c0d9b6332c806cc614a766c9fec88710d0793f6a7e0e440","observation_id":"e1d87813-d7de-424f-a2d5-49d4f8a74062","resolution":{"observed_at":"2026-08-07T11:34:37.345392Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:37.065200Z","title":"Optimal best-arm identification in linear bandits","venue":null,"work_id":"cc1d98fa-fabb-470a-96c2-aad1d3676435","year":2020},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:28.404863Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:31732e3e010f32d5798422ddca0fe2680582a6bf968485ac9d7782ac0c471531","observation_id":"ac6f267c-b58d-4082-855e-c68ccb867d8b","resolution":{"observed_at":"2026-08-07T11:34:37.136752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:36.815214Z","title":"PAC subset selection in stochastic multi-armed bandits","venue":null,"work_id":"7381c59a-8050-4fc6-9fe8-6f53256763f3","year":2012},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:28.550366Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:4f86b1d2255644dcaea5585b55374f323372aa8b1b340fb093a0cf69e7c0e0df","observation_id":"5b7ba34f-d33f-45a8-9346-44b8e2c5c058","resolution":{"observed_at":"2026-08-07T11:34:36.939341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:36.557090Z","title":"Almost optimal exploration in multi-armed bandits","venue":null,"work_id":"334b7bee-1462-4fb3-ba8e-533e5a855262","year":2013},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:28.779853Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:e7c48c1c45a2b56c49eeb4ba6389dee11f9e62b8bbfa4d54652a0365753a729d","observation_id":"9778d862-97bf-49e8-ab04-3f327fc85be8","resolution":{"observed_at":"2026-08-07T11:34:36.680637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:36.309561Z","title":"Feasible arm identification","venue":null,"work_id":"82316eea-23a5-4a8d-8228-05af608103a3","year":2018},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:28.901860Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:b785ac7b3c1e18ff1efb883b9ad9a0aaa5b65633213a83bb19c1be86e6011009","observation_id":"ee84042c-33d3-43ce-aa34-b70e92d7c652","resolution":{"observed_at":"2026-08-07T11:34:36.417902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:36.046556Z","title":"Top feasible arm identification","venue":null,"work_id":"d81b4034-f1a0-4091-a99a-24c21bfac431","year":2019},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:29.013295Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:9e298f10430dd3bd46c6f06a475219a9be2627a70c1ae06e7af7e1c7515cd81e","observation_id":"21ba3ced-b88c-4ac1-9b0c-30b12a00e4b8","resolution":{"observed_at":"2026-08-07T11:34:36.190529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:35.814340Z","title":"Minimax optimal algorithms for fixed-budget best arm identification","venue":null,"work_id":"0031c8d7-c07f-4d6a-8717-28be300a760d","year":2022},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:29.140692Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:21b2942426735ef72e89d14f3ac84d5db035f03dc57007c20661c3921d04fc07","observation_id":"485f9609-2a7f-4bbe-a79e-5dc9997568a9","resolution":{"observed_at":"2026-08-07T11:34:35.953157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04939","last_updated":"2024-11-07T18:15:38Z","snapshot_observed_at":"2026-08-16T13:02:00.969285Z","submitted_at":"2024-11-07T18:15:38Z","title":"Pareto Set Identification With Posterior Sampling","version":1},"cited_work":{"arxiv_id":"2411.04939","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.04939","snapshot_observed_at":"2026-08-07T11:34:32.374523Z","title":"Pareto Set Identification With Posterior Sampling","venue":"stat.ML","work_id":"aa3bf6a1-36cf-4a05-b6f0-48bdc5a99c5b","year":2024},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:29.256116Z"},"links":{"cited_paper":"/paper/2411.04939","citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:9732719d5cfba17eb4cbfa4da4521b5374c5b39575ce807eeafffe1e7703a010","observation_id":"ddfb0f7a-a62b-43ae-a669-dc604a6bab84","resolution":{"observed_at":"2026-08-07T11:34:32.489358Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-08-14T23:43:30.629323Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-08-07T11:34:29.374675Z","title":"Algorithms for multi-armed bandit problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:29.374675Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:9a23ae64993d0ebcbd74f74b9225d67e16afe73f6f13c34f12ef89a6cf97f4fe","observation_id":"b9014d5b-6919-4582-b8ec-3e6eec7bab53","resolution":{"observed_at":"2026-08-07T11:34:29.374675Z","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-07T11:34:35.530112Z","title":"Polynomial-time algorithms for multiple-arm identification with full-bandit feedback","venue":null,"work_id":"032bd443-a925-48e5-9b83-516890c1ec40","year":2020},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:29.494232Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:4bfc4a05c5460d672c18e481f4cc76d795a48ea3ad20b44e492cb6247cf098da","observation_id":"933ea07c-1f61-4720-813e-851428f5a8c4","resolution":{"observed_at":"2026-08-07T11:34:35.670374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:35.254896Z","title":"Striatum: A contextual bandit library","venue":null,"work_id":"916a97aa-b8d5-4f9f-a1e3-3f4bcf36a51c","year":2017},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:29.958716Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:79b083dca2b99a4001eff420c376f61271d96ef6991adcfdbadcded8b160119a","observation_id":"2870ac46-b6c7-487a-9a37-952964798bf1","resolution":{"observed_at":"2026-08-07T11:34:35.375232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:34.995953Z","title":"The end of optimism? an asymptotic analysis of finite-armed linear bandits","venue":null,"work_id":"b1008a77-aece-4d28-8bdf-7b742749fef0","year":2017},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:30.127533Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:f75ce7dbcc55af11352c54bf94f52c5668c8ffc5b335a7408d37a4cb8a01c7a9","observation_id":"dce3a392-546e-4daa-a209-b21fd922c721","resolution":{"observed_at":"2026-08-07T11:34:35.117564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:30.291105Z","title":"Bandit Algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:30.291105Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:80c70edfa5a8a5a573ef1d565cb3326f5277460433c65bc45ac8e1c19da0d904","observation_id":"a3d25081-8288-41de-9096-3fabb2ab42ae","resolution":{"observed_at":"2026-08-07T11:34:30.291105Z","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-07T11:34:34.715466Z","title":"Optimal exploration is no harder than Thompson sampling","venue":null,"work_id":"70635864-3ded-4d66-9672-9825846b248f","year":2024},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:30.440008Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:37674c043bc1cc05d1884c23af46fb0d13020b901e0631a44d9bbfcd45440ad3","observation_id":"ea59e599-654a-4919-86a2-03dc677b088c","resolution":{"observed_at":"2026-08-07T11:34:34.848255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:34.443971Z","title":"The racing algorithm: Model selection for lazy learners","venue":null,"work_id":"32df2b9f-cff0-4724-9478-51afe86e156e","year":1997},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:30.570012Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:8b0d9c3f028c2f25ad0c2372f310a5eb5995fc6d69e59f4359b6e506e17ca46f","observation_id":"8a1ad04f-3fc4-4857-bb86-bc8d54f48e75","resolution":{"observed_at":"2026-08-07T11:34:34.543753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:34.150316Z","title":"Safe linear Thompson sampling with side information","venue":null,"work_id":"fe9608c7-87f7-46d7-a36f-4ceca8590301","year":2021},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:30.738729Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:8679008054573be40037141c6087c9b476f3ecaa5c103cb22a99310cd1f9de88","observation_id":"a9c72534-b634-40a5-953e-ec1a62a2dc97","resolution":{"observed_at":"2026-08-07T11:34:34.282161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08016","last_updated":"2025-08-21T17:32:02Z","snapshot_observed_at":"2026-08-16T14:27:18.503771Z","submitted_at":"2024-01-15T23:58:21Z","title":"Contextual Bandits with Stage-wise Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08016","snapshot_observed_at":"2026-08-07T11:34:30.905879Z","title":"Contextual bandits with stage-wise constraints","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:30.905879Z"},"links":{"cited_paper":"/paper/2401.08016","citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:7ef14e70e6fc471551a3a8ede46ab053a26c8cac537eb7c5af5c58160e3e5146","observation_id":"c540b94e-62f2-4952-986f-5a3cbe54ca4f","resolution":{"observed_at":"2026-08-07T11:34:30.905879Z","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-07T11:34:33.921721Z","title":"Simple Bayesian algorithms for best arm identification","venue":null,"work_id":"eaa54b97-5e9b-41dc-a4c3-35029bc6ab6c","year":2016},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:31.031668Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:f428cc6bbe9921dc4e246f290bad909154bd2bd26b28d461d329f353f00772f2","observation_id":"1ef4e5b2-3ff3-42b0-ba8b-a521cc55a939","resolution":{"observed_at":"2026-08-07T11:34:34.010971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08709","last_updated":"2023-09-15T19:01:21Z","snapshot_observed_at":"2026-08-16T15:00:18.019858Z","submitted_at":"2023-09-15T19:01:21Z","title":"Price of Safety in Linear Best Arm Identification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.08709","snapshot_observed_at":"2026-08-07T11:34:31.153851Z","title":"Price of safety in linear best arm identification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:31.153851Z"},"links":{"cited_paper":"/paper/2309.08709","citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:ee4c7407039f397930b9da859e0444cc04ad6a6dbbb58ef1820e947889b50f9d","observation_id":"7c2e7fb5-9504-4448-9fc0-126b23f9a436","resolution":{"observed_at":"2026-08-07T11:34:31.153851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15090","last_updated":"2024-05-23T22:35:11Z","snapshot_observed_at":"2026-08-16T13:49:58.128214Z","submitted_at":"2024-05-23T22:35:11Z","title":"Pure Exploration for Constrained Best Mixed Arm Identification with a Fixed Budget","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15090","snapshot_observed_at":"2026-08-07T11:34:31.315263Z","title":"Pure exploration for constrained best mixed arm identification with a fixed budget","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:31.315263Z"},"links":{"cited_paper":"/paper/2405.15090","citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:f4fbffa3cd66089ab65c13173a3d900a9b3811cfef2fce1fdf244536ed631d37","observation_id":"2862dfd1-33b4-43a9-9c6b-020e478e12a8","resolution":{"observed_at":"2026-08-07T11:34:31.315263Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:31.442462Z","title":"Thompson","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:31.442462Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:2457ba8789e92c98a5765de31b89fea3bc640c1cc7b6f261153a90864318da14","observation_id":"9bff4e37-f860-4285-a8c8-7a0e77df4da8","resolution":{"observed_at":"2026-08-07T11:34:31.442462Z","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-07T11:34:33.673862Z","title":"Best arm identification with safety constraints","venue":null,"work_id":"fa7ac6ed-ef43-4973-af90-8f6a1a3039f3","year":2022},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:31.597027Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:4a846c5f2c4f79ba1191a1ab2dfb5712f23ff0733e24e9fb0c85079a60de6e1b","observation_id":"537961ef-de39-4c49-bea0-4ac7ea41afb7","resolution":{"observed_at":"2026-08-07T11:34:33.783621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:33.435420Z","title":"Minimax optimal fixed-budget best arm identification in linear bandits","venue":null,"work_id":"1a8000a8-bbcd-403f-ae7b-73c70df1dc84","year":2022},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:31.724219Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:37d0b4b0a00d6924bbedf329c31d9e63d8f6a9d38d2d3865a5bf85e8bc32818d","observation_id":"ceb13eff-f046-402f-affc-51a4381706a9","resolution":{"observed_at":"2026-08-07T11:34:33.567100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:33.213230Z","title":"Stochastically constrained best arm identification with Thompson sampling","venue":null,"work_id":"59f58aca-2aa8-4e97-a364-f534503d9598","year":2025},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:31.875127Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:1aa357eb8c9297ab14c647ee5acd347809f95f6272afd8c3ce76e7ba646731df","observation_id":"eab97dae-362f-4948-9fbc-406460b9d057","resolution":{"observed_at":"2026-08-07T11:34:33.321776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:34:32.939881Z","title":"On kernelized multi-armed bandits with constraints","venue":null,"work_id":"335c909a-784d-47b6-a0d4-d803b8d95fa2","year":2022},"citing_paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T11:34:32.004227Z"},"links":{"citing_paper":"/paper/2506.02386"},"observation_digest":"sha256:aa10dad257fc34daca63a7332ec28685793b76e58c27d01739d504030f766ca7","observation_id":"5e4cccd2-1c8d-4b24-9c1f-0a6c2c11b248","resolution":{"observed_at":"2026-08-07T11:34:33.050347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.02386","last_updated":"2025-06-03T02:56:26Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:47:21.604759Z","submitted_at":"2025-06-03T02:56:26Z","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":25},"total_outbound_references":36},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2506.02386."}