{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:D4RCRGUSQPWGZRFWED3V2DIPSG","short_pith_number":"pith:D4RCRGUS","schema_version":"1.0","canonical_sha256":"1f22289a9283ec6cc4b620f75d0d0f91bf9fea17dd6b8e8b8c254ac9a4406c88","source":{"kind":"arxiv","id":"1908.09393","version":2},"attestation_state":"computed","paper":{"title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hiroshi Mamitsuka, Jaakko Peltonen, Jonathan Strahl, Samuel Kaski","submitted_at":"2019-08-25T21:21:18Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.09393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-25T21:21:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3116a6ef44409ea7cf8d0c616ff8994a165dde4a084fdacd9003f358d8523c07","abstract_canon_sha256":"ecaf73ba028810b79e85097b7c457640cec55bce38bc940452f24725567afca1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:08.785499Z","signature_b64":"snX9Pln8t5Rk8FxheXqqCvGdRvPNEV9bwWJwA1fGrYHbmNsc7pjbDxZsBHqf0wUlyW2TXoRdOvydSvGITuEPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f22289a9283ec6cc4b620f75d0d0f91bf9fea17dd6b8e8b8c254ac9a4406c88","last_reissued_at":"2026-07-05T02:00:08.785148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:08.785148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hiroshi Mamitsuka, Jaakko Peltonen, Jonathan Strahl, Samuel Kaski","submitted_at":"2019-08-25T21:21:18Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09393","kind":"arxiv","version":2},"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/1908.09393/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.09393","created_at":"2026-07-05T02:00:08.785202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09393v2","created_at":"2026-07-05T02:00:08.785202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09393","created_at":"2026-07-05T02:00:08.785202+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4RCRGUSQPWG","created_at":"2026-07-05T02:00:08.785202+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4RCRGUSQPWGZRFW","created_at":"2026-07-05T02:00:08.785202+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4RCRGUS","created_at":"2026-07-05T02:00:08.785202+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG","json":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG.json","graph_json":"https://pith.science/api/pith-number/D4RCRGUSQPWGZRFWED3V2DIPSG/graph.json","events_json":"https://pith.science/api/pith-number/D4RCRGUSQPWGZRFWED3V2DIPSG/events.json","paper":"https://pith.science/paper/D4RCRGUS"},"agent_actions":{"view_html":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG","download_json":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG.json","view_paper":"https://pith.science/paper/D4RCRGUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09393&json=true","fetch_graph":"https://pith.science/api/pith-number/D4RCRGUSQPWGZRFWED3V2DIPSG/graph.json","fetch_events":"https://pith.science/api/pith-number/D4RCRGUSQPWGZRFWED3V2DIPSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG/action/storage_attestation","attest_author":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG/action/author_attestation","sign_citation":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG/action/citation_signature","submit_replication":"https://pith.science/pith/D4RCRGUSQPWGZRFWED3V2DIPSG/action/replication_record"}},"created_at":"2026-07-05T02:00:08.785202+00:00","updated_at":"2026-07-05T02:00:08.785202+00:00"}