{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J6FMIMROWYFUGOKLUPETOGT5JC","short_pith_number":"pith:J6FMIMRO","canonical_record":{"source":{"id":"1608.03023","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-10T01:51:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8ca9e89e78dc95691b2ecdf0e20933b495f8feb60322414e7c7b210220a3cce1","abstract_canon_sha256":"e6c63a928131737500229ec6b1d9d4fff82cdee6863abe9a91ac8847ae1a8cd7"},"schema_version":"1.0"},"canonical_sha256":"4f8ac4322eb60b43394ba3c9371a7d4887e17b34e60d43115a7b9a870313a92e","source":{"kind":"arxiv","id":"1608.03023","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03023","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03023v3","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03023","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"J6FMIMROWYFU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J6FMIMROWYFUGOKL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J6FMIMRO","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J6FMIMROWYFUGOKLUPETOGT5JC","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03023","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-10T01:51:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8ca9e89e78dc95691b2ecdf0e20933b495f8feb60322414e7c7b210220a3cce1","abstract_canon_sha256":"e6c63a928131737500229ec6b1d9d4fff82cdee6863abe9a91ac8847ae1a8cd7"},"schema_version":"1.0"},"canonical_sha256":"4f8ac4322eb60b43394ba3c9371a7d4887e17b34e60d43115a7b9a870313a92e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:06.643567Z","signature_b64":"YL7evKb7A1iuj/VobsVF1AF9gPJlphLvVuv8JhiPIJIVlh9EUhwVE1vHuJIvaPBk3ImvlxwYF4g0gflKKRreAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f8ac4322eb60b43394ba3c9371a7d4887e17b34e60d43115a7b9a870313a92e","last_reissued_at":"2026-05-18T00:49:06.643040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:06.643040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03023","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:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vU2Wxle6VTfJi1w6Y6O4T9zdmCt22C7ymjciWPDxcF4vKbjX2KLN2TiHlsfxTjpy3pX5HZwYztfgzjBEw3QpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:25.921990Z"},"content_sha256":"f036ddb72a57db147e1b90c89871cd934ad3b0d3fc3200e390d7242fedbc5b81","schema_version":"1.0","event_id":"sha256:f036ddb72a57db147e1b90c89871cd934ad3b0d3fc3200e390d7242fedbc5b81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J6FMIMROWYFUGOKLUPETOGT5JC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Rank-1 Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Branislav Kveton, Claire Vernade, Csaba Szepesvari, Sumeet Katariya, Zheng Wen","submitted_at":"2016-08-10T01:51:36Z","abstract_excerpt":"We propose stochastic rank-$1$ bandits, a class of online learning problems where at each step a learning agent chooses a pair of row and column arms, and receives the product of their values as a reward. The main challenge of the problem is that the individual values of the row and column are unobserved. We assume that these values are stochastic and drawn independently. We propose a computationally-efficient algorithm for solving our problem, which we call Rank1Elim. We derive a $O((K + L) (1 / \\Delta) \\log n)$ upper bound on its $n$-step regret, where $K$ is the number of rows, $L$ is the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03023","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:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbx7IYE9ava4BplB2r6Ae2QX0o20RfV+C7pgo35rMEkycOB8jzfK+pDU/+1ZumXKQ9F3S8OSoUA/pv5ROwOGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:25.922358Z"},"content_sha256":"9bb20e27d8c88b50a971fd46cd84b17f17aeb7c8311043a078e695ece5af3402","schema_version":"1.0","event_id":"sha256:9bb20e27d8c88b50a971fd46cd84b17f17aeb7c8311043a078e695ece5af3402"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6FMIMROWYFUGOKLUPETOGT5JC/bundle.json","state_url":"https://pith.science/pith/J6FMIMROWYFUGOKLUPETOGT5JC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6FMIMROWYFUGOKLUPETOGT5JC/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-27T19:19:25Z","links":{"resolver":"https://pith.science/pith/J6FMIMROWYFUGOKLUPETOGT5JC","bundle":"https://pith.science/pith/J6FMIMROWYFUGOKLUPETOGT5JC/bundle.json","state":"https://pith.science/pith/J6FMIMROWYFUGOKLUPETOGT5JC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6FMIMROWYFUGOKLUPETOGT5JC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J6FMIMROWYFUGOKLUPETOGT5JC","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":"e6c63a928131737500229ec6b1d9d4fff82cdee6863abe9a91ac8847ae1a8cd7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-10T01:51:36Z","title_canon_sha256":"8ca9e89e78dc95691b2ecdf0e20933b495f8feb60322414e7c7b210220a3cce1"},"schema_version":"1.0","source":{"id":"1608.03023","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03023","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03023v3","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03023","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"J6FMIMROWYFU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J6FMIMROWYFUGOKL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J6FMIMRO","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:9bb20e27d8c88b50a971fd46cd84b17f17aeb7c8311043a078e695ece5af3402","target":"graph","created_at":"2026-05-18T00:49:06Z","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":"We propose stochastic rank-$1$ bandits, a class of online learning problems where at each step a learning agent chooses a pair of row and column arms, and receives the product of their values as a reward. The main challenge of the problem is that the individual values of the row and column are unobserved. We assume that these values are stochastic and drawn independently. We propose a computationally-efficient algorithm for solving our problem, which we call Rank1Elim. We derive a $O((K + L) (1 / \\Delta) \\log n)$ upper bound on its $n$-step regret, where $K$ is the number of rows, $L$ is the n","authors_text":"Branislav Kveton, Claire Vernade, Csaba Szepesvari, Sumeet Katariya, Zheng Wen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-10T01:51:36Z","title":"Stochastic Rank-1 Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03023","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:f036ddb72a57db147e1b90c89871cd934ad3b0d3fc3200e390d7242fedbc5b81","target":"record","created_at":"2026-05-18T00:49:06Z","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":"e6c63a928131737500229ec6b1d9d4fff82cdee6863abe9a91ac8847ae1a8cd7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-10T01:51:36Z","title_canon_sha256":"8ca9e89e78dc95691b2ecdf0e20933b495f8feb60322414e7c7b210220a3cce1"},"schema_version":"1.0","source":{"id":"1608.03023","kind":"arxiv","version":3}},"canonical_sha256":"4f8ac4322eb60b43394ba3c9371a7d4887e17b34e60d43115a7b9a870313a92e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f8ac4322eb60b43394ba3c9371a7d4887e17b34e60d43115a7b9a870313a92e","first_computed_at":"2026-05-18T00:49:06.643040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:06.643040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YL7evKb7A1iuj/VobsVF1AF9gPJlphLvVuv8JhiPIJIVlh9EUhwVE1vHuJIvaPBk3ImvlxwYF4g0gflKKRreAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:06.643567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03023","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f036ddb72a57db147e1b90c89871cd934ad3b0d3fc3200e390d7242fedbc5b81","sha256:9bb20e27d8c88b50a971fd46cd84b17f17aeb7c8311043a078e695ece5af3402"],"state_sha256":"cdab733884fcf1a4242892a9212efb109e311c02ca43048a68cf9c323c47b571"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wL1OWQmj1ozVjG7iXqj4qoI/2XABidndgqyQRtfgageJ7sMGWICQfdOaXL5hVz7XvtMXyiVjGB0A6zEciQISCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:19:25.924889Z","bundle_sha256":"a043a1d0f0881a0d4bc58812de2dc96f17b35666c9687bbd49b981f138ad1f2a"}}