{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6POHWWWM6QSWWBLIMBA5JXGFZH","short_pith_number":"pith:6POHWWWM","schema_version":"1.0","canonical_sha256":"f3dc7b5accf4256b05686041d4dcc5c9c106db450c82b5a13a90a0844b5fa6f1","source":{"kind":"arxiv","id":"1805.04912","version":1},"attestation_state":"computed","paper":{"title":"Extendable Neural Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Duc Minh Nguyen, Evaggelia Tsiligianni, Nikos Deligiannis","submitted_at":"2018-05-13T16:46:36Z","abstract_excerpt":"Matrix completion is one of the key problems in signal processing and machine learning, with applications ranging from image pro- cessing and data gathering to classification and recommender sys- tems. Recently, deep neural networks have been proposed as la- tent factor models for matrix completion and have achieved state- of-the-art performance. Nevertheless, a major problem with existing neural-network-based models is their limited capabilities to extend to samples unavailable at the training stage. In this paper, we propose a deep two-branch neural network model for matrix completion. The p"},"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":"1805.04912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-13T16:46:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7bbb16bb743ad2a860b83efc7eb2ef15bfcf5c7b5e08f832a71f8deeb5b79a7d","abstract_canon_sha256":"663172456e6eef1f98291942837b3a0e5786959a54369105aa3fc9cd79a5c7d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.351198Z","signature_b64":"eJFPOn0h2Pq3Iv/VBRUR+vBa+wsnXI9CYmDhmGMkh2Cu9Ati1/tJX1K2iHmJuBATaUgDn0jOO9qnW1wDf18FAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3dc7b5accf4256b05686041d4dcc5c9c106db450c82b5a13a90a0844b5fa6f1","last_reissued_at":"2026-05-18T00:16:04.350725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.350725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extendable Neural Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Duc Minh Nguyen, Evaggelia Tsiligianni, Nikos Deligiannis","submitted_at":"2018-05-13T16:46:36Z","abstract_excerpt":"Matrix completion is one of the key problems in signal processing and machine learning, with applications ranging from image pro- cessing and data gathering to classification and recommender sys- tems. Recently, deep neural networks have been proposed as la- tent factor models for matrix completion and have achieved state- of-the-art performance. Nevertheless, a major problem with existing neural-network-based models is their limited capabilities to extend to samples unavailable at the training stage. In this paper, we propose a deep two-branch neural network model for matrix completion. The p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04912","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":"1805.04912","created_at":"2026-05-18T00:16:04.350798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04912v1","created_at":"2026-05-18T00:16:04.350798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04912","created_at":"2026-05-18T00:16:04.350798+00:00"},{"alias_kind":"pith_short_12","alias_value":"6POHWWWM6QSW","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6POHWWWM6QSWWBLI","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6POHWWWM","created_at":"2026-05-18T12:32:11.075285+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/6POHWWWM6QSWWBLIMBA5JXGFZH","json":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH.json","graph_json":"https://pith.science/api/pith-number/6POHWWWM6QSWWBLIMBA5JXGFZH/graph.json","events_json":"https://pith.science/api/pith-number/6POHWWWM6QSWWBLIMBA5JXGFZH/events.json","paper":"https://pith.science/paper/6POHWWWM"},"agent_actions":{"view_html":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH","download_json":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH.json","view_paper":"https://pith.science/paper/6POHWWWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04912&json=true","fetch_graph":"https://pith.science/api/pith-number/6POHWWWM6QSWWBLIMBA5JXGFZH/graph.json","fetch_events":"https://pith.science/api/pith-number/6POHWWWM6QSWWBLIMBA5JXGFZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/action/storage_attestation","attest_author":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/action/author_attestation","sign_citation":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/action/citation_signature","submit_replication":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/action/replication_record"}},"created_at":"2026-05-18T00:16:04.350798+00:00","updated_at":"2026-05-18T00:16:04.350798+00:00"}