{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KO7IUG5RLIGKABY6D5AEHOKXLY","short_pith_number":"pith:KO7IUG5R","canonical_record":{"source":{"id":"2502.11414","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-17T03:55:51Z","cross_cats_sorted":[],"title_canon_sha256":"d7d32f67ed85c032dd3f0aa91e7f12d18b3e99e190fb1aa499c93882eb709169","abstract_canon_sha256":"4ddc2abae520e14b0269dc0f90b100375f8e8f76e9f461d3db2a0b84b476141c"},"schema_version":"1.0"},"canonical_sha256":"53be8a1bb15a0ca0071e1f4043b9575e248f19253bbfafda894b7540bd019693","source":{"kind":"arxiv","id":"2502.11414","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11414","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11414v2","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11414","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"KO7IUG5RLIGK","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"pith_short_16","alias_value":"KO7IUG5RLIGKABY6","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"pith_short_8","alias_value":"KO7IUG5R","created_at":"2026-07-05T10:15:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KO7IUG5RLIGKABY6D5AEHOKXLY","target":"record","payload":{"canonical_record":{"source":{"id":"2502.11414","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-17T03:55:51Z","cross_cats_sorted":[],"title_canon_sha256":"d7d32f67ed85c032dd3f0aa91e7f12d18b3e99e190fb1aa499c93882eb709169","abstract_canon_sha256":"4ddc2abae520e14b0269dc0f90b100375f8e8f76e9f461d3db2a0b84b476141c"},"schema_version":"1.0"},"canonical_sha256":"53be8a1bb15a0ca0071e1f4043b9575e248f19253bbfafda894b7540bd019693","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:49.827327Z","signature_b64":"C1NRcRXTl6QwgCScxuVxBTgk6A1+T40ywcB6W4bH0iUrU/27jI2eP9uddIDUNNxTc0KjKw0ZmstfMDdrvWWoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53be8a1bb15a0ca0071e1f4043b9575e248f19253bbfafda894b7540bd019693","last_reissued_at":"2026-07-05T10:15:49.826808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:49.826808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.11414","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-07-05T10:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdzJ/OZCwfrMgA0lx6LwWfZpicfc+kWGLHqQLEfUXYRd+afhM1rKmsXDnKuXMcESwsdPTISvnG7wDpjj0MxaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:33:54.979030Z"},"content_sha256":"40385d0eccbafafbb0a260381a28b3d5bfbca7e14dc56da46019e39cfa60feaf","schema_version":"1.0","event_id":"sha256:40385d0eccbafafbb0a260381a28b3d5bfbca7e14dc56da46019e39cfa60feaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KO7IUG5RLIGKABY6D5AEHOKXLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unbiased Learning to Rank with Query-Level Click Propensity Estimation: Beyond Pointwise Observation and Relevance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Dawei Yin, Jiafeng Guo, Keping Bi, Lulu Yu, Shihao Liu, Xueqi Cheng","submitted_at":"2025-02-17T03:55:51Z","abstract_excerpt":"Most existing unbiased learning-to-rank (ULTR) approaches are based on the user examination hypothesis, which assumes that users will click a result only if it is both relevant and observed (typically modeled by position). However, in real-world scenarios, users often click only one or two results after examining multiple relevant options, due to limited patience or because their information needs have already been satisfied. Motivated by this, we propose a query-level click propensity model to capture the probability that users will click on different result lists, allowing for non-zero proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11414","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.11414/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-05T10:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2iTHIh3VDbrEoKfY8KkDzlnwD20EuVECSrtpXjNRPsmdTJ8xcFBk06kuK2SGCGKDDHn+ptwfIpB6TlhRN5GCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:33:54.979549Z"},"content_sha256":"d1a1f93fc75481b5adaa23ea843c6640c6c95efbf241a6893dedb83f87b5782b","schema_version":"1.0","event_id":"sha256:d1a1f93fc75481b5adaa23ea843c6640c6c95efbf241a6893dedb83f87b5782b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KO7IUG5RLIGKABY6D5AEHOKXLY/bundle.json","state_url":"https://pith.science/pith/KO7IUG5RLIGKABY6D5AEHOKXLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KO7IUG5RLIGKABY6D5AEHOKXLY/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-04T03:33:54Z","links":{"resolver":"https://pith.science/pith/KO7IUG5RLIGKABY6D5AEHOKXLY","bundle":"https://pith.science/pith/KO7IUG5RLIGKABY6D5AEHOKXLY/bundle.json","state":"https://pith.science/pith/KO7IUG5RLIGKABY6D5AEHOKXLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KO7IUG5RLIGKABY6D5AEHOKXLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KO7IUG5RLIGKABY6D5AEHOKXLY","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":"4ddc2abae520e14b0269dc0f90b100375f8e8f76e9f461d3db2a0b84b476141c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-17T03:55:51Z","title_canon_sha256":"d7d32f67ed85c032dd3f0aa91e7f12d18b3e99e190fb1aa499c93882eb709169"},"schema_version":"1.0","source":{"id":"2502.11414","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11414","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11414v2","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11414","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"KO7IUG5RLIGK","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"pith_short_16","alias_value":"KO7IUG5RLIGKABY6","created_at":"2026-07-05T10:15:49Z"},{"alias_kind":"pith_short_8","alias_value":"KO7IUG5R","created_at":"2026-07-05T10:15:49Z"}],"graph_snapshots":[{"event_id":"sha256:d1a1f93fc75481b5adaa23ea843c6640c6c95efbf241a6893dedb83f87b5782b","target":"graph","created_at":"2026-07-05T10:15:49Z","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/2502.11414/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most existing unbiased learning-to-rank (ULTR) approaches are based on the user examination hypothesis, which assumes that users will click a result only if it is both relevant and observed (typically modeled by position). However, in real-world scenarios, users often click only one or two results after examining multiple relevant options, due to limited patience or because their information needs have already been satisfied. Motivated by this, we propose a query-level click propensity model to capture the probability that users will click on different result lists, allowing for non-zero proba","authors_text":"Dawei Yin, Jiafeng Guo, Keping Bi, Lulu Yu, Shihao Liu, Xueqi Cheng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-17T03:55:51Z","title":"Unbiased Learning to Rank with Query-Level Click Propensity Estimation: Beyond Pointwise Observation and Relevance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11414","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:40385d0eccbafafbb0a260381a28b3d5bfbca7e14dc56da46019e39cfa60feaf","target":"record","created_at":"2026-07-05T10:15:49Z","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":"4ddc2abae520e14b0269dc0f90b100375f8e8f76e9f461d3db2a0b84b476141c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-17T03:55:51Z","title_canon_sha256":"d7d32f67ed85c032dd3f0aa91e7f12d18b3e99e190fb1aa499c93882eb709169"},"schema_version":"1.0","source":{"id":"2502.11414","kind":"arxiv","version":2}},"canonical_sha256":"53be8a1bb15a0ca0071e1f4043b9575e248f19253bbfafda894b7540bd019693","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53be8a1bb15a0ca0071e1f4043b9575e248f19253bbfafda894b7540bd019693","first_computed_at":"2026-07-05T10:15:49.826808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:49.826808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C1NRcRXTl6QwgCScxuVxBTgk6A1+T40ywcB6W4bH0iUrU/27jI2eP9uddIDUNNxTc0KjKw0ZmstfMDdrvWWoAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:49.827327Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11414","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40385d0eccbafafbb0a260381a28b3d5bfbca7e14dc56da46019e39cfa60feaf","sha256:d1a1f93fc75481b5adaa23ea843c6640c6c95efbf241a6893dedb83f87b5782b"],"state_sha256":"c03d6273150379926b43d85a118a6c004f3bf064937ea09a7506ff6e2f1b9b39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNn+ZSCwuq6EiKfhn8/hDCUqRXyluLuh4cX3u5bVD8mTfddJpHWWmgYdbxPkdG8SnDEp6OoCIuSt+llSY5B3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T03:33:54.985245Z","bundle_sha256":"61b62683c02aa2147512a4defc8a495ae24e320fb0100fe2490952e63512d6d0"}}