{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FY2BFVPJAPHQYHV24VUMNTGZQM","short_pith_number":"pith:FY2BFVPJ","canonical_record":{"source":{"id":"2012.03433","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-12-07T03:05:47Z","cross_cats_sorted":[],"title_canon_sha256":"0f6bd4b2d0d887be9ad3f37d93025c5f85f18ab7217aac995a4715e73fe13cd1","abstract_canon_sha256":"a43ac6437bf48f4a50176b3a1cf9a564fdfd8e6aa88ce912491da8e3d79281fd"},"schema_version":"1.0"},"canonical_sha256":"2e3412d5e903cf0c1ebae568c6ccd983316e309d41b361450ef960b2c24bd252","source":{"kind":"arxiv","id":"2012.03433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.03433","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"2012.03433v1","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.03433","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"FY2BFVPJAPHQ","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"pith_short_16","alias_value":"FY2BFVPJAPHQYHV2","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"pith_short_8","alias_value":"FY2BFVPJ","created_at":"2026-07-05T02:41:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FY2BFVPJAPHQYHV24VUMNTGZQM","target":"record","payload":{"canonical_record":{"source":{"id":"2012.03433","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-12-07T03:05:47Z","cross_cats_sorted":[],"title_canon_sha256":"0f6bd4b2d0d887be9ad3f37d93025c5f85f18ab7217aac995a4715e73fe13cd1","abstract_canon_sha256":"a43ac6437bf48f4a50176b3a1cf9a564fdfd8e6aa88ce912491da8e3d79281fd"},"schema_version":"1.0"},"canonical_sha256":"2e3412d5e903cf0c1ebae568c6ccd983316e309d41b361450ef960b2c24bd252","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:09.668328Z","signature_b64":"HxVk6fbr54T7CRf1p8oIZ9vX+K6YPYbB0BrvLz/C3aNFay3EpNa26JSpe6m/xK7XP3KmH5OvRTt5sRzmLPy4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e3412d5e903cf0c1ebae568c6ccd983316e309d41b361450ef960b2c24bd252","last_reissued_at":"2026-07-05T02:41:09.667872Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:09.667872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.03433","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-07-05T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBSJNH/10RxxWz2/GmItPDwn7Ht3LuS9ku6dyQofy+VisGJrCCJU+tjKstaX61jdzeSrZj1IWuE4peuZsoHxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:23:42.005281Z"},"content_sha256":"32794a0ac32d8ce4d9a48505feae997a682e7c1a3a4e1c119678e0d3a3e9652f","schema_version":"1.0","event_id":"sha256:32794a0ac32d8ce4d9a48505feae997a682e7c1a3a4e1c119678e0d3a3e9652f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FY2BFVPJAPHQYHV24VUMNTGZQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Latent Factor Model for Collaborative Filtering with Bayesian Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jiang Liu, Jiansheng Fang, Ming Yang, Xiaoqing Zhang, Yan Hu, Yanwu Xu","submitted_at":"2020-12-07T03:05:47Z","abstract_excerpt":"Latent Factor Model (LFM) is one of the most successful methods for Collaborative filtering (CF) in the recommendation system, in which both users and items are projected into a joint latent factor space. Base on matrix factorization applied usually in pattern recognition, LFM models user-item interactions as inner products of factor vectors of user and item in that space and can be efficiently solved by least square methods with optimal estimation. However, such optimal estimation methods are prone to overfitting due to the extreme sparsity of user-item interactions. In this paper, we propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.03433","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.03433/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqNcDqcYYO3vSnWKJy6eXm4ssJkTbY2sZNcb5sMM553Ii73dqNzJYDcIVqCQA86flO74ErlzPfNX4Et05LAVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:23:42.006194Z"},"content_sha256":"5f25622d041b291f25b98ec1b81c3e4df8463d18366ebd1c6f3c8785c176a94c","schema_version":"1.0","event_id":"sha256:5f25622d041b291f25b98ec1b81c3e4df8463d18366ebd1c6f3c8785c176a94c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FY2BFVPJAPHQYHV24VUMNTGZQM/bundle.json","state_url":"https://pith.science/pith/FY2BFVPJAPHQYHV24VUMNTGZQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FY2BFVPJAPHQYHV24VUMNTGZQM/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-08-04T05:23:42Z","links":{"resolver":"https://pith.science/pith/FY2BFVPJAPHQYHV24VUMNTGZQM","bundle":"https://pith.science/pith/FY2BFVPJAPHQYHV24VUMNTGZQM/bundle.json","state":"https://pith.science/pith/FY2BFVPJAPHQYHV24VUMNTGZQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FY2BFVPJAPHQYHV24VUMNTGZQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FY2BFVPJAPHQYHV24VUMNTGZQM","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":"a43ac6437bf48f4a50176b3a1cf9a564fdfd8e6aa88ce912491da8e3d79281fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-12-07T03:05:47Z","title_canon_sha256":"0f6bd4b2d0d887be9ad3f37d93025c5f85f18ab7217aac995a4715e73fe13cd1"},"schema_version":"1.0","source":{"id":"2012.03433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.03433","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"2012.03433v1","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.03433","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"FY2BFVPJAPHQ","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"pith_short_16","alias_value":"FY2BFVPJAPHQYHV2","created_at":"2026-07-05T02:41:09Z"},{"alias_kind":"pith_short_8","alias_value":"FY2BFVPJ","created_at":"2026-07-05T02:41:09Z"}],"graph_snapshots":[{"event_id":"sha256:5f25622d041b291f25b98ec1b81c3e4df8463d18366ebd1c6f3c8785c176a94c","target":"graph","created_at":"2026-07-05T02:41:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.03433/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Latent Factor Model (LFM) is one of the most successful methods for Collaborative filtering (CF) in the recommendation system, in which both users and items are projected into a joint latent factor space. Base on matrix factorization applied usually in pattern recognition, LFM models user-item interactions as inner products of factor vectors of user and item in that space and can be efficiently solved by least square methods with optimal estimation. However, such optimal estimation methods are prone to overfitting due to the extreme sparsity of user-item interactions. In this paper, we propose","authors_text":"Jiang Liu, Jiansheng Fang, Ming Yang, Xiaoqing Zhang, Yan Hu, Yanwu Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-12-07T03:05:47Z","title":"Probabilistic Latent Factor Model for Collaborative Filtering with Bayesian Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.03433","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:32794a0ac32d8ce4d9a48505feae997a682e7c1a3a4e1c119678e0d3a3e9652f","target":"record","created_at":"2026-07-05T02:41:09Z","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":"a43ac6437bf48f4a50176b3a1cf9a564fdfd8e6aa88ce912491da8e3d79281fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2020-12-07T03:05:47Z","title_canon_sha256":"0f6bd4b2d0d887be9ad3f37d93025c5f85f18ab7217aac995a4715e73fe13cd1"},"schema_version":"1.0","source":{"id":"2012.03433","kind":"arxiv","version":1}},"canonical_sha256":"2e3412d5e903cf0c1ebae568c6ccd983316e309d41b361450ef960b2c24bd252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e3412d5e903cf0c1ebae568c6ccd983316e309d41b361450ef960b2c24bd252","first_computed_at":"2026-07-05T02:41:09.667872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:41:09.667872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HxVk6fbr54T7CRf1p8oIZ9vX+K6YPYbB0BrvLz/C3aNFay3EpNa26JSpe6m/xK7XP3KmH5OvRTt5sRzmLPy4BA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:41:09.668328Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.03433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32794a0ac32d8ce4d9a48505feae997a682e7c1a3a4e1c119678e0d3a3e9652f","sha256:5f25622d041b291f25b98ec1b81c3e4df8463d18366ebd1c6f3c8785c176a94c"],"state_sha256":"79bc1293b6c27bb5e2ba8534cd495f2c8a7aca7dc50e6dbec5e6d749230932c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wFZFdxvHZnnh5jdoqBhg/uC4ZzJ34zfb2PjDUy+3fLUad3UHoPdp8aoeFXgsvCLfWIESCTCDjC8N8mWUaNeAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T05:23:42.012239Z","bundle_sha256":"9f9dc9a461c0e35f2e92efe47dfa3418cab0b284ea426bcaef8608c4b4e84b03"}}