{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QYVNFUAYTCKECARQZIZ5XCGIYI","short_pith_number":"pith:QYVNFUAY","canonical_record":{"source":{"id":"1808.05904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-17T15:48:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8866e88cb7d83a01072f58ab927d7b5786c97fa20c9bbcd74e834ce0d0b77d3e","abstract_canon_sha256":"b93a72536e9527c4d2479f7305cf6e5f877c5ac5cde063eed5e5f26117803786"},"schema_version":"1.0"},"canonical_sha256":"862ad2d0189894410230ca33db88c8c23149ce5793ab7a9c03d7912ec4d44209","source":{"kind":"arxiv","id":"1808.05904","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05904","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05904v2","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05904","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"pith_short_12","alias_value":"QYVNFUAYTCKE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QYVNFUAYTCKECARQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QYVNFUAY","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QYVNFUAYTCKECARQZIZ5XCGIYI","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-17T15:48:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8866e88cb7d83a01072f58ab927d7b5786c97fa20c9bbcd74e834ce0d0b77d3e","abstract_canon_sha256":"b93a72536e9527c4d2479f7305cf6e5f877c5ac5cde063eed5e5f26117803786"},"schema_version":"1.0"},"canonical_sha256":"862ad2d0189894410230ca33db88c8c23149ce5793ab7a9c03d7912ec4d44209","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:07.481067Z","signature_b64":"cSAaVLQRAIS1Z8xUk7I75dq8GrfNaRsvnFP+oVRWGiXXaHvaIjQ4xbnam3O//47zelWq2ChDrBgMtszHB33QAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"862ad2d0189894410230ca33db88c8c23149ce5793ab7a9c03d7912ec4d44209","last_reissued_at":"2026-05-17T23:55:07.480620Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:07.480620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05904","source_version":2,"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:55:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGXowiTUVBPvjuegXMnwXC1u9KOjvZm0Vndm66Ciqpa/wVVF5Hu5NoYQxWO0dv3iXPrraE+O14NtFcSRGlWRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:17:26.259014Z"},"content_sha256":"7f1b8dddd9f8d8edcc271302beb61c92f420e9f656bc0f999f7810f0d2982d1f","schema_version":"1.0","event_id":"sha256:7f1b8dddd9f8d8edcc271302beb61c92f420e9f656bc0f999f7810f0d2982d1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QYVNFUAYTCKECARQZIZ5XCGIYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Correlated Multi-armed Bandits with a Latent Random Source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Gauri Joshi, Osman Ya\\u{g}an, Samarth Gupta","submitted_at":"2018-08-17T15:48:52Z","abstract_excerpt":"We consider a novel multi-armed bandit framework where the rewards obtained by pulling the arms are functions of a common latent random variable. The correlation between arms due to the common random source can be used to design a generalized upper-confidence-bound (UCB) algorithm that identifies certain arms as $non-competitive$, and avoids exploring them. As a result, we reduce a $K$-armed bandit problem to a $C+1$-armed problem, where $C+1$ includes the best arm and $C$ $competitive$ arms. Our regret analysis shows that the competitive arms need to be pulled $\\mathcal{O}(\\log T)$ times, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05904","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"},"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:55:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwkvi/cPdiguPRbr90ouR41xxGS9CKQIyPgo4VW+85q+6vOtiJzMAci+SdckuDCNB/7lwVuT6L1fhvYbTGggDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:17:26.259380Z"},"content_sha256":"bb0160b3b478cc36463cd877c22a2493dee9dabef8bf49550aa0f697da2e5570","schema_version":"1.0","event_id":"sha256:bb0160b3b478cc36463cd877c22a2493dee9dabef8bf49550aa0f697da2e5570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYVNFUAYTCKECARQZIZ5XCGIYI/bundle.json","state_url":"https://pith.science/pith/QYVNFUAYTCKECARQZIZ5XCGIYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYVNFUAYTCKECARQZIZ5XCGIYI/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-06-12T09:17:26Z","links":{"resolver":"https://pith.science/pith/QYVNFUAYTCKECARQZIZ5XCGIYI","bundle":"https://pith.science/pith/QYVNFUAYTCKECARQZIZ5XCGIYI/bundle.json","state":"https://pith.science/pith/QYVNFUAYTCKECARQZIZ5XCGIYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYVNFUAYTCKECARQZIZ5XCGIYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QYVNFUAYTCKECARQZIZ5XCGIYI","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":"b93a72536e9527c4d2479f7305cf6e5f877c5ac5cde063eed5e5f26117803786","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-17T15:48:52Z","title_canon_sha256":"8866e88cb7d83a01072f58ab927d7b5786c97fa20c9bbcd74e834ce0d0b77d3e"},"schema_version":"1.0","source":{"id":"1808.05904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05904","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05904v2","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05904","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"pith_short_12","alias_value":"QYVNFUAYTCKE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QYVNFUAYTCKECARQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QYVNFUAY","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:bb0160b3b478cc36463cd877c22a2493dee9dabef8bf49550aa0f697da2e5570","target":"graph","created_at":"2026-05-17T23:55:07Z","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 a novel multi-armed bandit framework where the rewards obtained by pulling the arms are functions of a common latent random variable. The correlation between arms due to the common random source can be used to design a generalized upper-confidence-bound (UCB) algorithm that identifies certain arms as $non-competitive$, and avoids exploring them. As a result, we reduce a $K$-armed bandit problem to a $C+1$-armed problem, where $C+1$ includes the best arm and $C$ $competitive$ arms. Our regret analysis shows that the competitive arms need to be pulled $\\mathcal{O}(\\log T)$ times, whi","authors_text":"Gauri Joshi, Osman Ya\\u{g}an, Samarth Gupta","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-17T15:48:52Z","title":"Correlated Multi-armed Bandits with a Latent Random Source"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05904","kind":"arxiv","version":2},"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:7f1b8dddd9f8d8edcc271302beb61c92f420e9f656bc0f999f7810f0d2982d1f","target":"record","created_at":"2026-05-17T23:55:07Z","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":"b93a72536e9527c4d2479f7305cf6e5f877c5ac5cde063eed5e5f26117803786","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-17T15:48:52Z","title_canon_sha256":"8866e88cb7d83a01072f58ab927d7b5786c97fa20c9bbcd74e834ce0d0b77d3e"},"schema_version":"1.0","source":{"id":"1808.05904","kind":"arxiv","version":2}},"canonical_sha256":"862ad2d0189894410230ca33db88c8c23149ce5793ab7a9c03d7912ec4d44209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"862ad2d0189894410230ca33db88c8c23149ce5793ab7a9c03d7912ec4d44209","first_computed_at":"2026-05-17T23:55:07.480620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:07.480620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cSAaVLQRAIS1Z8xUk7I75dq8GrfNaRsvnFP+oVRWGiXXaHvaIjQ4xbnam3O//47zelWq2ChDrBgMtszHB33QAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:07.481067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f1b8dddd9f8d8edcc271302beb61c92f420e9f656bc0f999f7810f0d2982d1f","sha256:bb0160b3b478cc36463cd877c22a2493dee9dabef8bf49550aa0f697da2e5570"],"state_sha256":"eefd3a3cddd326e9dc24370da3cd7d5b074e4b40c1b432a0f05d837333380611"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmItBT+YZ+6jYH6QJkS6GsbbdgGjwEjzXYqmHRyDVc5N84EgGLwos4eWHnz+8vc84hIO33ZmDhiWLwnI/sH+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:17:26.261470Z","bundle_sha256":"64177d6556dee0edaf5cdd7c39d1c993a85d9d572456c285e0a932f79b14cc00"}}