{"as_of":"2026-08-21T21:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbca047e93d3b6888b7d3ce4a775580f45145f35a99ebef68081e739ff9dc234","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:58:56.177965Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2411.12154/citation-record","integrity":"/paper/2411.12154/integrity","json":"/paper/2411.12154/citation-record.json","paper":"/paper/2411.12154"},"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-12T17:58:57.158030Z","title":"Forced-exploration based algorithms for playing in stochastic linear bandits","venue":null,"work_id":"98703428-8442-425f-8f53-82532fef9b32","year":2009},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.005905Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:90766a3db97555786374e730709211ebc71f70963472ed15e80048a7008f8934","observation_id":"a2e82736-8e2c-4f52-910f-4758984af2f9","resolution":{"observed_at":"2026-08-12T17:58:57.162604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.144295Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":"d0741782-28d8-4a4b-8ed5-b71207908609","year":2011},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.011777Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:2aabc8eff51b43bc23d14aeccfc321fd79ba46ac06f8474c10c2a8956a4d7a59","observation_id":"1d9294cb-3dc8-45ef-a146-69e72b09a98a","resolution":{"observed_at":"2026-08-12T17:58:57.148949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.129208Z","title":"Linear T hompson sampling revisited","venue":null,"work_id":"84c9a470-a60d-4372-ba22-50d40a26d9a1","year":2017},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.017267Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:7990d8fb79c1a6702722c88af126b249e8f955a56712f2c995405c1276ee21ac","observation_id":"2b5e6d02-a150-46ce-aa6d-c5bb969ad56a","resolution":{"observed_at":"2026-08-12T17:58:57.133749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.115669Z","title":"Thompson sampling for contextual bandits with linear payoffs","venue":null,"work_id":"51a32878-7b28-47b5-82ab-097ca859223a","year":2013},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.022101Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:59b47aa8aeae146e63228114861a3cb21d601b423b5c405f5499ed76eade6b5f","observation_id":"1c5d3960-d6d9-4660-8906-231d105d32ba","resolution":{"observed_at":"2026-08-12T17:58:57.120423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03597","last_updated":"2023-01-09T17:09:53Z","snapshot_observed_at":"2026-08-16T16:03:34.179306Z","submitted_at":"2023-01-09T17:09:53Z","title":"On the Minimax Regret for Linear Bandits in a wide variety of Action Spaces","version":1},"cited_work":{"arxiv_id":"2301.03597","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.03597","snapshot_observed_at":"2026-08-12T17:58:56.798602Z","title":"On the Minimax Regret for Linear Bandits in a wide variety of Action Spaces","venue":"cs.LG","work_id":"d9449c20-c0fc-4f84-af1c-2bc1369e1c63","year":2023},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.026650Z"},"links":{"cited_paper":"/paper/2301.03597","citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:45575a06b15ab98649cf87e04158ad67dcd26d64758132ad4fddb9119edeafed","observation_id":"873cad19-dbd8-4ef2-8ee7-312a1a41e94d","resolution":{"observed_at":"2026-08-12T17:58:56.803456Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.103014Z","title":"Exploration in linear bandits with rich action sets and its implications for inference","venue":null,"work_id":"dce718d5-65f7-4787-bf0f-4a101358aab7","year":2023},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.031897Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:02993e5d2ea46b2f6bc98733501a81693216ff4d4b176df25f7b90c9e3550a86","observation_id":"398a548b-26aa-49db-828d-e03d913f3530","resolution":{"observed_at":"2026-08-12T17:58:57.107442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.089792Z","title":"Schapire","venue":null,"work_id":"8e351308-609c-40be-b733-4a86fdacc767","year":2011},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.037376Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:4090547a0b132b985dcac88bfc114d2341686ffa098a5efbeae6906493abc278","observation_id":"f8ce88ff-6bc6-48e7-ac61-2ed3544c81c2","resolution":{"observed_at":"2026-08-12T17:58:57.094623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2012.64834","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:58:56.776374Z","title":"Linear bandits in high dimension and recommendation systems","venue":null,"work_id":"53b7e16c-4d19-4896-9742-68ac29163260","year":2012},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.041752Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:0114de986dd621ec814dd7c9b78e352754edb4268da279a955ad710f35ea3d6b","observation_id":"443ff633-ed20-44f1-a412-05872cd8ec98","resolution":{"observed_at":"2026-08-12T17:58:56.783978Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.074839Z","title":"Gill and Boris Y","venue":null,"work_id":"b1f41b90-48fb-4215-84b7-46612935b822","year":1995},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.045937Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:7567e09c3bb28913d5bd828aa03ccc15fbf83e0473938132f55cfe42b8020dee","observation_id":"0440aa4c-a46a-4e4c-8127-beeb4752dc58","resolution":{"observed_at":"2026-08-12T17:58:57.079000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.062185Z","title":"Some modified matrix eigenvalue problems","venue":null,"work_id":"5ef0e85a-c6d8-4c9c-834f-01eacd8b307d","year":1973},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.050023Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:9ed55e577d491fe9408676ba78a53cff7d250060ee039b854ae46dc8f3c6c9d1","observation_id":"16ddc400-a4c6-4efb-87b2-45f336428ec7","resolution":{"observed_at":"2026-08-12T17:58:57.066733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.049253Z","title":"Greenewald, Ambuj Tewari, Susan A","venue":null,"work_id":"3cfedfaa-2c05-4936-91a1-be501f88d1fb","year":2017},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.054281Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:8090a7ad690ab84d31137b71e537e1083d9438d68628965c9982929ac3b83ed6","observation_id":"8f0214e4-b82e-4182-9b78-3d8ad41a8aa7","resolution":{"observed_at":"2026-08-12T17:58:57.054072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.037248Z","title":"Michael Harrison, N","venue":null,"work_id":"8ea47227-5bc3-4b81-8369-ff548dfd52b6","year":2012},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.058490Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:86ea10416ab039d4c5c8ca96b7fea35fa301476689fbe1e9718cb58edca485c2","observation_id":"13876955-dec9-437c-bc8e-6e969511a11b","resolution":{"observed_at":"2026-08-12T17:58:57.041421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:57.025138Z","title":null,"venue":null,"work_id":"eaa510cc-f2ad-4f05-88f8-93cf4ac4252a","year":2022},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.062515Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:3e6e09a8d9a70bd65ab2bd409169f58f044291422335cab934d92b68864164d9","observation_id":"d8f030e8-6e34-4993-b672-c7aaed4c1227","resolution":{"observed_at":"2026-08-12T17:58:57.029207Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.066629Z","title":"Matrix analysis","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.066629Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:bb4d03792d4b6d4659ac8fb8c86ee97d8b67facdb3db8beb07f6f885a766dbfb","observation_id":"eb6450f5-9fa5-48bc-99f3-09b1d29a8ead","resolution":{"observed_at":"2026-08-12T17:58:56.066629Z","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-12T17:58:57.004769Z","title":"Following the leader and fast rates in online linear prediction: Curved constraint sets and other regularities","venue":null,"work_id":"7703aa44-7e59-4c2a-93fb-4fb34ebba3d7","year":2017},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.070877Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:17096d0d87b16e96214758f5026738e52d694af6c51031a8638136d493da59cd","observation_id":"3b6a7c30-2a2c-4247-90ce-bbceedd8856b","resolution":{"observed_at":"2026-08-12T17:58:57.009020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.992569Z","title":"Perturbation Theory for Linear Operators, volume 132 of Grundlehren der mathematischen Wissenschaften","venue":null,"work_id":"ccdfe08f-2e74-491a-b22c-14645945af50","year":1980},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.074751Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:69baefb8aa5856e7d9368adf78ad36cb16c21eff811d0ac8a2bff3e25930d001","observation_id":"243fe881-006f-4b18-80df-f45d5680bc6d","resolution":{"observed_at":"2026-08-12T17:58:56.996922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.078626Z","title":"Cooperative multi-agent bandits with heavy tails","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.078626Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:085e1f0e8956390e9b2ef618f62f1566ef31e6088eb6acd4e39593dabf9ba6a6","observation_id":"8e0a3ae6-78ab-4309-8864-faf3329250aa","resolution":{"observed_at":"2026-08-12T17:58:56.078626Z","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-12T17:58:56.979343Z","title":"Projection-free optimization on uniformly convex sets","venue":null,"work_id":"ff7fdf3a-4fa4-4896-8a8a-638c0755b9db","year":2021},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.082611Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:ba38bb0b62712c6c2e73db6e0a21f9e6e2c37a532cd58161380075e385fa9d74","observation_id":"df7a1edb-a088-4c1b-9ec9-dd461d3f6f89","resolution":{"observed_at":"2026-08-12T17:58:56.984177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2014.1302","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:58:56.623839Z","title":"Bora Keskin and Assaf Zeevi","venue":null,"work_id":"751e0a7f-fa2c-4d42-ba59-873921fdb0f1","year":2014},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.086748Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:473f088c7f9f258f5d1a0066a538ee9e1e50120da1f9fcae4f13abc07064d7dd","observation_id":"37094b94-7c7b-4e4f-b088-5c7cde642dbd","resolution":{"observed_at":"2026-08-12T17:58:56.634016Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.966099Z","title":"Information directed sampling for linear partial monitoring","venue":null,"work_id":"860bb418-d3ce-4e3a-84af-c3b578501578","year":2020},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.093634Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:1030794ef73badf1d20558a125263de26f130ab592d72cbcbb2666196787d1dd","observation_id":"5780777b-7765-48a5-8c05-f1d7cbd7e66d","resolution":{"observed_at":"2026-08-12T17:58:56.970370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.953015Z","title":"Multi-agent multi-armed bandits with limited communication","venue":null,"work_id":"840c0211-07c7-413f-b83c-3519262fd9b6","year":2016},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.097989Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:7163a7a711f1289eae74eb86e18df6ad80b76d1d7b9b2cf3f337a822bd668dfe","observation_id":"0ee2dec0-fbea-43d0-9fa5-2e89d38c369f","resolution":{"observed_at":"2026-08-12T17:58:56.957563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.102069Z","title":"Bandit Algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.102069Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:6a961e6f17dd1f824221b1c73d914bba412e55bf9291aaf3e7ec789f6664db3f","observation_id":"d1947a42-90e9-4f3b-b1d9-1e25a3d185ec","resolution":{"observed_at":"2026-08-12T17:58:56.102069Z","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-12T17:58:56.107188Z","title":"Schapire","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.107188Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:143c1664fd3d1751a068e365dc34403f976894d55a84e56298d801f00a6652b9","observation_id":"74ff1405-0949-486a-8fbb-b62a5ee8c428","resolution":{"observed_at":"2026-08-12T17:58:56.107188Z","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-12T17:58:56.932822Z","title":"Linear bandits with polylogarithmic minimax regret","venue":null,"work_id":"0ef6e1c2-1335-4c20-9010-81d592069481","year":2024},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.111218Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:5646fc4e7f7bfbed3bc586028255d3ba477df452809c495406ae7a77fd8cde91","observation_id":"9b958a54-9fa7-436f-ae56-91cf2ab9383f","resolution":{"observed_at":"2026-08-12T17:58:56.937271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.115261Z","title":"Distributed cooperative decision-making in multiarmed bandits: Frequentist and bayesian algorithms","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.115261Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:5445d6f670936480b54cbb58f0c35bcb6c62588f05b49cbba067dc364062dfbf","observation_id":"eb266e7e-d922-48a2-9ac9-198205e780f6","resolution":{"observed_at":"2026-08-12T17:58:56.115261Z","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-12T17:58:56.919374Z","title":"Multi-agent thompson sampling for bandit applications with sparse neighbourhood structures","venue":null,"work_id":"2fa7612c-b48b-4b48-9f48-0929965287d2","year":2021},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.119541Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:8a17f397c0897f25c97113cdf36fd5b7d09004b3f535b3519ce23e17efa307fe","observation_id":"f2648f10-6855-4497-af92-e9da78d2ff7b","resolution":{"observed_at":"2026-08-12T17:58:56.923781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.03213","last_updated":"2021-05-11T02:05:14Z","snapshot_observed_at":"2026-08-20T02:05:35.347390Z","submitted_at":"2020-02-08T18:10:20Z","title":"Curvature of Feasible Sets in Offline and Online Optimization","version":2},"cited_work":{"arxiv_id":"2002.03213","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.03213","snapshot_observed_at":"2026-08-12T17:58:56.422758Z","title":"Curvature of Feasible Sets in Offline and Online Optimization","venue":"cs.DS","work_id":"ccb7f58b-e25c-4fab-8f9f-611f49b69595","year":2020},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.123912Z"},"links":{"cited_paper":"/paper/2002.03213","citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:53f3550c2ed50151b251caf5cd7772aeea349a4fa146d9e23996e4ed7cf85519","observation_id":"006491f2-e894-442f-b2f8-38a8697e410c","resolution":{"observed_at":"2026-08-12T17:58:56.427419Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.905105Z","title":"Dynamical linear bandits","venue":null,"work_id":"4f337027-eae1-4098-bd4a-32c3b669ee55","year":2020},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.129469Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:3126cd7499f4d0ce19b9571b49ce71a946d7561d7be3be2c7c174f8e08c5c96b","observation_id":"a0c6600d-0db8-49a6-b7f9-5975ab783cd0","resolution":{"observed_at":"2026-08-12T17:58:56.909717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.890939Z","title":null,"venue":null,"work_id":"803c17ed-fe67-4dc5-a893-df431d19b560","year":2008},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.133666Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:5e5f38caaaf5c9b6b0e4c885a071437c2a82a5421b8d131f54abdcf6e4698e28","observation_id":"c7c7af9f-a49c-4874-8e38-5a484d4670cb","resolution":{"observed_at":"2026-08-12T17:58:56.895723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.137933Z","title":"Tsitsiklis","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.137933Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:1815123bf3bac78142f0edeaba77cb67822aa7b2253fced266322e358a694b5f","observation_id":"1b9063c6-3c4b-4652-91a6-fcc3ff646898","resolution":{"observed_at":"2026-08-12T17:58:56.137933Z","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-12T17:58:56.875461Z","title":"Learning to optimize via information-directed sampling","venue":null,"work_id":"6b0adfc2-7eb0-4ba3-bfa8-5ab2776f16de","year":2014},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.142051Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:5fd82c58edba7f1fa3d35ffd7a247ce27a792257d74e5d08bfc04ffee2e88b7c","observation_id":"d6a187b9-2d09-4922-a1ba-1df535e6410a","resolution":{"observed_at":"2026-08-12T17:58:56.880475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.145975Z","title":"Learning to optimize via posterior sampling","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.145975Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:430ecba6c2639e593fce26dbc5d88cdc02a682912d5ea14faed1697ac5f7a600","observation_id":"f8036171-df7a-4776-a16a-46eb3eab48a5","resolution":{"observed_at":"2026-08-12T17:58:56.145975Z","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-12T17:58:56.863104Z","title":"An information-theoretic analysis of thompson sampling","venue":null,"work_id":"9fac732c-5d69-474b-b099-45d10af9c0fc","year":2016},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.149740Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:d02cf85cc021954674bf5a8f74a13315b49fceee46b8f12eea101c1015e90674","observation_id":"e60f35be-7e60-4435-b6d6-c36550a0b165","resolution":{"observed_at":"2026-08-12T17:58:56.867303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.850552Z","title":"A triangle inequality for cosine similarity","venue":null,"work_id":"9bb0ddb1-bdcf-4512-93d3-0d2c8898c350","year":2021},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.153476Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:d5645dd8711319862cac3b56a1a50f31cb99df2521b88fd4996462a9fed8ee4d","observation_id":"f8eb890f-2ca4-46bd-b228-c36fd321a305","resolution":{"observed_at":"2026-08-12T17:58:56.855270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.838111Z","title":"Dynamic learning in strategic pricing games","venue":null,"work_id":"5dbbaefe-91a2-470b-8a9b-b4e61768f9f6","year":2020},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.157413Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:01431189fe45594741a634d63605add95d69390d54903b2f526b2ec92900595a","observation_id":"77b36beb-a341-4c92-bb2b-c2002ea51a34","resolution":{"observed_at":"2026-08-12T17:58:56.842274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.161549Z","title":"Freedman's inequality for matrix martingales","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.161549Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:0433141adac0dfc26414ad29bd07f44a3d50b430c7ae93392b6b99779a184170","observation_id":"ac5aa0db-12bf-44c0-8e78-927de921990e","resolution":{"observed_at":"2026-08-12T17:58:56.161549Z","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-12T17:58:56.165618Z","title":"High-dimensional probability: An introduction with applications in data science, volume 47","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.165618Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:d1cef1353ad3ab5e7961aa30eb2b84d4956d9dc00f5d9df1c2095132251c4937","observation_id":"708a20c8-06be-4e3e-9e59-fff5c93159df","resolution":{"observed_at":"2026-08-12T17:58:56.165618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10637","last_updated":"2018-12-19T02:19:20Z","snapshot_observed_at":"2026-08-14T18:09:43.344759Z","submitted_at":"2018-10-24T21:47:19Z","title":"Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure","version":2},"cited_work":{"arxiv_id":"1810.10637","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.10637","snapshot_observed_at":"2026-08-12T17:58:56.243478Z","title":"Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure","venue":"cs.LG","work_id":"1d98d6e2-5d93-419f-829c-e9f03d82821f","year":2018},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.169551Z"},"links":{"cited_paper":"/paper/1810.10637","citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:955f1025a9293f0a5d583d3281eeda923bfbdbd2206adb133bdcd853d39c2bb3","observation_id":"2dbbafbb-0d7a-4ec7-9f7c-b724edc42b58","resolution":{"observed_at":"2026-08-12T17:58:56.250859Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-12T17:58:56.811927Z","title":"On uninformative optimal policies in adaptive lqr with unknown b-matrix","venue":null,"work_id":"b5a41d6f-9a72-4ce9-887e-c33a05131523","year":2021},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.173832Z"},"links":{"citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:fb0b8819ebb97df7453f9fab117bdca6d4f9c78923258485a2f245fc224bab0e","observation_id":"022ac7a3-1d89-4d91-96de-2ea8948b8e95","resolution":{"observed_at":"2026-08-12T17:58:56.816623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.01680","last_updated":"2024-06-12T13:11:28Z","snapshot_observed_at":"2026-08-16T17:30:06.171909Z","submitted_at":"2022-01-05T16:19:16Z","title":"Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.01680","snapshot_observed_at":"2026-08-12T17:58:56.177965Z","title":"Regret lower bounds for learning linear quadratic gaussian systems, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T17:58:56.177965Z"},"links":{"cited_paper":"/paper/2201.01680","citing_paper":"/paper/2411.12154"},"observation_digest":"sha256:6d11437deef677a1d070ebb1b2ff7f310a93a1259a02ee74247675be423bba71","observation_id":"b05cb6a5-4105-4e02-a035-f418a6532da7","resolution":{"observed_at":"2026-08-12T17:58:56.177965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.12154","last_updated":"2024-11-19T01:08:13Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-18T03:12:44.127449Z","submitted_at":"2024-11-19T01:08:13Z","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":4,"verified_fuzzy":23},"total_outbound_references":40},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2411.12154."}