{"as_of":"2026-08-09T20:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04e00150e64ab2d2e5a2267bbf6bd51f40732541b5e198491185d7469745a20b","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T19:57:04.463584Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-05T10:20:16.326364Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-05T10:20:57.158448Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"cited_work":{"arxiv_id":"2502.10020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.10020","snapshot_observed_at":"2026-07-05T10:20:57.158448Z","title":"Lee and M.-h","venue":null,"work_id":"46be6677-8c24-4249-ad26-44de1ff7def4","year":2025},"citing_paper":{"arxiv_id":"2604.18800","last_updated":"2026-05-23T23:42:14Z","snapshot_observed_at":"2026-07-06T23:05:35.374092Z","submitted_at":"2026-04-20T20:08:46Z","title":"Optimal Exploration of New Products under Assortment Decisions","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-10T02:54:16.836240Z"},"links":{"cited_paper":"/paper/2502.10020","citing_paper":"/paper/2604.18800"},"observation_digest":"sha256:65780e0eb228241e41a4370276c906a8097532c16205c8d128b05e877d3dc005","observation_id":"ea485244-967c-49dc-a9d6-746bf542b833","resolution":{"observed_at":"2026-05-11T12:51:02.778637Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"cited_work":{"arxiv_id":"2502.10020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.10020","snapshot_observed_at":"2026-07-05T10:20:57.158448Z","title":"Lee and M.-h","venue":null,"work_id":"46be6677-8c24-4249-ad26-44de1ff7def4","year":2025},"citing_paper":{"arxiv_id":"2604.18800","last_updated":"2026-05-23T23:42:14Z","snapshot_observed_at":"2026-07-06T23:05:35.374092Z","submitted_at":"2026-04-20T20:08:46Z","title":"Optimal Exploration of New Products under Assortment Decisions","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-05T10:20:16.326364Z"},"links":{"cited_paper":"/paper/2502.10020","citing_paper":"/paper/2604.18800"},"observation_digest":"sha256:979c6631aba6b03fb1a68623d5daf92f210c9df4073c7adcb5c44baca2b5b348","observation_id":"1cb3e46c-1f32-45e8-a04f-0985611330cf","resolution":{"observed_at":"2026-07-05T10:20:57.160636Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"cited_work":{"arxiv_id":"2502.10020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.10020","snapshot_observed_at":"2026-07-05T10:20:57.158448Z","title":"Lee and M.-h","venue":null,"work_id":"46be6677-8c24-4249-ad26-44de1ff7def4","year":2025},"citing_paper":{"arxiv_id":"2604.19008","last_updated":"2026-04-21T02:53:38Z","snapshot_observed_at":"2026-07-06T23:05:44.499005Z","submitted_at":"2026-04-21T02:53:38Z","title":"Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-10T02:33:24.470297Z"},"links":{"cited_paper":"/paper/2502.10020","citing_paper":"/paper/2604.19008"},"observation_digest":"sha256:5a6dbdf310c45159611b33f1f9704389f51ade8a04b45b31e6e2af1502afe2ca","observation_id":"4755ac94-62fb-4372-af46-e4ecdfe106fa","resolution":{"observed_at":"2026-05-11T12:56:19.300374Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"cited_work":{"arxiv_id":"2502.10020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.10020","snapshot_observed_at":"2026-07-05T10:20:57.158448Z","title":"Lee and M.-h","venue":null,"work_id":"46be6677-8c24-4249-ad26-44de1ff7def4","year":2025},"citing_paper":{"arxiv_id":"2605.19768","last_updated":"2026-05-19T12:39:32Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T12:39:32Z","title":"Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-20T04:56:35.254081Z"},"links":{"cited_paper":"/paper/2502.10020","citing_paper":"/paper/2605.19768"},"observation_digest":"sha256:e40b716d9bcd9202dfbebf9810edf1a0793d8c2e2531c64730e92b33ed2eb4e3","observation_id":"cc609e57-f4fe-4023-9cd3-8e58f7a5e6ea","resolution":{"observed_at":"2026-05-20T04:58:05.031716Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.10020/citation-record","integrity":"/paper/2502.10020/integrity","json":"/paper/2502.10020/citation-record.json","paper":"/paper/2502.10020"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.288347Z","title":"Instance-wise minimax-optimal algorithms for logistic bandits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.288347Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:115dfda70d99625fefc59368f89b5870471386b58ba9a3e779e524f97122b1f2","observation_id":"4d77ca67-19d0-48ce-8074-84a0de452634","resolution":{"observed_at":"2026-08-07T19:57:04.288347Z","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-07T19:57:04.294435Z","title":"A tractable online learning algorithm for the multinomial logit contextual bandit","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.294435Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:f9cd7c75ea983f3dd9e38371676038b290f086fbc77155b198ee00f2bfc54bc4","observation_id":"8386362a-4e37-4f85-ae78-c312b0f2bf24","resolution":{"observed_at":"2026-08-07T19:57:04.294435Z","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-07T19:57:04.299593Z","title":"Thompson sampling for the mnl-bandit","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.299593Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:b74903285847b0793bf9917e10d67e35edb1d75fc6c4bbbd2bf2cb89bf70f875","observation_id":"98ac0450-8c64-4734-9a48-1ffd666d766c","resolution":{"observed_at":"2026-08-07T19:57:04.299593Z","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-07T19:57:04.305263Z","title":"Mnl-bandit: A dynamic learning approach to assortment selection","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.305263Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:8440648ef3011339eb49aaf13fab01d20fc84bffd9ee63e9ae64afeb230daa31","observation_id":"029518b4-661e-4cc4-beb5-e994341b99a1","resolution":{"observed_at":"2026-08-07T19:57:04.305263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.939689Z","title":"and Orabona, F","venue":null,"work_id":"ecab1a33-59fa-42ef-a2d6-b83c804edc0d","year":2020},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.310417Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:641fe0ac6229947a7bd61aa860201d13c861ccbc66b970e63e0fab8b2d358dc5","observation_id":"71714843-40a4-4df9-897f-2b9ba0e877d5","resolution":{"observed_at":"2026-08-07T19:57:04.944571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.923611Z","title":"Dynamic assortment optimization with changing contextual information","venue":null,"work_id":"7a92425b-0afc-4f22-bdbf-6a0660705b1c","year":2020},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.315344Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:0b5b9a24a2a79d147c21a96c3f32dc84f618afbd6f5d89464d75abcd61a55304","observation_id":"c221067a-8140-476a-b020-4a9cc358103b","resolution":{"observed_at":"2026-08-07T19:57:04.928699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20165","last_updated":"2024-10-31T05:14:55Z","snapshot_observed_at":"2026-08-09T15:29:32.471969Z","submitted_at":"2024-05-30T15:39:19Z","title":"Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation","version":2},"cited_work":{"arxiv_id":"2405.20165","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.20165","snapshot_observed_at":"2026-08-07T19:57:04.607682Z","title":"Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation","venue":"stat.ML","work_id":"67e37360-bc07-49df-8b3e-0dd7ae6b6a16","year":2024},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.321031Z"},"links":{"cited_paper":"/paper/2405.20165","citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:6f79be8a57567f9a284052fd537d4363a4afc591220dbe0dd23f611ec9f082b7","observation_id":"a4a86fdf-f7d1-4fd8-b13c-76432e207683","resolution":{"observed_at":"2026-08-07T19:57:04.613603Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.907452Z","title":"M., Gallego, G., and Topaloglu, H","venue":null,"work_id":"864d8427-9aea-4ea8-971f-4b5142e5cfc7","year":2014},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.326354Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:9c0708f12d8a6edb2f287885be7084d11c1fd4bd799f0468899d1c25be48fc5c","observation_id":"2ef9a6c0-dde0-4f3d-9dfa-1c1592e11769","resolution":{"observed_at":"2026-08-07T19:57:04.912282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.891074Z","title":"On the performance of thompson sampling on logistic bandits","venue":null,"work_id":"505d3e8e-0e1e-4875-a6fd-86f59e425d58","year":2019},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.331049Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:e2aa8eb7e90ef07d77a71c1bc536ea60ef5021085ef1dbb71d1b35ce9fcd117f","observation_id":"395b0f73-9a7c-45c4-86e1-eeae296055fd","resolution":{"observed_at":"2026-08-07T19:57:04.896306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.335944Z","title":"Improved optimistic algorithms for logistic bandits","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.335944Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:42a715eadae2c8eec18b0ce9e10a2cca1d37deb0ed66a94261b53375a5693e0a","observation_id":"33c44dad-05ae-441a-a5f4-e05eee9c740a","resolution":{"observed_at":"2026-08-07T19:57:04.335944Z","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-07T19:57:04.340812Z","title":"Jointly efficient and optimal algorithms for logistic bandits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.340812Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:356e16b51ce1df2f2ad2ed2a4278e6f5832dd6ae9fbce87cdd24ae2dc1ed089c","observation_id":"354e32f4-8d52-47f0-8da2-b10453c109c5","resolution":{"observed_at":"2026-08-07T19:57:04.340812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.854351Z","title":"J., Kale, S., Luo, H., Mohri, M., and Sridharan, K","venue":null,"work_id":"fa4bdf81-3e89-46bc-b59f-5c26fc742dd1","year":2018},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.345841Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:7dbbfb9d9f0e0b1b3f2ac2c0aa0045f4e9f3bc15810ae5b02ee7dfcb33eb1a58","observation_id":"562a6fc7-a9f1-4907-ae95-e98de2813233","resolution":{"observed_at":"2026-08-07T19:57:04.859444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.350660Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.350660Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:434c41d5f953704f209069142403125b7e1a6a19507e5f48d4d3b373a0d9acac","observation_id":"a57f2435-0449-459b-be8f-6ed5c9cfcdfb","resolution":{"observed_at":"2026-08-07T19:57:04.350660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.13540","last_updated":"2024-11-17T09:17:02Z","snapshot_observed_at":"2026-07-06T14:35:18.395420Z","submitted_at":"2022-12-27T16:25:09Z","title":"Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation","version":2},"cited_work":{"arxiv_id":"2212.13540","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.13540","snapshot_observed_at":"2026-08-07T19:57:04.583152Z","title":"Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation","venue":"stat.ML","work_id":"e506d7e6-8ea1-40f2-ac32-d63f04b62e26","year":2022},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.355613Z"},"links":{"cited_paper":"/paper/2212.13540","citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:dc1b5e8aeeaa8fbf06d1f326cb2c7a044a79a474822b17d6c4f477c9735e21e8","observation_id":"886bccc9-1dbf-444a-b1c8-8ed5779ce9bf","resolution":{"observed_at":"2026-08-07T19:57:04.588808Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.827582Z","title":"Mixability made efficient: Fast online multiclass logistic regression","venue":null,"work_id":"99315319-d2b1-4591-9a7e-aa63a0600e9f","year":2021},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.360904Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:0487c7294cc3dc964ef068358a5e0e87a897e8082ab883fc3e9a0aff438ab055","observation_id":"9456c4c2-280c-4de9-be63-40ff74cafd58","resolution":{"observed_at":"2026-08-07T19:57:04.832839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.365896Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.365896Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:f6bf304cb21de4e700e72850984910a7cce91afc7c59ce8a80581b7f68b5fb5c","observation_id":"daaca871-7c85-402a-b064-bd77003f04a1","resolution":{"observed_at":"2026-08-07T19:57:04.365896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.800975Z","title":"Improved regret analysis for variance-adaptive linear bandits and horizon-free linear mixture mdps","venue":null,"work_id":"1d4138a5-6241-4d3d-b33c-c0642cc2b891","year":2022},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.371159Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:bb9b719146ad8dc9f5ec2b4c4a45653b7da7ec34868e57c4b66f9a004b871100","observation_id":"e032c028-f5fd-4599-b6a4-2f50dadb6237","resolution":{"observed_at":"2026-08-07T19:57:04.806395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.376270Z","title":"and Oh, M.-h","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.376270Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:55f2c8ac9807c6a32be8ba7cc3f99dbb62412103f1eee25d594be7680c1c8fe0","observation_id":"9357f74d-f942-4fa8-bfc8-5245d60d0d14","resolution":{"observed_at":"2026-08-07T19:57:04.376270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10158","last_updated":"2025-06-05T01:30:34Z","snapshot_observed_at":"2026-08-09T08:55:20.940990Z","submitted_at":"2025-02-14T13:37:02Z","title":"Combinatorial Reinforcement Learning with Preference Feedback","version":3},"cited_work":{"arxiv_id":"2502.10158","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.10158","snapshot_observed_at":"2026-08-07T19:57:04.556666Z","title":"Combinatorial Reinforcement Learning with Preference Feedback","venue":"stat.ML","work_id":"b4f618f1-0124-4198-8cb1-1ba2ddfa8fa5","year":2025},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.381612Z"},"links":{"cited_paper":"/paper/2502.10158","citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:ca34605e1768a2f857036f9ab90022f24db3d4a12f0207ae16a8326334dea435","observation_id":"43b8d225-c795-465e-b2a8-95d9a7baee25","resolution":{"observed_at":"2026-08-07T19:57:04.564210Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.773604Z","title":"Improved regret bounds of (multinomial) logistic bandits via regret-to-confidence-set conversion","venue":null,"work_id":"58233e4b-6763-474c-befb-035fa3312050","year":2024},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.387163Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:ed5d4d824356bbace3a898c7aa4b4262d3223784a54962f37d3b21b5dd467a08","observation_id":"18e02381-33bd-4e77-a525-fdd154b8bde5","resolution":{"observed_at":"2026-08-07T19:57:04.779086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.13977","last_updated":"2025-01-15T09:25:02Z","snapshot_observed_at":"2026-08-06T04:07:50.783545Z","submitted_at":"2024-07-19T02:06:08Z","title":"A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.13977","snapshot_observed_at":"2026-08-07T19:57:04.392443Z","title":"A unified confidence sequence for generalized linear models, with applications to bandits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.392443Z"},"links":{"cited_paper":"/paper/2407.13977","citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:d352257c5f757bd43d17937af8a9d6cc952e042957b800f1cf242d65339ab1ea","observation_id":"6e692353-883d-45f9-bdb6-35fc744601eb","resolution":{"observed_at":"2026-08-07T19:57:04.392443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17061","last_updated":"2025-01-16T14:45:52Z","snapshot_observed_at":"2026-08-09T01:03:41.469515Z","submitted_at":"2024-05-27T11:31:54Z","title":"Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17061","snapshot_observed_at":"2026-08-07T19:57:04.398028Z","title":"Provably efficient reinforcement learning with multinomial logit function approximation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.398028Z"},"links":{"cited_paper":"/paper/2405.17061","citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:91e306b10b22189fd0160a417d6c13f81b1381a25be99821c5a2e486f6b919fb","observation_id":"6907349d-54b4-4b13-9520-78832b7496a8","resolution":{"observed_at":"2026-08-07T19:57:04.398028Z","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-07T19:57:04.403937Z","title":"Modelling the choice of residential location","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.403937Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:c20b166b95382ee5d2fec9b21c174fdacb66e4a501980c14c83ea49c41669a71","observation_id":"43fdf7f1-f54e-42ab-b232-3be17b1e7154","resolution":{"observed_at":"2026-08-07T19:57:04.403937Z","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-07T19:57:04.409176Z","title":"and Iyengar, G","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.409176Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:2812104d84126745f950e9b55729950ee9ef8091e1f8812dd8053392794041d8","observation_id":"f90ff801-3b45-4b0e-b744-de5e794a1531","resolution":{"observed_at":"2026-08-07T19:57:04.409176Z","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-07T19:57:04.414503Z","title":"and Iyengar, G","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.414503Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:bb5c4d199772dd8721458c5fa51e421f723ac61d07199ce76f915ca90c85d629","observation_id":"ce64861b-0a2d-4345-8625-b35d9cfba7e4","resolution":{"observed_at":"2026-08-07T19:57:04.414503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.725849Z","title":"Multinomial logit bandit with linear utility functions","venue":null,"work_id":"e0732cc8-8636-42fe-9b94-e6286d0578ee","year":2018},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.419185Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:5772adb3d15141f13ee8ffa713e1abec8f465fc31aa82937f644119e117e2eef","observation_id":"cacdfdb8-e4d8-476f-af53-984628a6ae22","resolution":{"observed_at":"2026-08-07T19:57:04.731088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13633","last_updated":"2024-10-14T00:37:51Z","snapshot_observed_at":"2026-07-06T18:33:45.816337Z","submitted_at":"2024-06-19T15:29:14Z","title":"Infinite-Horizon Reinforcement Learning with Multinomial Logistic Function Approximation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13633","snapshot_observed_at":"2026-08-07T19:57:04.424269Z","title":"Infinite-horizon reinforcement learning with multinomial logistic function approximation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.424269Z"},"links":{"cited_paper":"/paper/2406.13633","citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:428fdbcd8419b2378190c0430bc7a2db5525b5ce4d6598b5ecf9ebca68f40209","observation_id":"7cc01e79-fa64-4674-89d6-f96ff50575af","resolution":{"observed_at":"2026-08-07T19:57:04.424269Z","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-07T19:57:04.429722Z","title":"and Goyal, V","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.429722Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:3d7b627065bb575283171dd970f13075bf81a344282cbaeae12f6e3966a16a6b","observation_id":"95dcf5be-b2c3-4736-b160-c5985e864aa0","resolution":{"observed_at":"2026-08-07T19:57:04.429722Z","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-07T19:57:04.434964Z","title":"M., and Shmoys, D","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.434964Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:db42d456f5e49bd7e3ad7149aad2d19b3955d38bfde1a8b20a5902f15bdadc28","observation_id":"e749d384-554f-441f-8295-cb24a4cef756","resolution":{"observed_at":"2026-08-07T19:57:04.434964Z","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-07T19:57:04.439756Z","title":"and Zeevi, A","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.439756Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:4da7c45d2e894139b55ddaff0f9b8eeb627ac99bad1f7f75b873602e6dfc7ff4","observation_id":"8d26eda6-17e5-48ba-b171-46fe35581a03","resolution":{"observed_at":"2026-08-07T19:57:04.439756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.676973Z","title":"Generalized linear bandits with limited adaptivity","venue":null,"work_id":"257450af-64d4-4c13-bcfe-9ed12c80bd9f","year":2024},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.444534Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:676b02288e912f107a642774c1a8bdb40dc312bf802a6fc6d498e76e7b5ebcda","observation_id":"bf743657-9b58-40b0-949d-39b02fbf8053","resolution":{"observed_at":"2026-08-07T19:57:04.682395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.449417Z","title":"Composite convex minimization involving self-concordant-like cost functions","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.449417Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:b63597e5c48c788722db5b60f411d81072ef216510fa0496a878ff4c26c2eb9d","observation_id":"6e004508-af96-4b42-b2ea-9fc93e18cb04","resolution":{"observed_at":"2026-08-07T19:57:04.449417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.648441Z","title":"Etude critique de la notion de collectif, volume 3","venue":null,"work_id":"fed22571-ba1e-47f0-831f-21099cbc0f4b","year":1939},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.454020Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:358e2c7749bc420182fc09b55f0e7c4624e58c554c6dcdd7dd987c411ebbf162","observation_id":"02684f4a-0b7f-41dd-ad48-c6d96b2fcf12","resolution":{"observed_at":"2026-08-07T19:57:04.654657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:57:04.458882Z","title":"and Sugiyama, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.458882Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:28c4bfb141b962b2fcef61c99deeaa02946bb30537c0cf1f876405509f2e9925","observation_id":"4686b175-9c22-4bef-b573-8a27c48f7da9","resolution":{"observed_at":"2026-08-07T19:57:04.458882Z","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-07T19:57:04.463584Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","version":5},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T19:57:04.463584Z"},"links":{"citing_paper":"/paper/2502.10020"},"observation_digest":"sha256:325c53fff1d20c9005dbe91b4e5c1e62ebf71b08309f834021722852b77f2493","observation_id":"94e40ae9-11f1-443b-b9e2-c6f125733dd6","resolution":{"observed_at":"2026-08-07T19:57:04.463584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.10020","last_updated":"2025-06-16T13:10:36Z","latest_version":5,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-08T21:21:52.883225Z","submitted_at":"2025-02-14T09:01:12Z","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":3,"verified_fuzzy":11},"total_outbound_references":35},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 4 inbound Pith citation observations for arXiv:2502.10020."}