{"as_of":"2026-08-08T01:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d4b40066e8e67464505eb76d31e471d2ea600772a56fffdb42e4899af83caad","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-07T06:34:17.273281+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-07-30T23:56:32.226533Z","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:5ec34393f84b65ee03a309f0038d3064e69e1c9ecf4eeeef96e027788706638a","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-07-30T23:56:32.226533Z","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:14c85929f85ece4af250d83fd98a04283818b322da50f5714446b0682118df56","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-07-30T23:56:32.226533Z","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:4a7094530116055753002495fa58a44433ec8cd48fca9cba46865231065c9ecd","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-07-30T23:56:32.226533Z","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:9f5bd43ed1af7ab3579a4b9459703f640ace90a8357773231665f30118af96ef","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-07-30T23:56:32.226533Z","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:29a7c309ec952884f5644354c6863dbfbadd0bad306d966565a13748dcac66c8","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-07-30T23:56:32.226533Z","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:0e6d04ef77ff743b4cb258b8fc12e151ae12a2138957f8e289d5a55cebb344c7","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-07-30T23:56:32.226533Z","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:e327733019408969fb0b986c07111d63343cef6e25d173842a18edd2fcd94626","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-07-30T23:56:32.226533Z","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:e74a65e74171a24daecbc5d18bf1d885cf80c07a98dc898e79a1ffb2b2ebd7b4","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-07-30T23:56:32.226533Z","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:b81e96be477144a7b07ef5216aafa4b37ef46d28f4f901f30e194f9cf66fc41e","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-07-30T23:56:32.226533Z","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:d2e129edd9abfe4bee16043559ae57224842294d26f43da782a4cd05be077aa7","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-07-30T23:56:32.226533Z","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:266979007027212cab3a60648c98bbe72ab23355fe1b95d61615f96fada84fb7","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-07-30T23:56:32.226533Z","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:993e536d284e4f96583226f8f0fea81df0654a3234e7f433c4a80d17dd86db19","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-07-30T23:56:32.226533Z","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:c0994075ca51801117157c1b7e014776f350d1fb958869a2b191b7ccb4ccc6f2","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-07-30T23:56:32.226533Z","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:84ff46dbc854decf68420e5f8ea0e880715586c0527870bbf89790daa9ee119d","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-07-30T23:56:32.226533Z","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:885b621583150e6aecfe563d13f4fba2a4bc29d49e93e0fcf58777794be7c295","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-07-30T23:56:32.226533Z","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:a0b50e8ff29136661c1df9932a30409ba0934fd566a3c5332b82c8654acb414d","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-07-30T23:56:32.226533Z","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:152e3fdd6d2b2e5b09929da8de38b8c2bc75c58a784634f323403c1b8f54d08a","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-07-30T23:56:32.226533Z","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:167e2b8d6e1d9bdd26c6966400445191c71b5883eeaf20bd62b397e2e035b3e2","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-07-30T23:56:32.226533Z","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:29ad3e12982599ca02fc4f64f197b6488f3cff4e2350a9b7fea4b0d0273079c6","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-07-30T23:56:32.226533Z","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:1dcfd4f006d52c889e158acf421194a14babacad5c56027725be061e9bf41ced","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-07-30T23:56:32.226533Z","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:7df4f214c93e5560f4d17ed5ba8447da821fda1de1141a12dcd41cb91944ef1f","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-07T17:02:20.731511Z","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-07-30T23:56:32.226533Z","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:188d871f3770e02afb84fc4e0478a8fab2fa9afc805a0f10784f33934122c04c","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-07-30T23:56:32.226533Z","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:f38f0c7e7fa34fe44d9e9410d07402a28229931267c4c69671bdb476fe092720","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-07-30T23:56:32.226533Z","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:1538754c630b2ccaeda316fb6584a2d7afb462ecbaa6aa83fa5da9a143659ecd","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-07-30T23:56:32.226533Z","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:846ca038ccd7e033241fab2e670348c70a8afb43e1c0648ce8dea73b8a852cfa","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-07-30T23:56:32.226533Z","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:c1ebca495de93c58268d44bf1a43272ee838cdcede72ad56ad031796b63ea4af","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-07-30T23:56:32.226533Z","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:8fb119789ea7d2be86e0fbe37681f8f9e4f3dd968f77fa68f0e97fa162798f39","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-07-30T23:56:32.226533Z","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:2fa67efdb8e9e2445217ee0bb3c08a1d2bf954e155c0a08b2db4013d66de6683","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-07-06T11:24:49.784288Z","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-07-30T23:56:32.226533Z","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:c0d85b0a26877171fd1e0427afaaeca3fbfd5aa63b127a51028bb41e95e44cc3","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-07-30T23:56:32.226533Z","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:2fa7a60e9c4b36752ad2fb699ec17d9a980927d008ebd77b056b1a2fd974c59f","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-07-30T23:56:32.226533Z","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:d220d6fef40a2b2e92b24bc1b9e96a7619d84c6a5c273f6be76bcc781a752b56","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-07-30T23:56:32.226533Z","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:92d214cef5c38366aa58f3ed7393392594013a7d867956fda7a881b331f138ef","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-07-30T23:56:32.226533Z","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:c1aec7ed7fa689d3b199ce9f927b5240eb3a48a8ee4c36660cbe3451592f6cff","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-07-30T23:56:32.226533Z","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:83fc4600c588e0fa350a6cc1d777a58a9a5d2f62dbced52be972c1ad4e7791df","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-07-30T23:56:32.226533Z","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:e3176cef40e57aeb513ff5cc2a31113825d0625262ac3f3319c9f4a37c292ee0","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-07-30T23:56:32.226533Z","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:efb78e52da3beba35b6b4f7d39a5c1a7a73ba22cc20f5af780c1f8fde8181532","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-07-30T23:56:32.226533Z","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:0eb0ec063a5b5ca8784fd5d9891bdd9e21215735171f6ef46bb6c1acc31feeb6","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-07-30T23:56:32.226533Z","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:560984089b1f17e9cc1051ece66c3ced0d19dba7b8c0db02aac43d7e5f0a4b3a","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-07-30T23:56:32.226533Z","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:b1d8023ee245d758a9a37c23ab67afd77a94bf685f9118961bd0c272f180564a","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-07-06T09:15:51.648333Z","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-07-30T23:56:32.226533Z","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:9b972e1eb04ec164ed92ecb4633182d9b274f9ba4162529fa006dae64b4aaee3","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-07-30T23:56:32.226533Z","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:389cb9558879eb541fdfcd39d3248a1a3721f5bd00dac2f1004ecee8b6a26d1c","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-07-30T23:56:32.226533Z","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:329ddc893dfcbc6f21ae9b64431fb5be8d72915bf4fd9089dabe3244570fbe25","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-07-30T23:56:32.226533Z","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:3158bf6606c517be868f1f1922f6484ac0d895496404b1165eb8491280a3ce7d","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-07-30T23:56:32.226533Z","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:afa86ab99d4ca37f79f17a2c5898895de0437bc24b9da50caa5d11351c101b58","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-07-30T23:56:32.226533Z","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:d77882a404f860b7fd9d4a6d69401dc26350a520eff6a8a4bad1056b165a158e","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-07-30T23:56:32.226533Z","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:3306c49559766d9941f4bb6a4c7b7a8fd3bf5b9083a57800c67c03ddd643c3ac","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-07-30T23:56:32.226533Z","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:18e3ddc0c57bb127942279300cb8fd9283ae27205e9acca385f2027c2a6baf1c","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-07-30T23:56:32.226533Z","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:6e052f272a474ffe2685c47c485c690471f3440a2234bdf933e49c18ab1334b4","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-07-30T23:56:32.226533Z","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:d9906197710893f06cbc5c85038edf73cf848d1b587cce91775a4eb0456faa2c","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-07-30T23:56:32.226533Z","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:0f820896321ae1e9fc1e1dc262dbeeb23d08ed460be875b8c06a1813f390b74b","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-07-30T23:56:32.226533Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2607.23679."}