{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4SPNMOFM3QICRVYMXCKRT4OCGC","short_pith_number":"pith:4SPNMOFM","schema_version":"1.0","canonical_sha256":"e49ed638acdc1028d70cb89519f1c230b73245f9731325b547bf8eeb66e5e234","source":{"kind":"arxiv","id":"1609.09152","version":1},"attestation_state":"computed","paper":{"title":"Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Julian McAuley, Ruining He","submitted_at":"2016-09-28T23:09:24Z","abstract_excerpt":"Predicting personalized sequential behavior is a key task for recommender systems. In order to predict user actions such as the next product to purchase, movie to watch, or place to visit, it is essential to take into account both long-term user preferences and sequential patterns (i.e., short-term dynamics). Matrix Factorization and Markov Chain methods have emerged as two separate but powerful paradigms for modeling the two respectively. Combining these ideas has led to unified methods that accommodate long- and short-term dynamics simultaneously by modeling pairwise user-item and item-item "},"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":"1609.09152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-09-28T23:09:24Z","cross_cats_sorted":[],"title_canon_sha256":"581cf66256699e88eaf1291ffb472d45740db1f8baab198f0f206c588655d0a4","abstract_canon_sha256":"0babe2fd984ea9dc539a8d33df4a83d3524033ca6fa7ff34941490015097b98f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:40.129539Z","signature_b64":"cn7Jg5WWChj2p2kpWPgtnNrmf3VlFJ+PBxijYdR3k9ANTybMpu6omP9p5V9LzojHv3kbplkLCpQoofkh/RFdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e49ed638acdc1028d70cb89519f1c230b73245f9731325b547bf8eeb66e5e234","last_reissued_at":"2026-05-18T01:03:40.128984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:40.128984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Julian McAuley, Ruining He","submitted_at":"2016-09-28T23:09:24Z","abstract_excerpt":"Predicting personalized sequential behavior is a key task for recommender systems. In order to predict user actions such as the next product to purchase, movie to watch, or place to visit, it is essential to take into account both long-term user preferences and sequential patterns (i.e., short-term dynamics). Matrix Factorization and Markov Chain methods have emerged as two separate but powerful paradigms for modeling the two respectively. Combining these ideas has led to unified methods that accommodate long- and short-term dynamics simultaneously by modeling pairwise user-item and item-item "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09152","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":"1609.09152","created_at":"2026-05-18T01:03:40.129070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09152v1","created_at":"2026-05-18T01:03:40.129070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09152","created_at":"2026-05-18T01:03:40.129070+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SPNMOFM3QIC","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SPNMOFM3QICRVYM","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SPNMOFM","created_at":"2026-05-18T12:29:58.707656+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/4SPNMOFM3QICRVYMXCKRT4OCGC","json":"https://pith.science/pith/4SPNMOFM3QICRVYMXCKRT4OCGC.json","graph_json":"https://pith.science/api/pith-number/4SPNMOFM3QICRVYMXCKRT4OCGC/graph.json","events_json":"https://pith.science/api/pith-number/4SPNMOFM3QICRVYMXCKRT4OCGC/events.json","paper":"https://pith.science/paper/4SPNMOFM"},"agent_actions":{"view_html":"https://pith.science/pith/4SPNMOFM3QICRVYMXCKRT4OCGC","download_json":"https://pith.science/pith/4SPNMOFM3QICRVYMXCKRT4OCGC.json","view_paper":"https://pith.science/paper/4SPNMOFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09152&json=true","fetch_graph":"https://pith.science/api/pith-number/4SPNMOFM3QICRVYMXCKRT4OCGC/graph.json","fetch_events":"https://pith.science/api/pith-number/4SPNMOFM3QICRVYMXCKRT4OCGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SPNMOFM3QICRVYMXCKRT4OCGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SPNMOFM3QICRVYMXCKRT4OCGC/action/storage_attestation","attest_author":"https://pith.science/pith/4SPNMOFM3QICRVYMXCKRT4OCGC/action/author_attestation","sign_citation":"https://pith.science/pith/4SPNMOFM3QICRVYMXCKRT4OCGC/action/citation_signature","submit_replication":"https://pith.science/pith/4SPNMOFM3QICRVYMXCKRT4OCGC/action/replication_record"}},"created_at":"2026-05-18T01:03:40.129070+00:00","updated_at":"2026-05-18T01:03:40.129070+00:00"}