{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:N2HECKXBV6KYBLKA5BEOMVVWIE","short_pith_number":"pith:N2HECKXB","canonical_record":{"source":{"id":"1602.04976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-16T10:48:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a8319e806b211e3532d32580ccb16f8923416e9d03e7521c7f19e470b6e19ae","abstract_canon_sha256":"e905a67dbc7a22edf2135f6c640b0c11f83e96f779c046ac7a335678ea41e30e"},"schema_version":"1.0"},"canonical_sha256":"6e8e412ae1af9580ad40e848e656b6410f0b29bc94822fd0f40e1cbde89cb210","source":{"kind":"arxiv","id":"1602.04976","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04976","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04976v1","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04976","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"N2HECKXBV6KY","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N2HECKXBV6KYBLKA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N2HECKXB","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:N2HECKXBV6KYBLKA5BEOMVVWIE","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-16T10:48:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a8319e806b211e3532d32580ccb16f8923416e9d03e7521c7f19e470b6e19ae","abstract_canon_sha256":"e905a67dbc7a22edf2135f6c640b0c11f83e96f779c046ac7a335678ea41e30e"},"schema_version":"1.0"},"canonical_sha256":"6e8e412ae1af9580ad40e848e656b6410f0b29bc94822fd0f40e1cbde89cb210","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:18.658645Z","signature_b64":"+mpYUNXhw0zffZJmgvljIRN1KXJTf7Dcg5knRYnbfurtn6h9OO8TvyBGbliqGE6UIMc12rQYxYmcE0l2S8i9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e8e412ae1af9580ad40e848e656b6410f0b29bc94822fd0f40e1cbde89cb210","last_reissued_at":"2026-05-18T01:20:18.658073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:18.658073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04976","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-18T01:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnIWePZHnBTzJVCHvZ3CldmV5z0fUF+XYF68auYwHZ08dRtB3UtVwfvnYe4A67dso4N/Oyq/BM9MXt4vLFkbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:32:26.945179Z"},"content_sha256":"bb7f5e1f0d93f0938bd047d1c9b0a5dfb41502aa0035f778da2920fe969ed5fd","schema_version":"1.0","event_id":"sha256:bb7f5e1f0d93f0938bd047d1c9b0a5dfb41502aa0035f778da2920fe969ed5fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:N2HECKXBV6KYBLKA5BEOMVVWIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Process Bandits: Upper Confidence Bounds Algorithms via Generic Chaining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Emile Contal, Nicolas Vayatis","submitted_at":"2016-02-16T10:48:28Z","abstract_excerpt":"The paper considers the problem of global optimization in the setup of stochastic process bandits. We introduce an UCB algorithm which builds a cascade of discretization trees based on generic chaining in order to render possible his operability over a continuous domain. The theoretical framework applies to functions under weak probabilistic smoothness assumptions and also extends significantly the spectrum of application of UCB strategies. Moreover generic regret bounds are derived which are then specialized to Gaussian processes indexed on infinite-dimensional spaces as well as to quadratic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04976","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-18T01:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4AhSWfr5oh/OWoe3TtM97dnss3uXsc21/En9YKSaaytsn79B6kQtNRuMfEIEsGTtlbj6RRYmo+jbfAIKrNeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:32:26.945543Z"},"content_sha256":"83ccf50451854d7c393c4e53cc24c359b545c58891ce9a5585c9ef718cce3cc0","schema_version":"1.0","event_id":"sha256:83ccf50451854d7c393c4e53cc24c359b545c58891ce9a5585c9ef718cce3cc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2HECKXBV6KYBLKA5BEOMVVWIE/bundle.json","state_url":"https://pith.science/pith/N2HECKXBV6KYBLKA5BEOMVVWIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2HECKXBV6KYBLKA5BEOMVVWIE/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-21T18:32:26Z","links":{"resolver":"https://pith.science/pith/N2HECKXBV6KYBLKA5BEOMVVWIE","bundle":"https://pith.science/pith/N2HECKXBV6KYBLKA5BEOMVVWIE/bundle.json","state":"https://pith.science/pith/N2HECKXBV6KYBLKA5BEOMVVWIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2HECKXBV6KYBLKA5BEOMVVWIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:N2HECKXBV6KYBLKA5BEOMVVWIE","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":"e905a67dbc7a22edf2135f6c640b0c11f83e96f779c046ac7a335678ea41e30e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-16T10:48:28Z","title_canon_sha256":"8a8319e806b211e3532d32580ccb16f8923416e9d03e7521c7f19e470b6e19ae"},"schema_version":"1.0","source":{"id":"1602.04976","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04976","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04976v1","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04976","created_at":"2026-05-18T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"N2HECKXBV6KY","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N2HECKXBV6KYBLKA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N2HECKXB","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:83ccf50451854d7c393c4e53cc24c359b545c58891ce9a5585c9ef718cce3cc0","target":"graph","created_at":"2026-05-18T01:20:18Z","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":"The paper considers the problem of global optimization in the setup of stochastic process bandits. We introduce an UCB algorithm which builds a cascade of discretization trees based on generic chaining in order to render possible his operability over a continuous domain. The theoretical framework applies to functions under weak probabilistic smoothness assumptions and also extends significantly the spectrum of application of UCB strategies. Moreover generic regret bounds are derived which are then specialized to Gaussian processes indexed on infinite-dimensional spaces as well as to quadratic ","authors_text":"Emile Contal, Nicolas Vayatis","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-16T10:48:28Z","title":"Stochastic Process Bandits: Upper Confidence Bounds Algorithms via Generic Chaining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04976","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:bb7f5e1f0d93f0938bd047d1c9b0a5dfb41502aa0035f778da2920fe969ed5fd","target":"record","created_at":"2026-05-18T01:20:18Z","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":"e905a67dbc7a22edf2135f6c640b0c11f83e96f779c046ac7a335678ea41e30e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-16T10:48:28Z","title_canon_sha256":"8a8319e806b211e3532d32580ccb16f8923416e9d03e7521c7f19e470b6e19ae"},"schema_version":"1.0","source":{"id":"1602.04976","kind":"arxiv","version":1}},"canonical_sha256":"6e8e412ae1af9580ad40e848e656b6410f0b29bc94822fd0f40e1cbde89cb210","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e8e412ae1af9580ad40e848e656b6410f0b29bc94822fd0f40e1cbde89cb210","first_computed_at":"2026-05-18T01:20:18.658073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:18.658073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mpYUNXhw0zffZJmgvljIRN1KXJTf7Dcg5knRYnbfurtn6h9OO8TvyBGbliqGE6UIMc12rQYxYmcE0l2S8i9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:18.658645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04976","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb7f5e1f0d93f0938bd047d1c9b0a5dfb41502aa0035f778da2920fe969ed5fd","sha256:83ccf50451854d7c393c4e53cc24c359b545c58891ce9a5585c9ef718cce3cc0"],"state_sha256":"2b4f23ef07e76c5d14911b8f9b3620b467dac92206e58fcb752e5096ade1b285"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3DybgPQimb9lhGWOFLFoC/lBCCV1XjZ6I1jqH8oFYqIpJt6iAqOLTJvyNuWSbphKSz2KNNb7fb7DYcXAbwvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:32:26.948072Z","bundle_sha256":"e3d29a6eb855a1540ab8ba71c0a29ad6063a059bc6552fec7183aaa6fe395ee3"}}