{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:QVOSK3GPHI3NYOX7A4AJR43JLS","short_pith_number":"pith:QVOSK3GP","canonical_record":{"source":{"id":"2305.09918","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-05-17T02:59:13Z","cross_cats_sorted":[],"title_canon_sha256":"736f3e1d5438e29fceec3a9956b102b876253fe23ec62dcf134beac71422b49a","abstract_canon_sha256":"54f2ad43a913e05bd29bdafb2400d8b2feab25bda7a18f2335dc3c31eae795d9"},"schema_version":"1.0"},"canonical_sha256":"855d256ccf3a36dc3aff070098f3695cbffcba9c1379387000436c6ca1473d7a","source":{"kind":"arxiv","id":"2305.09918","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.09918","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"2305.09918v3","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09918","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"QVOSK3GPHI3N","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"pith_short_16","alias_value":"QVOSK3GPHI3NYOX7","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"pith_short_8","alias_value":"QVOSK3GP","created_at":"2026-07-05T06:29:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:QVOSK3GPHI3NYOX7A4AJR43JLS","target":"record","payload":{"canonical_record":{"source":{"id":"2305.09918","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-05-17T02:59:13Z","cross_cats_sorted":[],"title_canon_sha256":"736f3e1d5438e29fceec3a9956b102b876253fe23ec62dcf134beac71422b49a","abstract_canon_sha256":"54f2ad43a913e05bd29bdafb2400d8b2feab25bda7a18f2335dc3c31eae795d9"},"schema_version":"1.0"},"canonical_sha256":"855d256ccf3a36dc3aff070098f3695cbffcba9c1379387000436c6ca1473d7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:01.869774Z","signature_b64":"cnnW8JYXDYKE8vw6lpWBm5lLEWtr8TCuYkcB0s8r0/Ttg7+VS8ostrxU5SToZi3rnfWnlv/2Yrtz5plPi+EqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"855d256ccf3a36dc3aff070098f3695cbffcba9c1379387000436c6ca1473d7a","last_reissued_at":"2026-07-05T06:29:01.869284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:01.869284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.09918","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-05T06:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j4I02q4K66vsZrye38jQnWC/RaQJ07DnsuDbx7XJePPMcE80VSgG0sJQwmlKFao9/scZxlyldem7bcSMoSGnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:12:54.569606Z"},"content_sha256":"107edb1076fb12f2265deb749104b9e0b477a2a8bb838c6e1248ca97fb8d59a1","schema_version":"1.0","event_id":"sha256:107edb1076fb12f2265deb749104b9e0b477a2a8bb838c6e1248ca97fb8d59a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:QVOSK3GPHI3NYOX7A4AJR43JLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unconfounded Propensity Estimation for Unbiased Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Brian D. Davison, Chenliang Li, Dan Luo, Dawei Yin, Lixin Zou, Qingyao Ai, Zhiyu Chen","submitted_at":"2023-05-17T02:59:13Z","abstract_excerpt":"The goal of unbiased learning to rank (ULTR) is to leverage implicit user feedback for optimizing learning-to-rank systems. Among existing solutions, automatic ULTR algorithms that jointly learn user bias models (i.e., propensity models) with unbiased rankers have received a lot of attention due to their superior performance and low deployment cost in practice. Despite their theoretical soundness, the effectiveness is usually justified under a weak logging policy, where the ranking model can barely rank documents according to their relevance to the query. However, when the logging policy is st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09918","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/2305.09918/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-05T06:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xqhd8WK/oJH7qloxGnAppdYBx3zFOYTqheuJn5jTGnFsNLaWbUr/crCvoXCASD/vqRLHK/5jQdzyCxGXD8cJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:12:54.570759Z"},"content_sha256":"38e9a11debeac4f55d4a3501a14f38ee7df67cb79d6fc8f6923294b855c58cbb","schema_version":"1.0","event_id":"sha256:38e9a11debeac4f55d4a3501a14f38ee7df67cb79d6fc8f6923294b855c58cbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVOSK3GPHI3NYOX7A4AJR43JLS/bundle.json","state_url":"https://pith.science/pith/QVOSK3GPHI3NYOX7A4AJR43JLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVOSK3GPHI3NYOX7A4AJR43JLS/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-06T01:12:54Z","links":{"resolver":"https://pith.science/pith/QVOSK3GPHI3NYOX7A4AJR43JLS","bundle":"https://pith.science/pith/QVOSK3GPHI3NYOX7A4AJR43JLS/bundle.json","state":"https://pith.science/pith/QVOSK3GPHI3NYOX7A4AJR43JLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVOSK3GPHI3NYOX7A4AJR43JLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:QVOSK3GPHI3NYOX7A4AJR43JLS","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":"54f2ad43a913e05bd29bdafb2400d8b2feab25bda7a18f2335dc3c31eae795d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-05-17T02:59:13Z","title_canon_sha256":"736f3e1d5438e29fceec3a9956b102b876253fe23ec62dcf134beac71422b49a"},"schema_version":"1.0","source":{"id":"2305.09918","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.09918","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"2305.09918v3","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09918","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"QVOSK3GPHI3N","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"pith_short_16","alias_value":"QVOSK3GPHI3NYOX7","created_at":"2026-07-05T06:29:01Z"},{"alias_kind":"pith_short_8","alias_value":"QVOSK3GP","created_at":"2026-07-05T06:29:01Z"}],"graph_snapshots":[{"event_id":"sha256:38e9a11debeac4f55d4a3501a14f38ee7df67cb79d6fc8f6923294b855c58cbb","target":"graph","created_at":"2026-07-05T06:29:01Z","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/2305.09918/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The goal of unbiased learning to rank (ULTR) is to leverage implicit user feedback for optimizing learning-to-rank systems. Among existing solutions, automatic ULTR algorithms that jointly learn user bias models (i.e., propensity models) with unbiased rankers have received a lot of attention due to their superior performance and low deployment cost in practice. Despite their theoretical soundness, the effectiveness is usually justified under a weak logging policy, where the ranking model can barely rank documents according to their relevance to the query. However, when the logging policy is st","authors_text":"Brian D. Davison, Chenliang Li, 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":"2023-05-17T02:59:13Z","title":"Unconfounded Propensity Estimation for Unbiased Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09918","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:107edb1076fb12f2265deb749104b9e0b477a2a8bb838c6e1248ca97fb8d59a1","target":"record","created_at":"2026-07-05T06:29:01Z","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":"54f2ad43a913e05bd29bdafb2400d8b2feab25bda7a18f2335dc3c31eae795d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-05-17T02:59:13Z","title_canon_sha256":"736f3e1d5438e29fceec3a9956b102b876253fe23ec62dcf134beac71422b49a"},"schema_version":"1.0","source":{"id":"2305.09918","kind":"arxiv","version":3}},"canonical_sha256":"855d256ccf3a36dc3aff070098f3695cbffcba9c1379387000436c6ca1473d7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"855d256ccf3a36dc3aff070098f3695cbffcba9c1379387000436c6ca1473d7a","first_computed_at":"2026-07-05T06:29:01.869284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:29:01.869284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cnnW8JYXDYKE8vw6lpWBm5lLEWtr8TCuYkcB0s8r0/Ttg7+VS8ostrxU5SToZi3rnfWnlv/2Yrtz5plPi+EqAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:29:01.869774Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.09918","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:107edb1076fb12f2265deb749104b9e0b477a2a8bb838c6e1248ca97fb8d59a1","sha256:38e9a11debeac4f55d4a3501a14f38ee7df67cb79d6fc8f6923294b855c58cbb"],"state_sha256":"b67a6501d6328c47765bdbc715081c43ef2e06a585b3c0c7a3c7e642a7200283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dVClvA4XyZDexyTZJzlxb0KU/1fHR51F2LfmKihHLUd6V49BLutH5TJx5GXKwQCYHOwym2fliUNkczywHyjxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:12:54.578321Z","bundle_sha256":"ffa325b32edd7e1f2f26e0cf11afcc6d60d0a76e0f9711fa1f18a707a37bec9e"}}