{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3K7TAPO4JLMFWY3TLJ7LA3ZLCT","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":"f5e272628dd6892fe45fd050c6c67c0f1cd110b693cb3216225ee2ed5f184021","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","title_canon_sha256":"e6fdc405df41af80cd77e20a6dcb76091aef5fb98ac05207ead2c204bb3e9728"},"schema_version":"1.0","source":{"id":"1806.02248","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02248","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02248v2","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02248","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"3K7TAPO4JLMF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3K7TAPO4JLMFWY3T","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3K7TAPO4","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:6d46a6b79adaab9c5efe9d0dc9048d9520a307f73f8deb166fad2745df826c0a","target":"graph","created_at":"2026-05-17T23:50:59Z","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":"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 ","authors_text":"Branislav Kveton, Csaba Szepesvari, Shuai Li, Tor Lattimore","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","title":"TopRank: A practical algorithm for online stochastic ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02248","kind":"arxiv","version":2},"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:8a2c61d4653fd867c0e7f24bf4aa587b28f9ba9e759da45db98483d2c43903de","target":"record","created_at":"2026-05-17T23:50:59Z","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":"f5e272628dd6892fe45fd050c6c67c0f1cd110b693cb3216225ee2ed5f184021","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","title_canon_sha256":"e6fdc405df41af80cd77e20a6dcb76091aef5fb98ac05207ead2c204bb3e9728"},"schema_version":"1.0","source":{"id":"1806.02248","kind":"arxiv","version":2}},"canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","first_computed_at":"2026-05-17T23:50:59.628826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:59.628826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1m4UrnYAGtND8UGA9PNic0FJVUUQ4raYSkU1am0aKtfBcYYjG6y7pEOakyUAXtcf6CbnjiZvWVNWxVEx2+YNCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:59.629653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02248","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a2c61d4653fd867c0e7f24bf4aa587b28f9ba9e759da45db98483d2c43903de","sha256:6d46a6b79adaab9c5efe9d0dc9048d9520a307f73f8deb166fad2745df826c0a"],"state_sha256":"0654dc256ef76a581fbd8e2a1f44a2d83e167b8bf29ba7ae0f47de103c48814e"}