{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OFN5D6BHPFGJHZOMBB4WBMVTU2","short_pith_number":"pith:OFN5D6BH","schema_version":"1.0","canonical_sha256":"715bd1f827794c93e5cc087960b2b3a68958fcd849f6f8d6a3ad428c546033a9","source":{"kind":"arxiv","id":"2305.06569","version":6},"attestation_state":"computed","paper":{"title":"How to Index Item IDs for Recommendation Foundation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Shuyuan Xu, Wenyue Hua, Yingqiang Ge, Yongfeng Zhang","submitted_at":"2023-05-11T05:02:37Z","abstract_excerpt":"Recommendation foundation model utilizes large language models (LLM) for recommendation by converting recommendation tasks into natural language tasks. It enables generative recommendation which directly generates the item(s) to recommend rather than calculating a ranking score for each and every candidate item as in traditional recommendation models, simplifying the recommendation pipeline from multi-stage filtering to single-stage filtering. To avoid generating excessively long text and hallucinated recommendations when deciding which item(s) to recommend, creating LLM-compatible item IDs to"},"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.06569","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-05-11T05:02:37Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"4d4c6938e14fa55ca60c12661bd1bcd07e1fc7e26584d3f5ce303f328117c7f4","abstract_canon_sha256":"0ff3e788b662f95fc571bb22f2aebd8f12f9fadbc5dc393f981a8c9796e031c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:16.371343Z","signature_b64":"FCPMGGKZucDT2QAm+aW7hWJqi5zhvaxBiaPlAciiHvjxZnYYlxHvxwa1ROnaNmyRuJtCWAMJPffEuR6HUoMwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"715bd1f827794c93e5cc087960b2b3a68958fcd849f6f8d6a3ad428c546033a9","last_reissued_at":"2026-07-05T06:54:16.370898Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:16.370898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Index Item IDs for Recommendation Foundation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Shuyuan Xu, Wenyue Hua, Yingqiang Ge, Yongfeng Zhang","submitted_at":"2023-05-11T05:02:37Z","abstract_excerpt":"Recommendation foundation model utilizes large language models (LLM) for recommendation by converting recommendation tasks into natural language tasks. It enables generative recommendation which directly generates the item(s) to recommend rather than calculating a ranking score for each and every candidate item as in traditional recommendation models, simplifying the recommendation pipeline from multi-stage filtering to single-stage filtering. To avoid generating excessively long text and hallucinated recommendations when deciding which item(s) to recommend, creating LLM-compatible item IDs to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.06569","kind":"arxiv","version":6},"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.06569/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.06569","created_at":"2026-07-05T06:54:16.370955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.06569v6","created_at":"2026-07-05T06:54:16.370955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.06569","created_at":"2026-07-05T06:54:16.370955+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFN5D6BHPFGJ","created_at":"2026-07-05T06:54:16.370955+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFN5D6BHPFGJHZOM","created_at":"2026-07-05T06:54:16.370955+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFN5D6BH","created_at":"2026-07-05T06:54:16.370955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13344","citing_title":"Full-Stack Optimized Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2","json":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2.json","graph_json":"https://pith.science/api/pith-number/OFN5D6BHPFGJHZOMBB4WBMVTU2/graph.json","events_json":"https://pith.science/api/pith-number/OFN5D6BHPFGJHZOMBB4WBMVTU2/events.json","paper":"https://pith.science/paper/OFN5D6BH"},"agent_actions":{"view_html":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2","download_json":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2.json","view_paper":"https://pith.science/paper/OFN5D6BH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.06569&json=true","fetch_graph":"https://pith.science/api/pith-number/OFN5D6BHPFGJHZOMBB4WBMVTU2/graph.json","fetch_events":"https://pith.science/api/pith-number/OFN5D6BHPFGJHZOMBB4WBMVTU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2/action/storage_attestation","attest_author":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2/action/author_attestation","sign_citation":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2/action/citation_signature","submit_replication":"https://pith.science/pith/OFN5D6BHPFGJHZOMBB4WBMVTU2/action/replication_record"}},"created_at":"2026-07-05T06:54:16.370955+00:00","updated_at":"2026-07-05T06:54:16.370955+00:00"}