{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GOXKJ6FIQQ5HIEOUJXQ4BXOFWL","short_pith_number":"pith:GOXKJ6FI","canonical_record":{"source":{"id":"1906.03979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T14:27:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"232293b1ce2bcb7d8b82e028dcdcb41a544a04612f8f4e4fbcd68d3a60371df0","abstract_canon_sha256":"29603a406808e3c5d4e3b863cd5199ad64de77476fb9b983aef9da68790412ad"},"schema_version":"1.0"},"canonical_sha256":"33aea4f8a8843a7411d44de1c0ddc5b2eaa5a167ec275e0cb37e09be1445bb6e","source":{"kind":"arxiv","id":"1906.03979","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03979","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03979v1","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03979","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"GOXKJ6FIQQ5H","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GOXKJ6FIQQ5HIEOU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GOXKJ6FI","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GOXKJ6FIQQ5HIEOUJXQ4BXOFWL","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T14:27:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"232293b1ce2bcb7d8b82e028dcdcb41a544a04612f8f4e4fbcd68d3a60371df0","abstract_canon_sha256":"29603a406808e3c5d4e3b863cd5199ad64de77476fb9b983aef9da68790412ad"},"schema_version":"1.0"},"canonical_sha256":"33aea4f8a8843a7411d44de1c0ddc5b2eaa5a167ec275e0cb37e09be1445bb6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:44.282640Z","signature_b64":"s8AVLzwtYKN0fX0VDOyOTpuuMseLRBVUNsccNBblJZOzvhnhXxOfoyg9MkFo1/zv1S1k3HxrxX5FJ/ga1zQrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33aea4f8a8843a7411d44de1c0ddc5b2eaa5a167ec275e0cb37e09be1445bb6e","last_reissued_at":"2026-05-17T23:43:44.281922Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:44.281922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03979","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-17T23:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHK5xe05zHgbQZEoFmsKtb8k3wsEDIxcV4uqJIp234fYHv46mQScz+GL6um2osozWSfPtW7Le+3hfh/l5hahDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:15:51.846651Z"},"content_sha256":"f10d32cf8442f7d0cde2541f649892700cdf76eb56ad5b3eb94dd12e08898315","schema_version":"1.0","event_id":"sha256:f10d32cf8442f7d0cde2541f649892700cdf76eb56ad5b3eb94dd12e08898315"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GOXKJ6FIQQ5HIEOUJXQ4BXOFWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Exploitation of Clustering and History Information in Multi-Armed Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Djallel Bouneffouf, Horst Samulowitz, Martin Wistub, Srinivasan Parthasarathy","submitted_at":"2019-05-31T14:27:58Z","abstract_excerpt":"We consider the stochastic multi-armed bandit problem and the contextual bandit problem with historical observations and pre-clustered arms. The historical observations can contain any number of instances for each arm, and the pre-clustering information is a fixed clustering of arms provided as part of the input. We develop a variety of algorithms which incorporate this offline information effectively during the online exploration phase and derive their regret bounds. In particular, we develop the META algorithm which effectively hedges between two other algorithms: one which uses both histori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03979","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-17T23:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5JR2nE5DQ/nYYQnZ03vDuzpbCxPfquQmRaDgYUOrnDyQoY2aS5GF5uYi7u78r82mJ/IkG01WBrCy140T5BCEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:15:51.847052Z"},"content_sha256":"ad239604dd4479b4ca0091f77436cede949897b328faf958c9526271b04b595a","schema_version":"1.0","event_id":"sha256:ad239604dd4479b4ca0091f77436cede949897b328faf958c9526271b04b595a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOXKJ6FIQQ5HIEOUJXQ4BXOFWL/bundle.json","state_url":"https://pith.science/pith/GOXKJ6FIQQ5HIEOUJXQ4BXOFWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOXKJ6FIQQ5HIEOUJXQ4BXOFWL/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-28T00:15:51Z","links":{"resolver":"https://pith.science/pith/GOXKJ6FIQQ5HIEOUJXQ4BXOFWL","bundle":"https://pith.science/pith/GOXKJ6FIQQ5HIEOUJXQ4BXOFWL/bundle.json","state":"https://pith.science/pith/GOXKJ6FIQQ5HIEOUJXQ4BXOFWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOXKJ6FIQQ5HIEOUJXQ4BXOFWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GOXKJ6FIQQ5HIEOUJXQ4BXOFWL","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":"29603a406808e3c5d4e3b863cd5199ad64de77476fb9b983aef9da68790412ad","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T14:27:58Z","title_canon_sha256":"232293b1ce2bcb7d8b82e028dcdcb41a544a04612f8f4e4fbcd68d3a60371df0"},"schema_version":"1.0","source":{"id":"1906.03979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03979","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03979v1","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03979","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"GOXKJ6FIQQ5H","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GOXKJ6FIQQ5HIEOU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GOXKJ6FI","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:ad239604dd4479b4ca0091f77436cede949897b328faf958c9526271b04b595a","target":"graph","created_at":"2026-05-17T23:43:44Z","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":"We consider the stochastic multi-armed bandit problem and the contextual bandit problem with historical observations and pre-clustered arms. The historical observations can contain any number of instances for each arm, and the pre-clustering information is a fixed clustering of arms provided as part of the input. We develop a variety of algorithms which incorporate this offline information effectively during the online exploration phase and derive their regret bounds. In particular, we develop the META algorithm which effectively hedges between two other algorithms: one which uses both histori","authors_text":"Djallel Bouneffouf, Horst Samulowitz, Martin Wistub, Srinivasan Parthasarathy","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T14:27:58Z","title":"Optimal Exploitation of Clustering and History Information in Multi-Armed Bandit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03979","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:f10d32cf8442f7d0cde2541f649892700cdf76eb56ad5b3eb94dd12e08898315","target":"record","created_at":"2026-05-17T23:43:44Z","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":"29603a406808e3c5d4e3b863cd5199ad64de77476fb9b983aef9da68790412ad","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T14:27:58Z","title_canon_sha256":"232293b1ce2bcb7d8b82e028dcdcb41a544a04612f8f4e4fbcd68d3a60371df0"},"schema_version":"1.0","source":{"id":"1906.03979","kind":"arxiv","version":1}},"canonical_sha256":"33aea4f8a8843a7411d44de1c0ddc5b2eaa5a167ec275e0cb37e09be1445bb6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33aea4f8a8843a7411d44de1c0ddc5b2eaa5a167ec275e0cb37e09be1445bb6e","first_computed_at":"2026-05-17T23:43:44.281922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:44.281922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s8AVLzwtYKN0fX0VDOyOTpuuMseLRBVUNsccNBblJZOzvhnhXxOfoyg9MkFo1/zv1S1k3HxrxX5FJ/ga1zQrDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:44.282640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f10d32cf8442f7d0cde2541f649892700cdf76eb56ad5b3eb94dd12e08898315","sha256:ad239604dd4479b4ca0091f77436cede949897b328faf958c9526271b04b595a"],"state_sha256":"81064f21f1bc5db0872c2e7c5d713be7b6f2cf3d7f3ceded267702f39e626a7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfn1jqrynzXVwvdCV8mP7qv7BYppMu/FjP1L76LJhGyLzrLvbPYah/flGIIh1YsXXJ+0X9K2OiR5y6NwyWRGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:15:51.849787Z","bundle_sha256":"b42c9acc3c8e5caf59614cd99f0c8199ef021fce5e87cb38e6a7badcfaf7d755"}}