{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MKHEV3G5TAL7CBABHEPNQFXZF7","short_pith_number":"pith:MKHEV3G5","schema_version":"1.0","canonical_sha256":"628e4aecdd9817f10401391ed816f92fcc61d30ac65a0c7fbb88789a6517e61d","source":{"kind":"arxiv","id":"1809.07426","version":1},"attestation_state":"computed","paper":{"title":"Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Jiaxi Tang, Ke Wang","submitted_at":"2018-09-19T23:13:57Z","abstract_excerpt":"Top-$N$ sequential recommendation models each user as a sequence of items interacted in the past and aims to predict top-$N$ ranked items that a user will likely interact in a `near future'. The order of interaction implies that sequential patterns play an important role where more recent items in a sequence have a larger impact on the next item. In this paper, we propose a Convolutional Sequence Embedding Recommendation Model (\\emph{Caser}) as a solution to address this requirement. The idea is to embed a sequence of recent items into an `image' in the time and latent spaces and learn sequent"},"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":"1809.07426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-19T23:13:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"be8a1353b4d7e43bdf57faa67a10520761e33e3d700bcd67310318e9aaefaac2","abstract_canon_sha256":"b0897a9c51dbadcc4e04c39db83a1cf090acd9129937af934d590f990ecc4478"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:16.364524Z","signature_b64":"5jrhGYmkEuyMiRu0V82Wm3czjwPR+hKP36kk4Gs1jPSU9/VDau7zxCKKmLsE1t16OnPhGojMkNG65zAZEA+NAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"628e4aecdd9817f10401391ed816f92fcc61d30ac65a0c7fbb88789a6517e61d","last_reissued_at":"2026-05-18T00:05:16.363936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:16.363936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Jiaxi Tang, Ke Wang","submitted_at":"2018-09-19T23:13:57Z","abstract_excerpt":"Top-$N$ sequential recommendation models each user as a sequence of items interacted in the past and aims to predict top-$N$ ranked items that a user will likely interact in a `near future'. The order of interaction implies that sequential patterns play an important role where more recent items in a sequence have a larger impact on the next item. In this paper, we propose a Convolutional Sequence Embedding Recommendation Model (\\emph{Caser}) as a solution to address this requirement. The idea is to embed a sequence of recent items into an `image' in the time and latent spaces and learn sequent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07426","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":""},"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":"1809.07426","created_at":"2026-05-18T00:05:16.364017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07426v1","created_at":"2026-05-18T00:05:16.364017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07426","created_at":"2026-05-18T00:05:16.364017+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKHEV3G5TAL7","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKHEV3G5TAL7CBAB","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKHEV3G5","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7","json":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7.json","graph_json":"https://pith.science/api/pith-number/MKHEV3G5TAL7CBABHEPNQFXZF7/graph.json","events_json":"https://pith.science/api/pith-number/MKHEV3G5TAL7CBABHEPNQFXZF7/events.json","paper":"https://pith.science/paper/MKHEV3G5"},"agent_actions":{"view_html":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7","download_json":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7.json","view_paper":"https://pith.science/paper/MKHEV3G5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07426&json=true","fetch_graph":"https://pith.science/api/pith-number/MKHEV3G5TAL7CBABHEPNQFXZF7/graph.json","fetch_events":"https://pith.science/api/pith-number/MKHEV3G5TAL7CBABHEPNQFXZF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7/action/storage_attestation","attest_author":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7/action/author_attestation","sign_citation":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7/action/citation_signature","submit_replication":"https://pith.science/pith/MKHEV3G5TAL7CBABHEPNQFXZF7/action/replication_record"}},"created_at":"2026-05-18T00:05:16.364017+00:00","updated_at":"2026-05-18T00:05:16.364017+00:00"}