{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NBEM2SMYJ3DYUFIX3H2Q6OL6WK","short_pith_number":"pith:NBEM2SMY","schema_version":"1.0","canonical_sha256":"6848cd49984ec78a1517d9f50f397eb2a36da010dcab9cf2ecf19ce7a3a27bd1","source":{"kind":"arxiv","id":"1808.05163","version":4},"attestation_state":"computed","paper":{"title":"A Simple Convolutional Generative Network for Next Item Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Alexandros Karatzoglou, Fajie Yuan, Ioannis Arapakis, Joemon M Jose, Xiangnan He","submitted_at":"2018-08-15T16:04:28Z","abstract_excerpt":"Convolutional Neural Networks (CNNs) have been recently introduced in the domain of session-based next item recommendation. An ordered collection of past items the user has interacted with in a session (or sequence) are embedded into a 2-dimensional latent matrix, and treated as an image. The convolution and pooling operations are then applied to the mapped item embeddings. In this paper, we first examine the typical session-based CNN recommender and show that both the generative model and network architecture are suboptimal when modeling long-range dependencies in the item sequence. To addres"},"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":"1808.05163","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-08-15T16:04:28Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fef35b1edf6309f8d3e0d45c2f369477f9c4c7e2c3e25e1d1b1731569dfe89d9","abstract_canon_sha256":"4940f3c5a0f3e8036dc25baa664ed5343731a8490f19bf1d712419d0244a7062"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:38.448313Z","signature_b64":"KSgpIAl9zHiLVGwE4JNBbeg2Ie6xJmL9kjSC6ztZFABRJdJpJZlQZNI7uthewBPwiMqlt/oLLYf9uZyWMtPGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6848cd49984ec78a1517d9f50f397eb2a36da010dcab9cf2ecf19ce7a3a27bd1","last_reissued_at":"2026-05-17T23:59:38.447589Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:38.447589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Convolutional Generative Network for Next Item Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Alexandros Karatzoglou, Fajie Yuan, Ioannis Arapakis, Joemon M Jose, Xiangnan He","submitted_at":"2018-08-15T16:04:28Z","abstract_excerpt":"Convolutional Neural Networks (CNNs) have been recently introduced in the domain of session-based next item recommendation. An ordered collection of past items the user has interacted with in a session (or sequence) are embedded into a 2-dimensional latent matrix, and treated as an image. The convolution and pooling operations are then applied to the mapped item embeddings. In this paper, we first examine the typical session-based CNN recommender and show that both the generative model and network architecture are suboptimal when modeling long-range dependencies in the item sequence. To addres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05163","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1808.05163","created_at":"2026-05-17T23:59:38.447716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05163v4","created_at":"2026-05-17T23:59:38.447716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05163","created_at":"2026-05-17T23:59:38.447716+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBEM2SMYJ3DY","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBEM2SMYJ3DYUFIX","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBEM2SMY","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.15724","citing_title":"Instruction-Based Fine-tuning of Open-Source LLMs for Predicting Customer Purchase Behaviors","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK","json":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK.json","graph_json":"https://pith.science/api/pith-number/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/graph.json","events_json":"https://pith.science/api/pith-number/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/events.json","paper":"https://pith.science/paper/NBEM2SMY"},"agent_actions":{"view_html":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK","download_json":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK.json","view_paper":"https://pith.science/paper/NBEM2SMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05163&json=true","fetch_graph":"https://pith.science/api/pith-number/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/graph.json","fetch_events":"https://pith.science/api/pith-number/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/action/storage_attestation","attest_author":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/action/author_attestation","sign_citation":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/action/citation_signature","submit_replication":"https://pith.science/pith/NBEM2SMYJ3DYUFIX3H2Q6OL6WK/action/replication_record"}},"created_at":"2026-05-17T23:59:38.447716+00:00","updated_at":"2026-05-17T23:59:38.447716+00:00"}