{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:75CG27KXERAM2H72XSVPOUMLPK","short_pith_number":"pith:75CG27KX","schema_version":"1.0","canonical_sha256":"ff446d7d572440cd1ffabcaaf7518b7aa00b8436ea9e78efb69aada9e05a2453","source":{"kind":"arxiv","id":"1905.13159","version":2},"attestation_state":"computed","paper":{"title":"Distribution-dependent and Time-uniform Bounds for Piecewise i.i.d Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Odalric-Ambrym Maillard, Subhojyoti Mukherjee","submitted_at":"2019-05-30T16:30:19Z","abstract_excerpt":"We consider the setup of stochastic multi-armed bandits in the case when reward distributions are piecewise i.i.d. and bounded with unknown changepoints. We focus on the case when changes happen simultaneously on all arms, and in stark contrast with the existing literature, we target gap-dependent (as opposed to only gap-independent) regret bounds involving the magnitude of changes $(\\Delta^{chg}_{i,g})$ and optimality-gaps ($\\Delta^{opt}_{i,g}$). Diverging from previous works, we assume the more realistic scenario that there can be undetectable changepoint gaps and under a different set of as"},"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":"1905.13159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T16:30:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"787123b363d64f20caf3764f43989806d3c54340f6de90b6d7c8c2f526c69074","abstract_canon_sha256":"95ba4b94df07565edcb09865773be46f8511363e41bdbc9ad7ede42eec381931"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:55.918133Z","signature_b64":"nZocfbsSNxI9zetbqKWSgobgHyI8f05YyYJPMeGsLrkQaWuImJXC7iXKIfiPtx+j39Te0Lp7KMdOF2keWVvVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff446d7d572440cd1ffabcaaf7518b7aa00b8436ea9e78efb69aada9e05a2453","last_reissued_at":"2026-05-17T23:43:55.917464Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:55.917464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distribution-dependent and Time-uniform Bounds for Piecewise i.i.d Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Odalric-Ambrym Maillard, Subhojyoti Mukherjee","submitted_at":"2019-05-30T16:30:19Z","abstract_excerpt":"We consider the setup of stochastic multi-armed bandits in the case when reward distributions are piecewise i.i.d. and bounded with unknown changepoints. We focus on the case when changes happen simultaneously on all arms, and in stark contrast with the existing literature, we target gap-dependent (as opposed to only gap-independent) regret bounds involving the magnitude of changes $(\\Delta^{chg}_{i,g})$ and optimality-gaps ($\\Delta^{opt}_{i,g}$). Diverging from previous works, we assume the more realistic scenario that there can be undetectable changepoint gaps and under a different set of as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13159","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":""},"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":"1905.13159","created_at":"2026-05-17T23:43:55.917568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13159v2","created_at":"2026-05-17T23:43:55.917568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13159","created_at":"2026-05-17T23:43:55.917568+00:00"},{"alias_kind":"pith_short_12","alias_value":"75CG27KXERAM","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"75CG27KXERAM2H72","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"75CG27KX","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21432","citing_title":"A single algorithm for both restless and rested rotting bandits","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK","json":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK.json","graph_json":"https://pith.science/api/pith-number/75CG27KXERAM2H72XSVPOUMLPK/graph.json","events_json":"https://pith.science/api/pith-number/75CG27KXERAM2H72XSVPOUMLPK/events.json","paper":"https://pith.science/paper/75CG27KX"},"agent_actions":{"view_html":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK","download_json":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK.json","view_paper":"https://pith.science/paper/75CG27KX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13159&json=true","fetch_graph":"https://pith.science/api/pith-number/75CG27KXERAM2H72XSVPOUMLPK/graph.json","fetch_events":"https://pith.science/api/pith-number/75CG27KXERAM2H72XSVPOUMLPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK/action/storage_attestation","attest_author":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK/action/author_attestation","sign_citation":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK/action/citation_signature","submit_replication":"https://pith.science/pith/75CG27KXERAM2H72XSVPOUMLPK/action/replication_record"}},"created_at":"2026-05-17T23:43:55.917568+00:00","updated_at":"2026-05-17T23:43:55.917568+00:00"}