{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XQBAWZDA2FMFFVGKPBMEQUBQKA","short_pith_number":"pith:XQBAWZDA","canonical_record":{"source":{"id":"1111.4460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T19:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"db4bfac9c5fcca2523899946afb4046fe8f7c02087e67ef81ef061fa88ca9633","abstract_canon_sha256":"20a546b83446fc5831433e8741e33cd45b523ff496e7ca19996f6560cf86708b"},"schema_version":"1.0"},"canonical_sha256":"bc020b6460d15852d4ca7858485030502cc28bf562cf3e646e59ed6a24ddcd2f","source":{"kind":"arxiv","id":"1111.4460","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4460","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4460v1","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4460","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"XQBAWZDA2FMF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XQBAWZDA2FMFFVGK","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XQBAWZDA","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XQBAWZDA2FMFFVGKPBMEQUBQKA","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T19:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"db4bfac9c5fcca2523899946afb4046fe8f7c02087e67ef81ef061fa88ca9633","abstract_canon_sha256":"20a546b83446fc5831433e8741e33cd45b523ff496e7ca19996f6560cf86708b"},"schema_version":"1.0"},"canonical_sha256":"bc020b6460d15852d4ca7858485030502cc28bf562cf3e646e59ed6a24ddcd2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:04.383880Z","signature_b64":"EETZ2O3Vu4hKwkK6a/0hw4iXTH5oOFLhk3tG6qP/CvdGjgPttgUcwTb+7hzFnVM0sGhu27pzTGUBXwngbGhnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc020b6460d15852d4ca7858485030502cc28bf562cf3e646e59ed6a24ddcd2f","last_reissued_at":"2026-05-18T04:08:04.383391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:04.383391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4460","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-18T04:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63WOrwjkYMhTzaRTp3ghiq3qJq53w/Pt0u3JoFxPK4reySPs7Nf39pA9RXQUTRXIS8+Xco+Y7/MwDiUQqXxYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:46:03.870995Z"},"content_sha256":"35a512faedc0b858a7e4126ec380b0126fa199dca59ac315568bf756943d73e7","schema_version":"1.0","event_id":"sha256:35a512faedc0b858a7e4126ec380b0126fa199dca59ac315568bf756943d73e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XQBAWZDA2FMFFVGKPBMEQUBQKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parametrized Stochastic Multi-armed Bandits with Binary Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chong Jiang, R. Srikant","submitted_at":"2011-11-18T19:23:47Z","abstract_excerpt":"In this paper, we consider the problem of multi-armed bandits with a large, possibly infinite number of correlated arms. We assume that the arms have Bernoulli distributed rewards, independent across time, where the probabilities of success are parametrized by known attribute vectors for each arm, as well as an unknown preference vector, each of dimension $n$. For this model, we seek an algorithm with a total regret that is sub-linear in time and independent of the number of arms. We present such an algorithm, which we call the Two-Phase Algorithm, and analyze its performance. We show upper bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4460","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-18T04:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9zAR9Zr7hyfEyFTV6YMQE94zMSX281u6KSHQmCGkJu6EhoFXqs8MO/Q+Y77LoNVtCsXGJ5Yjv1vDYsVPcfPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:46:03.871627Z"},"content_sha256":"4cf2d678aad28186353b5b00968628c17ab42876042ef6453b6a1176ac2897e6","schema_version":"1.0","event_id":"sha256:4cf2d678aad28186353b5b00968628c17ab42876042ef6453b6a1176ac2897e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQBAWZDA2FMFFVGKPBMEQUBQKA/bundle.json","state_url":"https://pith.science/pith/XQBAWZDA2FMFFVGKPBMEQUBQKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQBAWZDA2FMFFVGKPBMEQUBQKA/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-07T23:46:03Z","links":{"resolver":"https://pith.science/pith/XQBAWZDA2FMFFVGKPBMEQUBQKA","bundle":"https://pith.science/pith/XQBAWZDA2FMFFVGKPBMEQUBQKA/bundle.json","state":"https://pith.science/pith/XQBAWZDA2FMFFVGKPBMEQUBQKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQBAWZDA2FMFFVGKPBMEQUBQKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XQBAWZDA2FMFFVGKPBMEQUBQKA","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":"20a546b83446fc5831433e8741e33cd45b523ff496e7ca19996f6560cf86708b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T19:23:47Z","title_canon_sha256":"db4bfac9c5fcca2523899946afb4046fe8f7c02087e67ef81ef061fa88ca9633"},"schema_version":"1.0","source":{"id":"1111.4460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4460","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4460v1","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4460","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"XQBAWZDA2FMF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XQBAWZDA2FMFFVGK","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XQBAWZDA","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:4cf2d678aad28186353b5b00968628c17ab42876042ef6453b6a1176ac2897e6","target":"graph","created_at":"2026-05-18T04:08:04Z","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":"In this paper, we consider the problem of multi-armed bandits with a large, possibly infinite number of correlated arms. We assume that the arms have Bernoulli distributed rewards, independent across time, where the probabilities of success are parametrized by known attribute vectors for each arm, as well as an unknown preference vector, each of dimension $n$. For this model, we seek an algorithm with a total regret that is sub-linear in time and independent of the number of arms. We present such an algorithm, which we call the Two-Phase Algorithm, and analyze its performance. We show upper bo","authors_text":"Chong Jiang, R. Srikant","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T19:23:47Z","title":"Parametrized Stochastic Multi-armed Bandits with Binary Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4460","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:35a512faedc0b858a7e4126ec380b0126fa199dca59ac315568bf756943d73e7","target":"record","created_at":"2026-05-18T04:08:04Z","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":"20a546b83446fc5831433e8741e33cd45b523ff496e7ca19996f6560cf86708b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-11-18T19:23:47Z","title_canon_sha256":"db4bfac9c5fcca2523899946afb4046fe8f7c02087e67ef81ef061fa88ca9633"},"schema_version":"1.0","source":{"id":"1111.4460","kind":"arxiv","version":1}},"canonical_sha256":"bc020b6460d15852d4ca7858485030502cc28bf562cf3e646e59ed6a24ddcd2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc020b6460d15852d4ca7858485030502cc28bf562cf3e646e59ed6a24ddcd2f","first_computed_at":"2026-05-18T04:08:04.383391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:04.383391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EETZ2O3Vu4hKwkK6a/0hw4iXTH5oOFLhk3tG6qP/CvdGjgPttgUcwTb+7hzFnVM0sGhu27pzTGUBXwngbGhnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:04.383880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35a512faedc0b858a7e4126ec380b0126fa199dca59ac315568bf756943d73e7","sha256:4cf2d678aad28186353b5b00968628c17ab42876042ef6453b6a1176ac2897e6"],"state_sha256":"46be887c8436b0004c0d73407a1481d0e481dde3386c332c49b6fbf8f87247eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLxIOwfyo/S4QMrtIasFSt/Pb4blev7lO+RQGPSWfNDFN7AAd4vE5BgMYrzKG121RY7MRBakGElXFpdMLbYoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:46:03.875486Z","bundle_sha256":"e0cc57a7474ad7e13346f79c29338408728de5563e4149ac0671c6ab39d791cd"}}