{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RH36Y2F37HPTAWT36CDBTROFHI","short_pith_number":"pith:RH36Y2F3","schema_version":"1.0","canonical_sha256":"89f7ec68bbf9df305a7bf08619c5c53a2e320a32f7c89470d9ed1b104b97ffeb","source":{"kind":"arxiv","id":"2311.16720","version":3},"attestation_state":"computed","paper":{"title":"A Two-Stage Adaptation of Large Language Models for Text Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Dingkun Long, Longhui Zhang, Meishan Zhang, Min Zhang, Pengjun Xie, Yanzhao Zhang","submitted_at":"2023-11-28T12:04:19Z","abstract_excerpt":"Text ranking is a critical task in information retrieval. Recent advances in pre-trained language models (PLMs), especially large language models (LLMs), present new opportunities for applying them to text ranking. While supervised fine-tuning (SFT) with ranking data has been widely explored to better align PLMs with text ranking goals, previous studies have focused primarily on encoder-only and encoder-decoder PLMs. Research on leveraging decoder-only LLMs for text ranking remains scarce. An exception to this is RankLLaMA, which uses direct SFT to explore LLaMA's potential for text ranking. I"},"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":"2311.16720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-11-28T12:04:19Z","cross_cats_sorted":[],"title_canon_sha256":"50e1251c0c357c1d5438fce8a97416506b57981cca367b00752b9280a2eb3eef","abstract_canon_sha256":"bacb66b6e3defbc8fa9ed4fee53dec4d7f1e84af9f3becad0aa69821394cd921"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:25:51.171645Z","signature_b64":"1/mIa1VLRlTP3bc7PblQ5HpkVns3HYC6pdme3EH+zfRbUJuWbX43wplfo91ikTYAUxEK7pNUy4F6ZSrdImxhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89f7ec68bbf9df305a7bf08619c5c53a2e320a32f7c89470d9ed1b104b97ffeb","last_reissued_at":"2026-07-05T08:25:51.171169Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:25:51.171169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Two-Stage Adaptation of Large Language Models for Text Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Dingkun Long, Longhui Zhang, Meishan Zhang, Min Zhang, Pengjun Xie, Yanzhao Zhang","submitted_at":"2023-11-28T12:04:19Z","abstract_excerpt":"Text ranking is a critical task in information retrieval. Recent advances in pre-trained language models (PLMs), especially large language models (LLMs), present new opportunities for applying them to text ranking. While supervised fine-tuning (SFT) with ranking data has been widely explored to better align PLMs with text ranking goals, previous studies have focused primarily on encoder-only and encoder-decoder PLMs. Research on leveraging decoder-only LLMs for text ranking remains scarce. An exception to this is RankLLaMA, which uses direct SFT to explore LLaMA's potential for text ranking. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16720","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/2311.16720/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":"2311.16720","created_at":"2026-07-05T08:25:51.171225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.16720v3","created_at":"2026-07-05T08:25:51.171225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16720","created_at":"2026-07-05T08:25:51.171225+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH36Y2F37HPT","created_at":"2026-07-05T08:25:51.171225+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH36Y2F37HPTAWT3","created_at":"2026-07-05T08:25:51.171225+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH36Y2F3","created_at":"2026-07-05T08:25:51.171225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.18580","citing_title":"System Report for CCL25-Eval Task 10: SRAG-MAV for Fine-Grained Chinese Hate Speech Recognition","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI","json":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI.json","graph_json":"https://pith.science/api/pith-number/RH36Y2F37HPTAWT36CDBTROFHI/graph.json","events_json":"https://pith.science/api/pith-number/RH36Y2F37HPTAWT36CDBTROFHI/events.json","paper":"https://pith.science/paper/RH36Y2F3"},"agent_actions":{"view_html":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI","download_json":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI.json","view_paper":"https://pith.science/paper/RH36Y2F3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.16720&json=true","fetch_graph":"https://pith.science/api/pith-number/RH36Y2F37HPTAWT36CDBTROFHI/graph.json","fetch_events":"https://pith.science/api/pith-number/RH36Y2F37HPTAWT36CDBTROFHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI/action/storage_attestation","attest_author":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI/action/author_attestation","sign_citation":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI/action/citation_signature","submit_replication":"https://pith.science/pith/RH36Y2F37HPTAWT36CDBTROFHI/action/replication_record"}},"created_at":"2026-07-05T08:25:51.171225+00:00","updated_at":"2026-07-05T08:25:51.171225+00:00"}