{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HNBVKJYBCPJGOTKGO3RVTFQME3","short_pith_number":"pith:HNBVKJYB","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"},"canonical_sha256":"3b4355270113d2674d4676e359960c26def4278265385341e08b5f7f48c4f01e","source":{"kind":"arxiv","id":"2207.11785","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.11785","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"2207.11785v3","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11785","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"HNBVKJYBCPJG","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"pith_short_16","alias_value":"HNBVKJYBCPJGOTKG","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"pith_short_8","alias_value":"HNBVKJYB","created_at":"2026-07-05T05:39:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HNBVKJYBCPJGOTKGO3RVTFQME3","target":"record","payload":{"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"},"canonical_sha256":"3b4355270113d2674d4676e359960c26def4278265385341e08b5f7f48c4f01e","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"},"source_kind":"arxiv","source_id":"2207.11785","source_version":3,"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-07-05T05:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4WCYZpY9BledqKGISeQh3Vr24tmzuwrXGYx+FFc22uJ4ZNFFHPunSq47l5WN002LIc8ro3NNrMFHac6SpbfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T21:27:51.139004Z"},"content_sha256":"e4e038c58a2937efb994690811c6ff2b92a01204462d850da849f4eba2436b50","schema_version":"1.0","event_id":"sha256:e4e038c58a2937efb994690811c6ff2b92a01204462d850da849f4eba2436b50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HNBVKJYBCPJGOTKGO3RVTFQME3","target":"graph","payload":{"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"},"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-07-05T05:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LPCx4tCbqRBn919LDsIBZmE8kma4Gb6h5T9q2tR36+qFGWjLFCqtf+EGm/RTVbWEbo4af2GI67aUEMhQIiJHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T21:27:51.139899Z"},"content_sha256":"4ae888a8fda5dea04597124395853daee218a1382e3d90b22a87cc729d1a3ecf","schema_version":"1.0","event_id":"sha256:4ae888a8fda5dea04597124395853daee218a1382e3d90b22a87cc729d1a3ecf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/bundle.json","state_url":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/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-08-19T21:27:51Z","links":{"resolver":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3","bundle":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/bundle.json","state":"https://pith.science/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNBVKJYBCPJGOTKGO3RVTFQME3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HNBVKJYBCPJGOTKGO3RVTFQME3","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":"25db224d2a554dc6d28fc2e9ae08829f90bb87f31b497691ede790df12a1cd38","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-07-24T18:26:38Z","title_canon_sha256":"91adf0fa5390a9fecce765111adaef8fb54361115f3027fedc8c7ca21e443201"},"schema_version":"1.0","source":{"id":"2207.11785","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.11785","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"2207.11785v3","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11785","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"HNBVKJYBCPJG","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"pith_short_16","alias_value":"HNBVKJYBCPJGOTKG","created_at":"2026-07-05T05:39:52Z"},{"alias_kind":"pith_short_8","alias_value":"HNBVKJYB","created_at":"2026-07-05T05:39:52Z"}],"graph_snapshots":[{"event_id":"sha256:4ae888a8fda5dea04597124395853daee218a1382e3d90b22a87cc729d1a3ecf","target":"graph","created_at":"2026-07-05T05:39:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.11785/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Brian D. Davison, Dan Luo, Dawei Yin, Lixin Zou, Qingyao Ai, Zhiyu Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-07-24T18:26:38Z","title":"Model-based Unbiased Learning to Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11785","kind":"arxiv","version":3},"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:e4e038c58a2937efb994690811c6ff2b92a01204462d850da849f4eba2436b50","target":"record","created_at":"2026-07-05T05:39:52Z","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":"25db224d2a554dc6d28fc2e9ae08829f90bb87f31b497691ede790df12a1cd38","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-07-24T18:26:38Z","title_canon_sha256":"91adf0fa5390a9fecce765111adaef8fb54361115f3027fedc8c7ca21e443201"},"schema_version":"1.0","source":{"id":"2207.11785","kind":"arxiv","version":3}},"canonical_sha256":"3b4355270113d2674d4676e359960c26def4278265385341e08b5f7f48c4f01e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b4355270113d2674d4676e359960c26def4278265385341e08b5f7f48c4f01e","first_computed_at":"2026-07-05T05:39:52.450782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:39:52.450782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ehI6utAWVeof9vTdMHL3xEY/T0cRgdXrl1wSybcsdq+N4REq8ZEfnk8xqgRATrT8GrGsrSKoEbHlTMD03xIyAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:39:52.451345Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.11785","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4e038c58a2937efb994690811c6ff2b92a01204462d850da849f4eba2436b50","sha256:4ae888a8fda5dea04597124395853daee218a1382e3d90b22a87cc729d1a3ecf"],"state_sha256":"d3de73e83e1de81b2289684d6b2f7ea085ffeb923d84e7a6b67f7c9081ba0679"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Lzh4tP4os8Y5SvYbSbDfrwCin7OUeaBIpZqWeC8nICw1W0YI00jMQe28qjmgDd9EJn1Cmu01P5K5w3/1UbyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T21:27:51.145298Z","bundle_sha256":"e84fdff2c773ca9db80e36d5cb8b0eeb7ccb87b2b1c1977ee3abddc2b0b0f9a6"}}