{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4DOW4OUNRQ4SZAPC2HMQNM2T2Z","short_pith_number":"pith:4DOW4OUN","canonical_record":{"source":{"id":"1703.02527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T18:53:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"248ab59b9d68a81265f50d5ca924a31aa8d8471b72d7d9a5ddde5c34c4d499ff","abstract_canon_sha256":"886d29f1faab20ebba4aec73378c82c5d0b3b4b9e03f79c0ffe51a04bf82b8b1"},"schema_version":"1.0"},"canonical_sha256":"e0dd6e3a8d8c392c81e2d1d906b353d656e72260964b4dc5874b58b9f2b13667","source":{"kind":"arxiv","id":"1703.02527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02527","created_at":"2026-05-18T00:42:06Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02527v2","created_at":"2026-05-18T00:42:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02527","created_at":"2026-05-18T00:42:06Z"},{"alias_kind":"pith_short_12","alias_value":"4DOW4OUNRQ4S","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4DOW4OUNRQ4SZAPC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4DOW4OUN","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4DOW4OUNRQ4SZAPC2HMQNM2T2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T18:53:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"248ab59b9d68a81265f50d5ca924a31aa8d8471b72d7d9a5ddde5c34c4d499ff","abstract_canon_sha256":"886d29f1faab20ebba4aec73378c82c5d0b3b4b9e03f79c0ffe51a04bf82b8b1"},"schema_version":"1.0"},"canonical_sha256":"e0dd6e3a8d8c392c81e2d1d906b353d656e72260964b4dc5874b58b9f2b13667","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:06.985061Z","signature_b64":"ftuQUpSFMG8lAOCOYyoyOeMHXeQGuBdN/C2V2u/9mFCIf+GLNfaQKtAR2PQ/ukrdnH4ygXNw7G7b//DResh4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0dd6e3a8d8c392c81e2d1d906b353d656e72260964b4dc5874b58b9f2b13667","last_reissued_at":"2026-05-18T00:42:06.984342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:06.984342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02527","source_version":2,"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:42:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYfTDIV8ObHrOVeXnap7GhCElzwyZ5H5MbGOA/J+ELCGrWDZGhXoafrC4hxCA8nYOeWTw98Tmavc9rGLjk2sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:20:00.907092Z"},"content_sha256":"aed70cdd210ff754f382177a261afcd1ccf31265401c8f5134d26e04eacb7672","schema_version":"1.0","event_id":"sha256:aed70cdd210ff754f382177a261afcd1ccf31265401c8f5134d26e04eacb7672"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4DOW4OUNRQ4SZAPC2HMQNM2T2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Learning to Rank in Stochastic Click Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Branislav Kveton, Csaba Szepesvari, Masrour Zoghi, Mohammad Ghavamzadeh, Tomas Tunys, Zheng Wen","submitted_at":"2017-03-07T18:53:58Z","abstract_excerpt":"Online learning to rank is a core problem in information retrieval and machine learning. Many provably efficient algorithms have been recently proposed for this problem in specific click models. The click model is a model of how the user interacts with a list of documents. Though these results are significant, their impact on practice is limited, because all proposed algorithms are designed for specific click models and lack convergence guarantees in other models. In this work, we propose BatchRank, the first online learning to rank algorithm for a broad class of click models. The class encomp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02527","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"},"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:42:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAFKdhNsvIeuI88+Rjp6FnNNMeR6DyB4AkLkyr4ci9uwV6q070ic613ZdM8XQz5aHC8y8TaS13P8oUAWZa3dAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:20:00.907464Z"},"content_sha256":"6f9b703bc9f624b80bedefd11d66a7596fdb33507ca4f10de93792e898de2916","schema_version":"1.0","event_id":"sha256:6f9b703bc9f624b80bedefd11d66a7596fdb33507ca4f10de93792e898de2916"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DOW4OUNRQ4SZAPC2HMQNM2T2Z/bundle.json","state_url":"https://pith.science/pith/4DOW4OUNRQ4SZAPC2HMQNM2T2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DOW4OUNRQ4SZAPC2HMQNM2T2Z/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-03T19:20:00Z","links":{"resolver":"https://pith.science/pith/4DOW4OUNRQ4SZAPC2HMQNM2T2Z","bundle":"https://pith.science/pith/4DOW4OUNRQ4SZAPC2HMQNM2T2Z/bundle.json","state":"https://pith.science/pith/4DOW4OUNRQ4SZAPC2HMQNM2T2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DOW4OUNRQ4SZAPC2HMQNM2T2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4DOW4OUNRQ4SZAPC2HMQNM2T2Z","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":"886d29f1faab20ebba4aec73378c82c5d0b3b4b9e03f79c0ffe51a04bf82b8b1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T18:53:58Z","title_canon_sha256":"248ab59b9d68a81265f50d5ca924a31aa8d8471b72d7d9a5ddde5c34c4d499ff"},"schema_version":"1.0","source":{"id":"1703.02527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02527","created_at":"2026-05-18T00:42:06Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02527v2","created_at":"2026-05-18T00:42:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02527","created_at":"2026-05-18T00:42:06Z"},{"alias_kind":"pith_short_12","alias_value":"4DOW4OUNRQ4S","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4DOW4OUNRQ4SZAPC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4DOW4OUN","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:6f9b703bc9f624b80bedefd11d66a7596fdb33507ca4f10de93792e898de2916","target":"graph","created_at":"2026-05-18T00:42:06Z","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 core problem in information retrieval and machine learning. Many provably efficient algorithms have been recently proposed for this problem in specific click models. The click model is a model of how the user interacts with a list of documents. Though these results are significant, their impact on practice is limited, because all proposed algorithms are designed for specific click models and lack convergence guarantees in other models. In this work, we propose BatchRank, the first online learning to rank algorithm for a broad class of click models. The class encomp","authors_text":"Branislav Kveton, Csaba Szepesvari, Masrour Zoghi, Mohammad Ghavamzadeh, Tomas Tunys, Zheng Wen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T18:53:58Z","title":"Online Learning to Rank in Stochastic Click Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02527","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:aed70cdd210ff754f382177a261afcd1ccf31265401c8f5134d26e04eacb7672","target":"record","created_at":"2026-05-18T00:42:06Z","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":"886d29f1faab20ebba4aec73378c82c5d0b3b4b9e03f79c0ffe51a04bf82b8b1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T18:53:58Z","title_canon_sha256":"248ab59b9d68a81265f50d5ca924a31aa8d8471b72d7d9a5ddde5c34c4d499ff"},"schema_version":"1.0","source":{"id":"1703.02527","kind":"arxiv","version":2}},"canonical_sha256":"e0dd6e3a8d8c392c81e2d1d906b353d656e72260964b4dc5874b58b9f2b13667","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0dd6e3a8d8c392c81e2d1d906b353d656e72260964b4dc5874b58b9f2b13667","first_computed_at":"2026-05-18T00:42:06.984342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:06.984342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ftuQUpSFMG8lAOCOYyoyOeMHXeQGuBdN/C2V2u/9mFCIf+GLNfaQKtAR2PQ/ukrdnH4ygXNw7G7b//DResh4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:06.985061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aed70cdd210ff754f382177a261afcd1ccf31265401c8f5134d26e04eacb7672","sha256:6f9b703bc9f624b80bedefd11d66a7596fdb33507ca4f10de93792e898de2916"],"state_sha256":"484abfe8faad3cc2572d838d13b37019a997a80e0ad1b1f194a23a3ac8a80d6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Stwzoq3e1HrCotBUf/4NydsrS0XOkw/yGniMFxtvBe2eO6dESXDecQeKyuB8pPaTSc18CwqgMshhe260LbVgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:20:00.909502Z","bundle_sha256":"e24e42d599df84952ea72b1fffa7fb7799e352f13a44b7e34240dd8bd5698123"}}