{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XCJPKNQBNI5KWHHVAHTRMFHCXO","short_pith_number":"pith:XCJPKNQB","canonical_record":{"source":{"id":"2010.06531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-13T16:35:30Z","cross_cats_sorted":[],"title_canon_sha256":"32fd9f1bb9071c64fecc9df0134b210b93dffe0e97e24b399b891900d81a8f99","abstract_canon_sha256":"2dc1e17b89a318e655f189c36fc677b242e761c0664f686220ace7bc5403779a"},"schema_version":"1.0"},"canonical_sha256":"b892f536016a3aab1cf501e71614e2bb859203d80cd3b5da82f9be343824e288","source":{"kind":"arxiv","id":"2010.06531","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.06531","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"2010.06531v2","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.06531","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"XCJPKNQBNI5K","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_16","alias_value":"XCJPKNQBNI5KWHHV","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_8","alias_value":"XCJPKNQB","created_at":"2026-07-05T02:37:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XCJPKNQBNI5KWHHVAHTRMFHCXO","target":"record","payload":{"canonical_record":{"source":{"id":"2010.06531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-13T16:35:30Z","cross_cats_sorted":[],"title_canon_sha256":"32fd9f1bb9071c64fecc9df0134b210b93dffe0e97e24b399b891900d81a8f99","abstract_canon_sha256":"2dc1e17b89a318e655f189c36fc677b242e761c0664f686220ace7bc5403779a"},"schema_version":"1.0"},"canonical_sha256":"b892f536016a3aab1cf501e71614e2bb859203d80cd3b5da82f9be343824e288","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:42.363120Z","signature_b64":"FymqG26d0AXr+IPjP74g69xKljooMxVVXIUm78U2UoBHVls0B+d/fkhYTHrnL6INgfnY/Yw3jiOPBkJZqn+7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b892f536016a3aab1cf501e71614e2bb859203d80cd3b5da82f9be343824e288","last_reissued_at":"2026-07-05T02:37:42.362693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:42.362693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.06531","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVMQXbe9jrSfaK6/0wuGIHW0lFr+xczf3LgP9qpPABWBnNAJBhO26CSgd4izaR9UjTFGLGF+81dDzpFyocUVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:46:59.356507Z"},"content_sha256":"a4960d58d5a11e92bf80a1b484f680b0d325fb1227d7ddb530fc63549a84d21f","schema_version":"1.0","event_id":"sha256:a4960d58d5a11e92bf80a1b484f680b0d325fb1227d7ddb530fc63549a84d21f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XCJPKNQBNI5KWHHVAHTRMFHCXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Impact of Representation Learning in Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jason D. Lee, Jiaqi Yang, Simon S. Du, Wei Hu","submitted_at":"2020-10-13T16:35:30Z","abstract_excerpt":"We study how representation learning can improve the efficiency of bandit problems. We study the setting where we play $T$ linear bandits with dimension $d$ concurrently, and these $T$ bandit tasks share a common $k (\\ll d)$ dimensional linear representation. For the finite-action setting, we present a new algorithm which achieves $\\widetilde{O}(T\\sqrt{kN} + \\sqrt{dkNT})$ regret, where $N$ is the number of rounds we play for each bandit. When $T$ is sufficiently large, our algorithm significantly outperforms the naive algorithm (playing $T$ bandits independently) that achieves $\\widetilde{O}(T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.06531","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.06531/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OpZYdJ45DSuZB5KURBjcgNN1dnMGRitSFzg+Xf5hyXjnqj07dq/xbRF3Fh77x+UpyuZ/Mnm8aoC/PUcbUajpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:46:59.357498Z"},"content_sha256":"2642a051320e2ecb25df550559c0ee8eccf35e9f7693802dbd158ff976e03ea6","schema_version":"1.0","event_id":"sha256:2642a051320e2ecb25df550559c0ee8eccf35e9f7693802dbd158ff976e03ea6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCJPKNQBNI5KWHHVAHTRMFHCXO/bundle.json","state_url":"https://pith.science/pith/XCJPKNQBNI5KWHHVAHTRMFHCXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCJPKNQBNI5KWHHVAHTRMFHCXO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T16:46:59Z","links":{"resolver":"https://pith.science/pith/XCJPKNQBNI5KWHHVAHTRMFHCXO","bundle":"https://pith.science/pith/XCJPKNQBNI5KWHHVAHTRMFHCXO/bundle.json","state":"https://pith.science/pith/XCJPKNQBNI5KWHHVAHTRMFHCXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCJPKNQBNI5KWHHVAHTRMFHCXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XCJPKNQBNI5KWHHVAHTRMFHCXO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2dc1e17b89a318e655f189c36fc677b242e761c0664f686220ace7bc5403779a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-13T16:35:30Z","title_canon_sha256":"32fd9f1bb9071c64fecc9df0134b210b93dffe0e97e24b399b891900d81a8f99"},"schema_version":"1.0","source":{"id":"2010.06531","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.06531","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"2010.06531v2","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.06531","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"XCJPKNQBNI5K","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_16","alias_value":"XCJPKNQBNI5KWHHV","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_8","alias_value":"XCJPKNQB","created_at":"2026-07-05T02:37:42Z"}],"graph_snapshots":[{"event_id":"sha256:2642a051320e2ecb25df550559c0ee8eccf35e9f7693802dbd158ff976e03ea6","target":"graph","created_at":"2026-07-05T02:37:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.06531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study how representation learning can improve the efficiency of bandit problems. We study the setting where we play $T$ linear bandits with dimension $d$ concurrently, and these $T$ bandit tasks share a common $k (\\ll d)$ dimensional linear representation. For the finite-action setting, we present a new algorithm which achieves $\\widetilde{O}(T\\sqrt{kN} + \\sqrt{dkNT})$ regret, where $N$ is the number of rounds we play for each bandit. When $T$ is sufficiently large, our algorithm significantly outperforms the naive algorithm (playing $T$ bandits independently) that achieves $\\widetilde{O}(T","authors_text":"Jason D. Lee, Jiaqi Yang, Simon S. Du, Wei Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-13T16:35:30Z","title":"Impact of Representation Learning in Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.06531","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a4960d58d5a11e92bf80a1b484f680b0d325fb1227d7ddb530fc63549a84d21f","target":"record","created_at":"2026-07-05T02:37:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2dc1e17b89a318e655f189c36fc677b242e761c0664f686220ace7bc5403779a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-13T16:35:30Z","title_canon_sha256":"32fd9f1bb9071c64fecc9df0134b210b93dffe0e97e24b399b891900d81a8f99"},"schema_version":"1.0","source":{"id":"2010.06531","kind":"arxiv","version":2}},"canonical_sha256":"b892f536016a3aab1cf501e71614e2bb859203d80cd3b5da82f9be343824e288","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b892f536016a3aab1cf501e71614e2bb859203d80cd3b5da82f9be343824e288","first_computed_at":"2026-07-05T02:37:42.362693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:37:42.362693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FymqG26d0AXr+IPjP74g69xKljooMxVVXIUm78U2UoBHVls0B+d/fkhYTHrnL6INgfnY/Yw3jiOPBkJZqn+7AA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:37:42.363120Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.06531","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4960d58d5a11e92bf80a1b484f680b0d325fb1227d7ddb530fc63549a84d21f","sha256:2642a051320e2ecb25df550559c0ee8eccf35e9f7693802dbd158ff976e03ea6"],"state_sha256":"596f46bf622401535b02c65e2b1dace033fe221dbc52659a4068963d1914f5c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SaSYe0MSduZ55a8HZmGIMzFXd4/yD+8pKVTiWvjPcU9s9UQdVoTRMqh8JDZyN5tSMGdi5Im4dL5wJ9w8lUlNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T16:46:59.362925Z","bundle_sha256":"56c077c8d52c5afd33c5ea3c2a7283b2d8253b72ce206485a611371684b2f92f"}}