{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EQHOV2TVDZ65JNGCQ5V5SUAV25","short_pith_number":"pith:EQHOV2TV","canonical_record":{"source":{"id":"1903.09132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T17:45:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0d6eea55cc1b07e1b0522c491c1f90b26487c607acc1064db40e74831ee8d21c","abstract_canon_sha256":"3956fbf6d5617ed93fbfc0a896d96be2751cb6872ff3e6eed07373bf4ccfa385"},"schema_version":"1.0"},"canonical_sha256":"240eeaea751e7dd4b4c2876bd95015d7517f65f695604aaa2ff6f7f3852a6c6b","source":{"kind":"arxiv","id":"1903.09132","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09132","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09132v2","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09132","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"EQHOV2TVDZ65","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"EQHOV2TVDZ65JNGC","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"EQHOV2TV","created_at":"2026-07-05T06:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EQHOV2TVDZ65JNGCQ5V5SUAV25","target":"record","payload":{"canonical_record":{"source":{"id":"1903.09132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T17:45:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0d6eea55cc1b07e1b0522c491c1f90b26487c607acc1064db40e74831ee8d21c","abstract_canon_sha256":"3956fbf6d5617ed93fbfc0a896d96be2751cb6872ff3e6eed07373bf4ccfa385"},"schema_version":"1.0"},"canonical_sha256":"240eeaea751e7dd4b4c2876bd95015d7517f65f695604aaa2ff6f7f3852a6c6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:17.252705Z","signature_b64":"zc3c8IFoIa0bPFT4SlVcHh8ZB+Y69Ho6Nsg1yX7n8uVAZty9AyM08cn9A791tCPW0O6YTeE5JU26pCmUE89LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"240eeaea751e7dd4b4c2876bd95015d7517f65f695604aaa2ff6f7f3852a6c6b","last_reissued_at":"2026-07-05T06:29:17.252086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:17.252086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.09132","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-07-05T06:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bEl/iVJM/ZfRHZJacCxv5KjT9OeR0X3v8YrCqHlVnim4PkC0ZGN5YWQGIA2m3a9sUIHfnJMzdAZhaeJtizt7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:26:02.671647Z"},"content_sha256":"b0831d88c87db07fb943782f2d1e2d9b5e2c3c3f3e5bfc7126085c07e03c79d3","schema_version":"1.0","event_id":"sha256:b0831d88c87db07fb943782f2d1e2d9b5e2c3c3f3e5bfc7126085c07e03c79d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EQHOV2TVDZ65JNGCQ5V5SUAV25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perturbed-History Exploration in Stochastic Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Branislav Kveton, Craig Boutilier, Csaba Szepesvari, Mohammad Ghavamzadeh","submitted_at":"2019-03-21T17:45:11Z","abstract_excerpt":"We propose a new online algorithm for cumulative regret minimization in a stochastic linear bandit. The algorithm pulls the arm with the highest estimated reward in a linear model trained on its perturbed history. Therefore, we call it perturbed-history exploration in a linear bandit (LinPHE). The perturbed history is a mixture of observed rewards and randomly generated i.i.d. pseudo-rewards. We derive a $\\tilde{O}(d \\sqrt{n})$ gap-free bound on the $n$-round regret of LinPHE, where $d$ is the number of features. The key steps in our analysis are new concentration and anti-concentration bounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09132","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.09132/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5cOZv6sBb5RkEHjA/13AOXVBX7EJHN59t9TB4SQz1CrPbD80SOShvmiZzgVtH5iOwSrZvZjW2GY/ZaWcZrTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:26:02.672712Z"},"content_sha256":"8ea82d42e617739fb8282d08855f69310f8167821b72e34c787cda2bc7c83550","schema_version":"1.0","event_id":"sha256:8ea82d42e617739fb8282d08855f69310f8167821b72e34c787cda2bc7c83550"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQHOV2TVDZ65JNGCQ5V5SUAV25/bundle.json","state_url":"https://pith.science/pith/EQHOV2TVDZ65JNGCQ5V5SUAV25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQHOV2TVDZ65JNGCQ5V5SUAV25/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-08-17T20:26:02Z","links":{"resolver":"https://pith.science/pith/EQHOV2TVDZ65JNGCQ5V5SUAV25","bundle":"https://pith.science/pith/EQHOV2TVDZ65JNGCQ5V5SUAV25/bundle.json","state":"https://pith.science/pith/EQHOV2TVDZ65JNGCQ5V5SUAV25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQHOV2TVDZ65JNGCQ5V5SUAV25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EQHOV2TVDZ65JNGCQ5V5SUAV25","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":"3956fbf6d5617ed93fbfc0a896d96be2751cb6872ff3e6eed07373bf4ccfa385","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T17:45:11Z","title_canon_sha256":"0d6eea55cc1b07e1b0522c491c1f90b26487c607acc1064db40e74831ee8d21c"},"schema_version":"1.0","source":{"id":"1903.09132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09132","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09132v2","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09132","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"EQHOV2TVDZ65","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"EQHOV2TVDZ65JNGC","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"EQHOV2TV","created_at":"2026-07-05T06:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:8ea82d42e617739fb8282d08855f69310f8167821b72e34c787cda2bc7c83550","target":"graph","created_at":"2026-07-05T06:29:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.09132/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new online algorithm for cumulative regret minimization in a stochastic linear bandit. The algorithm pulls the arm with the highest estimated reward in a linear model trained on its perturbed history. Therefore, we call it perturbed-history exploration in a linear bandit (LinPHE). The perturbed history is a mixture of observed rewards and randomly generated i.i.d. pseudo-rewards. We derive a $\\tilde{O}(d \\sqrt{n})$ gap-free bound on the $n$-round regret of LinPHE, where $d$ is the number of features. The key steps in our analysis are new concentration and anti-concentration bounds","authors_text":"Branislav Kveton, Craig Boutilier, Csaba Szepesvari, Mohammad Ghavamzadeh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T17:45:11Z","title":"Perturbed-History Exploration in Stochastic Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09132","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:b0831d88c87db07fb943782f2d1e2d9b5e2c3c3f3e5bfc7126085c07e03c79d3","target":"record","created_at":"2026-07-05T06:29:17Z","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":"3956fbf6d5617ed93fbfc0a896d96be2751cb6872ff3e6eed07373bf4ccfa385","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T17:45:11Z","title_canon_sha256":"0d6eea55cc1b07e1b0522c491c1f90b26487c607acc1064db40e74831ee8d21c"},"schema_version":"1.0","source":{"id":"1903.09132","kind":"arxiv","version":2}},"canonical_sha256":"240eeaea751e7dd4b4c2876bd95015d7517f65f695604aaa2ff6f7f3852a6c6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"240eeaea751e7dd4b4c2876bd95015d7517f65f695604aaa2ff6f7f3852a6c6b","first_computed_at":"2026-07-05T06:29:17.252086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:29:17.252086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zc3c8IFoIa0bPFT4SlVcHh8ZB+Y69Ho6Nsg1yX7n8uVAZty9AyM08cn9A791tCPW0O6YTeE5JU26pCmUE89LBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:29:17.252705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0831d88c87db07fb943782f2d1e2d9b5e2c3c3f3e5bfc7126085c07e03c79d3","sha256:8ea82d42e617739fb8282d08855f69310f8167821b72e34c787cda2bc7c83550"],"state_sha256":"6659e199c7bb125f288c09f478d8adb6e4ef1d976412ffca70c942705e92f866"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFDPNQmkyxrfwH/hA5PAYsmHSXBMFvEswA5vsOKJq9dzsbpRn+djp1a4PK4gn28b6s7/8xOHvSyAB/j9tQCOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T20:26:02.680792Z","bundle_sha256":"0daa80615eb529ad1a707250ecbe0663fc0e53b45d224d534bf1e01be1e4457c"}}