{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:32IOENUHBNXLO2YHS23DI2VPDV","short_pith_number":"pith:32IOENUH","canonical_record":{"source":{"id":"1804.10488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-27T13:19:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d13117149cddead34f75c88f8ac24d72908c376ae5d05b868ab41530612284c4","abstract_canon_sha256":"0b14893e06b68f73269b1d8ce00b84b66d9718af8a02e5c962ed31fc47da74ac"},"schema_version":"1.0"},"canonical_sha256":"de90e236870b6eb76b0796b6346aaf1d5f8a3c487782348c264e4abb189fd572","source":{"kind":"arxiv","id":"1804.10488","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10488","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10488v2","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10488","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"32IOENUHBNXL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"32IOENUHBNXLO2YH","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"32IOENUH","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:32IOENUHBNXLO2YHS23DI2VPDV","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-27T13:19:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d13117149cddead34f75c88f8ac24d72908c376ae5d05b868ab41530612284c4","abstract_canon_sha256":"0b14893e06b68f73269b1d8ce00b84b66d9718af8a02e5c962ed31fc47da74ac"},"schema_version":"1.0"},"canonical_sha256":"de90e236870b6eb76b0796b6346aaf1d5f8a3c487782348c264e4abb189fd572","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:17.136300Z","signature_b64":"xjrNan+Dj9etg3sXxAAKO0aXLQP9Kx0oFRmnpp5u/tnJxdeg5bKwc+NlzfGnNDv6NVL/nB3/v5btmBZ/xOoUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de90e236870b6eb76b0796b6346aaf1d5f8a3c487782348c264e4abb189fd572","last_reissued_at":"2026-05-18T00:13:17.135586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:17.135586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10488","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:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHJSoju8seGkDTDtFzqK4fl/xj5lLCUukJ/Ip3KnsnbyC12oFjYtE9hDvGya3Qe6T2YpPgWghCrqi48Mb+KOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:43:07.244995Z"},"content_sha256":"eb4ffc3fd23d945065e6b51c45235c049f9733b1c06ee12bebeae0f4d34c6b5f","schema_version":"1.0","event_id":"sha256:eb4ffc3fd23d945065e6b51c45235c049f9733b1c06ee12bebeae0f4d34c6b5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:32IOENUHBNXLO2YHS23DI2VPDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Offline Evaluation of Ranking Policies with Click Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Branislav Kveton, Shuai Li, S. Muthukrishnan, Vishwa Vinay, Yasin Abbasi-Yadkori, Zheng Wen","submitted_at":"2018-04-27T13:19:34Z","abstract_excerpt":"Many web systems rank and present a list of items to users, from recommender systems to search and advertising. An important problem in practice is to evaluate new ranking policies offline and optimize them before they are deployed. We address this problem by proposing evaluation algorithms for estimating the expected number of clicks on ranked lists from historical logged data. The existing algorithms are not guaranteed to be statistically efficient in our problem because the number of recommended lists can grow exponentially with their length. To overcome this challenge, we use models of use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10488","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:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kx4c3HDTF2I4rGiwKUQ8g2PAnTqhbbLGd8Ez/aLQ/GspSW+LBVRHBn28QzLWaHVFHibHMmg59FUwNr+RWr+tBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:43:07.245519Z"},"content_sha256":"06f51141426f9014e156772a2439fa27cd9e160be670776e68437bd6d006fc35","schema_version":"1.0","event_id":"sha256:06f51141426f9014e156772a2439fa27cd9e160be670776e68437bd6d006fc35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32IOENUHBNXLO2YHS23DI2VPDV/bundle.json","state_url":"https://pith.science/pith/32IOENUHBNXLO2YHS23DI2VPDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32IOENUHBNXLO2YHS23DI2VPDV/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-05-28T20:43:07Z","links":{"resolver":"https://pith.science/pith/32IOENUHBNXLO2YHS23DI2VPDV","bundle":"https://pith.science/pith/32IOENUHBNXLO2YHS23DI2VPDV/bundle.json","state":"https://pith.science/pith/32IOENUHBNXLO2YHS23DI2VPDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32IOENUHBNXLO2YHS23DI2VPDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:32IOENUHBNXLO2YHS23DI2VPDV","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":"0b14893e06b68f73269b1d8ce00b84b66d9718af8a02e5c962ed31fc47da74ac","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-27T13:19:34Z","title_canon_sha256":"d13117149cddead34f75c88f8ac24d72908c376ae5d05b868ab41530612284c4"},"schema_version":"1.0","source":{"id":"1804.10488","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10488","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10488v2","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10488","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"32IOENUHBNXL","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"32IOENUHBNXLO2YH","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"32IOENUH","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:06f51141426f9014e156772a2439fa27cd9e160be670776e68437bd6d006fc35","target":"graph","created_at":"2026-05-18T00:13:17Z","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":"Many web systems rank and present a list of items to users, from recommender systems to search and advertising. An important problem in practice is to evaluate new ranking policies offline and optimize them before they are deployed. We address this problem by proposing evaluation algorithms for estimating the expected number of clicks on ranked lists from historical logged data. The existing algorithms are not guaranteed to be statistically efficient in our problem because the number of recommended lists can grow exponentially with their length. To overcome this challenge, we use models of use","authors_text":"Branislav Kveton, Shuai Li, S. Muthukrishnan, Vishwa Vinay, Yasin Abbasi-Yadkori, Zheng Wen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-27T13:19:34Z","title":"Offline Evaluation of Ranking Policies with Click Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10488","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:eb4ffc3fd23d945065e6b51c45235c049f9733b1c06ee12bebeae0f4d34c6b5f","target":"record","created_at":"2026-05-18T00:13:17Z","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":"0b14893e06b68f73269b1d8ce00b84b66d9718af8a02e5c962ed31fc47da74ac","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-27T13:19:34Z","title_canon_sha256":"d13117149cddead34f75c88f8ac24d72908c376ae5d05b868ab41530612284c4"},"schema_version":"1.0","source":{"id":"1804.10488","kind":"arxiv","version":2}},"canonical_sha256":"de90e236870b6eb76b0796b6346aaf1d5f8a3c487782348c264e4abb189fd572","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de90e236870b6eb76b0796b6346aaf1d5f8a3c487782348c264e4abb189fd572","first_computed_at":"2026-05-18T00:13:17.135586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:17.135586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xjrNan+Dj9etg3sXxAAKO0aXLQP9Kx0oFRmnpp5u/tnJxdeg5bKwc+NlzfGnNDv6NVL/nB3/v5btmBZ/xOoUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:17.136300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10488","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb4ffc3fd23d945065e6b51c45235c049f9733b1c06ee12bebeae0f4d34c6b5f","sha256:06f51141426f9014e156772a2439fa27cd9e160be670776e68437bd6d006fc35"],"state_sha256":"9a0ad27a7971b06a5320e3292988621fc32b28127c9192debf1d99dea8a6cbcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iY2fegAr5wuUSkWyDlNUVHW+429mqvaBL91RgCIWaCDswi2g6gzlHp7qYQREpVLLuaVQl6DH0hzWFEOUuDcsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:43:07.247918Z","bundle_sha256":"943e3e253f0bd25cdfbbcf839ce38bca77e7db00a352a3d17b75310927acfb46"}}