{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6KDWVVDVGHSIKLUNIIA5IJCDC4","short_pith_number":"pith:6KDWVVDV","schema_version":"1.0","canonical_sha256":"f2876ad47531e4852e8d4201d42443170447af3214c49e46efb0dfbf32e893af","source":{"kind":"arxiv","id":"1708.04497","version":1},"attestation_state":"computed","paper":{"title":"SPMC: Socially-Aware Personalized Markov Chains for Sparse Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chenwei Cai, Julian McAuley, Ruining He","submitted_at":"2017-06-16T20:17:28Z","abstract_excerpt":"Dealing with sparse, long-tailed datasets, and cold-start problems is always a challenge for recommender systems. These issues can partly be dealt with by making predictions not in isolation, but by leveraging information from related events; such information could include signals from social relationships or from the sequence of recent activities. Both types of additional information can be used to improve the performance of state-of-the-art matrix factorization-based techniques. In this paper, we propose new methods to combine both social and sequential information simultaneously, in order t"},"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":"1708.04497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-16T20:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"986b0a8d13d92d673f20e0dd946852bf84c76b43aa3e0d25434f311bf329be2d","abstract_canon_sha256":"1922ad3ed29fc6be30c253c1129ee5364b98f66ff7837124dd564eec2cdeb84f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.161792Z","signature_b64":"A9xi5RGP9pUgz1mTzZYCrfuaYgP/EhEktC0X3AokURK7HIL6ls2f8CTU/Vp+Grph/71coMQPH7JCa15kwhaXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2876ad47531e4852e8d4201d42443170447af3214c49e46efb0dfbf32e893af","last_reissued_at":"2026-05-18T00:37:59.161354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.161354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPMC: Socially-Aware Personalized Markov Chains for Sparse Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chenwei Cai, Julian McAuley, Ruining He","submitted_at":"2017-06-16T20:17:28Z","abstract_excerpt":"Dealing with sparse, long-tailed datasets, and cold-start problems is always a challenge for recommender systems. These issues can partly be dealt with by making predictions not in isolation, but by leveraging information from related events; such information could include signals from social relationships or from the sequence of recent activities. Both types of additional information can be used to improve the performance of state-of-the-art matrix factorization-based techniques. In this paper, we propose new methods to combine both social and sequential information simultaneously, in order t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04497","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":"1708.04497","created_at":"2026-05-18T00:37:59.161446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04497v1","created_at":"2026-05-18T00:37:59.161446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04497","created_at":"2026-05-18T00:37:59.161446+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KDWVVDVGHSI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KDWVVDVGHSIKLUN","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KDWVVDV","created_at":"2026-05-18T12:31:03.183658+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/6KDWVVDVGHSIKLUNIIA5IJCDC4","json":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4.json","graph_json":"https://pith.science/api/pith-number/6KDWVVDVGHSIKLUNIIA5IJCDC4/graph.json","events_json":"https://pith.science/api/pith-number/6KDWVVDVGHSIKLUNIIA5IJCDC4/events.json","paper":"https://pith.science/paper/6KDWVVDV"},"agent_actions":{"view_html":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4","download_json":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4.json","view_paper":"https://pith.science/paper/6KDWVVDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04497&json=true","fetch_graph":"https://pith.science/api/pith-number/6KDWVVDVGHSIKLUNIIA5IJCDC4/graph.json","fetch_events":"https://pith.science/api/pith-number/6KDWVVDVGHSIKLUNIIA5IJCDC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/action/storage_attestation","attest_author":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/action/author_attestation","sign_citation":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/action/citation_signature","submit_replication":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/action/replication_record"}},"created_at":"2026-05-18T00:37:59.161446+00:00","updated_at":"2026-05-18T00:37:59.161446+00:00"}