{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:OV4JQHN2K5VP2LWULILZD3TNRP","short_pith_number":"pith:OV4JQHN2","canonical_record":{"source":{"id":"2005.11593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-23T19:52:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"758e6f8d2276d27a2dd305983aaac932a98d71f5e4aa43c668cbd894c8707016","abstract_canon_sha256":"9501565a09e715b07b3240e35b4e138564667342ca792cad036fec3037905aa8"},"schema_version":"1.0"},"canonical_sha256":"7578981dba576afd2ed45a1791ee6d8bd9fb4773ae16c24cdf7f6a9f764cf0ff","source":{"kind":"arxiv","id":"2005.11593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.11593","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"2005.11593v1","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.11593","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"OV4JQHN2K5VP","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"pith_short_16","alias_value":"OV4JQHN2K5VP2LWU","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"pith_short_8","alias_value":"OV4JQHN2","created_at":"2026-07-05T01:05:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:OV4JQHN2K5VP2LWULILZD3TNRP","target":"record","payload":{"canonical_record":{"source":{"id":"2005.11593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-23T19:52:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"758e6f8d2276d27a2dd305983aaac932a98d71f5e4aa43c668cbd894c8707016","abstract_canon_sha256":"9501565a09e715b07b3240e35b4e138564667342ca792cad036fec3037905aa8"},"schema_version":"1.0"},"canonical_sha256":"7578981dba576afd2ed45a1791ee6d8bd9fb4773ae16c24cdf7f6a9f764cf0ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:16.053072Z","signature_b64":"TGqJMpoSNxfZJXwINxv9YXjjV4/dRj/ID7Y5r8Q5AGVOkkNGmc6RoKjKvDm7ZEoHG84EGz3f/oPiYd5p5hROBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7578981dba576afd2ed45a1791ee6d8bd9fb4773ae16c24cdf7f6a9f764cf0ff","last_reissued_at":"2026-07-05T01:05:16.052688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:16.052688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.11593","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:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jydF+MzcFjQss4Sono/ocDn+4O43Q72Nwb0uWR5cNAf0SOMg2AXjOhYg76LinEXrx2/U5nYF9Fvzq9rXd5RXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:26:17.549778Z"},"content_sha256":"50916abde7ea93a398a8b19916f0e62969634638e5845026728882963e23786e","schema_version":"1.0","event_id":"sha256:50916abde7ea93a398a8b19916f0e62969634638e5845026728882963e23786e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:OV4JQHN2K5VP2LWULILZD3TNRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Confidence-Based Algorithm for Structured Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Lazaric, Andrea Tirinzoni, Marcello Restelli","submitted_at":"2020-05-23T19:52:44Z","abstract_excerpt":"We study finite-armed stochastic bandits where the rewards of each arm might be correlated to those of other arms. We introduce a novel phased algorithm that exploits the given structure to build confidence sets over the parameters of the true bandit problem and rapidly discard all sub-optimal arms. In particular, unlike standard bandit algorithms with no structure, we show that the number of times a suboptimal arm is selected may actually be reduced thanks to the information collected by pulling other arms. Furthermore, we show that, in some structures, the regret of an anytime extension of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.11593","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.11593/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:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IknfyUXRpaBVWY1rPrzhFXAfzj1LW3Tc0nOpa6b06ZW6PEhpjCQvAYaV4wQMaWy8HiiXZBGwIjTgKFAI1zpHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:26:17.550188Z"},"content_sha256":"3509898632bbe7998bc310764dd56dbb04eaf57c2adb7a8f61c146c30981937a","schema_version":"1.0","event_id":"sha256:3509898632bbe7998bc310764dd56dbb04eaf57c2adb7a8f61c146c30981937a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OV4JQHN2K5VP2LWULILZD3TNRP/bundle.json","state_url":"https://pith.science/pith/OV4JQHN2K5VP2LWULILZD3TNRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OV4JQHN2K5VP2LWULILZD3TNRP/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-07T08:26:17Z","links":{"resolver":"https://pith.science/pith/OV4JQHN2K5VP2LWULILZD3TNRP","bundle":"https://pith.science/pith/OV4JQHN2K5VP2LWULILZD3TNRP/bundle.json","state":"https://pith.science/pith/OV4JQHN2K5VP2LWULILZD3TNRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OV4JQHN2K5VP2LWULILZD3TNRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:OV4JQHN2K5VP2LWULILZD3TNRP","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":"9501565a09e715b07b3240e35b4e138564667342ca792cad036fec3037905aa8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-23T19:52:44Z","title_canon_sha256":"758e6f8d2276d27a2dd305983aaac932a98d71f5e4aa43c668cbd894c8707016"},"schema_version":"1.0","source":{"id":"2005.11593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.11593","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"2005.11593v1","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.11593","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"OV4JQHN2K5VP","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"pith_short_16","alias_value":"OV4JQHN2K5VP2LWU","created_at":"2026-07-05T01:05:16Z"},{"alias_kind":"pith_short_8","alias_value":"OV4JQHN2","created_at":"2026-07-05T01:05:16Z"}],"graph_snapshots":[{"event_id":"sha256:3509898632bbe7998bc310764dd56dbb04eaf57c2adb7a8f61c146c30981937a","target":"graph","created_at":"2026-07-05T01:05:16Z","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.11593/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study finite-armed stochastic bandits where the rewards of each arm might be correlated to those of other arms. We introduce a novel phased algorithm that exploits the given structure to build confidence sets over the parameters of the true bandit problem and rapidly discard all sub-optimal arms. In particular, unlike standard bandit algorithms with no structure, we show that the number of times a suboptimal arm is selected may actually be reduced thanks to the information collected by pulling other arms. Furthermore, we show that, in some structures, the regret of an anytime extension of o","authors_text":"Alessandro Lazaric, Andrea Tirinzoni, Marcello Restelli","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-23T19:52:44Z","title":"A Novel Confidence-Based Algorithm for Structured Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.11593","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:50916abde7ea93a398a8b19916f0e62969634638e5845026728882963e23786e","target":"record","created_at":"2026-07-05T01:05:16Z","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":"9501565a09e715b07b3240e35b4e138564667342ca792cad036fec3037905aa8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-23T19:52:44Z","title_canon_sha256":"758e6f8d2276d27a2dd305983aaac932a98d71f5e4aa43c668cbd894c8707016"},"schema_version":"1.0","source":{"id":"2005.11593","kind":"arxiv","version":1}},"canonical_sha256":"7578981dba576afd2ed45a1791ee6d8bd9fb4773ae16c24cdf7f6a9f764cf0ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7578981dba576afd2ed45a1791ee6d8bd9fb4773ae16c24cdf7f6a9f764cf0ff","first_computed_at":"2026-07-05T01:05:16.052688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:05:16.052688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TGqJMpoSNxfZJXwINxv9YXjjV4/dRj/ID7Y5r8Q5AGVOkkNGmc6RoKjKvDm7ZEoHG84EGz3f/oPiYd5p5hROBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:05:16.053072Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.11593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50916abde7ea93a398a8b19916f0e62969634638e5845026728882963e23786e","sha256:3509898632bbe7998bc310764dd56dbb04eaf57c2adb7a8f61c146c30981937a"],"state_sha256":"e050db3396a6fec217cfd2ffbc534028149760a16a109e9a9786216da7c256b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FW9nHecWvIcXN+VNjanvDwHx0y2XNAPlm8PS8ShvomEdJfc20l49JunPduV0DUFjoUvAmKxQB2IOItLnu2+3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:26:17.552416Z","bundle_sha256":"1b7a75e246e53ae775f1da654dd86be1fddf3f0c641adab00519cfbb5d8288c4"}}