{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:RPSGZUIZ3XYLWXMHSN5JMXMAHO","short_pith_number":"pith:RPSGZUIZ","canonical_record":{"source":{"id":"2005.08531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-18T08:41:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a0ef29f48ad35f40077fcb455087a2e9f72e6fe3b761b53aed5d81258b4f334e","abstract_canon_sha256":"373d5cc1409bde4b3278caef1ee6954a96f1ebf5041b691f9b1017b726257781"},"schema_version":"1.0"},"canonical_sha256":"8be46cd119ddf0bb5d87937a965d803bad160276147e0ab273781bde0fe16e89","source":{"kind":"arxiv","id":"2005.08531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.08531","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2005.08531v1","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.08531","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"RPSGZUIZ3XYL","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"RPSGZUIZ3XYLWXMH","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"RPSGZUIZ","created_at":"2026-07-05T01:03:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:RPSGZUIZ3XYLWXMHSN5JMXMAHO","target":"record","payload":{"canonical_record":{"source":{"id":"2005.08531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-18T08:41:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a0ef29f48ad35f40077fcb455087a2e9f72e6fe3b761b53aed5d81258b4f334e","abstract_canon_sha256":"373d5cc1409bde4b3278caef1ee6954a96f1ebf5041b691f9b1017b726257781"},"schema_version":"1.0"},"canonical_sha256":"8be46cd119ddf0bb5d87937a965d803bad160276147e0ab273781bde0fe16e89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:32.826917Z","signature_b64":"5tyrV3i0WhoNZlII7DTEPti395/a5rc23HEp7g/ztCPlvH+HfSwTNyK+OB75xXEi/HKqACDi9wGnMQIxBNknDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8be46cd119ddf0bb5d87937a965d803bad160276147e0ab273781bde0fe16e89","last_reissued_at":"2026-07-05T01:03:32.826498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:32.826498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.08531","source_version":1,"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-05T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1G1WsdADo7wnbTYaBkMhZ+r2pkP5Jer47IAkcIbK14n8dLTVNLAj+VilpuNtM58cUdRLlu0u3llVg+jbpIohBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:02:17.317552Z"},"content_sha256":"cabd9a73359166a0c0661815e0a04b0a9731ee8db5981fd881c74df11f989a85","schema_version":"1.0","event_id":"sha256:cabd9a73359166a0c0661815e0a04b0a9731ee8db5981fd881c74df11f989a85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:RPSGZUIZ3XYLWXMHSN5JMXMAHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Meta-learning with Stochastic Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Leonardo Cella, Massimiliano Pontil","submitted_at":"2020-05-18T08:41:39Z","abstract_excerpt":"We investigate meta-learning procedures in the setting of stochastic linear bandits tasks. The goal is to select a learning algorithm which works well on average over a class of bandits tasks, that are sampled from a task-distribution. Inspired by recent work on learning-to-learn linear regression, we consider a class of bandit algorithms that implement a regularized version of the well-known OFUL algorithm, where the regularization is a square euclidean distance to a bias vector. We first study the benefit of the biased OFUL algorithm in terms of regret minimization. We then propose two strat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.08531","kind":"arxiv","version":1},"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/2005.08531/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-05T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUYe2/aLptkWI8grQfZ4P3DwPMDgI3ItwvZCktbUTfdeDR2i9YrAd5dbsrT+d8QJuxo0faHJCAGLfiXLvRr4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:02:17.317973Z"},"content_sha256":"f338b70b9fcfe9a32cffd772147c5cfcb89ea060d8418114768c4af21f42e113","schema_version":"1.0","event_id":"sha256:f338b70b9fcfe9a32cffd772147c5cfcb89ea060d8418114768c4af21f42e113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPSGZUIZ3XYLWXMHSN5JMXMAHO/bundle.json","state_url":"https://pith.science/pith/RPSGZUIZ3XYLWXMHSN5JMXMAHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPSGZUIZ3XYLWXMHSN5JMXMAHO/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-07-06T15:02:17Z","links":{"resolver":"https://pith.science/pith/RPSGZUIZ3XYLWXMHSN5JMXMAHO","bundle":"https://pith.science/pith/RPSGZUIZ3XYLWXMHSN5JMXMAHO/bundle.json","state":"https://pith.science/pith/RPSGZUIZ3XYLWXMHSN5JMXMAHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPSGZUIZ3XYLWXMHSN5JMXMAHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:RPSGZUIZ3XYLWXMHSN5JMXMAHO","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":"373d5cc1409bde4b3278caef1ee6954a96f1ebf5041b691f9b1017b726257781","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-18T08:41:39Z","title_canon_sha256":"a0ef29f48ad35f40077fcb455087a2e9f72e6fe3b761b53aed5d81258b4f334e"},"schema_version":"1.0","source":{"id":"2005.08531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.08531","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2005.08531v1","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.08531","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"RPSGZUIZ3XYL","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"RPSGZUIZ3XYLWXMH","created_at":"2026-07-05T01:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"RPSGZUIZ","created_at":"2026-07-05T01:03:32Z"}],"graph_snapshots":[{"event_id":"sha256:f338b70b9fcfe9a32cffd772147c5cfcb89ea060d8418114768c4af21f42e113","target":"graph","created_at":"2026-07-05T01:03:32Z","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/2005.08531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate meta-learning procedures in the setting of stochastic linear bandits tasks. The goal is to select a learning algorithm which works well on average over a class of bandits tasks, that are sampled from a task-distribution. Inspired by recent work on learning-to-learn linear regression, we consider a class of bandit algorithms that implement a regularized version of the well-known OFUL algorithm, where the regularization is a square euclidean distance to a bias vector. We first study the benefit of the biased OFUL algorithm in terms of regret minimization. We then propose two strat","authors_text":"Alessandro Lazaric, Leonardo Cella, Massimiliano Pontil","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-18T08:41:39Z","title":"Meta-learning with Stochastic Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.08531","kind":"arxiv","version":1},"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:cabd9a73359166a0c0661815e0a04b0a9731ee8db5981fd881c74df11f989a85","target":"record","created_at":"2026-07-05T01:03:32Z","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":"373d5cc1409bde4b3278caef1ee6954a96f1ebf5041b691f9b1017b726257781","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-18T08:41:39Z","title_canon_sha256":"a0ef29f48ad35f40077fcb455087a2e9f72e6fe3b761b53aed5d81258b4f334e"},"schema_version":"1.0","source":{"id":"2005.08531","kind":"arxiv","version":1}},"canonical_sha256":"8be46cd119ddf0bb5d87937a965d803bad160276147e0ab273781bde0fe16e89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8be46cd119ddf0bb5d87937a965d803bad160276147e0ab273781bde0fe16e89","first_computed_at":"2026-07-05T01:03:32.826498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:03:32.826498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tyrV3i0WhoNZlII7DTEPti395/a5rc23HEp7g/ztCPlvH+HfSwTNyK+OB75xXEi/HKqACDi9wGnMQIxBNknDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:03:32.826917Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.08531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cabd9a73359166a0c0661815e0a04b0a9731ee8db5981fd881c74df11f989a85","sha256:f338b70b9fcfe9a32cffd772147c5cfcb89ea060d8418114768c4af21f42e113"],"state_sha256":"e31e9a6617b97959b47883a0d547047030bca8aa515e9b0ac53e190a24f593ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VqFZMo5zoe29AvKs7290ZakLdPbUoOvXn2D8zoxZxzgwlsUtXrLu2q2YhdAGTj1QWfcu85KKU/VO9/6IcXLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:02:17.320674Z","bundle_sha256":"04ff235929be9b8c25592a80c4954e6880ef7d1f0623e0bd335ab4a3b6710fe8"}}