{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QCUXKIJD67O3LVBH4WDBOTAWP5","short_pith_number":"pith:QCUXKIJD","schema_version":"1.0","canonical_sha256":"80a9752123f7ddb5d427e586174c167f54e76d6543313e1ee9774a66fff2e662","source":{"kind":"arxiv","id":"2307.15780","version":3},"attestation_state":"computed","paper":{"title":"LLM-Rec: Personalized Recommendation via Prompting Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Christopher Leung, Hanjia Lyu, Hanqing Zeng, Jiajie Tang, Jiebo Luo, Qifan Wang, Ren Chen, Si Zhang, Song Jiang, Yinglong Xia","submitted_at":"2023-07-24T18:47:38Z","abstract_excerpt":"Text-based recommendation holds a wide range of practical applications due to its versatility, as textual descriptions can represent nearly any type of item. However, directly employing the original item descriptions may not yield optimal recommendation performance due to the lack of comprehensive information to align with user preferences. Recent advances in large language models (LLMs) have showcased their remarkable ability to harness commonsense knowledge and reasoning. In this study, we introduce a novel approach, coined LLM-Rec, which incorporates four distinct prompting strategies of te"},"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":"2307.15780","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-07-24T18:47:38Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"3f9fdd77c35f5ce632145d61c51c953867a5b58e071e9195130b3dabca2315ce","abstract_canon_sha256":"89bcc2d3e306a80abdb9ca07fb5496c256b2be9a2334c68663195ac49ffa5e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:26.191492Z","signature_b64":"+9ORnpS9uIxhDNZbLRtraqtZale+iL0ZqbTXpfms+keQifIDvEWuIHyVeQIqUGU3mh03xrSlnMXeHuYLMoiTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80a9752123f7ddb5d427e586174c167f54e76d6543313e1ee9774a66fff2e662","last_reissued_at":"2026-07-05T08:03:26.190990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:26.190990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM-Rec: Personalized Recommendation via Prompting Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Christopher Leung, Hanjia Lyu, Hanqing Zeng, Jiajie Tang, Jiebo Luo, Qifan Wang, Ren Chen, Si Zhang, Song Jiang, Yinglong Xia","submitted_at":"2023-07-24T18:47:38Z","abstract_excerpt":"Text-based recommendation holds a wide range of practical applications due to its versatility, as textual descriptions can represent nearly any type of item. However, directly employing the original item descriptions may not yield optimal recommendation performance due to the lack of comprehensive information to align with user preferences. Recent advances in large language models (LLMs) have showcased their remarkable ability to harness commonsense knowledge and reasoning. In this study, we introduce a novel approach, coined LLM-Rec, which incorporates four distinct prompting strategies of te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15780","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/2307.15780/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":"2307.15780","created_at":"2026-07-05T08:03:26.191047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.15780v3","created_at":"2026-07-05T08:03:26.191047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15780","created_at":"2026-07-05T08:03:26.191047+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCUXKIJD67O3","created_at":"2026-07-05T08:03:26.191047+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCUXKIJD67O3LVBH","created_at":"2026-07-05T08:03:26.191047+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCUXKIJD","created_at":"2026-07-05T08:03:26.191047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00540","citing_title":"Trustworthy Recommendation in the Era of Large Language Models: Opportunities and Challenges","ref_index":156,"is_internal_anchor":false},{"citing_arxiv_id":"2408.11338","citing_title":"Automatic Dataset Construction (ADC): Sample Collection, Data Curation, and Beyond","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21969","citing_title":"LLM Retrieval for Stable and Predictable Ad Recommendations","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":276,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09551","citing_title":"SemaCDR: LLM-Powered Transferable Semantics for Cross-Domain Sequential Recommendation","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09553","citing_title":"SRBench: A Comprehensive Benchmark for Sequential Recommendation with Large Language Models","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18146","citing_title":"Modular Representation Compression: Adapting LLMs for Efficient and Effective Recommendations","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07851","citing_title":"ReRec: Reasoning-Augmented LLM-based Recommendation Assistant via Reinforcement Fine-tuning","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14833","citing_title":"Federated User Behavior Modeling for Privacy-Preserving LLM Recommendation","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5","json":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5.json","graph_json":"https://pith.science/api/pith-number/QCUXKIJD67O3LVBH4WDBOTAWP5/graph.json","events_json":"https://pith.science/api/pith-number/QCUXKIJD67O3LVBH4WDBOTAWP5/events.json","paper":"https://pith.science/paper/QCUXKIJD"},"agent_actions":{"view_html":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5","download_json":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5.json","view_paper":"https://pith.science/paper/QCUXKIJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.15780&json=true","fetch_graph":"https://pith.science/api/pith-number/QCUXKIJD67O3LVBH4WDBOTAWP5/graph.json","fetch_events":"https://pith.science/api/pith-number/QCUXKIJD67O3LVBH4WDBOTAWP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5/action/storage_attestation","attest_author":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5/action/author_attestation","sign_citation":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5/action/citation_signature","submit_replication":"https://pith.science/pith/QCUXKIJD67O3LVBH4WDBOTAWP5/action/replication_record"}},"created_at":"2026-07-05T08:03:26.191047+00:00","updated_at":"2026-07-05T08:03:26.191047+00:00"}