{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MD546BPL2Q5NUGUADA7IXBASV3","short_pith_number":"pith:MD546BPL","canonical_record":{"source":{"id":"1402.0562","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-04T01:34:50Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"1669aa14fce1f92cdad66c683e84ea9cc19c53ecb890298dedbeb2dbf13bd0c7","abstract_canon_sha256":"bbe6a9dc2b718cbcdc14726d86b74af80671ff922231f66ad673ff4010d93f04"},"schema_version":"1.0"},"canonical_sha256":"60fbcf05ebd43ada1a80183e8b8412aedac5a095f8b4a0c7509a9be3156f4275","source":{"kind":"arxiv","id":"1402.0562","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0562","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0562v3","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0562","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"MD546BPL2Q5N","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MD546BPL2Q5NUGUA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MD546BPL","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MD546BPL2Q5NUGUADA7IXBASV3","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0562","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-04T01:34:50Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"1669aa14fce1f92cdad66c683e84ea9cc19c53ecb890298dedbeb2dbf13bd0c7","abstract_canon_sha256":"bbe6a9dc2b718cbcdc14726d86b74af80671ff922231f66ad673ff4010d93f04"},"schema_version":"1.0"},"canonical_sha256":"60fbcf05ebd43ada1a80183e8b8412aedac5a095f8b4a0c7509a9be3156f4275","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:41.625141Z","signature_b64":"EHtmb/ujnutQh49BYtzLIUEX/6AXPns4+3mPD5H+S7sUNs3wpN9SXh4aoK+rZdGW3b4XxVB5ko3fljrHVD59Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60fbcf05ebd43ada1a80183e8b8412aedac5a095f8b4a0c7509a9be3156f4275","last_reissued_at":"2026-05-18T02:51:41.624633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:41.624633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0562","source_version":3,"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-18T02:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oV4L6AwgYP+Y9fJ6XFwKwLUgvykxgH7ISKMghrjPxgueF4CByl6cATn1Bih0P5KSPeNd08k8/hF0dtNJkMV3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:11:26.576355Z"},"content_sha256":"5d9014109bc1bba3263bda5da414971ab4fe4fcb3a74d06c943cd655be2226d3","schema_version":"1.0","event_id":"sha256:5d9014109bc1bba3263bda5da414971ab4fe4fcb3a74d06c943cd655be2226d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MD546BPL2Q5NUGUADA7IXBASV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Stochastic Optimization under Correlated Bandit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Emma Brunskill, Mohammad Gheshlaghi Azar","submitted_at":"2014-02-04T01:34:50Z","abstract_excerpt":"In this paper we consider the problem of online stochastic optimization of a locally smooth function under bandit feedback. We introduce the high-confidence tree (HCT) algorithm, a novel any-time $\\mathcal{X}$-armed bandit algorithm, and derive regret bounds matching the performance of existing state-of-the-art in terms of dependency on number of steps and smoothness factor. The main advantage of HCT is that it handles the challenging case of correlated rewards, whereas existing methods require that the reward-generating process of each arm is an identically and independent distributed (iid) r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0562","kind":"arxiv","version":3},"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-18T02:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncLBbp10LMs5xTXFaNnTh5crJ6v6/nqzYq62vifpG8hGgPnmf79Zoyx493mUIEwZnXbGP/yzZ9J8+mZxJ1udAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:11:26.576705Z"},"content_sha256":"fb283f9db2ed7a040510cf8731e22643e0cb66f9cbbdf73ac733625efa2da788","schema_version":"1.0","event_id":"sha256:fb283f9db2ed7a040510cf8731e22643e0cb66f9cbbdf73ac733625efa2da788"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MD546BPL2Q5NUGUADA7IXBASV3/bundle.json","state_url":"https://pith.science/pith/MD546BPL2Q5NUGUADA7IXBASV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MD546BPL2Q5NUGUADA7IXBASV3/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-07-06T21:11:26Z","links":{"resolver":"https://pith.science/pith/MD546BPL2Q5NUGUADA7IXBASV3","bundle":"https://pith.science/pith/MD546BPL2Q5NUGUADA7IXBASV3/bundle.json","state":"https://pith.science/pith/MD546BPL2Q5NUGUADA7IXBASV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MD546BPL2Q5NUGUADA7IXBASV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MD546BPL2Q5NUGUADA7IXBASV3","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":"bbe6a9dc2b718cbcdc14726d86b74af80671ff922231f66ad673ff4010d93f04","cross_cats_sorted":["cs.LG","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-04T01:34:50Z","title_canon_sha256":"1669aa14fce1f92cdad66c683e84ea9cc19c53ecb890298dedbeb2dbf13bd0c7"},"schema_version":"1.0","source":{"id":"1402.0562","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0562","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0562v3","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0562","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"MD546BPL2Q5N","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MD546BPL2Q5NUGUA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MD546BPL","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:fb283f9db2ed7a040510cf8731e22643e0cb66f9cbbdf73ac733625efa2da788","target":"graph","created_at":"2026-05-18T02:51:41Z","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 online stochastic optimization of a locally smooth function under bandit feedback. We introduce the high-confidence tree (HCT) algorithm, a novel any-time $\\mathcal{X}$-armed bandit algorithm, and derive regret bounds matching the performance of existing state-of-the-art in terms of dependency on number of steps and smoothness factor. The main advantage of HCT is that it handles the challenging case of correlated rewards, whereas existing methods require that the reward-generating process of each arm is an identically and independent distributed (iid) r","authors_text":"Alessandro Lazaric, Emma Brunskill, Mohammad Gheshlaghi Azar","cross_cats":["cs.LG","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-04T01:34:50Z","title":"Online Stochastic Optimization under Correlated Bandit Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0562","kind":"arxiv","version":3},"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:5d9014109bc1bba3263bda5da414971ab4fe4fcb3a74d06c943cd655be2226d3","target":"record","created_at":"2026-05-18T02:51:41Z","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":"bbe6a9dc2b718cbcdc14726d86b74af80671ff922231f66ad673ff4010d93f04","cross_cats_sorted":["cs.LG","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-04T01:34:50Z","title_canon_sha256":"1669aa14fce1f92cdad66c683e84ea9cc19c53ecb890298dedbeb2dbf13bd0c7"},"schema_version":"1.0","source":{"id":"1402.0562","kind":"arxiv","version":3}},"canonical_sha256":"60fbcf05ebd43ada1a80183e8b8412aedac5a095f8b4a0c7509a9be3156f4275","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60fbcf05ebd43ada1a80183e8b8412aedac5a095f8b4a0c7509a9be3156f4275","first_computed_at":"2026-05-18T02:51:41.624633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:41.624633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EHtmb/ujnutQh49BYtzLIUEX/6AXPns4+3mPD5H+S7sUNs3wpN9SXh4aoK+rZdGW3b4XxVB5ko3fljrHVD59Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:41.625141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0562","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d9014109bc1bba3263bda5da414971ab4fe4fcb3a74d06c943cd655be2226d3","sha256:fb283f9db2ed7a040510cf8731e22643e0cb66f9cbbdf73ac733625efa2da788"],"state_sha256":"d0119a6b44175c640005f9ac86a052ef662ca04f1dfcb1913753e99c5103d0c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"deM1BTnKm4INTMrkMGi4QrxvKgxgSrCFmjk1e4j9qqXQ31BUCLRxrIOYr+Ac9Qy6/YBCT1d8K6OQqcfulougAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T21:11:26.578636Z","bundle_sha256":"3f98b264e851f222faf6ff76ed1eb7494d121ae9e6a0f842e8ff79826411ccdd"}}