{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y4QJLEZ73PWEUEYP43JMUZ2WPB","short_pith_number":"pith:Y4QJLEZ7","schema_version":"1.0","canonical_sha256":"c72095933fdbec4a130fe6d2ca67567852f9a63d5b6af353cd3efc03613eedd0","source":{"kind":"arxiv","id":"1905.01997","version":3},"attestation_state":"computed","paper":{"title":"Deep Learning for Sequential Recommendation: Algorithms, Influential Factors, and Evaluations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Danning Zhang, Guibing Guo, Hui Fang, Yiheng Shu","submitted_at":"2019-04-30T03:13:50Z","abstract_excerpt":"In the field of sequential recommendation, deep learning (DL)-based methods have received a lot of attention in the past few years and surpassed traditional models such as Markov chain-based and factorization-based ones. However, there is little systematic study on DL-based methods, especially regarding to how to design an effective DL model for sequential recommendation. In this view, this survey focuses on DL-based sequential recommender systems by taking the aforementioned issues into consideration. Specifically,we illustrate the concept of sequential recommendation, propose a categorizatio"},"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":"1905.01997","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-30T03:13:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e74c5e13da16bc9fa5c14381f389bb7a564c8609fcebbac41c55578a58c2bc37","abstract_canon_sha256":"415192340bd9af5036be70de024e826f40603360cf4bd82be53f99171bed1916"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:48.077792Z","signature_b64":"zaO/HZSreyxsNFxoOATc1RR/fIsUjIVnl70EPYQKpBS2VAHQMslKpt6hrKeEgRAN/XsQARPcJmI+FO6Uhuc0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c72095933fdbec4a130fe6d2ca67567852f9a63d5b6af353cd3efc03613eedd0","last_reissued_at":"2026-07-05T01:41:48.077442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:48.077442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning for Sequential Recommendation: Algorithms, Influential Factors, and Evaluations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Danning Zhang, Guibing Guo, Hui Fang, Yiheng Shu","submitted_at":"2019-04-30T03:13:50Z","abstract_excerpt":"In the field of sequential recommendation, deep learning (DL)-based methods have received a lot of attention in the past few years and surpassed traditional models such as Markov chain-based and factorization-based ones. However, there is little systematic study on DL-based methods, especially regarding to how to design an effective DL model for sequential recommendation. In this view, this survey focuses on DL-based sequential recommender systems by taking the aforementioned issues into consideration. Specifically,we illustrate the concept of sequential recommendation, propose a categorizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01997","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/1905.01997/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":"1905.01997","created_at":"2026-07-05T01:41:48.077500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01997v3","created_at":"2026-07-05T01:41:48.077500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01997","created_at":"2026-07-05T01:41:48.077500+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4QJLEZ73PWE","created_at":"2026-07-05T01:41:48.077500+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4QJLEZ73PWEUEYP","created_at":"2026-07-05T01:41:48.077500+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4QJLEZ7","created_at":"2026-07-05T01:41:48.077500+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":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB","json":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB.json","graph_json":"https://pith.science/api/pith-number/Y4QJLEZ73PWEUEYP43JMUZ2WPB/graph.json","events_json":"https://pith.science/api/pith-number/Y4QJLEZ73PWEUEYP43JMUZ2WPB/events.json","paper":"https://pith.science/paper/Y4QJLEZ7"},"agent_actions":{"view_html":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB","download_json":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB.json","view_paper":"https://pith.science/paper/Y4QJLEZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01997&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4QJLEZ73PWEUEYP43JMUZ2WPB/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4QJLEZ73PWEUEYP43JMUZ2WPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB/action/storage_attestation","attest_author":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB/action/author_attestation","sign_citation":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB/action/citation_signature","submit_replication":"https://pith.science/pith/Y4QJLEZ73PWEUEYP43JMUZ2WPB/action/replication_record"}},"created_at":"2026-07-05T01:41:48.077500+00:00","updated_at":"2026-07-05T01:41:48.077500+00:00"}