{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7LMJ35QNZDCXTJSJOIAA333SHD","short_pith_number":"pith:7LMJ35QN","canonical_record":{"source":{"id":"1103.3735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-03-19T00:08:45Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f73210adcbb38b0e00004ce6962cc4d70947248d3fca70d21d19970aed921894","abstract_canon_sha256":"437cefc6199169a7850876daf2ce27b314379c489799e94bddee566cff8e5443"},"schema_version":"1.0"},"canonical_sha256":"fad89df60dc8c579a64972000def7238f8424923f2fd354759885431ed4baaba","source":{"kind":"arxiv","id":"1103.3735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3735","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3735v1","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3735","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"7LMJ35QNZDCX","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7LMJ35QNZDCXTJSJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7LMJ35QN","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7LMJ35QNZDCXTJSJOIAA333SHD","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-03-19T00:08:45Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f73210adcbb38b0e00004ce6962cc4d70947248d3fca70d21d19970aed921894","abstract_canon_sha256":"437cefc6199169a7850876daf2ce27b314379c489799e94bddee566cff8e5443"},"schema_version":"1.0"},"canonical_sha256":"fad89df60dc8c579a64972000def7238f8424923f2fd354759885431ed4baaba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:22.416255Z","signature_b64":"WUfZmVcz+1INblqc57rfpUU9V+xQ4Ba9BfWXh0BtZZlRagYMBKNUNxdBqsxH3tRWskkJDnAzT9W5gDwMCQEOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fad89df60dc8c579a64972000def7238f8424923f2fd354759885431ed4baaba","last_reissued_at":"2026-05-18T04:26:22.415825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:22.415825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3735","source_version":1,"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-18T04:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdxTZ0+2Fzlj9sst8EiCzzDKuzwgAVIB1ylV0byLu7fsOwfvKbakKSppSarEFg+SFp/kpPbmjBjNudhnyrHjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:45:04.464978Z"},"content_sha256":"71c436e21d1bb2e65ac4117287c12bba6958af518d0442095c146f120fab5cb0","schema_version":"1.0","event_id":"sha256:71c436e21d1bb2e65ac4117287c12bba6958af518d0442095c146f120fab5cb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7LMJ35QNZDCXTJSJOIAA333SHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Refining Recency Search Results with User Click Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Lihong Li, Taesup Moon, Wei Chu, Yi Chang, Zhaohui Zheng","submitted_at":"2011-03-19T00:08:45Z","abstract_excerpt":"Traditional machine-learned ranking systems for web search are often trained to capture stationary relevance of documents to queries, which has limited ability to track non-stationary user intention in a timely manner. In recency search, for instance, the relevance of documents to a query on breaking news often changes significantly over time, requiring effective adaptation to user intention. In this paper, we focus on recency search and study a number of algorithms to improve ranking results by leveraging user click feedback. Our contributions are three-fold. First, we use real search session"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3735","kind":"arxiv","version":1},"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-18T04:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqecg0NsQY+NVcepfOSaPBju9HxyuZ+Ig4j3EJ/0I9q08jBdNntDDFZ6uUbNnN/b6mPE4mQbeEJXz/1US73HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:45:04.465707Z"},"content_sha256":"aa63f1776b7044d58ce805c4283761ba82e8d13aa058cf27cae31246c36c8771","schema_version":"1.0","event_id":"sha256:aa63f1776b7044d58ce805c4283761ba82e8d13aa058cf27cae31246c36c8771"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LMJ35QNZDCXTJSJOIAA333SHD/bundle.json","state_url":"https://pith.science/pith/7LMJ35QNZDCXTJSJOIAA333SHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LMJ35QNZDCXTJSJOIAA333SHD/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-26T13:45:04Z","links":{"resolver":"https://pith.science/pith/7LMJ35QNZDCXTJSJOIAA333SHD","bundle":"https://pith.science/pith/7LMJ35QNZDCXTJSJOIAA333SHD/bundle.json","state":"https://pith.science/pith/7LMJ35QNZDCXTJSJOIAA333SHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LMJ35QNZDCXTJSJOIAA333SHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7LMJ35QNZDCXTJSJOIAA333SHD","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":"437cefc6199169a7850876daf2ce27b314379c489799e94bddee566cff8e5443","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-03-19T00:08:45Z","title_canon_sha256":"f73210adcbb38b0e00004ce6962cc4d70947248d3fca70d21d19970aed921894"},"schema_version":"1.0","source":{"id":"1103.3735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3735","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3735v1","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3735","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"7LMJ35QNZDCX","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7LMJ35QNZDCXTJSJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7LMJ35QN","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:aa63f1776b7044d58ce805c4283761ba82e8d13aa058cf27cae31246c36c8771","target":"graph","created_at":"2026-05-18T04:26:22Z","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":"Traditional machine-learned ranking systems for web search are often trained to capture stationary relevance of documents to queries, which has limited ability to track non-stationary user intention in a timely manner. In recency search, for instance, the relevance of documents to a query on breaking news often changes significantly over time, requiring effective adaptation to user intention. In this paper, we focus on recency search and study a number of algorithms to improve ranking results by leveraging user click feedback. Our contributions are three-fold. First, we use real search session","authors_text":"Lihong Li, Taesup Moon, Wei Chu, Yi Chang, Zhaohui Zheng","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-03-19T00:08:45Z","title":"Refining Recency Search Results with User Click Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3735","kind":"arxiv","version":1},"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:71c436e21d1bb2e65ac4117287c12bba6958af518d0442095c146f120fab5cb0","target":"record","created_at":"2026-05-18T04:26:22Z","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":"437cefc6199169a7850876daf2ce27b314379c489799e94bddee566cff8e5443","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-03-19T00:08:45Z","title_canon_sha256":"f73210adcbb38b0e00004ce6962cc4d70947248d3fca70d21d19970aed921894"},"schema_version":"1.0","source":{"id":"1103.3735","kind":"arxiv","version":1}},"canonical_sha256":"fad89df60dc8c579a64972000def7238f8424923f2fd354759885431ed4baaba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fad89df60dc8c579a64972000def7238f8424923f2fd354759885431ed4baaba","first_computed_at":"2026-05-18T04:26:22.415825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:22.415825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WUfZmVcz+1INblqc57rfpUU9V+xQ4Ba9BfWXh0BtZZlRagYMBKNUNxdBqsxH3tRWskkJDnAzT9W5gDwMCQEOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:22.416255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71c436e21d1bb2e65ac4117287c12bba6958af518d0442095c146f120fab5cb0","sha256:aa63f1776b7044d58ce805c4283761ba82e8d13aa058cf27cae31246c36c8771"],"state_sha256":"1964f024c5890e754ce6a6b2544112d3c51c96401ceb06d0a3eeedf433b4ca8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtdDDijlUBap5wHEeHUzGEZ26//JiuB6QqI318y2av+kv7ik8tifljhvh4a/bEa8RhJqzB2ca3Wt3L0+iurQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:45:04.469872Z","bundle_sha256":"1bbd736da9b30dde95aff6f96eb0fc93caad61cd5b64ff0cf2b026348646a98b"}}