{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BM3EM6D7SK5YY7UUAX3SFVI5QO","short_pith_number":"pith:BM3EM6D7","schema_version":"1.0","canonical_sha256":"0b3646787f92bb8c7e9405f722d51d8398f4a915b4c2d691bca71da419b9b48b","source":{"kind":"arxiv","id":"2304.03153","version":1},"attestation_state":"computed","paper":{"title":"Zero-Shot Next-Item Recommendation using Large Pretrained Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Ee-Peng Lim, Lei Wang","submitted_at":"2023-04-06T15:35:11Z","abstract_excerpt":"Large language models (LLMs) have achieved impressive zero-shot performance in various natural language processing (NLP) tasks, demonstrating their capabilities for inference without training examples. Despite their success, no research has yet explored the potential of LLMs to perform next-item recommendations in the zero-shot setting. We have identified two major challenges that must be addressed to enable LLMs to act effectively as recommenders. First, the recommendation space can be extremely large for LLMs, and LLMs do not know about the target user's past interacted items and preferences"},"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":"2304.03153","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-04-06T15:35:11Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"733bf0de09e1cd34f95f62e827f7fe7a39723381adc712f48136e85d8d01c3ab","abstract_canon_sha256":"b460baab3d00b111e538a223309ae7037fb71bdf9256df3c1b42dd2e3d26c18a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:45.757790Z","signature_b64":"59ZPxFEbtWjxBmko/3yMaIjy9BE0IRNCyFaAX4W7c7JTXKnIljhO+yDtnOj0yLGkTrGORDPPtBLNe66NjWqWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b3646787f92bb8c7e9405f722d51d8398f4a915b4c2d691bca71da419b9b48b","last_reissued_at":"2026-07-05T05:58:45.757331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:45.757331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-Shot Next-Item Recommendation using Large Pretrained Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Ee-Peng Lim, Lei Wang","submitted_at":"2023-04-06T15:35:11Z","abstract_excerpt":"Large language models (LLMs) have achieved impressive zero-shot performance in various natural language processing (NLP) tasks, demonstrating their capabilities for inference without training examples. Despite their success, no research has yet explored the potential of LLMs to perform next-item recommendations in the zero-shot setting. We have identified two major challenges that must be addressed to enable LLMs to act effectively as recommenders. First, the recommendation space can be extremely large for LLMs, and LLMs do not know about the target user's past interacted items and preferences"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03153","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/2304.03153/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":"2304.03153","created_at":"2026-07-05T05:58:45.757388+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03153v1","created_at":"2026-07-05T05:58:45.757388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03153","created_at":"2026-07-05T05:58:45.757388+00:00"},{"alias_kind":"pith_short_12","alias_value":"BM3EM6D7SK5Y","created_at":"2026-07-05T05:58:45.757388+00:00"},{"alias_kind":"pith_short_16","alias_value":"BM3EM6D7SK5YY7UU","created_at":"2026-07-05T05:58:45.757388+00:00"},{"alias_kind":"pith_short_8","alias_value":"BM3EM6D7","created_at":"2026-07-05T05:58:45.757388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27930","citing_title":"An LLM-Powered Semantic Alignment Framework for Journal Recommendation","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2502.14541","citing_title":"LLM-based User Profile Management for Recommender System","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18780","citing_title":"A Reproducibility Analysis of PO4ISR: Diagnosing and Mitigating Semantic Drift in LLM-Based Session Recommendation","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2601.21986","citing_title":"SpecTran: Spectral-Aware Transformer-based Adapter for LLM-Enhanced Sequential Recommendation","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2601.22925","citing_title":"BEAR: Towards Beam-Search-Aware Optimization for Recommendation with Large Language Models","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09553","citing_title":"SRBench: A Comprehensive Benchmark for Sequential Recommendation with Large Language Models","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06207","citing_title":"A Comparative Study of Demonstration Selection for Practical Large Language Models-based Next POI Prediction","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16379","citing_title":"LLMAR: A Tuning-Free Recommendation Framework for Sparse and Text-Rich Industrial Domains","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12645","citing_title":"Training LLMs with Reinforcement Learning for Intent-Aware Personalized Question Answering","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12995","citing_title":"F-GRPO: Factorized Group-Relative Policy Optimization for Unified Candidate Generation and Ranking","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11582","citing_title":"Efficient LLM-based Advertising via Model Compression and Parallel Verification","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07443","citing_title":"RcLLM: Accelerating Generative Recommendation via Beyond-Prefix KV Caching","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO","json":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO.json","graph_json":"https://pith.science/api/pith-number/BM3EM6D7SK5YY7UUAX3SFVI5QO/graph.json","events_json":"https://pith.science/api/pith-number/BM3EM6D7SK5YY7UUAX3SFVI5QO/events.json","paper":"https://pith.science/paper/BM3EM6D7"},"agent_actions":{"view_html":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO","download_json":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO.json","view_paper":"https://pith.science/paper/BM3EM6D7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03153&json=true","fetch_graph":"https://pith.science/api/pith-number/BM3EM6D7SK5YY7UUAX3SFVI5QO/graph.json","fetch_events":"https://pith.science/api/pith-number/BM3EM6D7SK5YY7UUAX3SFVI5QO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO/action/storage_attestation","attest_author":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO/action/author_attestation","sign_citation":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO/action/citation_signature","submit_replication":"https://pith.science/pith/BM3EM6D7SK5YY7UUAX3SFVI5QO/action/replication_record"}},"created_at":"2026-07-05T05:58:45.757388+00:00","updated_at":"2026-07-05T05:58:45.757388+00:00"}