{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EW3LGFK467IT6QEFKCJMY46QFE","short_pith_number":"pith:EW3LGFK4","schema_version":"1.0","canonical_sha256":"25b6b3155cf7d13f40855092cc73d0291ff61f050f8decf064276212f430fff4","source":{"kind":"arxiv","id":"1812.01478","version":1},"attestation_state":"computed","paper":{"title":"Matrix Factorization via Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Duc Minh Nguyen, Evaggelia Tsiligianni, Nikos Deligiannis","submitted_at":"2018-12-04T15:15:23Z","abstract_excerpt":"Matrix completion is one of the key problems in signal processing and machine learning. In recent years, deep-learning-based models have achieved state-of-the-art results in matrix completion. Nevertheless, they suffer from two drawbacks: (i) they can not be extended easily to rows or columns unseen during training; and (ii) their results are often degraded in case discrete predictions are required. This paper addresses these two drawbacks by presenting a deep matrix factorization model and a generic method to allow joint training of the factorization model and the discretization operator. Exp"},"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":"1812.01478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-04T15:15:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ef76c7fb42ba3081f0c64f65df7056ecd4946b1132cfc740db9e6ed6a4b2f5ae","abstract_canon_sha256":"5ccbe9d25b6f3da57be35a4d31d684db983540c55fb2109f74f2892ebeb0e7af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:12.356771Z","signature_b64":"wgTN6aOgGR1rhZQWTq+TBf4dgVcURdyjPX6MN+v969B/gfGVZg08ZNOcTZKLTQm636POT4DS8A6ug7u4b788AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b6b3155cf7d13f40855092cc73d0291ff61f050f8decf064276212f430fff4","last_reissued_at":"2026-05-17T23:59:12.356173Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:12.356173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Factorization via Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Duc Minh Nguyen, Evaggelia Tsiligianni, Nikos Deligiannis","submitted_at":"2018-12-04T15:15:23Z","abstract_excerpt":"Matrix completion is one of the key problems in signal processing and machine learning. In recent years, deep-learning-based models have achieved state-of-the-art results in matrix completion. Nevertheless, they suffer from two drawbacks: (i) they can not be extended easily to rows or columns unseen during training; and (ii) their results are often degraded in case discrete predictions are required. This paper addresses these two drawbacks by presenting a deep matrix factorization model and a generic method to allow joint training of the factorization model and the discretization operator. Exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01478","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.01478","created_at":"2026-05-17T23:59:12.356283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01478v1","created_at":"2026-05-17T23:59:12.356283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01478","created_at":"2026-05-17T23:59:12.356283+00:00"},{"alias_kind":"pith_short_12","alias_value":"EW3LGFK467IT","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EW3LGFK467IT6QEF","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EW3LGFK4","created_at":"2026-05-18T12:32:22.470017+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/EW3LGFK467IT6QEFKCJMY46QFE","json":"https://pith.science/pith/EW3LGFK467IT6QEFKCJMY46QFE.json","graph_json":"https://pith.science/api/pith-number/EW3LGFK467IT6QEFKCJMY46QFE/graph.json","events_json":"https://pith.science/api/pith-number/EW3LGFK467IT6QEFKCJMY46QFE/events.json","paper":"https://pith.science/paper/EW3LGFK4"},"agent_actions":{"view_html":"https://pith.science/pith/EW3LGFK467IT6QEFKCJMY46QFE","download_json":"https://pith.science/pith/EW3LGFK467IT6QEFKCJMY46QFE.json","view_paper":"https://pith.science/paper/EW3LGFK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01478&json=true","fetch_graph":"https://pith.science/api/pith-number/EW3LGFK467IT6QEFKCJMY46QFE/graph.json","fetch_events":"https://pith.science/api/pith-number/EW3LGFK467IT6QEFKCJMY46QFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EW3LGFK467IT6QEFKCJMY46QFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EW3LGFK467IT6QEFKCJMY46QFE/action/storage_attestation","attest_author":"https://pith.science/pith/EW3LGFK467IT6QEFKCJMY46QFE/action/author_attestation","sign_citation":"https://pith.science/pith/EW3LGFK467IT6QEFKCJMY46QFE/action/citation_signature","submit_replication":"https://pith.science/pith/EW3LGFK467IT6QEFKCJMY46QFE/action/replication_record"}},"created_at":"2026-05-17T23:59:12.356283+00:00","updated_at":"2026-05-17T23:59:12.356283+00:00"}