{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:APOENML43L2ICL2F3GIHEQGHME","short_pith_number":"pith:APOENML4","schema_version":"1.0","canonical_sha256":"03dc46b17cdaf4812f45d9907240c761337be0cdad5684363be951273b67ff28","source":{"kind":"arxiv","id":"1711.00400","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.00400","created_at":"2026-05-18T00:31:32.191193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00400v1","created_at":"2026-05-18T00:31:32.191193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00400","created_at":"2026-05-18T00:31:32.191193+00:00"},{"alias_kind":"pith_short_12","alias_value":"APOENML43L2I","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"APOENML43L2ICL2F","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"APOENML4","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME","json":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME.json","graph_json":"https://pith.science/api/pith-number/APOENML43L2ICL2F3GIHEQGHME/graph.json","events_json":"https://pith.science/api/pith-number/APOENML43L2ICL2F3GIHEQGHME/events.json","paper":"https://pith.science/paper/APOENML4"},"agent_actions":{"view_html":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME","download_json":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME.json","view_paper":"https://pith.science/paper/APOENML4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00400&json=true","fetch_graph":"https://pith.science/api/pith-number/APOENML43L2ICL2F3GIHEQGHME/graph.json","fetch_events":"https://pith.science/api/pith-number/APOENML43L2ICL2F3GIHEQGHME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/action/storage_attestation","attest_author":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/action/author_attestation","sign_citation":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/action/citation_signature","submit_replication":"https://pith.science/pith/APOENML43L2ICL2F3GIHEQGHME/action/replication_record"}},"created_at":"2026-05-18T00:31:32.191193+00:00","updated_at":"2026-05-18T00:31:32.191193+00:00"}