{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZBRBQ3QTVTVS57P3G7QKQ6AOFH","short_pith_number":"pith:ZBRBQ3QT","schema_version":"1.0","canonical_sha256":"c862186e13aceb2efdfb37e0a8780e29fca4927ce5d794fd8e62557366e5f3fb","source":{"kind":"arxiv","id":"1707.04987","version":1},"attestation_state":"computed","paper":{"title":"Online Multi-Armed Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Ashwath Thirmulai, Joe Zurier, Uma Roy","submitted_at":"2017-07-17T02:55:00Z","abstract_excerpt":"We introduce a novel variant of the multi-armed bandit problem, in which bandits are streamed one at a time to the player, and at each point, the player can either choose to pull the current bandit or move on to the next bandit. Once a player has moved on from a bandit, they may never visit it again, which is a crucial difference between our problem and classic multi-armed bandit problems. In this online context, we study Bernoulli bandits (bandits with payout Ber($p_i$) for some underlying mean $p_i$) with underlying means drawn i.i.d. from various distributions, including the uniform distrib"},"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":"1707.04987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-17T02:55:00Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"353afb669568f5ed085dc989badcbd01b45494bbc49a3be6a493772f28bd0111","abstract_canon_sha256":"de70d53112885870e4661b5788072fbb1bde33221cfad8c2c5fec115aebf960f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.660564Z","signature_b64":"1eucZuo2Qmt9SqAFb4/SLljYIymXxMJOGyt7beN7/14LxdHwMwji9nlFg69+B68jEgkcYB0Q9P+dNiantKp6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c862186e13aceb2efdfb37e0a8780e29fca4927ce5d794fd8e62557366e5f3fb","last_reissued_at":"2026-05-18T00:40:11.659969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.659969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Multi-Armed Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Ashwath Thirmulai, Joe Zurier, Uma Roy","submitted_at":"2017-07-17T02:55:00Z","abstract_excerpt":"We introduce a novel variant of the multi-armed bandit problem, in which bandits are streamed one at a time to the player, and at each point, the player can either choose to pull the current bandit or move on to the next bandit. Once a player has moved on from a bandit, they may never visit it again, which is a crucial difference between our problem and classic multi-armed bandit problems. In this online context, we study Bernoulli bandits (bandits with payout Ber($p_i$) for some underlying mean $p_i$) with underlying means drawn i.i.d. from various distributions, including the uniform distrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04987","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":"1707.04987","created_at":"2026-05-18T00:40:11.660074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04987v1","created_at":"2026-05-18T00:40:11.660074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04987","created_at":"2026-05-18T00:40:11.660074+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBRBQ3QTVTVS","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBRBQ3QTVTVS57P3","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBRBQ3QT","created_at":"2026-05-18T12:31:59.375834+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/ZBRBQ3QTVTVS57P3G7QKQ6AOFH","json":"https://pith.science/pith/ZBRBQ3QTVTVS57P3G7QKQ6AOFH.json","graph_json":"https://pith.science/api/pith-number/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/graph.json","events_json":"https://pith.science/api/pith-number/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/events.json","paper":"https://pith.science/paper/ZBRBQ3QT"},"agent_actions":{"view_html":"https://pith.science/pith/ZBRBQ3QTVTVS57P3G7QKQ6AOFH","download_json":"https://pith.science/pith/ZBRBQ3QTVTVS57P3G7QKQ6AOFH.json","view_paper":"https://pith.science/paper/ZBRBQ3QT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04987&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/action/storage_attestation","attest_author":"https://pith.science/pith/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/action/author_attestation","sign_citation":"https://pith.science/pith/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/action/citation_signature","submit_replication":"https://pith.science/pith/ZBRBQ3QTVTVS57P3G7QKQ6AOFH/action/replication_record"}},"created_at":"2026-05-18T00:40:11.660074+00:00","updated_at":"2026-05-18T00:40:11.660074+00:00"}