{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BEWDQWAZL3LOUC2H2DG7ASBTCA","short_pith_number":"pith:BEWDQWAZ","canonical_record":{"source":{"id":"1903.04489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-11T14:18:43Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5a31dbad12f8b3d86bf411d91de12ee8c71d17e465d4f2832468e662cce72d86","abstract_canon_sha256":"c4123f0defcdb07f06afd148311cef363099ddb89bdb4a7d305f7d0eca254456"},"schema_version":"1.0"},"canonical_sha256":"092c3858195ed6ea0b47d0cdf04833102adc992037867a2f9c5c8d3c5473417a","source":{"kind":"arxiv","id":"1903.04489","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04489","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04489v1","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04489","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"BEWDQWAZL3LO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BEWDQWAZL3LOUC2H","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BEWDQWAZ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BEWDQWAZL3LOUC2H2DG7ASBTCA","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-11T14:18:43Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5a31dbad12f8b3d86bf411d91de12ee8c71d17e465d4f2832468e662cce72d86","abstract_canon_sha256":"c4123f0defcdb07f06afd148311cef363099ddb89bdb4a7d305f7d0eca254456"},"schema_version":"1.0"},"canonical_sha256":"092c3858195ed6ea0b47d0cdf04833102adc992037867a2f9c5c8d3c5473417a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:29.454829Z","signature_b64":"nVvBGpXycrl3nDVSR3+UawqBCvyI5Fxr0TsHotg/IMFLxXodTOYR6GcUAWnk62hwiEg1FqdffhIgNMagXTPjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"092c3858195ed6ea0b47d0cdf04833102adc992037867a2f9c5c8d3c5473417a","last_reissued_at":"2026-05-17T23:51:29.454472Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:29.454472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04489","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-17T23:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i8cCz5umvJpvS3pqDta4/J4ggrlj/+6G6J2bp4v4zTVhjx6lZ6DIe+I3nkd1EVQbFp2nkMRVEYm4043PLNRIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:31:26.542086Z"},"content_sha256":"0d60a566276cd899b79c6c1e43d8337618b0599ec7f48ce53ef36ecc1674199b","schema_version":"1.0","event_id":"sha256:0d60a566276cd899b79c6c1e43d8337618b0599ec7f48ce53ef36ecc1674199b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BEWDQWAZL3LOUC2H2DG7ASBTCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SPMF: A Social Trust and Preference Segmentation-based Matrix Factorization Recommendation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Baogui Xin, Wei Peng","submitted_at":"2019-03-11T14:18:43Z","abstract_excerpt":"The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be limited to specific areas. A social trust and preference segmentation-based matrix factorization (SPMF) recommendation system is proposed to solve the above-mentioned problems. Experimental results based on the Ciao and Epinions datasets show that the accuracy of the SPMF algorithm is significantly higher than that of some state-of-the-art recommendation algorithms. The proposed S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04489","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-17T23:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRcHeWVBWqRw6fTIMSP4iymMwcNgZoKLkwz25bcNwQybBMBBtWpQV5xtXH2r89tUNFijYy+e/KS4KUOnopqFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:31:26.542460Z"},"content_sha256":"082f235079f43344a8958a62f27f7d9da825bbee52525587f92efbad086899dc","schema_version":"1.0","event_id":"sha256:082f235079f43344a8958a62f27f7d9da825bbee52525587f92efbad086899dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEWDQWAZL3LOUC2H2DG7ASBTCA/bundle.json","state_url":"https://pith.science/pith/BEWDQWAZL3LOUC2H2DG7ASBTCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEWDQWAZL3LOUC2H2DG7ASBTCA/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-06-03T01:31:26Z","links":{"resolver":"https://pith.science/pith/BEWDQWAZL3LOUC2H2DG7ASBTCA","bundle":"https://pith.science/pith/BEWDQWAZL3LOUC2H2DG7ASBTCA/bundle.json","state":"https://pith.science/pith/BEWDQWAZL3LOUC2H2DG7ASBTCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEWDQWAZL3LOUC2H2DG7ASBTCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BEWDQWAZL3LOUC2H2DG7ASBTCA","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":"c4123f0defcdb07f06afd148311cef363099ddb89bdb4a7d305f7d0eca254456","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-11T14:18:43Z","title_canon_sha256":"5a31dbad12f8b3d86bf411d91de12ee8c71d17e465d4f2832468e662cce72d86"},"schema_version":"1.0","source":{"id":"1903.04489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04489","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04489v1","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04489","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"BEWDQWAZL3LO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BEWDQWAZL3LOUC2H","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BEWDQWAZ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:082f235079f43344a8958a62f27f7d9da825bbee52525587f92efbad086899dc","target":"graph","created_at":"2026-05-17T23:51:29Z","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":"The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be limited to specific areas. A social trust and preference segmentation-based matrix factorization (SPMF) recommendation system is proposed to solve the above-mentioned problems. Experimental results based on the Ciao and Epinions datasets show that the accuracy of the SPMF algorithm is significantly higher than that of some state-of-the-art recommendation algorithms. The proposed S","authors_text":"Baogui Xin, Wei Peng","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-11T14:18:43Z","title":"SPMF: A Social Trust and Preference Segmentation-based Matrix Factorization Recommendation Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04489","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:0d60a566276cd899b79c6c1e43d8337618b0599ec7f48ce53ef36ecc1674199b","target":"record","created_at":"2026-05-17T23:51:29Z","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":"c4123f0defcdb07f06afd148311cef363099ddb89bdb4a7d305f7d0eca254456","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-11T14:18:43Z","title_canon_sha256":"5a31dbad12f8b3d86bf411d91de12ee8c71d17e465d4f2832468e662cce72d86"},"schema_version":"1.0","source":{"id":"1903.04489","kind":"arxiv","version":1}},"canonical_sha256":"092c3858195ed6ea0b47d0cdf04833102adc992037867a2f9c5c8d3c5473417a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"092c3858195ed6ea0b47d0cdf04833102adc992037867a2f9c5c8d3c5473417a","first_computed_at":"2026-05-17T23:51:29.454472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:29.454472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nVvBGpXycrl3nDVSR3+UawqBCvyI5Fxr0TsHotg/IMFLxXodTOYR6GcUAWnk62hwiEg1FqdffhIgNMagXTPjCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:29.454829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d60a566276cd899b79c6c1e43d8337618b0599ec7f48ce53ef36ecc1674199b","sha256:082f235079f43344a8958a62f27f7d9da825bbee52525587f92efbad086899dc"],"state_sha256":"9d92200bd5a7ce276f536c5f04dcbc345e656aae51ffe8f4b5fb6b09ca60acc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+gAzBpt3BuqdzCFa95jZIH/NuuANusaExbIPshunI4N3+x6S3bfqw7tJ79QkMgc7DzfiqgZZMrha47VkEGpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:31:26.544676Z","bundle_sha256":"582d277878b903c4777010850449bf2e55646534b2fdc7d680cdca6deff989ac"}}