{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:D4RCRGUSQPWGZRFWED3V2DIPSG","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":"ecaf73ba028810b79e85097b7c457640cec55bce38bc940452f24725567afca1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-25T21:21:18Z","title_canon_sha256":"3116a6ef44409ea7cf8d0c616ff8994a165dde4a084fdacd9003f358d8523c07"},"schema_version":"1.0","source":{"id":"1908.09393","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09393","created_at":"2026-07-05T02:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09393v2","created_at":"2026-07-05T02:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09393","created_at":"2026-07-05T02:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"D4RCRGUSQPWG","created_at":"2026-07-05T02:00:08Z"},{"alias_kind":"pith_short_16","alias_value":"D4RCRGUSQPWGZRFW","created_at":"2026-07-05T02:00:08Z"},{"alias_kind":"pith_short_8","alias_value":"D4RCRGUS","created_at":"2026-07-05T02:00:08Z"}],"graph_snapshots":[{"event_id":"sha256:1b3d75f57fdf3b185b1385beee40a8a3c48d86f26ac847499c0134dee11037d2","target":"graph","created_at":"2026-07-05T02:00:08Z","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/1908.09393/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In matrix factorization, available graph side-information may not be well suited for the matrix completion problem, having edges that disagree with the latent-feature relations learnt from the incomplete data matrix. We show that removing these $\\textit{contested}$ edges improves prediction accuracy and scalability. We identify the contested edges through a highly-efficient graphical lasso approximation. The identification and removal of contested edges adds no computational complexity to state-of-the-art graph-regularized matrix factorization, remaining linear with respect to the number of no","authors_text":"Hiroshi Mamitsuka, Jaakko Peltonen, Jonathan Strahl, Samuel Kaski","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-25T21:21:18Z","title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09393","kind":"arxiv","version":2},"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:866ed32d31c7d04a3d7132e43b74cb79dfb9c04e78a015f2620bb561d3e43451","target":"record","created_at":"2026-07-05T02:00:08Z","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":"ecaf73ba028810b79e85097b7c457640cec55bce38bc940452f24725567afca1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-25T21:21:18Z","title_canon_sha256":"3116a6ef44409ea7cf8d0c616ff8994a165dde4a084fdacd9003f358d8523c07"},"schema_version":"1.0","source":{"id":"1908.09393","kind":"arxiv","version":2}},"canonical_sha256":"1f22289a9283ec6cc4b620f75d0d0f91bf9fea17dd6b8e8b8c254ac9a4406c88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f22289a9283ec6cc4b620f75d0d0f91bf9fea17dd6b8e8b8c254ac9a4406c88","first_computed_at":"2026-07-05T02:00:08.785148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:00:08.785148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"snX9Pln8t5Rk8FxheXqqCvGdRvPNEV9bwWJwA1fGrYHbmNsc7pjbDxZsBHqf0wUlyW2TXoRdOvydSvGITuEPDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:00:08.785499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.09393","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:866ed32d31c7d04a3d7132e43b74cb79dfb9c04e78a015f2620bb561d3e43451","sha256:1b3d75f57fdf3b185b1385beee40a8a3c48d86f26ac847499c0134dee11037d2"],"state_sha256":"2edbb968a2dd33a1ab7ece7f912df8d704fbd1156056d2cb05b48d4075f0bd82"}