{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K5OQC3FOGIKNVXCMKFQYATB3UN","short_pith_number":"pith:K5OQC3FO","schema_version":"1.0","canonical_sha256":"575d016cae3214dadc4c5161804c3ba35582b5ff9c191ac013fd1c6434af346d","source":{"kind":"arxiv","id":"1810.02567","version":2},"attestation_state":"computed","paper":{"title":"Online Learning to Rank with Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Csaba Szepesv\\'ari, Shuai Li, Tor Lattimore","submitted_at":"2018-10-05T08:39:00Z","abstract_excerpt":"We introduce a new model for online ranking in which the click probability factors into an examination and attractiveness function and the attractiveness function is a linear function of a feature vector and an unknown parameter. Only relatively mild assumptions are made on the examination function. A novel algorithm for this setup is analysed, showing that the dependence on the number of items is replaced by a dependence on the dimension, allowing the new algorithm to handle a large number of items. When reduced to the orthogonal case, the regret of the algorithm improves on the state-of-the-"},"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":"1810.02567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-05T08:39:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"924435b33602379908be95a9d75f35af60d2ce6ed2ba850ae139a19027bb369c","abstract_canon_sha256":"b2d9034aaa1d248daaa8254e0804f27d27ff512506adbcbc5b6f861289af9c3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:09.559151Z","signature_b64":"15Q2tP5PDkyLv6OU68Gg4zml+X2gLNVh5PR607YVTARbsd1lRIgE2Gf8BDhQgo/qrx3CjPye7/4Z7ykSNirWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"575d016cae3214dadc4c5161804c3ba35582b5ff9c191ac013fd1c6434af346d","last_reissued_at":"2026-05-17T23:45:09.558368Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:09.558368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning to Rank with Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Csaba Szepesv\\'ari, Shuai Li, Tor Lattimore","submitted_at":"2018-10-05T08:39:00Z","abstract_excerpt":"We introduce a new model for online ranking in which the click probability factors into an examination and attractiveness function and the attractiveness function is a linear function of a feature vector and an unknown parameter. Only relatively mild assumptions are made on the examination function. A novel algorithm for this setup is analysed, showing that the dependence on the number of items is replaced by a dependence on the dimension, allowing the new algorithm to handle a large number of items. When reduced to the orthogonal case, the regret of the algorithm improves on the state-of-the-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02567","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":"1810.02567","created_at":"2026-05-17T23:45:09.558499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02567v2","created_at":"2026-05-17T23:45:09.558499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02567","created_at":"2026-05-17T23:45:09.558499+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5OQC3FOGIKN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5OQC3FOGIKNVXCM","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5OQC3FO","created_at":"2026-05-18T12:32:33.847187+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/K5OQC3FOGIKNVXCMKFQYATB3UN","json":"https://pith.science/pith/K5OQC3FOGIKNVXCMKFQYATB3UN.json","graph_json":"https://pith.science/api/pith-number/K5OQC3FOGIKNVXCMKFQYATB3UN/graph.json","events_json":"https://pith.science/api/pith-number/K5OQC3FOGIKNVXCMKFQYATB3UN/events.json","paper":"https://pith.science/paper/K5OQC3FO"},"agent_actions":{"view_html":"https://pith.science/pith/K5OQC3FOGIKNVXCMKFQYATB3UN","download_json":"https://pith.science/pith/K5OQC3FOGIKNVXCMKFQYATB3UN.json","view_paper":"https://pith.science/paper/K5OQC3FO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02567&json=true","fetch_graph":"https://pith.science/api/pith-number/K5OQC3FOGIKNVXCMKFQYATB3UN/graph.json","fetch_events":"https://pith.science/api/pith-number/K5OQC3FOGIKNVXCMKFQYATB3UN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5OQC3FOGIKNVXCMKFQYATB3UN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5OQC3FOGIKNVXCMKFQYATB3UN/action/storage_attestation","attest_author":"https://pith.science/pith/K5OQC3FOGIKNVXCMKFQYATB3UN/action/author_attestation","sign_citation":"https://pith.science/pith/K5OQC3FOGIKNVXCMKFQYATB3UN/action/citation_signature","submit_replication":"https://pith.science/pith/K5OQC3FOGIKNVXCMKFQYATB3UN/action/replication_record"}},"created_at":"2026-05-17T23:45:09.558499+00:00","updated_at":"2026-05-17T23:45:09.558499+00:00"}