{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5DPD62RJD5PVDUP3YDVMUW25GC","short_pith_number":"pith:5DPD62RJ","canonical_record":{"source":{"id":"1804.05938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-16T21:03:07Z","cross_cats_sorted":[],"title_canon_sha256":"3fc1a10a889c93caa357b13cc354b69c08937549ec11ef099ab83fdd12af83b2","abstract_canon_sha256":"eb8b9444d77f710f837dc8652f9f779cf61c5a04877cfe72b5c178abaa551701"},"schema_version":"1.0"},"canonical_sha256":"e8de3f6a291f5f51d1fbc0eaca5b5d308b510231c9aa16928b0170b6b187df94","source":{"kind":"arxiv","id":"1804.05938","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05938","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05938v2","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05938","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"5DPD62RJD5PV","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5DPD62RJD5PVDUP3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5DPD62RJ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5DPD62RJD5PVDUP3YDVMUW25GC","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-16T21:03:07Z","cross_cats_sorted":[],"title_canon_sha256":"3fc1a10a889c93caa357b13cc354b69c08937549ec11ef099ab83fdd12af83b2","abstract_canon_sha256":"eb8b9444d77f710f837dc8652f9f779cf61c5a04877cfe72b5c178abaa551701"},"schema_version":"1.0"},"canonical_sha256":"e8de3f6a291f5f51d1fbc0eaca5b5d308b510231c9aa16928b0170b6b187df94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:47.246694Z","signature_b64":"XZQAC/R9CmTh/uVSxGmJr5Q7SUY6LlP6UQnXE7cauQ8i0tTtvQDX43vBZr1GtwUn8x9SXkPqNPleL2lLvNwEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8de3f6a291f5f51d1fbc0eaca5b5d308b510231c9aa16928b0170b6b187df94","last_reissued_at":"2026-05-18T00:17:47.245978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:47.245978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05938","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:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDKcIRwRNpBmpHN949FdVsg4qcS+1ioIdyChttmiq0ITQ6vW7Nq0zcQavYrasBXyBk/gDr80seFJiOiIvqicBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:59:35.453444Z"},"content_sha256":"3e6157a1a55a4ca6dd4cad64660c201637226d19fe3061d478743f5fab002be3","schema_version":"1.0","event_id":"sha256:3e6157a1a55a4ca6dd4cad64660c201637226d19fe3061d478743f5fab002be3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5DPD62RJD5PVDUP3YDVMUW25GC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unbiased Learning to Rank with Unbiased Propensity Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Cheng Luo, Jiafeng Guo, Keping Bi, Qingyao Ai, W. Bruce Croft","submitted_at":"2018-04-16T21:03:07Z","abstract_excerpt":"Learning to rank with biased click data is a well-known challenge. A variety of methods has been explored to debias click data for learning to rank such as click models, result interleaving and, more recently, the unbiased learning-to-rank framework based on inverse propensity weighting. Despite their differences, most existing studies separate the estimation of click bias (namely the \\textit{propensity model}) from the learning of ranking algorithms. To estimate click propensities, they either conduct online result randomization, which can negatively affect the user experience, or offline par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05938","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:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nq6T2L+bVxStvSyDoZAqEUEAtihxzRpZqsSKmiZ5toQqm1QY7B2Oln4gYR+5vCBf+svOX4NeD7Iftd3r9khhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:59:35.453815Z"},"content_sha256":"9650b18c8fe5815ce1584cdaadaaca9513661e80c88f5263eaa66c94083ac856","schema_version":"1.0","event_id":"sha256:9650b18c8fe5815ce1584cdaadaaca9513661e80c88f5263eaa66c94083ac856"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DPD62RJD5PVDUP3YDVMUW25GC/bundle.json","state_url":"https://pith.science/pith/5DPD62RJD5PVDUP3YDVMUW25GC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DPD62RJD5PVDUP3YDVMUW25GC/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-26T22:59:35Z","links":{"resolver":"https://pith.science/pith/5DPD62RJD5PVDUP3YDVMUW25GC","bundle":"https://pith.science/pith/5DPD62RJD5PVDUP3YDVMUW25GC/bundle.json","state":"https://pith.science/pith/5DPD62RJD5PVDUP3YDVMUW25GC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DPD62RJD5PVDUP3YDVMUW25GC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5DPD62RJD5PVDUP3YDVMUW25GC","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":"eb8b9444d77f710f837dc8652f9f779cf61c5a04877cfe72b5c178abaa551701","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-16T21:03:07Z","title_canon_sha256":"3fc1a10a889c93caa357b13cc354b69c08937549ec11ef099ab83fdd12af83b2"},"schema_version":"1.0","source":{"id":"1804.05938","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05938","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05938v2","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05938","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"5DPD62RJD5PV","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5DPD62RJD5PVDUP3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5DPD62RJ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:9650b18c8fe5815ce1584cdaadaaca9513661e80c88f5263eaa66c94083ac856","target":"graph","created_at":"2026-05-18T00:17:47Z","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":"Learning to rank with biased click data is a well-known challenge. A variety of methods has been explored to debias click data for learning to rank such as click models, result interleaving and, more recently, the unbiased learning-to-rank framework based on inverse propensity weighting. Despite their differences, most existing studies separate the estimation of click bias (namely the \\textit{propensity model}) from the learning of ranking algorithms. To estimate click propensities, they either conduct online result randomization, which can negatively affect the user experience, or offline par","authors_text":"Cheng Luo, Jiafeng Guo, Keping Bi, Qingyao Ai, W. Bruce Croft","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-16T21:03:07Z","title":"Unbiased Learning to Rank with Unbiased Propensity Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05938","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:3e6157a1a55a4ca6dd4cad64660c201637226d19fe3061d478743f5fab002be3","target":"record","created_at":"2026-05-18T00:17:47Z","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":"eb8b9444d77f710f837dc8652f9f779cf61c5a04877cfe72b5c178abaa551701","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-16T21:03:07Z","title_canon_sha256":"3fc1a10a889c93caa357b13cc354b69c08937549ec11ef099ab83fdd12af83b2"},"schema_version":"1.0","source":{"id":"1804.05938","kind":"arxiv","version":2}},"canonical_sha256":"e8de3f6a291f5f51d1fbc0eaca5b5d308b510231c9aa16928b0170b6b187df94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8de3f6a291f5f51d1fbc0eaca5b5d308b510231c9aa16928b0170b6b187df94","first_computed_at":"2026-05-18T00:17:47.245978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:47.245978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XZQAC/R9CmTh/uVSxGmJr5Q7SUY6LlP6UQnXE7cauQ8i0tTtvQDX43vBZr1GtwUn8x9SXkPqNPleL2lLvNwEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:47.246694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05938","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e6157a1a55a4ca6dd4cad64660c201637226d19fe3061d478743f5fab002be3","sha256:9650b18c8fe5815ce1584cdaadaaca9513661e80c88f5263eaa66c94083ac856"],"state_sha256":"025ffc6d1da6e4ff3d63c49daafdb2b64073ebb03aeb9d4ea08d109d2a9cc5bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w81I0dr9ZdQjahMnDLxieWTeC1d5fisaxkPa1SRMjYnBUBY8JsOln659se57uj0sgmJ8rPXY/WSX1VLy4hiMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:59:35.456784Z","bundle_sha256":"85a29c1761a641513e7ac2b5728778d9b8fa9d3bc5e6ebd8657ef3774c56e7b0"}}