{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UNJTMPXCJUYYBOMOSAS2W37SQW","short_pith_number":"pith:UNJTMPXC","schema_version":"1.0","canonical_sha256":"a353363ee24d3180b98e9025ab6ff285a67ae740bf651fe695d2d900e359c8e6","source":{"kind":"arxiv","id":"2305.08845","version":2},"attestation_state":"computed","paper":{"title":"Large Language Models are Zero-Shot Rankers for Recommender Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Hongyu Lu, Julian McAuley, Junjie Zhang, Ruobing Xie, Wayne Xin Zhao, Yupeng Hou, Zihan Lin","submitted_at":"2023-05-15T17:57:39Z","abstract_excerpt":"Recently, large language models (LLMs) (e.g., GPT-4) have demonstrated impressive general-purpose task-solving abilities, including the potential to approach recommendation tasks. Along this line of research, this work aims to investigate the capacity of LLMs that act as the ranking model for recommender systems. We first formalize the recommendation problem as a conditional ranking task, considering sequential interaction histories as conditions and the items retrieved by other candidate generation models as candidates. To solve the ranking task by LLMs, we carefully design the prompting temp"},"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":"2305.08845","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-05-15T17:57:39Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"f9b75765b7e1d16118a0cf33fd2abfc2af0086d24c2f7e4f371ddaebb557bbad","abstract_canon_sha256":"fa3f54a588a66edf185588d24a636710c6f69e62a1bbc4651956e02049e06a7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:51.337982Z","signature_b64":"sGEMCDPbreyHTL5AyCd3WHQ1wSK+bghHxpfsCkG5LEn5NVMJHsApsVhoVK6ZSsixAGnUmdF+7Y51oNYKr1IaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a353363ee24d3180b98e9025ab6ff285a67ae740bf651fe695d2d900e359c8e6","last_reissued_at":"2026-07-05T07:36:51.337624Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:51.337624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Language Models are Zero-Shot Rankers for Recommender Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Hongyu Lu, Julian McAuley, Junjie Zhang, Ruobing Xie, Wayne Xin Zhao, Yupeng Hou, Zihan Lin","submitted_at":"2023-05-15T17:57:39Z","abstract_excerpt":"Recently, large language models (LLMs) (e.g., GPT-4) have demonstrated impressive general-purpose task-solving abilities, including the potential to approach recommendation tasks. Along this line of research, this work aims to investigate the capacity of LLMs that act as the ranking model for recommender systems. We first formalize the recommendation problem as a conditional ranking task, considering sequential interaction histories as conditions and the items retrieved by other candidate generation models as candidates. To solve the ranking task by LLMs, we carefully design the prompting temp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08845","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/2305.08845/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":"2305.08845","created_at":"2026-07-05T07:36:51.337676+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.08845v2","created_at":"2026-07-05T07:36:51.337676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08845","created_at":"2026-07-05T07:36:51.337676+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNJTMPXCJUYY","created_at":"2026-07-05T07:36:51.337676+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNJTMPXCJUYYBOMO","created_at":"2026-07-05T07:36:51.337676+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNJTMPXC","created_at":"2026-07-05T07:36:51.337676+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27429","citing_title":"Ocean4Rec: Offline LLM-Derived OCEAN Profiles for Request-Time VOD Reranking","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27810","citing_title":"LRanker: LLM Ranker for Massive Candidates","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2402.17152","citing_title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","ref_index":72,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27599","citing_title":"One Pass, Any Order: Position-Invariant Listwise Reranking for LLM-Based Recommendation","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21536","citing_title":"Pre-trained LLMs Meet Sequential Recommenders: Efficient User-Centric Knowledge Distillation","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW","json":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW.json","graph_json":"https://pith.science/api/pith-number/UNJTMPXCJUYYBOMOSAS2W37SQW/graph.json","events_json":"https://pith.science/api/pith-number/UNJTMPXCJUYYBOMOSAS2W37SQW/events.json","paper":"https://pith.science/paper/UNJTMPXC"},"agent_actions":{"view_html":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW","download_json":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW.json","view_paper":"https://pith.science/paper/UNJTMPXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.08845&json=true","fetch_graph":"https://pith.science/api/pith-number/UNJTMPXCJUYYBOMOSAS2W37SQW/graph.json","fetch_events":"https://pith.science/api/pith-number/UNJTMPXCJUYYBOMOSAS2W37SQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW/action/storage_attestation","attest_author":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW/action/author_attestation","sign_citation":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW/action/citation_signature","submit_replication":"https://pith.science/pith/UNJTMPXCJUYYBOMOSAS2W37SQW/action/replication_record"}},"created_at":"2026-07-05T07:36:51.337676+00:00","updated_at":"2026-07-05T07:36:51.337676+00:00"}