{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PC7WGLTFECPHGSWMNWKBR7QSFP","short_pith_number":"pith:PC7WGLTF","canonical_record":{"source":{"id":"1703.00048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T20:39:44Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"5a6a0d37be5b4971bcb3fe239833eab279fc987a74dd78a9e85e85c24fe09df2","abstract_canon_sha256":"618f8f5c26a0a760802a6776728b8ef31190b34b42bc59b188a09030348ad267"},"schema_version":"1.0"},"canonical_sha256":"78bf632e65209e734acc6d9418fe122bf689835c99c4b3f0b717780ca5bc8088","source":{"kind":"arxiv","id":"1703.00048","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00048","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00048v2","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00048","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"PC7WGLTFECPH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PC7WGLTFECPHGSWM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PC7WGLTF","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PC7WGLTFECPHGSWMNWKBR7QSFP","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T20:39:44Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"5a6a0d37be5b4971bcb3fe239833eab279fc987a74dd78a9e85e85c24fe09df2","abstract_canon_sha256":"618f8f5c26a0a760802a6776728b8ef31190b34b42bc59b188a09030348ad267"},"schema_version":"1.0"},"canonical_sha256":"78bf632e65209e734acc6d9418fe122bf689835c99c4b3f0b717780ca5bc8088","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:12.337332Z","signature_b64":"w9AoDnpSuE3LRFLBmWGSmwQc02L1BO9Lww5p9VduElAfpPmrSCooR5Qy4Bt8aRDupyzL8EyGdGIYefUutXJNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78bf632e65209e734acc6d9418fe122bf689835c99c4b3f0b717780ca5bc8088","last_reissued_at":"2026-05-18T00:42:12.336850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:12.336850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00048","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-05-18T00:42:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IEd22znMvCLLUtTly5gSEjgty8og54UzW0HS1jmyedowQBLF1RQrf0zQGOPxExlFFFaV+bJJaOneksXeJN4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:46:02.726820Z"},"content_sha256":"bcd891ce048148bfea052017bb173297c0e1e6e7f615914cc02f16cba9568a3b","schema_version":"1.0","event_id":"sha256:bcd891ce048148bfea052017bb173297c0e1e6e7f615914cc02f16cba9568a3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PC7WGLTFECPHGSWMNWKBR7QSFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provably Optimal Algorithms for Generalized Linear Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dengyong Zhou, Lihong Li, Yu Lu","submitted_at":"2017-02-28T20:39:44Z","abstract_excerpt":"Contextual bandits are widely used in Internet services from news recommendation to advertising, and to Web search. Generalized linear models (logistical regression in particular) have demonstrated stronger performance than linear models in many applications where rewards are binary. However, most theoretical analyses on contextual bandits so far are on linear bandits. In this work, we propose an upper confidence bound based algorithm for generalized linear contextual bandits, which achieves an $\\tilde{O}(\\sqrt{dT})$ regret over $T$ rounds with $d$ dimensional feature vectors. This regret matc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00048","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":""},"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-18T00:42:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BuSMdEopZMzxpWGAIEGnmo0XCs4+WGcU+EtviQJyfnvW+6jkOafUId2O+70UmNQoLjOIOzNHG3rQ6qFe7mljAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:46:02.727601Z"},"content_sha256":"be62395f4b053da971b20f5906ddf2e8fda0f8ff64fe76c23023716b470f3ce0","schema_version":"1.0","event_id":"sha256:be62395f4b053da971b20f5906ddf2e8fda0f8ff64fe76c23023716b470f3ce0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PC7WGLTFECPHGSWMNWKBR7QSFP/bundle.json","state_url":"https://pith.science/pith/PC7WGLTFECPHGSWMNWKBR7QSFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PC7WGLTFECPHGSWMNWKBR7QSFP/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-09T23:46:02Z","links":{"resolver":"https://pith.science/pith/PC7WGLTFECPHGSWMNWKBR7QSFP","bundle":"https://pith.science/pith/PC7WGLTFECPHGSWMNWKBR7QSFP/bundle.json","state":"https://pith.science/pith/PC7WGLTFECPHGSWMNWKBR7QSFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PC7WGLTFECPHGSWMNWKBR7QSFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PC7WGLTFECPHGSWMNWKBR7QSFP","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":"618f8f5c26a0a760802a6776728b8ef31190b34b42bc59b188a09030348ad267","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T20:39:44Z","title_canon_sha256":"5a6a0d37be5b4971bcb3fe239833eab279fc987a74dd78a9e85e85c24fe09df2"},"schema_version":"1.0","source":{"id":"1703.00048","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00048","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00048v2","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00048","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"PC7WGLTFECPH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PC7WGLTFECPHGSWM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PC7WGLTF","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:be62395f4b053da971b20f5906ddf2e8fda0f8ff64fe76c23023716b470f3ce0","target":"graph","created_at":"2026-05-18T00:42:12Z","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":"Contextual bandits are widely used in Internet services from news recommendation to advertising, and to Web search. Generalized linear models (logistical regression in particular) have demonstrated stronger performance than linear models in many applications where rewards are binary. However, most theoretical analyses on contextual bandits so far are on linear bandits. In this work, we propose an upper confidence bound based algorithm for generalized linear contextual bandits, which achieves an $\\tilde{O}(\\sqrt{dT})$ regret over $T$ rounds with $d$ dimensional feature vectors. This regret matc","authors_text":"Dengyong Zhou, Lihong Li, Yu Lu","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T20:39:44Z","title":"Provably Optimal Algorithms for Generalized Linear Contextual Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00048","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:bcd891ce048148bfea052017bb173297c0e1e6e7f615914cc02f16cba9568a3b","target":"record","created_at":"2026-05-18T00:42:12Z","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":"618f8f5c26a0a760802a6776728b8ef31190b34b42bc59b188a09030348ad267","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T20:39:44Z","title_canon_sha256":"5a6a0d37be5b4971bcb3fe239833eab279fc987a74dd78a9e85e85c24fe09df2"},"schema_version":"1.0","source":{"id":"1703.00048","kind":"arxiv","version":2}},"canonical_sha256":"78bf632e65209e734acc6d9418fe122bf689835c99c4b3f0b717780ca5bc8088","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78bf632e65209e734acc6d9418fe122bf689835c99c4b3f0b717780ca5bc8088","first_computed_at":"2026-05-18T00:42:12.336850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:12.336850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w9AoDnpSuE3LRFLBmWGSmwQc02L1BO9Lww5p9VduElAfpPmrSCooR5Qy4Bt8aRDupyzL8EyGdGIYefUutXJNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:12.337332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00048","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcd891ce048148bfea052017bb173297c0e1e6e7f615914cc02f16cba9568a3b","sha256:be62395f4b053da971b20f5906ddf2e8fda0f8ff64fe76c23023716b470f3ce0"],"state_sha256":"f7096e1030f0a7b6b85c0ed8b54ca7f604e4237d56f72313e4504c0a290700b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/sTgQuOKhV570mVsAce0nEBcxzF+jjcNAYQiU2lQ6lZgs9y3rLhRP7xVOg7JFuWTeFerb5wDsDhEiaJKmMQqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:46:02.731426Z","bundle_sha256":"c3f6dcd983a28ce8bc0f21ecc84f3ba0ad5a34558e594d3a6a4ffb44e04d083a"}}