{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CM3MHIUAGLJHFRVG6A5VZKT7BZ","short_pith_number":"pith:CM3MHIUA","canonical_record":{"source":{"id":"1712.04644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T07:59:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d29a6662d2d7ceba84283f9af08b7cccb6d11ff2e0d0944fac126fc594fe09bc","abstract_canon_sha256":"406ff0b91f4ed64832cfcbe5b5f87cbe71fd0b64a3155e8aab99d020930a2a89"},"schema_version":"1.0"},"canonical_sha256":"1336c3a28032d272c6a6f03b5caa7f0e610a603080c13605ce90d50ade4804ec","source":{"kind":"arxiv","id":"1712.04644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04644","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04644v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04644","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"CM3MHIUAGLJH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CM3MHIUAGLJHFRVG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CM3MHIUA","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CM3MHIUAGLJHFRVG6A5VZKT7BZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T07:59:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d29a6662d2d7ceba84283f9af08b7cccb6d11ff2e0d0944fac126fc594fe09bc","abstract_canon_sha256":"406ff0b91f4ed64832cfcbe5b5f87cbe71fd0b64a3155e8aab99d020930a2a89"},"schema_version":"1.0"},"canonical_sha256":"1336c3a28032d272c6a6f03b5caa7f0e610a603080c13605ce90d50ade4804ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.925819Z","signature_b64":"TtjvRxb5GuvSoQYR39WBAn2gtC38A8/bMFbwYcsTyoRsUDGz7GfXoisDIbSsGOmx4xl3QIBK6z/hd10ZnxnhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1336c3a28032d272c6a6f03b5caa7f0e610a603080c13605ce90d50ade4804ec","last_reissued_at":"2026-05-18T00:28:03.925093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.925093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04644","source_version":1,"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:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THWwoKvbBaL8ZUOLsKyeCykcIGdiRKJr3ZCn9zOjtWs5kQlKIdKJWr0TYwQVA+eRroKKyNr/+oiy3Owwv+zADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:59:38.009213Z"},"content_sha256":"9efe5d8c29926870c1327351e5bc205f48ac295695e91decc61eb13099f3bfd1","schema_version":"1.0","event_id":"sha256:9efe5d8c29926870c1327351e5bc205f48ac295695e91decc61eb13099f3bfd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CM3MHIUAGLJHFRVG6A5VZKT7BZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Low-Rank Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anup Rao, Branislav Kveton, Csaba Szepesvari, S. Muthukrishnan, Yasin Abbasi-Yadkori, Zheng Wen","submitted_at":"2017-12-13T07:59:48Z","abstract_excerpt":"Many problems in computer vision and recommender systems involve low-rank matrices. In this work, we study the problem of finding the maximum entry of a stochastic low-rank matrix from sequential observations. At each step, a learning agent chooses pairs of row and column arms, and receives the noisy product of their latent values as a reward. The main challenge is that the latent values are unobserved. We identify a class of non-negative matrices whose maximum entry can be found statistically efficiently and propose an algorithm for finding them, which we call LowRankElim. We derive a $\\Decla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04644","kind":"arxiv","version":1},"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:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFR1QYxCHxAqyg2HhWweM7bSnc3Hns4mgcw1G5LTR+eqXIkj5/JFVdmWzbbhoCr5DseTJgC/iWeLKnU+ww7NBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:59:38.009571Z"},"content_sha256":"fa9f2ea4dfd3441721fff82e10e77bb6a29d97ce010c9a15583f7afb0aac5f1a","schema_version":"1.0","event_id":"sha256:fa9f2ea4dfd3441721fff82e10e77bb6a29d97ce010c9a15583f7afb0aac5f1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CM3MHIUAGLJHFRVG6A5VZKT7BZ/bundle.json","state_url":"https://pith.science/pith/CM3MHIUAGLJHFRVG6A5VZKT7BZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CM3MHIUAGLJHFRVG6A5VZKT7BZ/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-28T14:59:38Z","links":{"resolver":"https://pith.science/pith/CM3MHIUAGLJHFRVG6A5VZKT7BZ","bundle":"https://pith.science/pith/CM3MHIUAGLJHFRVG6A5VZKT7BZ/bundle.json","state":"https://pith.science/pith/CM3MHIUAGLJHFRVG6A5VZKT7BZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CM3MHIUAGLJHFRVG6A5VZKT7BZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CM3MHIUAGLJHFRVG6A5VZKT7BZ","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":"406ff0b91f4ed64832cfcbe5b5f87cbe71fd0b64a3155e8aab99d020930a2a89","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T07:59:48Z","title_canon_sha256":"d29a6662d2d7ceba84283f9af08b7cccb6d11ff2e0d0944fac126fc594fe09bc"},"schema_version":"1.0","source":{"id":"1712.04644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04644","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04644v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04644","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"CM3MHIUAGLJH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CM3MHIUAGLJHFRVG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CM3MHIUA","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:fa9f2ea4dfd3441721fff82e10e77bb6a29d97ce010c9a15583f7afb0aac5f1a","target":"graph","created_at":"2026-05-18T00:28:03Z","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":"Many problems in computer vision and recommender systems involve low-rank matrices. In this work, we study the problem of finding the maximum entry of a stochastic low-rank matrix from sequential observations. At each step, a learning agent chooses pairs of row and column arms, and receives the noisy product of their latent values as a reward. The main challenge is that the latent values are unobserved. We identify a class of non-negative matrices whose maximum entry can be found statistically efficiently and propose an algorithm for finding them, which we call LowRankElim. We derive a $\\Decla","authors_text":"Anup Rao, Branislav Kveton, Csaba Szepesvari, S. Muthukrishnan, Yasin Abbasi-Yadkori, Zheng Wen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T07:59:48Z","title":"Stochastic Low-Rank Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04644","kind":"arxiv","version":1},"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:9efe5d8c29926870c1327351e5bc205f48ac295695e91decc61eb13099f3bfd1","target":"record","created_at":"2026-05-18T00:28:03Z","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":"406ff0b91f4ed64832cfcbe5b5f87cbe71fd0b64a3155e8aab99d020930a2a89","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T07:59:48Z","title_canon_sha256":"d29a6662d2d7ceba84283f9af08b7cccb6d11ff2e0d0944fac126fc594fe09bc"},"schema_version":"1.0","source":{"id":"1712.04644","kind":"arxiv","version":1}},"canonical_sha256":"1336c3a28032d272c6a6f03b5caa7f0e610a603080c13605ce90d50ade4804ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1336c3a28032d272c6a6f03b5caa7f0e610a603080c13605ce90d50ade4804ec","first_computed_at":"2026-05-18T00:28:03.925093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:03.925093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TtjvRxb5GuvSoQYR39WBAn2gtC38A8/bMFbwYcsTyoRsUDGz7GfXoisDIbSsGOmx4xl3QIBK6z/hd10ZnxnhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:03.925819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9efe5d8c29926870c1327351e5bc205f48ac295695e91decc61eb13099f3bfd1","sha256:fa9f2ea4dfd3441721fff82e10e77bb6a29d97ce010c9a15583f7afb0aac5f1a"],"state_sha256":"2e21695601f51bcaf50ab0dae0a0532b77e2a988f85b1f12459a9f46b7c8cad0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1YS8FxV1Zgs3cgneXa+JPk02WrNKfF8NvEP+x1s2PGqfpBQ352DOyNrNB0Lv2G0ukbgp9efsVATbXp4BNxsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:59:38.011578Z","bundle_sha256":"43b69c20f91447f72556ed2a2ceb3da2a024ee1c1fa2d784b2fae502b3fac813"}}