{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5EZ5L3DVUILJ5NJLHZ7R6CHRGX","short_pith_number":"pith:5EZ5L3DV","schema_version":"1.0","canonical_sha256":"e933d5ec75a2169eb52b3e7f1f08f135cd83091dbc8f305d3adde32796d73152","source":{"kind":"arxiv","id":"2306.11114","version":1},"attestation_state":"computed","paper":{"title":"Generative Sequential Recommendation with GPTRec","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Aleksandr V. Petrov, Craig Macdonald","submitted_at":"2023-06-19T18:27:54Z","abstract_excerpt":"Sequential recommendation is an important recommendation task that aims to predict the next item in a sequence. Recently, adaptations of language models, particularly Transformer-based models such as SASRec and BERT4Rec, have achieved state-of-the-art results in sequential recommendation. In these models, item ids replace tokens in the original language models. However, this approach has limitations. First, the vocabulary of item ids may be many times larger than in language models. Second, the classical Top-K recommendation approach used by these models may not be optimal for complex recommen"},"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":"2306.11114","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-06-19T18:27:54Z","cross_cats_sorted":[],"title_canon_sha256":"34f213d4af7f469c00a0c59058db2fbefea752bd21af18a99b2caf3d74cb4664","abstract_canon_sha256":"a71e7151eb8e66028dcab08c70fd08130842b233350578ef24f3f5da2afe33fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:22:16.201969Z","signature_b64":"GvceUN/enaJEP/N7NvftdtrJ91WBSaS4PfbaaRK0hKGCo8PKCkJDN1TWrpEGFjQTnxJyMltcvALTdpOtt8YiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e933d5ec75a2169eb52b3e7f1f08f135cd83091dbc8f305d3adde32796d73152","last_reissued_at":"2026-07-05T06:22:16.201569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:22:16.201569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Sequential Recommendation with GPTRec","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Aleksandr V. Petrov, Craig Macdonald","submitted_at":"2023-06-19T18:27:54Z","abstract_excerpt":"Sequential recommendation is an important recommendation task that aims to predict the next item in a sequence. Recently, adaptations of language models, particularly Transformer-based models such as SASRec and BERT4Rec, have achieved state-of-the-art results in sequential recommendation. In these models, item ids replace tokens in the original language models. However, this approach has limitations. First, the vocabulary of item ids may be many times larger than in language models. Second, the classical Top-K recommendation approach used by these models may not be optimal for complex recommen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11114","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/2306.11114/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":"2306.11114","created_at":"2026-07-05T06:22:16.201624+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.11114v1","created_at":"2026-07-05T06:22:16.201624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11114","created_at":"2026-07-05T06:22:16.201624+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EZ5L3DVUILJ","created_at":"2026-07-05T06:22:16.201624+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EZ5L3DVUILJ5NJL","created_at":"2026-07-05T06:22:16.201624+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EZ5L3DV","created_at":"2026-07-05T06:22:16.201624+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.13648","citing_title":"Sequential Data Augmentation for Generative Recommendation","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17779","citing_title":"Learning Variable-Length Tokenization for Generative Recommendation","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15905","citing_title":"Generative Long-term User Interest Modeling for Click-Through Rate Prediction","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2510.21242","citing_title":"Bi-Level Optimization for Generative Recommendation: Bridging Tokenization and Generation","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12617","citing_title":"MLPs are Efficient Distilled Generative Recommenders","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11582","citing_title":"Efficient LLM-based Advertising via Model Compression and Parallel Verification","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07894","citing_title":"TSUBASA: Improving Long-Horizon Personalization via Evolving Memory and Self-Learning with Context Distillation","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13389","citing_title":"RoTE: Coarse-to-Fine Multi-Level Rotary Time Embedding for Sequential Recommendation","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX","json":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX.json","graph_json":"https://pith.science/api/pith-number/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/graph.json","events_json":"https://pith.science/api/pith-number/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/events.json","paper":"https://pith.science/paper/5EZ5L3DV"},"agent_actions":{"view_html":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX","download_json":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX.json","view_paper":"https://pith.science/paper/5EZ5L3DV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.11114&json=true","fetch_graph":"https://pith.science/api/pith-number/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/graph.json","fetch_events":"https://pith.science/api/pith-number/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/action/storage_attestation","attest_author":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/action/author_attestation","sign_citation":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/action/citation_signature","submit_replication":"https://pith.science/pith/5EZ5L3DVUILJ5NJLHZ7R6CHRGX/action/replication_record"}},"created_at":"2026-07-05T06:22:16.201624+00:00","updated_at":"2026-07-05T06:22:16.201624+00:00"}