{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7WDWGHPNV4IQHSP6VBERWDSDPY","short_pith_number":"pith:7WDWGHPN","schema_version":"1.0","canonical_sha256":"fd87631dedaf1103c9fea8491b0e437e1afc72988f4a24725c047ac50793b900","source":{"kind":"arxiv","id":"2411.01178","version":1},"attestation_state":"computed","paper":{"title":"LLM4PR: Improving Post-Ranking in Search Engine with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chi Zhang, Enyun Yu, Kang Pan, Wenwu Ou, Wenyuan Hou, Xingkai Ren, Yang Song, Yang Yan, Yihao Wang, Zelun Wu, Zhixin Zhai","submitted_at":"2024-11-02T08:36:16Z","abstract_excerpt":"Alongside the rapid development of Large Language Models (LLMs), there has been a notable increase in efforts to integrate LLM techniques in information retrieval (IR) and search engines (SE). Recently, an additional post-ranking stage is suggested in SE to enhance user satisfaction in practical applications. Nevertheless, research dedicated to enhancing the post-ranking stage through LLMs remains largely unexplored. In this study, we introduce a novel paradigm named Large Language Models for Post-Ranking in search engine (LLM4PR), which leverages the capabilities of LLMs to accomplish the pos"},"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":"2411.01178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-11-02T08:36:16Z","cross_cats_sorted":[],"title_canon_sha256":"d93117d2e1c84b1cf416148231b9a0e9c5dda844405a69d493cb18b3a41a2884","abstract_canon_sha256":"302886a047be0ddca37a8a9fb32de48187f43723ab410f50351c1d1c4ad787e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:26.196944Z","signature_b64":"vTvo8hEwyYx9r3N/NL3ZF0ht4CL6+ZywK6fkpZym4oXANqfhBs8LcnzGzzBShd7iJHQFX8wUrfkQV6atO1bUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd87631dedaf1103c9fea8491b0e437e1afc72988f4a24725c047ac50793b900","last_reissued_at":"2026-07-05T09:30:26.196424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:26.196424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM4PR: Improving Post-Ranking in Search Engine with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chi Zhang, Enyun Yu, Kang Pan, Wenwu Ou, Wenyuan Hou, Xingkai Ren, Yang Song, Yang Yan, Yihao Wang, Zelun Wu, Zhixin Zhai","submitted_at":"2024-11-02T08:36:16Z","abstract_excerpt":"Alongside the rapid development of Large Language Models (LLMs), there has been a notable increase in efforts to integrate LLM techniques in information retrieval (IR) and search engines (SE). Recently, an additional post-ranking stage is suggested in SE to enhance user satisfaction in practical applications. Nevertheless, research dedicated to enhancing the post-ranking stage through LLMs remains largely unexplored. In this study, we introduce a novel paradigm named Large Language Models for Post-Ranking in search engine (LLM4PR), which leverages the capabilities of LLMs to accomplish the pos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01178","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.01178/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":"2411.01178","created_at":"2026-07-05T09:30:26.196487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.01178v1","created_at":"2026-07-05T09:30:26.196487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01178","created_at":"2026-07-05T09:30:26.196487+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WDWGHPNV4IQ","created_at":"2026-07-05T09:30:26.196487+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WDWGHPNV4IQHSP6","created_at":"2026-07-05T09:30:26.196487+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WDWGHPN","created_at":"2026-07-05T09:30:26.196487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07420","citing_title":"Dual-Rerank: Fusing Causality and Utility for Industrial Generative Reranking","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY","json":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY.json","graph_json":"https://pith.science/api/pith-number/7WDWGHPNV4IQHSP6VBERWDSDPY/graph.json","events_json":"https://pith.science/api/pith-number/7WDWGHPNV4IQHSP6VBERWDSDPY/events.json","paper":"https://pith.science/paper/7WDWGHPN"},"agent_actions":{"view_html":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY","download_json":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY.json","view_paper":"https://pith.science/paper/7WDWGHPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.01178&json=true","fetch_graph":"https://pith.science/api/pith-number/7WDWGHPNV4IQHSP6VBERWDSDPY/graph.json","fetch_events":"https://pith.science/api/pith-number/7WDWGHPNV4IQHSP6VBERWDSDPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY/action/storage_attestation","attest_author":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY/action/author_attestation","sign_citation":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY/action/citation_signature","submit_replication":"https://pith.science/pith/7WDWGHPNV4IQHSP6VBERWDSDPY/action/replication_record"}},"created_at":"2026-07-05T09:30:26.196487+00:00","updated_at":"2026-07-05T09:30:26.196487+00:00"}