{"as_of":"2026-08-15T06:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:812ec20d8df5dba870db4ffecbd2a6fe772060472cd90304ca5a8af67eebdea7","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:25:16.895947Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2501.13390/citation-record","integrity":"/paper/2501.13390/integrity","json":"/paper/2501.13390/citation-record.json","paper":"/paper/2501.13390"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T16:25:16.710055Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.710055Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:0ba4183952dc8ba591f415986c4dc1955b4f25f0f1ca1323484995676dffa865","observation_id":"4a27144c-3687-4008-a20a-062eba3643dc","resolution":{"observed_at":"2026-08-10T16:25:16.710055Z","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-10T16:25:17.364385Z","title":"Associative reinforcement learning using linear probabilistic concepts","venue":null,"work_id":"14acc1c4-cf1d-4fe3-85ab-0bc8321c8c7e","year":1999},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.718223Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:eafdd5dc946def903c12185ba359d961a6fa6c868e1b0b82a1265c774ed31bba","observation_id":"0a4117b2-4570-4ce5-9845-c7469b8966f8","resolution":{"observed_at":"2026-08-10T16:25:17.371851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.338558Z","title":"Non-stationary bandits and meta-learning with a small set of optimal arms","venue":null,"work_id":"0b9869fc-7ebe-4d2a-8762-5fc281bc5d80","year":2024},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.727937Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:62e410a5c2bda4b426baebb806b50dff10bee8cb33cd194b57d486e7e28177d9","observation_id":"db4369c2-1504-4635-a65e-acd08e343f0d","resolution":{"observed_at":"2026-08-10T16:25:17.346209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14128","last_updated":"2022-05-27T17:40:32Z","snapshot_observed_at":"2026-08-13T15:35:10.273290Z","submitted_at":"2022-05-27T17:40:32Z","title":"Meta-Learning Adversarial Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14128","snapshot_observed_at":"2026-08-10T16:25:16.733916Z","title":"Meta-learning adversarial bandits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.733916Z"},"links":{"cited_paper":"/paper/2205.14128","citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:7aff8622bd1b423197143189c9adde46fc6342a7656426fa4fcf5dd0b0b65817","observation_id":"fa62291c-3e61-400b-a381-6330b51fbfcf","resolution":{"observed_at":"2026-08-10T16:25:16.733916Z","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-10T16:25:17.315501Z","title":"Meta learning in bandits within shared affine subspaces, 2024","venue":null,"work_id":"0863f97e-9f8f-4eef-9d84-52db056beeb7","year":2024},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.744025Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:aec81d1a63d027aaeb34f7b937410d3205b1a5a44db38141391ae7b0cfa510d0","observation_id":"a66f34ce-400a-4f91-b11d-d59a8e5e61fd","resolution":{"observed_at":"2026-08-10T16:25:17.323064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.295543Z","title":"Multi-task representation learning with stochastic linear bandits","venue":null,"work_id":"00d585ba-4d22-4473-9340-8265a4e815df","year":2023},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.761580Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:79cd9356c8ba6ae2d225445a895fd2e691bdb3fd8e8816d8a66f27e64179e973","observation_id":"683698ee-b484-422d-915c-e5c437d378cb","resolution":{"observed_at":"2026-08-10T16:25:17.302007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.274940Z","title":"Stochastic linear optimization under bandit feedback","venue":null,"work_id":"16ca3074-bd04-447b-92c7-a0994ea01d72","year":2008},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.774730Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:687d7e9a5a2634497d3898d4c34319ffad0ce5450b5f0ecea6ffaad97b2d5c11","observation_id":"bf42b93e-5619-435f-b10b-08624c217084","resolution":{"observed_at":"2026-08-10T16:25:17.282892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.254524Z","title":"Csc 2532 winter 2024: Statistical learning theory, lecture 5","venue":null,"work_id":"625eab99-39b1-4c8e-8671-29f3653c54f2","year":2024},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.783588Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:6c7055f035f38ef5bad0b3f44855eca26cb275f79400f40e03e1cf9643e7a1b2","observation_id":"5e921d3b-15ca-4519-adfc-dd3fe16f365d","resolution":{"observed_at":"2026-08-10T16:25:17.261447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:16.790563Z","title":"A decision-theoretic generalization of on-line learning and an application to boosting","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.790563Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:dfe9fb43ed4e58ce7811fd80ab98c33c0a5b2bbab7775d0148634a474607047f","observation_id":"78b2fdda-ea93-420a-8223-4ace1228b343","resolution":{"observed_at":"2026-08-10T16:25:16.790563Z","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-10T16:25:16.802052Z","title":"Procrustes problems, volume 30","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.802052Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:bd4b33477e462a2d02ae4404ab0545a29754d4e52a7da05c88f3cdf01d7d1578","observation_id":"a8196be1-e78a-4dc2-baf6-f53bc378d1d3","resolution":{"observed_at":"2026-08-10T16:25:16.802052Z","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-10T16:25:17.206836Z","title":"Near-optimal representation learning for linear bandits and linear rl","venue":null,"work_id":"06e317f0-9eb3-457f-ba4e-39c363b30edb","year":2021},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.813350Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:51a342b263b65ec75dfd092d5f76324ca7456e5bca58a223ce070df89d5069ef","observation_id":"e55a2119-ab31-4fe7-b593-56ceabdc9bab","resolution":{"observed_at":"2026-08-10T16:25:17.213520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.187443Z","title":"Improved regret bounds of bilinear bandits using action space analysis","venue":null,"work_id":"e4cea8e0-b2c9-4118-8368-c12946239152","year":2021},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.820101Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:888ab4e8be6ae9b55ddfa5a2dcee361d6b7a9c9c92711b0c35518dabadc206c0","observation_id":"c4e4317e-704b-40cf-9f2a-8ece5c97b7c5","resolution":{"observed_at":"2026-08-10T16:25:17.193970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.158776Z","title":"Improved regret bounds of bilinear bandits using action space analysis","venue":null,"work_id":"bc0bea4e-3f83-4759-b0a6-06b116476220","year":2021},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.826456Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:81fb70254bf331e692c873b2e3b25e5f0de01f96e930222994a55ba713aa77b2","observation_id":"b49b1327-6095-4c78-a29f-db9705931ab5","resolution":{"observed_at":"2026-08-10T16:25:17.165293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:16.832450Z","title":"Bandit algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.832450Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:856aa30db0c7d49b326a8350fd4c72edc0bc8018b3d06392f56fd2927642bde9","observation_id":"03ebaeba-8c6c-405b-a500-05caa9a40647","resolution":{"observed_at":"2026-08-10T16:25:16.832450Z","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-10T16:25:17.116051Z","title":"Non-stationary representation learning in sequential linear bandits","venue":null,"work_id":"e4527a6d-2f5f-4ef5-9c7a-8341adfe17f4","year":2022},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.839975Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:1b9c64df849488bd7b8777dbf21e3b0d4a42eeebaf8c6969e70663a2676d50b0","observation_id":"cdec2a45-8320-40bc-ad65-4805ab8f0d6f","resolution":{"observed_at":"2026-08-10T16:25:17.122129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.094414Z","title":"Linearly parameterized bandits","venue":null,"work_id":"908cdf1a-4ae2-419b-bd81-7e2539edbcd0","year":2010},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.848702Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:0cccc9ed21052e1aed549ca01c53929469f099197d505a694aeabfc07a533ecf","observation_id":"1102c464-2311-4ed7-b293-effbe0e250dd","resolution":{"observed_at":"2026-08-10T16:25:17.100460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.070569Z","title":"Deep learning theory lecture notes","venue":null,"work_id":"29ba0a35-5d54-4c7c-ac8b-4e2d190425e5","year":2021},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.853909Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:554f7a22484f18637117e136e4f7772c77a2d8fecb27aa7eeeebdb7b5a0fd7bd","observation_id":"dd6056d1-44d8-4bc0-95fe-a17b5d89e081","resolution":{"observed_at":"2026-08-10T16:25:17.077666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.044762Z","title":"Provable meta-learning of linear representations","venue":null,"work_id":"0b00c2d9-5572-49ab-853f-b16b16fa9877","year":2021},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.864972Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:93bab2127486f67af2114f533d3c8b67f545c1be0de9546394dccf9e1bee8c9d","observation_id":"6973b431-c385-4c66-8e8b-2bcfed5ea897","resolution":{"observed_at":"2026-08-10T16:25:17.050438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:17.016928Z","title":"Matrix perturbation and davis-kahan theorem","venue":null,"work_id":"7b70468d-04a1-4ad9-b040-6fb5df53cdb9","year":2020},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.878042Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:5f936f7e462b9395225cb6aa5eb1046b136406c05368badaea265c5d36eb8be0","observation_id":"09ade1e8-b441-422b-a022-025537e88b34","resolution":{"observed_at":"2026-08-10T16:25:17.023371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T16:25:16.888361Z","title":"Impact of representation learning in linear bandits","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.888361Z"},"links":{"citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:62a47b9e7c1f985d9eba71234808346c4afe1ed114d2be981e4dd604a5f6c499","observation_id":"4a534d4e-6947-4465-9803-3b5cc350272a","resolution":{"observed_at":"2026-08-10T16:25:16.888361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15664","last_updated":"2022-03-29T15:27:13Z","snapshot_observed_at":"2026-08-13T16:13:11.292290Z","submitted_at":"2022-03-29T15:27:13Z","title":"Nearly Minimax Algorithms for Linear Bandits with Shared Representation","version":1},"cited_work":{"arxiv_id":"2203.15664","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.15664","snapshot_observed_at":"2026-08-10T16:25:16.948502Z","title":"Nearly Minimax Algorithms for Linear Bandits with Shared Representation","venue":"cs.LG","work_id":"7b726f7a-4e54-4f53-9aed-b49b7f7159f4","year":2022},"citing_paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T16:25:16.895947Z"},"links":{"cited_paper":"/paper/2203.15664","citing_paper":"/paper/2501.13390"},"observation_digest":"sha256:4efb77e2145f0957b726195daf653e238434eb183a88c2d46b9ffa67a92dd45e","observation_id":"6da6dbd1-5cce-4178-97dd-b719ab648dfd","resolution":{"observed_at":"2026-08-10T16:25:16.956979Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.13390","last_updated":"2025-01-23T05:21:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T15:57:56.157971Z","submitted_at":"2025-01-23T05:21:27Z","title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":14},"total_outbound_references":21},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2501.13390."}