{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R3BHYQOUT2MEL7ECAQ636EIW4W","short_pith_number":"pith:R3BHYQOU","canonical_record":{"source":{"id":"1603.04522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-03-15T01:41:11Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"26dd9f19d10c25df60ce433cf7c3e909bf4eb9accf312a452e1f59b937a4cd44","abstract_canon_sha256":"aa99adc3375ed0d9f8b983b7b80f125f63759e2be0ea366f024c95c9a38befbd"},"schema_version":"1.0"},"canonical_sha256":"8ec27c41d49e9845fc82043dbf1116e5a385d71f485e233d6f26e99b20c69541","source":{"kind":"arxiv","id":"1603.04522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04522","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04522v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04522","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"R3BHYQOUT2ME","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R3BHYQOUT2MEL7EC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R3BHYQOU","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R3BHYQOUT2MEL7ECAQ636EIW4W","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-03-15T01:41:11Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"26dd9f19d10c25df60ce433cf7c3e909bf4eb9accf312a452e1f59b937a4cd44","abstract_canon_sha256":"aa99adc3375ed0d9f8b983b7b80f125f63759e2be0ea366f024c95c9a38befbd"},"schema_version":"1.0"},"canonical_sha256":"8ec27c41d49e9845fc82043dbf1116e5a385d71f485e233d6f26e99b20c69541","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:04.683460Z","signature_b64":"VhT2DzUSj9t72Z051sb/quOWz9PShnnyX+GmfPMElJOrNpwBPW6XvjDsbPkb4ZRUCCsvrEX2wZB4ybDPejd2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ec27c41d49e9845fc82043dbf1116e5a385d71f485e233d6f26e99b20c69541","last_reissued_at":"2026-05-18T01:19:04.682841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:04.682841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04522","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-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3BtIA9a0OO9kaezy+XTxO+EnGDJTHFs0ssD7ywxBEKUORq62OJWSqs5LRU50RRHCJBRGU8PUob+shV1WFDlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:32:29.891437Z"},"content_sha256":"42f4752a6012f849f2047195b1a79929965eb4162cc80b902ddbe856a24635a6","schema_version":"1.0","event_id":"sha256:42f4752a6012f849f2047195b1a79929965eb4162cc80b902ddbe856a24635a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R3BHYQOUT2MEL7ECAQ636EIW4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Optimal Social Dependency for Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Min Wu, Peilin Zhao, Xiao-Li Li, Xin Liu, Yong Liu","submitted_at":"2016-03-15T01:41:11Z","abstract_excerpt":"Social recommender systems exploit users' social relationships to improve the recommendation accuracy. Intuitively, a user tends to trust different subsets of her social friends, regarding with different scenarios. Therefore, the main challenge of social recommendation is to exploit the optimal social dependency between users for a specific recommendation task. In this paper, we propose a novel recommendation method, named probabilistic relational matrix factorization (PRMF), which aims to learn the optimal social dependency between users to improve the recommendation accuracy, with or without"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04522","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-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ougt1dHXVSMAuioQ9LkMIUV0rLlYr3lN7xmhcqkEprbmuYRzlU7q1cb5JuSyQTX2D64P1Z9LNvZtd5U/pST7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:32:29.891775Z"},"content_sha256":"0574fa101ea602c89ce9d2bb3097f2e7d21dd121ce5125d3ce4ac6acf90bff5e","schema_version":"1.0","event_id":"sha256:0574fa101ea602c89ce9d2bb3097f2e7d21dd121ce5125d3ce4ac6acf90bff5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3BHYQOUT2MEL7ECAQ636EIW4W/bundle.json","state_url":"https://pith.science/pith/R3BHYQOUT2MEL7ECAQ636EIW4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3BHYQOUT2MEL7ECAQ636EIW4W/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-28T10:32:29Z","links":{"resolver":"https://pith.science/pith/R3BHYQOUT2MEL7ECAQ636EIW4W","bundle":"https://pith.science/pith/R3BHYQOUT2MEL7ECAQ636EIW4W/bundle.json","state":"https://pith.science/pith/R3BHYQOUT2MEL7ECAQ636EIW4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3BHYQOUT2MEL7ECAQ636EIW4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R3BHYQOUT2MEL7ECAQ636EIW4W","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":"aa99adc3375ed0d9f8b983b7b80f125f63759e2be0ea366f024c95c9a38befbd","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-03-15T01:41:11Z","title_canon_sha256":"26dd9f19d10c25df60ce433cf7c3e909bf4eb9accf312a452e1f59b937a4cd44"},"schema_version":"1.0","source":{"id":"1603.04522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04522","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04522v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04522","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"R3BHYQOUT2ME","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R3BHYQOUT2MEL7EC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R3BHYQOU","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:0574fa101ea602c89ce9d2bb3097f2e7d21dd121ce5125d3ce4ac6acf90bff5e","target":"graph","created_at":"2026-05-18T01:19:04Z","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":"Social recommender systems exploit users' social relationships to improve the recommendation accuracy. Intuitively, a user tends to trust different subsets of her social friends, regarding with different scenarios. Therefore, the main challenge of social recommendation is to exploit the optimal social dependency between users for a specific recommendation task. In this paper, we propose a novel recommendation method, named probabilistic relational matrix factorization (PRMF), which aims to learn the optimal social dependency between users to improve the recommendation accuracy, with or without","authors_text":"Min Wu, Peilin Zhao, Xiao-Li Li, Xin Liu, Yong Liu","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-03-15T01:41:11Z","title":"Learning Optimal Social Dependency for Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04522","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:42f4752a6012f849f2047195b1a79929965eb4162cc80b902ddbe856a24635a6","target":"record","created_at":"2026-05-18T01:19:04Z","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":"aa99adc3375ed0d9f8b983b7b80f125f63759e2be0ea366f024c95c9a38befbd","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-03-15T01:41:11Z","title_canon_sha256":"26dd9f19d10c25df60ce433cf7c3e909bf4eb9accf312a452e1f59b937a4cd44"},"schema_version":"1.0","source":{"id":"1603.04522","kind":"arxiv","version":1}},"canonical_sha256":"8ec27c41d49e9845fc82043dbf1116e5a385d71f485e233d6f26e99b20c69541","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ec27c41d49e9845fc82043dbf1116e5a385d71f485e233d6f26e99b20c69541","first_computed_at":"2026-05-18T01:19:04.682841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:04.682841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhT2DzUSj9t72Z051sb/quOWz9PShnnyX+GmfPMElJOrNpwBPW6XvjDsbPkb4ZRUCCsvrEX2wZB4ybDPejd2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:04.683460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42f4752a6012f849f2047195b1a79929965eb4162cc80b902ddbe856a24635a6","sha256:0574fa101ea602c89ce9d2bb3097f2e7d21dd121ce5125d3ce4ac6acf90bff5e"],"state_sha256":"faad6e82584ae9ad5cf0dd48a5ec154a0d8bb5e4dd492f619d037f98c43b92cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5D+mdEtfaKmIKeazewt/cx+wqofwfUn37seUg/qVziBcpwQ7H3x1Jwmk9TC5yrHlq59r1AYKxHll9S2qjSluDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:32:29.893726Z","bundle_sha256":"921db17f952dff954f631bbda3193aba42882952de7faa6793e997ba2536c41f"}}