{"as_of":"2026-08-11T16:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b609510766e9d73e2e93f84e6d2543c9cb4b5486f58773ed2c17b88e9f00fa7","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T16:14:14.806220Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2607.23679/citation-record","integrity":"/paper/2607.23679/integrity","json":"/paper/2607.23679/citation-record.json","paper":"/paper/2607.23679"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T16:14:09.363479Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:09.363479Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:99728d44f00e2e0563b8012c5f4ef0e82c08d98e166b97c04ded4f5c24b564aa","observation_id":"dacc8228-c44c-4282-b494-dd3430b1ed2b","resolution":{"observed_at":"2026-07-30T16:14:09.363479Z","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-07-30T16:14:09.416205Z","title":"1986 , isbn =","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:09.416205Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:d9bf4ac7cd44210ad13b29c04d09b58e09b0650040f2cc56d4c93e20f7f93c59","observation_id":"42620710-85bf-468f-9bdc-2035cc0e3737","resolution":{"observed_at":"2026-07-30T16:14:09.416205Z","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-07-30T16:14:09.545452Z","title":", title =","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:09.545452Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:f589a26e04db253dc88ecdfb9eb506874f8fab66a0bebafb840c88c2e5489987","observation_id":"da022341-15f9-424b-a8a9-aca08d18137f","resolution":{"observed_at":"2026-07-30T16:14:09.545452Z","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-07-30T16:14:09.635036Z","title":", title =","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:09.635036Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:0b1eb74335eb92a99caa66a5cd13bcc715c146301bb7a1e6e4b56f88c1b9ebc8","observation_id":"1eb522b2-b8d2-45ad-a82f-233d74fad036","resolution":{"observed_at":"2026-07-30T16:14:09.635036Z","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-07-30T16:14:09.743630Z","title":"Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:09.743630Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:24aad4c1a2d5ac33b967361294142bed2e1ca83717b0da13b5fc3aea89f6a32b","observation_id":"32ad44ef-f0a4-4b34-ae0c-515f666c5766","resolution":{"observed_at":"2026-07-30T16:14:09.743630Z","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-07-30T16:14:09.891139Z","title":"Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:09.891139Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:95fd55996f4fbc23dbf8e4ef7f9b48e0eb940c46eab5451a4ca41251e023b883","observation_id":"def4efb4-2c23-43c0-8cdb-272e0cf00306","resolution":{"observed_at":"2026-07-30T16:14:09.891139Z","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-07-30T16:14:10.027441Z","title":"1995 , isbn =","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:10.027441Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:7c8d82af6051ce47fff49e349e62639fee07d41c42da6b0d4b8b1d90eebb6e11","observation_id":"e8334492-87ab-40fa-9095-c53f795a3bbe","resolution":{"observed_at":"2026-07-30T16:14:10.027441Z","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-07-30T16:14:10.146743Z","title":"Festschrift for Lucien Le Cam: Research Papers in Probability and Statistics , editor =","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:10.146743Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:91078654b6a79c99ee4434793da5cd45a7d40c162d1051d5ef8780a9cbded924","observation_id":"1309f5e2-fbc8-4d68-855e-098a0b03c6d4","resolution":{"observed_at":"2026-07-30T16:14:10.146743Z","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-07-30T16:14:10.284275Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:10.284275Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:b06632b0589b9365fc1ec70e26bb70dc4a9697f8f7f74d8bebd44ac3bc18455f","observation_id":"06eb3411-ef40-4077-85e4-afffb9844d74","resolution":{"observed_at":"2026-07-30T16:14:10.284275Z","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-07-30T16:14:10.346575Z","title":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:10.346575Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:c265bbc2387153dc1ef70d5749f14b7503762ef4417631ba7ff12d734388a6fe","observation_id":"62e93617-6fae-4418-a90c-d955a6ba39f6","resolution":{"observed_at":"2026-07-30T16:14:10.346575Z","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-07-30T16:14:10.491217Z","title":"2020 , publisher=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:10.491217Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:e699736f30307c591dad60f22ead49ad8fa93abf7e9d8cb6401078f5d51392cd","observation_id":"63bcf09f-0f1a-4b14-be1e-a2047b184ce1","resolution":{"observed_at":"2026-07-30T16:14:10.491217Z","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-07-30T16:14:10.653608Z","title":"2024 , eprint=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:10.653608Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:8e4ffeac95ec3f2086df5724583b6606aa44615cc8139b42b57593bf9e402161","observation_id":"56eb6e71-6062-47fb-85f3-72f7433487f5","resolution":{"observed_at":"2026-07-30T16:14:10.653608Z","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-07-30T16:14:10.818082Z","title":"the Annals of Probability , pages=","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:10.818082Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:8b86d1edd9de8c53ca6ade0e7c9e541ed02c753172ddb9f902881e41eb113850","observation_id":"1706c50c-7ed8-4f49-bd52-94e060d39cb7","resolution":{"observed_at":"2026-07-30T16:14:10.818082Z","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-07-30T16:14:10.972332Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:10.972332Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:5f8706e198715b7e8059e638ec24e697c2b00027d537bdecd4d1af69be730e57","observation_id":"306f28f2-03ef-4d59-9b25-afd182eed91a","resolution":{"observed_at":"2026-07-30T16:14:10.972332Z","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-07-30T16:14:11.149571Z","title":"The Thirty Sixth Annual Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.149571Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:4f80376f94c9efff7f39f6e2db5706796255058be714b0cb92cf183d221e505e","observation_id":"77362e5b-c935-4ed5-9720-a25d71665321","resolution":{"observed_at":"2026-07-30T16:14:11.149571Z","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-07-30T16:14:11.274935Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.274935Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:a8ff8fcf2304a5e6b2e73a43bfeb35b1157d0feec6d0612198b3e2ef041aae94","observation_id":"9bcac921-6d29-4d25-b572-25c3e21aa881","resolution":{"observed_at":"2026-07-30T16:14:11.274935Z","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-07-30T16:14:11.397850Z","title":"The Thirteenth International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.397850Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:094a724754ad98e150b5010fac39a923ebfc6751320a4253caa351fd51a66fe8","observation_id":"a3e6c841-1f68-4b78-bacb-f6d287abf51b","resolution":{"observed_at":"2026-07-30T16:14:11.397850Z","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-07-30T16:14:11.491359Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.491359Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:d36ab37592af84cb32fb532498fb77eff0778e18b3d24a927313ddeff857bf84","observation_id":"9ac82543-d35a-4aa4-a0c9-3dd998d8e8c5","resolution":{"observed_at":"2026-07-30T16:14:11.491359Z","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-07-30T16:14:11.549284Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.549284Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:f42fd0fd6b460ea4528364065d537db5dce6ab978fb0fd95ed51c86c0caa2b3e","observation_id":"a534ec07-0ed4-4f35-a9f5-608e74eb494a","resolution":{"observed_at":"2026-07-30T16:14:11.549284Z","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-07-30T16:14:11.607012Z","title":"1998 , publisher=","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.607012Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:3d56efbfc7b13de901b2e54e41a78f726826f6f933fe4b6e781ae3ea05382d03","observation_id":"2640db3d-bb7b-4e4c-ba08-1e14aa7b408c","resolution":{"observed_at":"2026-07-30T16:14:11.607012Z","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-07-30T16:14:11.664909Z","title":"Artificial Intelligence and Statistics , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.664909Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:3fae0d6a15e707eea57f6a6a089399b416d5d903a4cb2024827ce530325ba46d","observation_id":"6a7818e6-d46c-448f-bdaf-2869f4971ef4","resolution":{"observed_at":"2026-07-30T16:14:11.664909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.12020","last_updated":"2025-03-15T07:09:36Z","snapshot_observed_at":"2026-08-09T06:13:22.113738Z","submitted_at":"2025-03-15T07:09:36Z","title":"Variance-Dependent Regret Lower Bounds for Contextual Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.12020","snapshot_observed_at":"2026-07-30T16:14:11.723269Z","title":"arXiv preprint arXiv:2503.12020 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.723269Z"},"links":{"cited_paper":"/paper/2503.12020","citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:40d9723affa98d43d17a3076892687b7b59531bb64b91c6beed1bd42ff33e2fc","observation_id":"8f0583fd-3f28-4cf2-8839-16a45d85afa9","resolution":{"observed_at":"2026-07-30T16:14:11.723269Z","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-07-30T16:14:11.812597Z","title":"Conference On Learning Theory , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.812597Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:d392414a29828ce34fe278cde69884c79226aab8b33bff6f10587c57e3e172b3","observation_id":"b1b5da5b-cb52-4fc8-9872-3f1696a729a9","resolution":{"observed_at":"2026-07-30T16:14:11.812597Z","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-07-30T16:14:11.925387Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:11.925387Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:b286f2f46bdd455cf44f02e4b18b0a461df962f752af14ee4ca6b42b2d2a9bf5","observation_id":"f729322c-b2a4-4a15-8c54-66e0af4148a2","resolution":{"observed_at":"2026-07-30T16:14:11.925387Z","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-07-30T16:14:12.019313Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.019313Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:1f014456776a05efefffbdd3dd271d7f529852361c724cf3021eb381def78f7b","observation_id":"552dc51f-4d5a-4ee7-8816-bce49e485c87","resolution":{"observed_at":"2026-07-30T16:14:12.019313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.03289","last_updated":"2023-02-04T21:49:44Z","snapshot_observed_at":"2026-08-05T12:35:47.842990Z","submitted_at":"2021-11-05T06:47:27Z","title":"Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.03289","snapshot_observed_at":"2026-07-30T16:14:12.125618Z","title":"arXiv preprint arXiv:2111.03289 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.125618Z"},"links":{"cited_paper":"/paper/2111.03289","citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:6fdc160824e40cc8df3e154c98f9edd5438633cb851349b36311e6aa84f21370","observation_id":"1355f1cd-0755-4ddb-90f6-2a9bac3fb19b","resolution":{"observed_at":"2026-07-30T16:14:12.125618Z","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-07-30T16:14:12.190403Z","title":"21st Annual Conference on Learning Theory , number=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.190403Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:58f29d1dee05c32238cc8ee130278a06fd24485fa2d681bcf4f6c2c4799a1e24","observation_id":"fcb8e8a6-2baf-4b57-934f-04161845beb7","resolution":{"observed_at":"2026-07-30T16:14:12.190403Z","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-07-30T16:14:12.267904Z","title":"2004 , publisher=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.267904Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:b43b7c946cdcc679d61db4321cd83cc621b12cd727eafef6ba01c36574c6a9c8","observation_id":"f82a2e4b-41a3-4a85-bf8e-b2c348f0d7e1","resolution":{"observed_at":"2026-07-30T16:14:12.267904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.00118","last_updated":"2024-01-24T02:19:16Z","snapshot_observed_at":"2026-08-08T16:52:11.523178Z","submitted_at":"2021-06-30T22:00:00Z","title":"Do we need to estimate the variance in robust mean estimation?","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.00118","snapshot_observed_at":"2026-07-30T16:14:12.337079Z","title":"arXiv preprint arXiv:2107.00118 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.337079Z"},"links":{"cited_paper":"/paper/2107.00118","citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:eb4f9e494b76f08584e241c9b6406f4cb56a11656e315fdd8201c6a459909df6","observation_id":"7cd50da5-255d-4c9d-8881-385b2e0fd8aa","resolution":{"observed_at":"2026-07-30T16:14:12.337079Z","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-07-30T16:14:12.461880Z","title":"Transactions on Machine Learning Research , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.461880Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:c3be7b62d90e3619496fecf5bd5f1d1acc362055250570127c8a6a324e6941d6","observation_id":"79dc87cf-ff6c-4b9c-86c3-477b03f512c9","resolution":{"observed_at":"2026-07-30T16:14:12.461880Z","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-07-30T16:14:12.546453Z","title":"Machine learning , volume=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.546453Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:17258190fce544984d8a00c2207459bba7fce239066d86f00f07c063ec1e01e4","observation_id":"8bff835a-eed4-49f2-8ba2-a5d7afcac431","resolution":{"observed_at":"2026-07-30T16:14:12.546453Z","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-07-30T16:14:12.687852Z","title":"Minimax Policies for Adversarial and Stochastic Bandits , booktitle =","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.687852Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:4da1a5a8dfdee723913f7233837237bd07ae457e25d2ad92887f5c8338381ad5","observation_id":"2e7645f5-555a-4f9c-889c-d1d66a80d82b","resolution":{"observed_at":"2026-07-30T16:14:12.687852Z","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-07-30T16:14:12.893343Z","title":"A Minimax and Asymptotically Optimal Algorithm for Stochastic Bandits , booktitle =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:12.893343Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:b2d3b1fd467851a4276ecd2700331dc0ecfa375cad88c16238f59d292c48b4fe","observation_id":"ed5cd5dc-f377-4156-9830-82e6e37a905c","resolution":{"observed_at":"2026-07-30T16:14:12.893343Z","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-07-30T16:14:13.033462Z","title":"International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.033462Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:2e96eb0eb24d650586d12393e0cd64e5a57873de24f7288465f334c7d090aafb","observation_id":"5b67dfe1-2f0a-4fe6-a2ff-e92268bedf4a","resolution":{"observed_at":"2026-07-30T16:14:13.033462Z","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-07-30T16:14:13.153352Z","title":"International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.153352Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:10fda1f8dadb663165061d53b657dca14676567b38a9728e44bc45b2d70a1550","observation_id":"58529fcd-3f6a-4e35-a921-0f57a564ce80","resolution":{"observed_at":"2026-07-30T16:14:13.153352Z","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-07-30T16:14:13.321785Z","title":"International conference on machine learning , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.321785Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:8b9bb43491605e8ac43547b0683d12eb6088b8547641c26c826bcb9205e1a3da","observation_id":"38835b35-b1c9-40ce-968f-a92d4798eed9","resolution":{"observed_at":"2026-07-30T16:14:13.321785Z","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-07-30T16:14:13.459637Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.459637Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:d463e1d187b99be7628d83aca0a2f0ba1d66eef2634c88d75e7a8ea087836f63","observation_id":"6a52458e-2a5f-4457-b21e-d4d944c7ca9b","resolution":{"observed_at":"2026-07-30T16:14:13.459637Z","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-07-30T16:14:13.549518Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.549518Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:2df2011753f0003af848db7f884d67cbd5282dd70bae6d62368294d4c475d983","observation_id":"73bcd797-8c32-428e-9b8e-4909fef56845","resolution":{"observed_at":"2026-07-30T16:14:13.549518Z","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-07-30T16:14:13.671741Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.671741Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:4448c1185392982bda787819cbe8864584cc7b523cbcfa39e58e8eab5c9891e9","observation_id":"0faa6b90-518c-4559-96bc-f00735c1b7ec","resolution":{"observed_at":"2026-07-30T16:14:13.671741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13465","last_updated":"2020-04-28T13:01:38Z","snapshot_observed_at":"2026-08-08T13:59:49.702216Z","submitted_at":"2020-04-28T13:01:38Z","title":"Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13465","snapshot_observed_at":"2026-07-30T16:14:13.761525Z","title":"arXiv preprint arXiv:2004.13465 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.761525Z"},"links":{"cited_paper":"/paper/2004.13465","citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:60350fe1f275dc92ae2d141c72ed04aa9a07a9f8dbf6a5a76c13e2a2f0cfdc2b","observation_id":"d9beab0e-b81b-4658-8cf8-cec3f49ee13f","resolution":{"observed_at":"2026-07-30T16:14:13.761525Z","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-07-30T16:14:13.860087Z","title":"Proceedings of the fourteenth international conference on artificial intelligence and statistics , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.860087Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:0964982a01e5182a42667f862c17782c31093f92e6941eee4da2766c8e3c3bfa","observation_id":"904e2ad9-42a7-40a1-9311-50713f61c8c9","resolution":{"observed_at":"2026-07-30T16:14:13.860087Z","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-07-30T16:14:13.985634Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:13.985634Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:ed82a36ea0ba8cec5295c27dd271c370e3ba466fa29a456206d1609948a948dd","observation_id":"f0207830-3764-49a2-9639-7dfa0cd0c225","resolution":{"observed_at":"2026-07-30T16:14:13.985634Z","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-07-30T16:14:14.103314Z","title":"Forty-second International Conference on Machine Learning , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:14.103314Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:46659b2627099d69423cc0b09795f0e9dd0d33511a4c73379ee3e9bb16619cf2","observation_id":"8891bb5a-1d11-445f-bf00-a17dc0763b0d","resolution":{"observed_at":"2026-07-30T16:14:14.103314Z","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-07-30T16:14:14.204419Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:14.204419Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:1742cb847d102e58ef3249e74074ef42b24e29ded23f92f916eab177251aae76","observation_id":"4479ee79-858e-47f0-8133-9407ff5ca78f","resolution":{"observed_at":"2026-07-30T16:14:14.204419Z","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-07-30T16:14:14.319133Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:14.319133Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:cf388eea78bb95be787e4ca6e65ea6f833cf36b37a0486de0db5a26f46472cfb","observation_id":"c3767297-0b0a-45de-8e61-f654ab6db284","resolution":{"observed_at":"2026-07-30T16:14:14.319133Z","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-07-30T16:14:14.403271Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:14.403271Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:7ac1a5d9226c9d7a2cee403c2b63b2a2d4704eb9079aabef351ec919737b09bf","observation_id":"8cf4a89c-4175-4091-b72b-4b1531b122ec","resolution":{"observed_at":"2026-07-30T16:14:14.403271Z","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-07-30T16:14:14.498250Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:14.498250Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:f65da725f964d8d594463305d0487f9f8c8733c87a92e733a05752faebef3396","observation_id":"23c994f3-366d-4fdb-9130-075863eca5d5","resolution":{"observed_at":"2026-07-30T16:14:14.498250Z","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-07-30T16:14:14.634392Z","title":"The Thirteenth International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:14.634392Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:ca091c8077b3774eef12d6f7bcf2f984f8d25036883f64377feb37dc411f3539","observation_id":"0fe1e75e-c688-40d1-a69c-ab5acbaef3a9","resolution":{"observed_at":"2026-07-30T16:14:14.634392Z","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-07-30T16:14:14.722986Z","title":"arXiv preprint arXiv:2508.02103 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:14.722986Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:4976544a581c90fd55a4a9d0977860ffdedba0f640fc6120b9db257e92f5a953","observation_id":"7b2ce430-fc05-42c6-88a4-a72b9fc2d9ec","resolution":{"observed_at":"2026-07-30T16:14:14.722986Z","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-07-30T16:14:14.806220Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-30T16:14:14.806220Z"},"links":{"citing_paper":"/paper/2607.23679"},"observation_digest":"sha256:17b6908d99d11e2faac63fa23d38b00b1cd6dc937ec924bf0dfb27fe51aee56c","observation_id":"feede862-ad74-48ec-84aa-bdd710b9a32b","resolution":{"observed_at":"2026-07-30T16:14:14.806220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23679","last_updated":"2026-07-26T14:24:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T06:13:42.279495Z","submitted_at":"2026-07-26T14:24:34Z","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":50},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2607.23679."}