{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3K7TAPO4JLMFWY3TLJ7LA3ZLCT","short_pith_number":"pith:3K7TAPO4","schema_version":"1.0","canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","source":{"kind":"arxiv","id":"1806.02248","version":2},"attestation_state":"computed","paper":{"title":"TopRank: A practical algorithm for online stochastic ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Branislav Kveton, Csaba Szepesvari, Shuai Li, Tor Lattimore","submitted_at":"2018-06-06T15:33:08Z","abstract_excerpt":"Online learning to rank is a sequential decision-making problem where in each round the learning agent chooses a list of items and receives feedback in the form of clicks from the user. Many sample-efficient algorithms have been proposed for this problem that assume a specific click model connecting rankings and user behavior. We propose a generalized click model that encompasses many existing models, including the position-based and cascade models. Our generalization motivates a novel online learning algorithm based on topological sort, which we call TopRank. TopRank is (a) more natural than "},"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":"1806.02248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e6fdc405df41af80cd77e20a6dcb76091aef5fb98ac05207ead2c204bb3e9728","abstract_canon_sha256":"f5e272628dd6892fe45fd050c6c67c0f1cd110b693cb3216225ee2ed5f184021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:59.629653Z","signature_b64":"1m4UrnYAGtND8UGA9PNic0FJVUUQ4raYSkU1am0aKtfBcYYjG6y7pEOakyUAXtcf6CbnjiZvWVNWxVEx2+YNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","last_reissued_at":"2026-05-17T23:50:59.628826Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:59.628826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TopRank: A practical algorithm for online stochastic ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Branislav Kveton, Csaba Szepesvari, Shuai Li, Tor Lattimore","submitted_at":"2018-06-06T15:33:08Z","abstract_excerpt":"Online learning to rank is a sequential decision-making problem where in each round the learning agent chooses a list of items and receives feedback in the form of clicks from the user. Many sample-efficient algorithms have been proposed for this problem that assume a specific click model connecting rankings and user behavior. We propose a generalized click model that encompasses many existing models, including the position-based and cascade models. Our generalization motivates a novel online learning algorithm based on topological sort, which we call TopRank. TopRank is (a) more natural than "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02248","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.02248","created_at":"2026-05-17T23:50:59.628951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02248v2","created_at":"2026-05-17T23:50:59.628951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02248","created_at":"2026-05-17T23:50:59.628951+00:00"},{"alias_kind":"pith_short_12","alias_value":"3K7TAPO4JLMF","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3K7TAPO4JLMFWY3T","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3K7TAPO4","created_at":"2026-05-18T12:32:02.567920+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/3K7TAPO4JLMFWY3TLJ7LA3ZLCT","json":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT.json","graph_json":"https://pith.science/api/pith-number/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/graph.json","events_json":"https://pith.science/api/pith-number/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/events.json","paper":"https://pith.science/paper/3K7TAPO4"},"agent_actions":{"view_html":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT","download_json":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT.json","view_paper":"https://pith.science/paper/3K7TAPO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02248&json=true","fetch_graph":"https://pith.science/api/pith-number/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/graph.json","fetch_events":"https://pith.science/api/pith-number/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/action/storage_attestation","attest_author":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/action/author_attestation","sign_citation":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/action/citation_signature","submit_replication":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/action/replication_record"}},"created_at":"2026-05-17T23:50:59.628951+00:00","updated_at":"2026-05-17T23:50:59.628951+00:00"}