{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IAFI5QL3A2TD6TGGLEEN2ZCB53","short_pith_number":"pith:IAFI5QL3","canonical_record":{"source":{"id":"1706.00136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-01T00:41:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"af3c57427e4b493c1e2a4bdf679aba99a3782b2c6081b647230b673db17e51d8","abstract_canon_sha256":"c45eb297bcd2ce88232ee40793c28ca851d35c2e56e6b8a9398f16ec0988c5da"},"schema_version":"1.0"},"canonical_sha256":"400a8ec17b06a63f4cc65908dd6441eee351bdeaf514a5f0085fb2dce9ec42a3","source":{"kind":"arxiv","id":"1706.00136","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00136","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00136v3","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00136","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"IAFI5QL3A2TD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IAFI5QL3A2TD6TGG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IAFI5QL3","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IAFI5QL3A2TD6TGGLEEN2ZCB53","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-01T00:41:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"af3c57427e4b493c1e2a4bdf679aba99a3782b2c6081b647230b673db17e51d8","abstract_canon_sha256":"c45eb297bcd2ce88232ee40793c28ca851d35c2e56e6b8a9398f16ec0988c5da"},"schema_version":"1.0"},"canonical_sha256":"400a8ec17b06a63f4cc65908dd6441eee351bdeaf514a5f0085fb2dce9ec42a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:20.477035Z","signature_b64":"lLrZJf5h1lmoNebqZs1Q8taO66BRfHvtlOLAwBP4dIAeyKLtidBQ73iThn2jTb2AwhzL9gwwWugHO/zhB3P7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"400a8ec17b06a63f4cc65908dd6441eee351bdeaf514a5f0085fb2dce9ec42a3","last_reissued_at":"2026-05-18T00:32:20.476490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:20.476490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00136","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-18T00:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycpXMo2gb4W5Xs5eObd+kD5oxv2iz69EHJm2Hto/t03c/9QlFQcB0F85pqpxWE4GGXYaUJdTysBxhemIVvuPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:49:40.378563Z"},"content_sha256":"2b1b6cb4d18bdfb9b0971ce8f6e3d8618817bb2514b0819587d1e28195b11db6","schema_version":"1.0","event_id":"sha256:2b1b6cb4d18bdfb9b0971ce8f6e3d8618817bb2514b0819587d1e28195b11db6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IAFI5QL3A2TD6TGGLEEN2ZCB53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Generalized Linear Bandits: Online Computation and Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aniruddha Bhargava, Kwang-Sung Jun, Rebecca Willett, Robert Nowak","submitted_at":"2017-06-01T00:41:42Z","abstract_excerpt":"Generalized Linear Bandits (GLBs), a natural extension of the stochastic linear bandits, has been popular and successful in recent years. However, existing GLBs scale poorly with the number of rounds and the number of arms, limiting their utility in practice. This paper proposes new, scalable solutions to the GLB problem in two respects. First, unlike existing GLBs, whose per-time-step space and time complexity grow at least linearly with time $t$, we propose a new algorithm that performs online computations to enjoy a constant space and time complexity. At its heart is a novel Generalized Lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00136","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-18T00:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlr0gn2DM/W2fmtD835ua+KUr2H9Rgfn1NP+ZOsikfLna+8YLf+hPUASkOS4vg/L/Z7NMu3DsZve+l0j8BrbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:49:40.378903Z"},"content_sha256":"298c287fac614f5fd7373929ac3107124299ef8a549913ec183df611a1d3aec0","schema_version":"1.0","event_id":"sha256:298c287fac614f5fd7373929ac3107124299ef8a549913ec183df611a1d3aec0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAFI5QL3A2TD6TGGLEEN2ZCB53/bundle.json","state_url":"https://pith.science/pith/IAFI5QL3A2TD6TGGLEEN2ZCB53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAFI5QL3A2TD6TGGLEEN2ZCB53/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-24T06:49:40Z","links":{"resolver":"https://pith.science/pith/IAFI5QL3A2TD6TGGLEEN2ZCB53","bundle":"https://pith.science/pith/IAFI5QL3A2TD6TGGLEEN2ZCB53/bundle.json","state":"https://pith.science/pith/IAFI5QL3A2TD6TGGLEEN2ZCB53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAFI5QL3A2TD6TGGLEEN2ZCB53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IAFI5QL3A2TD6TGGLEEN2ZCB53","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":"c45eb297bcd2ce88232ee40793c28ca851d35c2e56e6b8a9398f16ec0988c5da","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-01T00:41:42Z","title_canon_sha256":"af3c57427e4b493c1e2a4bdf679aba99a3782b2c6081b647230b673db17e51d8"},"schema_version":"1.0","source":{"id":"1706.00136","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00136","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00136v3","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00136","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"IAFI5QL3A2TD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IAFI5QL3A2TD6TGG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IAFI5QL3","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:298c287fac614f5fd7373929ac3107124299ef8a549913ec183df611a1d3aec0","target":"graph","created_at":"2026-05-18T00:32:20Z","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":"Generalized Linear Bandits (GLBs), a natural extension of the stochastic linear bandits, has been popular and successful in recent years. However, existing GLBs scale poorly with the number of rounds and the number of arms, limiting their utility in practice. This paper proposes new, scalable solutions to the GLB problem in two respects. First, unlike existing GLBs, whose per-time-step space and time complexity grow at least linearly with time $t$, we propose a new algorithm that performs online computations to enjoy a constant space and time complexity. At its heart is a novel Generalized Lin","authors_text":"Aniruddha Bhargava, Kwang-Sung Jun, Rebecca Willett, Robert Nowak","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-01T00:41:42Z","title":"Scalable Generalized Linear Bandits: Online Computation and Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00136","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:2b1b6cb4d18bdfb9b0971ce8f6e3d8618817bb2514b0819587d1e28195b11db6","target":"record","created_at":"2026-05-18T00:32:20Z","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":"c45eb297bcd2ce88232ee40793c28ca851d35c2e56e6b8a9398f16ec0988c5da","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-01T00:41:42Z","title_canon_sha256":"af3c57427e4b493c1e2a4bdf679aba99a3782b2c6081b647230b673db17e51d8"},"schema_version":"1.0","source":{"id":"1706.00136","kind":"arxiv","version":3}},"canonical_sha256":"400a8ec17b06a63f4cc65908dd6441eee351bdeaf514a5f0085fb2dce9ec42a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"400a8ec17b06a63f4cc65908dd6441eee351bdeaf514a5f0085fb2dce9ec42a3","first_computed_at":"2026-05-18T00:32:20.476490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:20.476490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lLrZJf5h1lmoNebqZs1Q8taO66BRfHvtlOLAwBP4dIAeyKLtidBQ73iThn2jTb2AwhzL9gwwWugHO/zhB3P7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:20.477035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00136","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b1b6cb4d18bdfb9b0971ce8f6e3d8618817bb2514b0819587d1e28195b11db6","sha256:298c287fac614f5fd7373929ac3107124299ef8a549913ec183df611a1d3aec0"],"state_sha256":"c7642e53d136a208e05676c0bf2ed92eb11c404fc1039a047f5e4ce487fcbc73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hB1kQFub427KVJmgTw6oT/O2nyYyjstcKxjU7WH3x2jldwuIDMuF5VkkWtyJ89NlifwD4pdbcMd+nOjrdLEtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:49:40.380803Z","bundle_sha256":"e903852fb6f5019ec0413979d9046dd261d08fe287cfe29ce6eb72450fff35b6"}}