{"as_of":"2026-08-11T15:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1440f5fc50e2fc7f27995afc13abe0aaf3f301f90bff887583f7af6b1761a4db","coverage":[{"denominator":276,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:53:09.475755Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"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/2608.04324/citation-record","integrity":"/paper/2608.04324/integrity","json":"/paper/2608.04324/citation-record.json","paper":"/paper/2608.04324"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.016803Z","title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.016803Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:5e1268c188cf83eb71457d5893046927de01780c38f10022d219adaa4ed4f79e","observation_id":"1b18d7c5-5107-4638-8077-05d9ecfde384","resolution":{"observed_at":"2026-08-08T19:53:09.016803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.022138Z","title":"Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.022138Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:85a500201a1b0d7d9619a149078c759b84c3f20a21bb8c52a392c1a692606d11","observation_id":"2924554e-35a0-4a83-9592-c429583c49ff","resolution":{"observed_at":"2026-08-08T19:53:09.022138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-08-08T19:53:09.027483Z","title":"arXiv preprint arXiv:2407.17466 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.027483Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:4d38116724685755c75b844b9dd477b732330b77dc160e973999fab8e255a3ed","observation_id":"1c10cf1e-909c-499b-9ac3-035e593912f3","resolution":{"observed_at":"2026-08-08T19:53:09.027483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.032770Z","title":"Multiobjective Lipschitz Bandits under Lexicographic Ordering , journal=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.032770Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:46b01e2bcec1a0b271302acbee0eaf99939b7c333d014f575d53ed2aa98cb27b","observation_id":"4e2ec7ac-c539-4645-b01e-c36cb9b02003","resolution":{"observed_at":"2026-08-08T19:53:09.032770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.037499Z","title":"Proceedings of the 34th International Joint Conference on Artificial Intelligence , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.037499Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:e1d2b7146a1446586403fa62e369062c406de27efa5dd7be9fcd605de9aa1c2b","observation_id":"521f2f37-45cb-4413-94c4-e1b0439e1c43","resolution":{"observed_at":"2026-08-08T19:53:09.037499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.042445Z","title":"Multiple Trade-offs: An Improved Approach for Lexicographic Linear Bandits , booktitle=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.042445Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:5acda11eedc14233eda22f1c9317f3dc79530ff9add47dfa2c4aa7d976edd0d3","observation_id":"cb77b524-a7ae-4b12-9a24-485671cde2b0","resolution":{"observed_at":"2026-08-08T19:53:09.042445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.047804Z","title":"Proceedings of the 42nd International Conference on Machine Learning , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.047804Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:24eefa00668d5bfe73059d0da1239e99fe395f4a43de6ab12ec121a79ffa33ff","observation_id":"68ae0177-6143-463f-903d-994ec97c214a","resolution":{"observed_at":"2026-08-08T19:53:09.047804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.052208Z","title":"Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits , booktitle=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.052208Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:8930b1a992e0a173667e3dab61981d3797c5b913b5ff5ea92cfa6bcb15d707fb","observation_id":"87e4c9b6-7aef-4d1a-8b15-79ead11e1752","resolution":{"observed_at":"2026-08-08T19:53:09.052208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.056950Z","title":"Proceedings of the 34th International Joint Conference on Artificial Intelligence , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.056950Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:27160f3339b2b7b6809bfecfbc85e8ceb86281f995ff873597f861947854a20d","observation_id":"d3a6b9d0-ed04-4265-bf3a-ad3cea3b000c","resolution":{"observed_at":"2026-08-08T19:53:09.056950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.061506Z","title":"Using Confidence Bounds for Exploitation-Exploration Trade-offs , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.061506Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:b8eeae49ed8db20da72f1986ef5ff8f9db939736d71d6f4e72d11b9ca9b841c1","observation_id":"ee91c123-e0db-4fe5-8e95-3e5a035ee425","resolution":{"observed_at":"2026-08-08T19:53:09.061506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.066116Z","title":"Bandits With Heavy Tail , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.066116Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:2784ce88289f11bdd6f479f8f615552c1907e12ef88955496df6c30a2d8e69e4","observation_id":"bb4258de-3227-46b1-bd18-8611b9dcff33","resolution":{"observed_at":"2026-08-08T19:53:09.066116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.070559Z","title":"Weighted sums of certain dependent random variables","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.070559Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:48baa5d4e0052dd73fd46fc41dd2aa4945a13705f7462efb4baab1384a7cdc5b","observation_id":"2720f3e5-3b33-4646-a01c-3873e1cd91b9","resolution":{"observed_at":"2026-08-08T19:53:09.070559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.075538Z","title":"Annales de l'I.H.P","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.075538Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:a80dc5dc77e14df6608d30ded955013e51570da3570b703bdf7b740af11e8668","observation_id":"4471c82e-547d-4f61-9a22-09d8348c4d38","resolution":{"observed_at":"2026-08-08T19:53:09.075538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.080328Z","title":"Some aspects of the sequential design of experiments","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.080328Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:4880d109504b0cacd9180f281f41f81d2ce17101da71036b3614ae8f21aa3059","observation_id":"c4f34e55-408d-4310-a419-e4d33325fee6","resolution":{"observed_at":"2026-08-08T19:53:09.080328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.084983Z","title":"and Long, Philip M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.084983Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:1f403907633cfa4986bb78754aee130af5a91db18416178fc691ac030ac0b1f3","observation_id":"7eb2ea2d-02e2-458d-aefc-8614d9f058b1","resolution":{"observed_at":"2026-08-08T19:53:09.084983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.089566Z","title":"The heavy tail of the human brain","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.089566Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:93a188c789de20c93bb181e474c6077db88924fe985b2eade80163cfb535796d","observation_id":"d7b61f5e-c897-4a85-8b87-e269d98dfd9d","resolution":{"observed_at":"2026-08-08T19:53:09.089566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.094230Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.094230Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:f41513cfcfcbed8610f4dbbac7f7d2721ded131c20050cf359937040caa7529b","observation_id":"7ec97c88-657c-4996-b0e8-22cfb3ef2e28","resolution":{"observed_at":"2026-08-08T19:53:09.094230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.098662Z","title":"Proceedings of the 33rd International Conference on International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.098662Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:1c8cb6b1fcc8b082b59e71ea8fb647d1906c8f55f481647ff1e9b16f31278ed2","observation_id":"d40129d6-33fe-444d-b3a0-4e9980e39b80","resolution":{"observed_at":"2026-08-08T19:53:09.098662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.103102Z","title":"Proceedings of the 14th International Conference on Artificial Intelligence and Statistics , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.103102Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:0c53bd005c68713bf0810c0fad52ebbc6f4ca01db456d342fd3c84ebe171debb","observation_id":"d5a888b1-52d9-4283-a36e-93e0c728196a","resolution":{"observed_at":"2026-08-08T19:53:09.103102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.107503Z","title":"Proceedings of the 31st International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.107503Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:c1de07763f062ef2aff9c03276b1a8612eb54a9e32a1217703fc8522a2f3e203","observation_id":"9d60cf49-2fae-4574-87df-bff0e519f694","resolution":{"observed_at":"2026-08-08T19:53:09.107503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.111921Z","title":"Proceedings of the 31st Conference On Learning Theory , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.111921Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:ad18a2ae0547cc81e1d6fb7a183e5a1697af4a683e3620b0285443da498df1e9","observation_id":"f4a347e9-4859-4b07-8c2f-b99a5c7acf85","resolution":{"observed_at":"2026-08-08T19:53:09.111921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.116374Z","title":"Proceedings of the 31st International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.116374Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:94e4223ebce4d4c7e3f742d1cfc6b3725e0570f4995ebeb197b320a7e0f4b950","observation_id":"7d608f87-5520-49f6-9e86-c587c6d3b300","resolution":{"observed_at":"2026-08-08T19:53:09.116374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.120620Z","title":"_1 -regression with Heavy-tailed Distributions , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.120620Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:c09dab98272f0aafe8b992f3b84f0039f4c2846390ace33b3eaed1ff9fcb6788","observation_id":"ac0305cb-516e-4bfa-9b99-1c95f7656419","resolution":{"observed_at":"2026-08-08T19:53:09.120620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.125325Z","title":"Online Stochastic Linear Optimization under One-bit Feedback , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.125325Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:a8aeb2c86b152f99029eabb5edfb46bbdb2b52adbc1733b374f6e75f7c47467d","observation_id":"4ab11eb4-b749-4767-a6b3-1b14000c9fc6","resolution":{"observed_at":"2026-08-08T19:53:09.125325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.129736Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.129736Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:4342623cbd7207accfe590ccc465bea5d36b641f50a4f801c4836c5b341e58cb","observation_id":"54252108-e3b2-429d-bb43-2eb08cb01d60","resolution":{"observed_at":"2026-08-08T19:53:09.129736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.134095Z","title":"Advances in Neural Information Processing Systems 24 , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.134095Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:8c792b09dc81ef99253c2be27163d8c30081a3f8998173a4f913fd8ec6e40d35","observation_id":"99b8dc00-4a12-4cb6-bc6e-a50659576d68","resolution":{"observed_at":"2026-08-08T19:53:09.134095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.138869Z","title":"Proceedings of the 15th International Conference on Artificial Intelligence and Statistics , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.138869Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:e2a4365747ff75cb742ed7264de01a1ebec0aaee1d30118021950a542637d156","observation_id":"17288ba5-a570-484d-b15f-43dcde52f51a","resolution":{"observed_at":"2026-08-08T19:53:09.138869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.143445Z","title":"Advances in Neural Information Processing Systems 24 , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.143445Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:eee80eae6fa72d0c06a5636bf6e3cee525401607a48c03a4144ee7778c7461e0","observation_id":"d5a6cdfa-5f99-4728-980c-db87eb1819b3","resolution":{"observed_at":"2026-08-08T19:53:09.143445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.148006Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.148006Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:95651c9e592ef96ed6fffc747fd88d9188811857689e333d23bb26e3298a38f6","observation_id":"9041f2b7-fef4-47ab-9f81-143e8984268f","resolution":{"observed_at":"2026-08-08T19:53:09.148006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.152320Z","title":"Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , JOURNAL =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.152320Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:3012d9a79d666a2c16031d5aaa861194eac70f6dc8cf3d889b0b3b29d0f4169e","observation_id":"efd0290e-d82e-4e9f-8fa6-840fe70cec36","resolution":{"observed_at":"2026-08-08T19:53:09.152320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.156970Z","title":"Asymptotically efficient adaptive allocation rules","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.156970Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:f6bab9863981737d29d3e6abc83213ad5a64d75be36381b330677e3764cfde5d","observation_id":"a5b6d329-3cfb-4cf0-b550-0358db7c1079","resolution":{"observed_at":"2026-08-08T19:53:09.156970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.163408Z","title":"Proceedings of the 23rd Annual Conference on Learning Theory , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.163408Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:62f3538c2446b4d2913cb29c864a19788745c451d1f9192792bebfbbd094b500","observation_id":"68dfa5c5-141a-4a45-bacc-dbd2c460ad0f","resolution":{"observed_at":"2026-08-08T19:53:09.163408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.167921Z","title":"Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.167921Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:5834c2df43131031c5f7f23c783fd4b0fcb0f7396183e69ed128781209b196fb","observation_id":"53b44770-fc74-4c99-a348-1e9f5892c61f","resolution":{"observed_at":"2026-08-08T19:53:09.167921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.172382Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.172382Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:ad1875aa481cd000d37823effe6a29fd31c076d6ecbcb694aea26786ee7944c5","observation_id":"a91b7b83-b492-42ee-966d-afd271ecdd55","resolution":{"observed_at":"2026-08-08T19:53:09.172382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.176891Z","title":"and Kalai, Adam Tauman and McMahan, H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.176891Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:d91f456aff19d234160761b20c30e2f315e71e996a7035b98087dac72efc9f02","observation_id":"3a44f4ab-38e0-4cf3-b7a9-d5a35abba033","resolution":{"observed_at":"2026-08-08T19:53:09.176891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.181299Z","title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.181299Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:dc0e4cadd20cddb791a4a2aca56f66666be1ea80a32b395ace6f47c1ca7d024d","observation_id":"c122132b-19e2-4d5c-a0f9-b5a373f49d36","resolution":{"observed_at":"2026-08-08T19:53:09.181299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.185718Z","title":"Advances in Applied Probability , YEAR =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.185718Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:b1e1a89d2ecd6120264ba9a1c398731aaf9abec1dbf39a7c8a0f9d0d143b0834","observation_id":"ce86a944-b80b-4639-bf11-04121ca54a9c","resolution":{"observed_at":"2026-08-08T19:53:09.185718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.190727Z","title":"Finite-time Analysis of the Multiarmed Bandit Problem , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.190727Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:424febe25b49360c9f6fa565bb445948d6dd4bf53d8cdd3f3eeb0b26c2dc1fa2","observation_id":"11b6b918-e67f-409b-8aff-22cecd14ab93","resolution":{"observed_at":"2026-08-08T19:53:09.190727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.195246Z","title":"IEEE Journal of Selected Topics in Signal Processing , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.195246Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:5004acd17c00606c97e8e274ab7a2d7ae7ec180d2895d52a2e3b07bbd9f09019","observation_id":"e6d98af5-a79a-4469-afcc-134f534cd96a","resolution":{"observed_at":"2026-08-08T19:53:09.195246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.199961Z","title":"Hayes and Sham M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.199961Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:f7b610fa37793f470efdac2531e491430e895182b240610ca8f7983cb1c171fa","observation_id":"a16619cd-e3a9-4750-b96b-9986bb15605d","resolution":{"observed_at":"2026-08-08T19:53:09.199961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.204364Z","title":"The Nonstochastic Multiarmed Bandit Problem , journal =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.204364Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:e461d76db466eefc5c07f3e15f5ca18e75554a82593e38ddac3ceec7af5a381c","observation_id":"2027dc6f-8405-47c8-be80-28377d525d89","resolution":{"observed_at":"2026-08-08T19:53:09.204364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.208945Z","title":"and Thomas, Joy A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.208945Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:a064f5522da56c83c7d0685789fab29e678ce89a553ed1a6dc126d102241c1e8","observation_id":"00c45d5b-b504-4932-9b0a-0a6dac13f747","resolution":{"observed_at":"2026-08-08T19:53:09.208945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.213502Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.213502Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:03a3939ecfc2958be7c3e95b45c26375b746487bd8f2675c2f72bc49c335908f","observation_id":"af675c05-abef-481e-b8a9-fd623168375e","resolution":{"observed_at":"2026-08-08T19:53:09.213502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.217976Z","title":"Robust linear least squares regression","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.217976Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:e18055ea606ad5a6283e5e8587277846dc4ab251338443e2f61638a9a04ef4d4","observation_id":"481c8366-f331-41b9-937f-2e98850c0265","resolution":{"observed_at":"2026-08-08T19:53:09.217976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.222734Z","title":"Empirical risk minimization for heavy-tailed losses","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.222734Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:8a1b28a4aaf0660113ea8309569116f660bc60b1734af790775c68122855648b","observation_id":"e66f4168-42af-48aa-9909-91a6523b749f","resolution":{"observed_at":"2026-08-08T19:53:09.222734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.227583Z","title":"Journal of Machine Learning Research , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.227583Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:1cfc9cc949bb0a9cfae1332382558c1903902733abb504105c9dc2411bcc0f78","observation_id":"bc84535e-c8c6-4940-9134-d92879c3053a","resolution":{"observed_at":"2026-08-08T19:53:09.227583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.232138Z","title":"Proceedings of the 36th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.232138Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:286696673531a1282dea6de84d070f890396b9874b4bbd7c1e4694f49fda56c8","observation_id":"ca40584d-c2f9-4081-a323-9259f8e580ee","resolution":{"observed_at":"2026-08-08T19:53:09.232138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.236816Z","title":"and Van Loan,, Charles F","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.236816Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:26ec749f77e9fa04c2268f611ecd85627980ec1d9759ebfd3bf99179354d8a51","observation_id":"5b8ff94c-8cab-4dba-bf85-3ef9b26c8e01","resolution":{"observed_at":"2026-08-08T19:53:09.236816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.241370Z","title":"and Hsu, Daniel and Kakade, Sham M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.241370Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:c067655f190de87abe0aba8bbf2767c2a6f46dcb96a19da1786feb330b7b9117","observation_id":"cf980ba6-c73b-4917-ad70-e2e8055ef94a","resolution":{"observed_at":"2026-08-08T19:53:09.241370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.246206Z","title":"2014 , journal =","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.246206Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:555f5c4b5bf33b4ba702474548cfc3b4f836f71dc85d1b5b7975bdc0eafe06f6","observation_id":"7c046065-8c26-4de6-9e82-5eb12acc30e3","resolution":{"observed_at":"2026-08-08T19:53:09.246206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.250881Z","title":"Lyu and Irwin King , title =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.250881Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:3f6e45521e97640b883e5ac900666037a91659b139311feb3a3951111915183d","observation_id":"e7187b45-e7d4-4873-9236-c04f9d9297a5","resolution":{"observed_at":"2026-08-08T19:53:09.250881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.255292Z","title":"Lipschitz Bandits Without the Lipschitz Constant , booktitle =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.255292Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:60cbdcce9f32ff7383742d446acdc958f2bb5bae185061212a8cfa3ab7e99fca","observation_id":"57dfc09b-156b-4131-8d2b-5dc911583ce0","resolution":{"observed_at":"2026-08-08T19:53:09.255292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.259752Z","title":"SIAM Journal on Control and Optimization , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.259752Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:7c73f41b4492643e6abec52d60afa70362c41265e96df7e6e8449ac44b93562d","observation_id":"357c4127-1175-445c-a5e4-2bdbfebe94c7","resolution":{"observed_at":"2026-08-08T19:53:09.259752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.264340Z","title":"Bandit Convex Optimization:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.264340Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:b1f99f813664442d204054f5775ac376d84ebe98d3f09532d51baf2c14a29d10","observation_id":"8f984ce6-67ac-4e47-bf98-354c05a7ea69","resolution":{"observed_at":"2026-08-08T19:53:09.264340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.268866Z","title":"Bandit Algorithms , publisher=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.268866Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:03ddfe090228832548c7455e233c216e0214e46f8ef17c43add6cf80306c674d","observation_id":"f491f7f7-dc50-4928-9000-40817773d87e","resolution":{"observed_at":"2026-08-08T19:53:09.268866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.273680Z","title":"Advances in Neural Information Processing Systems 23 , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.273680Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:e8f5602eed1ce2f884c6631ac979db967a75b64695cc1e5da39c3cb6b16350c7","observation_id":"3d106b8b-2d52-4044-96a0-fababf6e3ecb","resolution":{"observed_at":"2026-08-08T19:53:09.273680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.278425Z","title":"Advances in Neural Information Processing Systems 30 , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.278425Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:00635c6dd9600a664d6455e10e69038c9b69d5aeb7bbb605f633b929b16812ac","observation_id":"3c13b773-628b-4577-a0ce-97a3633f6bc0","resolution":{"observed_at":"2026-08-08T19:53:09.278425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.282854Z","title":"McCullagh, John A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.282854Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:cc7b5baeee1ebc2d199cf7fd2decdd4a4484e137a856f414ddfa5c723ecb7fd3","observation_id":"bcc1c52e-94ee-4d8e-bd2f-a24975dce285","resolution":{"observed_at":"2026-08-08T19:53:09.282854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.287153Z","title":"Hubert and Shi, Elaine and Song, Dawn , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.287153Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:013e6436bb5b61e1bbb8249f908b630c5e120140ba1d7602d94e6ef57f63e17f","observation_id":"dc0e48d3-0b68-47b9-9581-2380a8beaaf7","resolution":{"observed_at":"2026-08-08T19:53:09.287153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.291620Z","title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.291620Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:b1a339442005c27ce6ccfa71a7dc2c100bdb1d44e8c63dbdb8dd1d5c82586cf9","observation_id":"310e1662-9399-46e0-b62d-1a6905edf15d","resolution":{"observed_at":"2026-08-08T19:53:09.291620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.296164Z","title":"Logarithmic Regret Algorithms for Online Convex Optimization , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.296164Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:9c265c7477bd89cf2f71bc27f2f62717eac2452eb4220cb184cb3467b9b28660","observation_id":"2b8733e0-13bc-409f-8483-b5c2b3f0483b","resolution":{"observed_at":"2026-08-08T19:53:09.296164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.300756Z","title":"Proceedings of the 34th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.300756Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:cfad6ab23f925a6dc8d07dd5882e8c48dbcf4b3535ad30e70a35db73d41a6192","observation_id":"45ea9c9a-e52b-4875-822c-fc7063d22e03","resolution":{"observed_at":"2026-08-08T19:53:09.300756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.305252Z","title":"Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.305252Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:3c8e517c6de6582c90cac949bff09117f362006e6ade78d41d7b47873622f03a","observation_id":"506bf8e2-68be-4385-b233-923f6895072e","resolution":{"observed_at":"2026-08-08T19:53:09.305252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.310109Z","title":"The Annals of Statistics , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.310109Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:eaf22900035b9c240a31a7c1ddf92094158619c869477953611742bfcaaeeb42","observation_id":"8c994fdd-080d-43f7-94d9-80f90d37e68f","resolution":{"observed_at":"2026-08-08T19:53:09.310109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.314526Z","title":"Bayesian Optimization under Heavy-tailed Payoffs , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.314526Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:d760d36299cd6157a37d5d6d4939889874f0446e41e52586938e06fc87a81f73","observation_id":"47574c66-4298-43ee-a7f2-900c45c15711","resolution":{"observed_at":"2026-08-08T19:53:09.314526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.319012Z","title":"IEEE transactions on pattern analysis and machine intelligence , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.319012Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:7a13dc836b377353e2e553113d90b5eb095a7262d04029861c20a1bda5a67699","observation_id":"14df5482-dbc6-4a82-b305-a24ef1219b6f","resolution":{"observed_at":"2026-08-08T19:53:09.319012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.323469Z","title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.323469Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:2405fb302bd08b8796318637795dcb3257b0846d69998dfe4cd69f1fb8b5d7cd","observation_id":"da96c6c5-04f8-493e-a093-2ddf661add83","resolution":{"observed_at":"2026-08-08T19:53:09.323469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.328021Z","title":"and Nowe, Ann , booktitle=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.328021Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:0ded2d9488021243efd3c416b8136c506ffda11bc0c0daad553823cf6679803a","observation_id":"0798639c-a38f-40ad-afbf-67d12d08af36","resolution":{"observed_at":"2026-08-08T19:53:09.328021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.332389Z","title":"Proceedings of the 19th International Conference on Artificial Intelligence and Statistics , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.332389Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:11b21558f2829a96d7beac5eb462c650710d382c04580e5611479bebcc0d68ba","observation_id":"225bb2cc-a9fd-4c4b-896f-c20f1b4c17a7","resolution":{"observed_at":"2026-08-08T19:53:09.332389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.336703Z","title":"2005 , publisher =","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.336703Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:9cad104c8d7a5734bd7d1d2a3e63906583bf8d9e0071e969d73040b09f6fc067","observation_id":"7c0dc8cc-d082-4193-ad71-88c1a2dd48e8","resolution":{"observed_at":"2026-08-08T19:53:09.336703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.341444Z","title":"Multi-objective multi-armed bandit with lexicographically ordered and satisficing objectives , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.341444Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:1d6e8d2fa869928d65f59d94e37c0c4f9a249f63167c3ad82f4e719aeda390be","observation_id":"fbbf5693-e174-4835-bc70-fc9a1272ecfc","resolution":{"observed_at":"2026-08-08T19:53:09.341444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.346287Z","title":"Proceedings of the 21st International Conference on Artificial Intelligence and Statistics , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.346287Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:7609a372a6051b6285d8ce080d8429e5cb2641907d721713bfd2fa939cc81c6f","observation_id":"2d63940e-9504-4aba-aec9-e918c21a8bb4","resolution":{"observed_at":"2026-08-08T19:53:09.346287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.350829Z","title":"Multi-objective","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.350829Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:5e6affe0f373273a645714419e591969a49e79d738d72b88ac89af2b71264dec","observation_id":"55d81473-f3fa-4497-b783-782ccc689f67","resolution":{"observed_at":"2026-08-08T19:53:09.350829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.355284Z","title":"Proceedings of the 39th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.355284Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:d3e437a74ab82410e8b85fcb4d860796c2f351fe797f8ab5c30e0dbeb0400035","observation_id":"b8da2baf-7c92-496b-89fa-d15267cf9237","resolution":{"observed_at":"2026-08-08T19:53:09.355284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.359871Z","title":"2016 , booktitle =","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.359871Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:d21cfa2486a62077125f93989f7fe4e308a982a596f037d85fd1fd9a6795b9a4","observation_id":"1b13bb9d-f07b-46b1-b2e7-5d79a7899639","resolution":{"observed_at":"2026-08-08T19:53:09.359871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.364358Z","title":"2012 , booktitle =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.364358Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:a45041d628348173c9a8f3a724841a6a6e8db5cc8983c88d9194e4815eb15089","observation_id":"b3efe0b0-cef0-4f12-a925-18be9e79e19c","resolution":{"observed_at":"2026-08-08T19:53:09.364358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.368773Z","title":"2004 , publisher=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.368773Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:da067850f732048d65a9380f17094f30f5ca5ef2eae1bb4b67f1dc67d83c87f5","observation_id":"d1488ce1-295d-45ab-8387-bb457274683e","resolution":{"observed_at":"2026-08-08T19:53:09.368773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.373360Z","title":"Breaking the","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.373360Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:70b2dbc37a2a731c853dfa3f5c6a7e8007f8a92c6acfd458bdf995a1a47a0b51","observation_id":"749bf63f-5548-4c70-92fa-59649ffda1fb","resolution":{"observed_at":"2026-08-08T19:53:09.373360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.378018Z","title":"Proceedings of the 39th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.378018Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:8f81463a38865307dff200091a26c78b98780cf11dae490f71d4ec56ffcd36ad","observation_id":"e283dce8-2a2d-4a4c-b3b3-63ac68dc60f8","resolution":{"observed_at":"2026-08-08T19:53:09.378018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.382869Z","title":"Proceedings of the 39th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.382869Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:ba2d5eb3693eaa4ddebd41ec6f9769970d58303500dcfdb6784588c9c58d7441","observation_id":"1e331d39-5c00-4ab9-b210-2a7c3c5ba941","resolution":{"observed_at":"2026-08-08T19:53:09.382869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.387627Z","title":"Proceedings of the 39th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.387627Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:ce2b699f45d6bbfb79a779f2c7577f7deedfd59e9bb986d47cb8d04f40ab4c3f","observation_id":"bcbfdd91-3060-4ef2-8daf-07a82c4466f0","resolution":{"observed_at":"2026-08-08T19:53:09.387627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.392171Z","title":"Proceedings of the 39th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.392171Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:fea280645407571c1025d5e3c414f1cebde7720b3c3e4a5b386fe9c097d0aaf4","observation_id":"ced82e69-f1b8-408a-8b29-a91a9cc64e3d","resolution":{"observed_at":"2026-08-08T19:53:09.392171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.396724Z","title":"A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.396724Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:28dcd6e776845e59c8d5b5e3bc4b59d36e3819d160065ba27723b7292ecaec8f","observation_id":"259c6cbd-fa51-48c8-8ed4-7b1830a2ca4a","resolution":{"observed_at":"2026-08-08T19:53:09.396724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.401189Z","title":"Lipschitz Bandits with Batched Feedback , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.401189Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:f647097a48e7e59c10611113f8b5a15b9fccb311da80a3b9309781ae64da43df","observation_id":"01c36314-c665-4518-8d06-21927b8555fc","resolution":{"observed_at":"2026-08-08T19:53:09.401189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.405809Z","title":"Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.405809Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:0a9614cc8b3db125abce8400a136751bc1739c70e148e39b763da2bf9b0eb979","observation_id":"895cd290-b873-484d-8c90-bc3164dbf7dc","resolution":{"observed_at":"2026-08-08T19:53:09.405809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.410274Z","title":"Communication Efficient Federated Learning for Generalized Linear Bandits , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.410274Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:7de60f76fc83ab01a47732f1a17687221513aeb79e2ed132b77a98befb7bcb2c","observation_id":"73bad6fb-e866-438a-b6d9-b9323482e4af","resolution":{"observed_at":"2026-08-08T19:53:09.410274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.414841Z","title":"Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.414841Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:89b63709621c8477501ebc003181090632a2c17a5d46cbc4b2969811f9e3d25f","observation_id":"fb8e6061-4918-4e8f-9e05-17315618ceb5","resolution":{"observed_at":"2026-08-08T19:53:09.414841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.419727Z","title":"Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.419727Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:63e1d165690f1179f44c6271d2a163b4269610e932c96e43888d3fe1f1b30b42","observation_id":"3441f407-f10b-4e30-8ea0-dbfa50f2b766","resolution":{"observed_at":"2026-08-08T19:53:09.419727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.424321Z","title":"Proceedings of the 39th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.424321Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:839a776aae39a2f281b18d7958e137a32fda5abaa570b6dc81c7600e2e97ab8e","observation_id":"586e5b56-8c68-4060-b503-d8f6f0fe53a9","resolution":{"observed_at":"2026-08-08T19:53:09.424321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.428874Z","title":"Proceedings of the 39th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.428874Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:226d5e6b450e7548fa5695827cbe45c109ff5278fa0c3ad6016170abe9b38542","observation_id":"cf1e3cc4-f27c-440f-9adb-4ac141d13922","resolution":{"observed_at":"2026-08-08T19:53:09.428874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.433390Z","title":"Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challenges , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.433390Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:7222a4b4f2e92a83da39de527ff5533c15acff8fc1aefa593b4bb99a40854156","observation_id":"ec1884ca-b49c-4d9a-9c2d-c82130a816cb","resolution":{"observed_at":"2026-08-08T19:53:09.433390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.438102Z","title":"MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.438102Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:753536f5b2fb880dec1d97a01df247ef7cff49b5605c0ebfd88a369ce9aa4edc","observation_id":"ebe8c305-cd43-48ee-b0cc-fbde8234c460","resolution":{"observed_at":"2026-08-08T19:53:09.438102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.442722Z","title":"Proceedings of the 38th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.442722Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:52e972e5bbcb9d42f21e1d27fd2856b08eaaf1df2955fea60dc0acfa8463f128","observation_id":"02847dd0-c1ea-41ec-ba49-644a50ed3c0a","resolution":{"observed_at":"2026-08-08T19:53:09.442722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.447501Z","title":"Proceedings of the 38th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.447501Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:20044e022adb49bd0705918d645828add8e64e9fc5742aff6ee009f580d70f31","observation_id":"b208fd28-3f5d-441d-9b83-bbd3c61551c8","resolution":{"observed_at":"2026-08-08T19:53:09.447501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.452132Z","title":"2012 , volume =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.452132Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:c1bced0acf4cd78bfef50af212e92af5877ee963be2283c63bbccc29d3ace784","observation_id":"d44d16d6-e7c4-4c38-855c-180ad1224511","resolution":{"observed_at":"2026-08-08T19:53:09.452132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.456986Z","title":"and Barto, Andrew G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.456986Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:58b897be7c0bb0aa897feee18b52fcc519da5da0db4f5699c2e7a0f0a5568430","observation_id":"675c1f2e-f83f-465f-b49d-9763f1b01d3e","resolution":{"observed_at":"2026-08-08T19:53:09.456986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.461616Z","title":"Proceedings of the 24th International Conference on Artificial Intelligence and Statistics , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.461616Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:21f65e4eb99776cae6c047319fce022a167010e64a3a33076c5442af27f12eab","observation_id":"45ae5bd6-aace-441d-b0e3-7479b40e322e","resolution":{"observed_at":"2026-08-08T19:53:09.461616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.466197Z","title":"PAC-Bayesian Inequalities for Martingales , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.466197Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:230da88a45fe76145dabeafb999f37607955f10f9b9488a54a3b2f5fb6eef81d","observation_id":"0b66654f-1dae-4cd6-8266-4f914d89d23a","resolution":{"observed_at":"2026-08-08T19:53:09.466197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.471140Z","title":"Learning in Generalized Linear Contextual Bandits with Stochastic Delays , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.471140Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:b914950d5732e998e58f3665c8ab2d91e64f63889412739aae2134e11c398112","observation_id":"f060dcd7-887d-4c9f-8e8a-243b77e6e348","resolution":{"observed_at":"2026-08-08T19:53:09.471140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T19:53:09.475755Z","title":"Advances in Neural Information Processing Systems 34 , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.475755Z"},"links":{"citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:15fca614a7cebd3de720eb5c004a3ac8591e0a36619503037cd61a343b73a49a","observation_id":"37b79adf-f71c-47c6-b698-33078b5400d9","resolution":{"observed_at":"2026-08-08T19:53:09.475755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":276},"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 100 of 276 outbound references and 0 inbound Pith citation observations for arXiv:2608.04324."}