{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HNBVKJYBCPJGOTKGO3RVTFQME3","short_pith_number":"pith:HNBVKJYB","schema_version":"1.0","canonical_sha256":"3b4355270113d2674d4676e359960c26def4278265385341e08b5f7f48c4f01e","source":{"kind":"arxiv","id":"2207.11785","version":3},"attestation_state":"computed","paper":{"title":"Model-based Unbiased Learning to Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Brian D. Davison, Dan Luo, Dawei Yin, Lixin Zou, Qingyao Ai, Zhiyu Chen","submitted_at":"2022-07-24T18:26:38Z","abstract_excerpt":"Unbiased Learning to Rank (ULTR) that learns to rank documents with biased user feedback data is a well-known challenge in information retrieval. Existing methods in unbiased learning to rank typically rely on click modeling or inverse propensity weighting (IPW). Unfortunately, the search engines are faced with severe long-tail query distribution, where neither click modeling nor IPW can handle well. Click modeling suffers from data sparsity problem since the same query-document pair appears limited times on tail queries; IPW suffers from high variance problem since it is highly sensitive to s"},"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":"2207.11785","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-07-24T18:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"91adf0fa5390a9fecce765111adaef8fb54361115f3027fedc8c7ca21e443201","abstract_canon_sha256":"25db224d2a554dc6d28fc2e9ae08829f90bb87f31b497691ede790df12a1cd38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:52.451345Z","signature_b64":"ehI6utAWVeof9vTdMHL3xEY/T0cRgdXrl1wSybcsdq+N4REq8ZEfnk8xqgRATrT8GrGsrSKoEbHlTMD03xIyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b4355270113d2674d4676e359960c26def4278265385341e08b5f7f48c4f01e","last_reissued_at":"2026-07-05T05:39:52.450782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:52.450782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-based Unbiased Learning to Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Brian D. Davison, Dan Luo, Dawei Yin, Lixin Zou, Qingyao Ai, Zhiyu Chen","submitted_at":"2022-07-24T18:26:38Z","abstract_excerpt":"Unbiased Learning to Rank (ULTR) that learns to rank documents with biased user feedback data is a well-known challenge in information retrieval. Existing methods in unbiased learning to rank typically rely on click modeling or inverse propensity weighting (IPW). Unfortunately, the search engines are faced with severe long-tail query distribution, where neither click modeling nor IPW can handle well. Click modeling suffers from data sparsity problem since the same query-document pair appears limited times on tail queries; IPW suffers from high variance problem since it is highly sensitive to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11785","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.11785/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.11785","created_at":"2026-07-05T05:39:52.450846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11785v3","created_at":"2026-07-05T05:39:52.450846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11785","created_at":"2026-07-05T05:39:52.450846+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNBVKJYBCPJG","created_at":"2026-07-05T05:39:52.450846+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNBVKJYBCPJGOTKG","created_at":"2026-07-05T05:39:52.450846+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNBVKJYB","created_at":"2026-07-05T05:39:52.450846+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/HNBVKJYBCPJGOTKGO3RVTFQME3","json":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3.json","graph_json":"https://pith.science/api/pith-number/HNBVKJYBCPJGOTKGO3RVTFQME3/graph.json","events_json":"https://pith.science/api/pith-number/HNBVKJYBCPJGOTKGO3RVTFQME3/events.json","paper":"https://pith.science/paper/HNBVKJYB"},"agent_actions":{"view_html":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3","download_json":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3.json","view_paper":"https://pith.science/paper/HNBVKJYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11785&json=true","fetch_graph":"https://pith.science/api/pith-number/HNBVKJYBCPJGOTKGO3RVTFQME3/graph.json","fetch_events":"https://pith.science/api/pith-number/HNBVKJYBCPJGOTKGO3RVTFQME3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/action/storage_attestation","attest_author":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/action/author_attestation","sign_citation":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/action/citation_signature","submit_replication":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/action/replication_record"}},"created_at":"2026-07-05T05:39:52.450846+00:00","updated_at":"2026-07-05T05:39:52.450846+00:00"}