{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:APOENML43L2ICL2F3GIHEQGHME","short_pith_number":"pith:APOENML4","canonical_record":{"source":{"id":"1711.00400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-01T15:40:26Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"title_canon_sha256":"449e2fe7be072377f85388d953902d6e40d3f6185b63cf7e7bcd3b448e863f58","abstract_canon_sha256":"37c802ce17d85a4bf80d3c91698dfe49eb02653169e4743572eccad0771aa14e"},"schema_version":"1.0"},"canonical_sha256":"03dc46b17cdaf4812f45d9907240c761337be0cdad5684363be951273b67ff28","source":{"kind":"arxiv","id":"1711.00400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00400","created_at":"2026-05-18T00:31:32Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00400v1","created_at":"2026-05-18T00:31:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00400","created_at":"2026-05-18T00:31:32Z"},{"alias_kind":"pith_short_12","alias_value":"APOENML43L2I","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"APOENML43L2ICL2F","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"APOENML4","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:APOENML43L2ICL2F3GIHEQGHME","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-01T15:40:26Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"title_canon_sha256":"449e2fe7be072377f85388d953902d6e40d3f6185b63cf7e7bcd3b448e863f58","abstract_canon_sha256":"37c802ce17d85a4bf80d3c91698dfe49eb02653169e4743572eccad0771aa14e"},"schema_version":"1.0"},"canonical_sha256":"03dc46b17cdaf4812f45d9907240c761337be0cdad5684363be951273b67ff28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:32.191675Z","signature_b64":"8Epfjx8fKWw7RQhxm1hiHyqzJL6t+qTFQvG3eskvGVFJAzESy42jYdW2mu57v0Ez7R82zCRGN8XJtr5jdGtTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03dc46b17cdaf4812f45d9907240c761337be0cdad5684363be951273b67ff28","last_reissued_at":"2026-05-18T00:31:32.191094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:32.191094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00400","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-05-18T00:31:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y47iuTGZY54ixDx6ID7wYK6UWIP2B2P+qK85e8+7z4svDOqz6SNZsS7XF/tPacapbJtPw3DVYybvAM3iwibOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:51:10.770789Z"},"content_sha256":"df3144fafcec0724f64c8ae8d7492000e30af01d3e313ad158d6824485d377ca","schema_version":"1.0","event_id":"sha256:df3144fafcec0724f64c8ae8d7492000e30af01d3e313ad158d6824485d377ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:APOENML43L2ICL2F3GIHEQGHME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Exploration in Structured Stochastic Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Alexandre Proutiere, Richard Combes, Stefan Magureanu","submitted_at":"2017-11-01T15:40:26Z","abstract_excerpt":"This paper introduces and addresses a wide class of stochastic bandit problems where the function mapping the arm to the corresponding reward exhibits some known structural properties. Most existing structures (e.g. linear, Lipschitz, unimodal, combinatorial, dueling, ...) are covered by our framework. We derive an asymptotic instance-specific regret lower bound for these problems, and develop OSSB, an algorithm whose regret matches this fundamental limit. OSSB is not based on the classical principle of \"optimism in the face of uncertainty\" or on Thompson sampling, and rather aims at matching "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00400","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":""},"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-05-18T00:31:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/S4pJSgmnKtBBP0KPil/Bs7SI3UPqNtnQ4lBml45G6X+DeYdpLG5fvnDeP2nIqnTF5XZWbcfrURiNd2/DJ0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:51:10.771452Z"},"content_sha256":"b6e4e7cad8d2e5e6135d8f8af06b2d4acb24da80b7b25a6a4d0c66a5030148b8","schema_version":"1.0","event_id":"sha256:b6e4e7cad8d2e5e6135d8f8af06b2d4acb24da80b7b25a6a4d0c66a5030148b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/bundle.json","state_url":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APOENML43L2ICL2F3GIHEQGHME/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-05-26T13:51:10Z","links":{"resolver":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME","bundle":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/bundle.json","state":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APOENML43L2ICL2F3GIHEQGHME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:APOENML43L2ICL2F3GIHEQGHME","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":"37c802ce17d85a4bf80d3c91698dfe49eb02653169e4743572eccad0771aa14e","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-01T15:40:26Z","title_canon_sha256":"449e2fe7be072377f85388d953902d6e40d3f6185b63cf7e7bcd3b448e863f58"},"schema_version":"1.0","source":{"id":"1711.00400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00400","created_at":"2026-05-18T00:31:32Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00400v1","created_at":"2026-05-18T00:31:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00400","created_at":"2026-05-18T00:31:32Z"},{"alias_kind":"pith_short_12","alias_value":"APOENML43L2I","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"APOENML43L2ICL2F","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"APOENML4","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:b6e4e7cad8d2e5e6135d8f8af06b2d4acb24da80b7b25a6a4d0c66a5030148b8","target":"graph","created_at":"2026-05-18T00:31: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"},"paper":{"abstract_excerpt":"This paper introduces and addresses a wide class of stochastic bandit problems where the function mapping the arm to the corresponding reward exhibits some known structural properties. Most existing structures (e.g. linear, Lipschitz, unimodal, combinatorial, dueling, ...) are covered by our framework. We derive an asymptotic instance-specific regret lower bound for these problems, and develop OSSB, an algorithm whose regret matches this fundamental limit. OSSB is not based on the classical principle of \"optimism in the face of uncertainty\" or on Thompson sampling, and rather aims at matching ","authors_text":"Alexandre Proutiere, Richard Combes, Stefan Magureanu","cross_cats":["cs.AI","cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-01T15:40:26Z","title":"Minimal Exploration in Structured Stochastic Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00400","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:df3144fafcec0724f64c8ae8d7492000e30af01d3e313ad158d6824485d377ca","target":"record","created_at":"2026-05-18T00:31: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":"37c802ce17d85a4bf80d3c91698dfe49eb02653169e4743572eccad0771aa14e","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-01T15:40:26Z","title_canon_sha256":"449e2fe7be072377f85388d953902d6e40d3f6185b63cf7e7bcd3b448e863f58"},"schema_version":"1.0","source":{"id":"1711.00400","kind":"arxiv","version":1}},"canonical_sha256":"03dc46b17cdaf4812f45d9907240c761337be0cdad5684363be951273b67ff28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03dc46b17cdaf4812f45d9907240c761337be0cdad5684363be951273b67ff28","first_computed_at":"2026-05-18T00:31:32.191094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:32.191094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Epfjx8fKWw7RQhxm1hiHyqzJL6t+qTFQvG3eskvGVFJAzESy42jYdW2mu57v0Ez7R82zCRGN8XJtr5jdGtTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:32.191675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df3144fafcec0724f64c8ae8d7492000e30af01d3e313ad158d6824485d377ca","sha256:b6e4e7cad8d2e5e6135d8f8af06b2d4acb24da80b7b25a6a4d0c66a5030148b8"],"state_sha256":"00f66fd3a7550e3db638dfb83900325ab44bb8466265d6bb7d0031caa3680c3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BS+d7KcFcsISzDy2izQay6zv5vr+SIQuKoYG6ayUcB/OoKwhAl48qBUoXrQ8qFsVsrjUXu2z3KRS1S07nlO3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:51:10.774981Z","bundle_sha256":"73dbe1d579bc56d58d81faae23095a39f077cdd95e5d3034fad4e25e35b57024"}}