{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EKNGLQJ3PE35O3PJPQ3C7OV5OM","short_pith_number":"pith:EKNGLQJ3","schema_version":"1.0","canonical_sha256":"229a65c13b7937d76de97c362fbabd731577f0bd7a2d11240e79c37b83cc4862","source":{"kind":"arxiv","id":"1703.06513","version":1},"attestation_state":"computed","paper":{"title":"Bernoulli Rank-$1$ Bandits for Click Feedback","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 Szepesv\\'ari, Sumeet Katariya, Zheng Wen","submitted_at":"2017-03-19T21:06:51Z","abstract_excerpt":"The probability that a user will click a search result depends both on its relevance and its position on the results page. The position based model explains this behavior by ascribing to every item an attraction probability, and to every position an examination probability. To be clicked, a result must be both attractive and examined. The probabilities of an item-position pair being clicked thus form the entries of a rank-$1$ matrix. We propose the learning problem of a Bernoulli rank-$1$ bandit where at each step, the learning agent chooses a pair of row and column arms, and receives the prod"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.06513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-19T21:06:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c375de0b8672a449a4223e8c73c0cd08188df54843b2ad04c75e2a4fb6a03e1b","abstract_canon_sha256":"2c27e542ce14feef16b3da7f39aab328e7330a6fbffca0c1059031c349abee19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:22.619047Z","signature_b64":"MZZPfozZUFgAMW6/m9TwPrG3+eFX+eAzQ5gfoJyBn3E5sYqwNO9cmI2JRHWwUAA7QnT1jZn4wlnJ0F4wYUscCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229a65c13b7937d76de97c362fbabd731577f0bd7a2d11240e79c37b83cc4862","last_reissued_at":"2026-05-18T00:48:22.618394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:22.618394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bernoulli Rank-$1$ Bandits for Click Feedback","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 Szepesv\\'ari, Sumeet Katariya, Zheng Wen","submitted_at":"2017-03-19T21:06:51Z","abstract_excerpt":"The probability that a user will click a search result depends both on its relevance and its position on the results page. The position based model explains this behavior by ascribing to every item an attraction probability, and to every position an examination probability. To be clicked, a result must be both attractive and examined. The probabilities of an item-position pair being clicked thus form the entries of a rank-$1$ matrix. We propose the learning problem of a Bernoulli rank-$1$ bandit where at each step, the learning agent chooses a pair of row and column arms, and receives the prod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06513","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.06513","created_at":"2026-05-18T00:48:22.618496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06513v1","created_at":"2026-05-18T00:48:22.618496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06513","created_at":"2026-05-18T00:48:22.618496+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKNGLQJ3PE35","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKNGLQJ3PE35O3PJ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKNGLQJ3","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM","json":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM.json","graph_json":"https://pith.science/api/pith-number/EKNGLQJ3PE35O3PJPQ3C7OV5OM/graph.json","events_json":"https://pith.science/api/pith-number/EKNGLQJ3PE35O3PJPQ3C7OV5OM/events.json","paper":"https://pith.science/paper/EKNGLQJ3"},"agent_actions":{"view_html":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM","download_json":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM.json","view_paper":"https://pith.science/paper/EKNGLQJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06513&json=true","fetch_graph":"https://pith.science/api/pith-number/EKNGLQJ3PE35O3PJPQ3C7OV5OM/graph.json","fetch_events":"https://pith.science/api/pith-number/EKNGLQJ3PE35O3PJPQ3C7OV5OM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM/action/storage_attestation","attest_author":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM/action/author_attestation","sign_citation":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM/action/citation_signature","submit_replication":"https://pith.science/pith/EKNGLQJ3PE35O3PJPQ3C7OV5OM/action/replication_record"}},"created_at":"2026-05-18T00:48:22.618496+00:00","updated_at":"2026-05-18T00:48:22.618496+00:00"}