{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4HPQUPCSI5N7ISR2DB6D367UED","short_pith_number":"pith:4HPQUPCS","schema_version":"1.0","canonical_sha256":"e1df0a3c52475bf44a3a187c3dfbf420f5bbc0c711b6c39d7ea2a7a17ecb5df9","source":{"kind":"arxiv","id":"2504.07439","version":1},"attestation_state":"computed","paper":{"title":"LLM4Ranking: An Easy-to-use Framework of Utilizing Large Language Models for Document Reranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Haozhe Duan, Jiaxin Mao, Qi Liu, Quanfeng Lu, Weiwei Sun, Yiqun Chen","submitted_at":"2025-04-10T04:08:38Z","abstract_excerpt":"Utilizing large language models (LLMs) for document reranking has been a popular and promising research direction in recent years, many studies are dedicated to improving the performance and efficiency of using LLMs for reranking. Besides, it can also be applied in many real-world applications, such as search engines or retrieval-augmented generation. In response to the growing demand for research and application in practice, we introduce a unified framework, \\textbf{LLM4Ranking}, which enables users to adopt different ranking methods using open-source or closed-source API-based LLMs. Our fram"},"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":"2504.07439","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-04-10T04:08:38Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"5254b153743169db5ba10375a60906eb3bc767d636dd3cb828829657c9d2b95f","abstract_canon_sha256":"827f8b456fa6b3d5d3129a77567c45b956aeb3d4716c34d1ecf19c67d008d1a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:09.053230Z","signature_b64":"BOfiabbsXfSIhIuGecVuX5gfbS7EEIRJavhCKSbUiW+Mw9glYxG1a8MvYp5yRRCYXpmnh+DGdRlkTQRRIAy9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1df0a3c52475bf44a3a187c3dfbf420f5bbc0c711b6c39d7ea2a7a17ecb5df9","last_reissued_at":"2026-07-05T10:47:09.052725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:09.052725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM4Ranking: An Easy-to-use Framework of Utilizing Large Language Models for Document Reranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Haozhe Duan, Jiaxin Mao, Qi Liu, Quanfeng Lu, Weiwei Sun, Yiqun Chen","submitted_at":"2025-04-10T04:08:38Z","abstract_excerpt":"Utilizing large language models (LLMs) for document reranking has been a popular and promising research direction in recent years, many studies are dedicated to improving the performance and efficiency of using LLMs for reranking. Besides, it can also be applied in many real-world applications, such as search engines or retrieval-augmented generation. In response to the growing demand for research and application in practice, we introduce a unified framework, \\textbf{LLM4Ranking}, which enables users to adopt different ranking methods using open-source or closed-source API-based LLMs. Our fram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07439","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/2504.07439/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":"2504.07439","created_at":"2026-07-05T10:47:09.052799+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.07439v1","created_at":"2026-07-05T10:47:09.052799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07439","created_at":"2026-07-05T10:47:09.052799+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HPQUPCSI5N7","created_at":"2026-07-05T10:47:09.052799+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HPQUPCSI5N7ISR2","created_at":"2026-07-05T10:47:09.052799+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HPQUPCS","created_at":"2026-07-05T10:47:09.052799+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12942","citing_title":"PRISMR: Overcoming Parse Collapse in Multimodal Listwise Ranking via Parameterized Representation Internalization","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30027","citing_title":"DocRetriever: A Plug-and-Play Framework for Multimodal Document Retrieval with Comprehensive Benchmark","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED","json":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED.json","graph_json":"https://pith.science/api/pith-number/4HPQUPCSI5N7ISR2DB6D367UED/graph.json","events_json":"https://pith.science/api/pith-number/4HPQUPCSI5N7ISR2DB6D367UED/events.json","paper":"https://pith.science/paper/4HPQUPCS"},"agent_actions":{"view_html":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED","download_json":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED.json","view_paper":"https://pith.science/paper/4HPQUPCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.07439&json=true","fetch_graph":"https://pith.science/api/pith-number/4HPQUPCSI5N7ISR2DB6D367UED/graph.json","fetch_events":"https://pith.science/api/pith-number/4HPQUPCSI5N7ISR2DB6D367UED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED/action/storage_attestation","attest_author":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED/action/author_attestation","sign_citation":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED/action/citation_signature","submit_replication":"https://pith.science/pith/4HPQUPCSI5N7ISR2DB6D367UED/action/replication_record"}},"created_at":"2026-07-05T10:47:09.052799+00:00","updated_at":"2026-07-05T10:47:09.052799+00:00"}