{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6KDWVVDVGHSIKLUNIIA5IJCDC4","short_pith_number":"pith:6KDWVVDV","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"},"canonical_sha256":"f2876ad47531e4852e8d4201d42443170447af3214c49e46efb0dfbf32e893af","source":{"kind":"arxiv","id":"1708.04497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04497","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04497v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04497","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"6KDWVVDVGHSI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KDWVVDVGHSIKLUN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KDWVVDV","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6KDWVVDVGHSIKLUNIIA5IJCDC4","target":"record","payload":{"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"},"canonical_sha256":"f2876ad47531e4852e8d4201d42443170447af3214c49e46efb0dfbf32e893af","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"},"source_kind":"arxiv","source_id":"1708.04497","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ZYUKpjHGagpqHPHh3hO3/1KpOjOiS3iiLd1MoMMThROToo32wS8n7X/IPBnsPLMUKGEZnWuHkt+MSr9g685DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:10:41.816475Z"},"content_sha256":"4be30c8e053b9efdc278dad7f7a3f4f154ffed2e7861643b668d0ee48e2888ca","schema_version":"1.0","event_id":"sha256:4be30c8e053b9efdc278dad7f7a3f4f154ffed2e7861643b668d0ee48e2888ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6KDWVVDVGHSIKLUNIIA5IJCDC4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54XoDnKnYyff0/e5TTyWBybssQvTBovVZ1dNAHbshDsLiJ8AbdFC5UXv7TnMbHVR4wd0Rw/+hhYxvY/trDH0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:10:41.817028Z"},"content_sha256":"a42b905c82c60acdcd618a1e2d98421baadffb5c9c7158d239083832a4c221cf","schema_version":"1.0","event_id":"sha256:a42b905c82c60acdcd618a1e2d98421baadffb5c9c7158d239083832a4c221cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/bundle.json","state_url":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T00:10:41Z","links":{"resolver":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4","bundle":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/bundle.json","state":"https://pith.science/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KDWVVDVGHSIKLUNIIA5IJCDC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6KDWVVDVGHSIKLUNIIA5IJCDC4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1922ad3ed29fc6be30c253c1129ee5364b98f66ff7837124dd564eec2cdeb84f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-16T20:17:28Z","title_canon_sha256":"986b0a8d13d92d673f20e0dd946852bf84c76b43aa3e0d25434f311bf329be2d"},"schema_version":"1.0","source":{"id":"1708.04497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04497","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04497v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04497","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"6KDWVVDVGHSI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KDWVVDVGHSIKLUN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KDWVVDV","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:a42b905c82c60acdcd618a1e2d98421baadffb5c9c7158d239083832a4c221cf","target":"graph","created_at":"2026-05-18T00:37:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Chenwei Cai, Julian McAuley, Ruining He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-16T20:17:28Z","title":"SPMC: Socially-Aware Personalized Markov Chains for Sparse Sequential Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04497","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4be30c8e053b9efdc278dad7f7a3f4f154ffed2e7861643b668d0ee48e2888ca","target":"record","created_at":"2026-05-18T00:37:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1922ad3ed29fc6be30c253c1129ee5364b98f66ff7837124dd564eec2cdeb84f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-16T20:17:28Z","title_canon_sha256":"986b0a8d13d92d673f20e0dd946852bf84c76b43aa3e0d25434f311bf329be2d"},"schema_version":"1.0","source":{"id":"1708.04497","kind":"arxiv","version":1}},"canonical_sha256":"f2876ad47531e4852e8d4201d42443170447af3214c49e46efb0dfbf32e893af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2876ad47531e4852e8d4201d42443170447af3214c49e46efb0dfbf32e893af","first_computed_at":"2026-05-18T00:37:59.161354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:59.161354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A9xi5RGP9pUgz1mTzZYCrfuaYgP/EhEktC0X3AokURK7HIL6ls2f8CTU/Vp+Grph/71coMQPH7JCa15kwhaXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:59.161792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4be30c8e053b9efdc278dad7f7a3f4f154ffed2e7861643b668d0ee48e2888ca","sha256:a42b905c82c60acdcd618a1e2d98421baadffb5c9c7158d239083832a4c221cf"],"state_sha256":"268af3163c69f916451464259a7faca6e98c42fe75f48f8d0908341359067b93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UlNkY9Hicu6IMOK0A6kjL48T5JfucbmBhIB03vQcuVEkFHSMy7YD4HDaH2SWXo+T76+zit2nRgsbsHPPrytbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:10:41.819629Z","bundle_sha256":"e0bad87cdeec1a4e4654fc94ab393173320ba30406e0bd2791466edb8af198ed"}}