{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JLKJCECLYYJ7TN3XPD36RYJ7KW","short_pith_number":"pith:JLKJCECL","canonical_record":{"source":{"id":"1906.08947","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-21T04:57:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"795c70bb9981eae967f6c8ffe40894ffacb6fba36125b8c64c4138ade55e6f7e","abstract_canon_sha256":"e6adbb8532a9af922a907fdad0561d58abd9c48a134d771fe8d7c395bc1f1e8c"},"schema_version":"1.0"},"canonical_sha256":"4ad491104bc613f9b77778f7e8e13f55a1e187f5039b9b9aaff3f2764ceec975","source":{"kind":"arxiv","id":"1906.08947","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08947","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08947v3","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08947","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"JLKJCECLYYJ7","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"JLKJCECLYYJ7TN3X","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"JLKJCECL","created_at":"2026-07-05T06:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JLKJCECLYYJ7TN3XPD36RYJ7KW","target":"record","payload":{"canonical_record":{"source":{"id":"1906.08947","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-21T04:57:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"795c70bb9981eae967f6c8ffe40894ffacb6fba36125b8c64c4138ade55e6f7e","abstract_canon_sha256":"e6adbb8532a9af922a907fdad0561d58abd9c48a134d771fe8d7c395bc1f1e8c"},"schema_version":"1.0"},"canonical_sha256":"4ad491104bc613f9b77778f7e8e13f55a1e187f5039b9b9aaff3f2764ceec975","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:17.289680Z","signature_b64":"Nj1A846gph59tYbyc0PKhXE06pwxisxwHFtZ7gUMD96MRsqiEH3ru0dprY9MUskTkni61clxYeqPKXqsenuxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ad491104bc613f9b77778f7e8e13f55a1e187f5039b9b9aaff3f2764ceec975","last_reissued_at":"2026-07-05T06:29:17.289197Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:17.289197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.08947","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-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":"NOOMrKXLuK+fpL/rCXDCDlEg44wmMb3zTTuqpZ+I+9tOMjlrBv9WFUULFItAyosWLR2Oxq6AkFwae7+0+lBeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:22:45.598178Z"},"content_sha256":"83980f35e5567c8ac2e3ff995f2ad745228ecba20e9c1147d8bffd344dc61af3","schema_version":"1.0","event_id":"sha256:83980f35e5567c8ac2e3ff995f2ad745228ecba20e9c1147d8bffd344dc61af3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JLKJCECLYYJ7TN3XPD36RYJ7KW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Exploration in Generalized 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, Lihong Li, Manzil Zaheer, Mohammad Ghavamzadeh","submitted_at":"2019-06-21T04:57:54Z","abstract_excerpt":"We study two randomized algorithms for generalized linear bandits. The first, GLM-TSL, samples a generalized linear model (GLM) from the Laplace approximation to the posterior distribution. The second, GLM-FPL, fits a GLM to a randomly perturbed history of past rewards. We analyze both algorithms and derive $\\tilde{O}(d \\sqrt{n \\log K})$ upper bounds on their $n$-round regret, where $d$ is the number of features and $K$ is the number of arms. The former improves on prior work while the latter is the first for Gaussian noise perturbations in non-linear models. We empirically evaluate both GLM-T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08947","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.08947/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":"WiR1GJ5y0x5zJHIhtgbrQ6vG1hjpuJHVl3Q0sxAfyPLkXtT7ucYiJc7x89Zj7mF3d/Gm33U1cKKRSJlHHjdODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:22:45.599762Z"},"content_sha256":"ab0e25e1575b340ed702d2bc205809b3d5e56930c9aa4133280606c33ff1ae9f","schema_version":"1.0","event_id":"sha256:ab0e25e1575b340ed702d2bc205809b3d5e56930c9aa4133280606c33ff1ae9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLKJCECLYYJ7TN3XPD36RYJ7KW/bundle.json","state_url":"https://pith.science/pith/JLKJCECLYYJ7TN3XPD36RYJ7KW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLKJCECLYYJ7TN3XPD36RYJ7KW/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-04T20:22:45Z","links":{"resolver":"https://pith.science/pith/JLKJCECLYYJ7TN3XPD36RYJ7KW","bundle":"https://pith.science/pith/JLKJCECLYYJ7TN3XPD36RYJ7KW/bundle.json","state":"https://pith.science/pith/JLKJCECLYYJ7TN3XPD36RYJ7KW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLKJCECLYYJ7TN3XPD36RYJ7KW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JLKJCECLYYJ7TN3XPD36RYJ7KW","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":"e6adbb8532a9af922a907fdad0561d58abd9c48a134d771fe8d7c395bc1f1e8c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-21T04:57:54Z","title_canon_sha256":"795c70bb9981eae967f6c8ffe40894ffacb6fba36125b8c64c4138ade55e6f7e"},"schema_version":"1.0","source":{"id":"1906.08947","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08947","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08947v3","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08947","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"JLKJCECLYYJ7","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"JLKJCECLYYJ7TN3X","created_at":"2026-07-05T06:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"JLKJCECL","created_at":"2026-07-05T06:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:ab0e25e1575b340ed702d2bc205809b3d5e56930c9aa4133280606c33ff1ae9f","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/1906.08947/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study two randomized algorithms for generalized linear bandits. The first, GLM-TSL, samples a generalized linear model (GLM) from the Laplace approximation to the posterior distribution. The second, GLM-FPL, fits a GLM to a randomly perturbed history of past rewards. We analyze both algorithms and derive $\\tilde{O}(d \\sqrt{n \\log K})$ upper bounds on their $n$-round regret, where $d$ is the number of features and $K$ is the number of arms. The former improves on prior work while the latter is the first for Gaussian noise perturbations in non-linear models. We empirically evaluate both GLM-T","authors_text":"Branislav Kveton, Craig Boutilier, Csaba Szepesvari, Lihong Li, Manzil Zaheer, Mohammad Ghavamzadeh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-21T04:57:54Z","title":"Randomized Exploration in Generalized Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08947","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:83980f35e5567c8ac2e3ff995f2ad745228ecba20e9c1147d8bffd344dc61af3","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":"e6adbb8532a9af922a907fdad0561d58abd9c48a134d771fe8d7c395bc1f1e8c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-21T04:57:54Z","title_canon_sha256":"795c70bb9981eae967f6c8ffe40894ffacb6fba36125b8c64c4138ade55e6f7e"},"schema_version":"1.0","source":{"id":"1906.08947","kind":"arxiv","version":3}},"canonical_sha256":"4ad491104bc613f9b77778f7e8e13f55a1e187f5039b9b9aaff3f2764ceec975","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ad491104bc613f9b77778f7e8e13f55a1e187f5039b9b9aaff3f2764ceec975","first_computed_at":"2026-07-05T06:29:17.289197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:29:17.289197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nj1A846gph59tYbyc0PKhXE06pwxisxwHFtZ7gUMD96MRsqiEH3ru0dprY9MUskTkni61clxYeqPKXqsenuxAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:29:17.289680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08947","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83980f35e5567c8ac2e3ff995f2ad745228ecba20e9c1147d8bffd344dc61af3","sha256:ab0e25e1575b340ed702d2bc205809b3d5e56930c9aa4133280606c33ff1ae9f"],"state_sha256":"2e04279b447d840afa083e9d843083668c9843c91a42d12b23ef992dde772cbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5E9G+qdoexCwVWyt5f+Dvs5EoROfzvGmxD+MmhDTcs2sgrJ7YUG9JyEABnIjyGGVED5RSgCuqyHFjZfRhNjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T20:22:45.623107Z","bundle_sha256":"fd1ed8606108dcf788f1a5cd45eafa4feaf30a758b0097f89ff8f1071399602f"}}