{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VDUJBXQRMCITFLFZSUAK6W4FQI","short_pith_number":"pith:VDUJBXQR","schema_version":"1.0","canonical_sha256":"a8e890de11609132acb99500af5b85823763b0665ba228867a40cf8bb8d59b4e","source":{"kind":"arxiv","id":"1805.10477","version":1},"attestation_state":"computed","paper":{"title":"Nonlinear Inductive Matrix Completion based on One-layer Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Inderjit S. Dhillon, Kai Zhong, Prateek Jain, Zhao Song","submitted_at":"2018-05-26T13:01:40Z","abstract_excerpt":"The goal of a recommendation system is to predict the interest of a user in a given item by exploiting the existing set of ratings as well as certain user/item features. A standard approach to modeling this problem is Inductive Matrix Completion where the predicted rating is modeled as an inner product of the user and the item features projected onto a latent space. In order to learn the parameters effectively from a small number of observed ratings, the latent space is constrained to be low-dimensional which implies that the parameter matrix is constrained to be low-rank. However, such biline"},"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.10477","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-05-26T13:01:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bdae810c383c2435b8f767914721cbf16904aa4afd9b1d254ec0f5ae680c5f1c","abstract_canon_sha256":"b9ad02029b3f52020ecc2c78ed2b9dfccca2d8db907aef9b97359f0b2edfabd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:52.404748Z","signature_b64":"rcxO/kGhkxHeJB4GF0fCAkubyqpPTUKcP07ZkKgCQT44Y2eqNs8sJqpxRywHN3zC7nEHFB1CvQhKeq7HNk7KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e890de11609132acb99500af5b85823763b0665ba228867a40cf8bb8d59b4e","last_reissued_at":"2026-05-18T00:14:52.404040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:52.404040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinear Inductive Matrix Completion based on One-layer Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Inderjit S. Dhillon, Kai Zhong, Prateek Jain, Zhao Song","submitted_at":"2018-05-26T13:01:40Z","abstract_excerpt":"The goal of a recommendation system is to predict the interest of a user in a given item by exploiting the existing set of ratings as well as certain user/item features. A standard approach to modeling this problem is Inductive Matrix Completion where the predicted rating is modeled as an inner product of the user and the item features projected onto a latent space. In order to learn the parameters effectively from a small number of observed ratings, the latent space is constrained to be low-dimensional which implies that the parameter matrix is constrained to be low-rank. However, such biline"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10477","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.10477","created_at":"2026-05-18T00:14:52.404140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10477v1","created_at":"2026-05-18T00:14:52.404140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10477","created_at":"2026-05-18T00:14:52.404140+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDUJBXQRMCIT","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDUJBXQRMCITFLFZ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDUJBXQR","created_at":"2026-05-18T12:32:59.047623+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/VDUJBXQRMCITFLFZSUAK6W4FQI","json":"https://pith.science/pith/VDUJBXQRMCITFLFZSUAK6W4FQI.json","graph_json":"https://pith.science/api/pith-number/VDUJBXQRMCITFLFZSUAK6W4FQI/graph.json","events_json":"https://pith.science/api/pith-number/VDUJBXQRMCITFLFZSUAK6W4FQI/events.json","paper":"https://pith.science/paper/VDUJBXQR"},"agent_actions":{"view_html":"https://pith.science/pith/VDUJBXQRMCITFLFZSUAK6W4FQI","download_json":"https://pith.science/pith/VDUJBXQRMCITFLFZSUAK6W4FQI.json","view_paper":"https://pith.science/paper/VDUJBXQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10477&json=true","fetch_graph":"https://pith.science/api/pith-number/VDUJBXQRMCITFLFZSUAK6W4FQI/graph.json","fetch_events":"https://pith.science/api/pith-number/VDUJBXQRMCITFLFZSUAK6W4FQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDUJBXQRMCITFLFZSUAK6W4FQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDUJBXQRMCITFLFZSUAK6W4FQI/action/storage_attestation","attest_author":"https://pith.science/pith/VDUJBXQRMCITFLFZSUAK6W4FQI/action/author_attestation","sign_citation":"https://pith.science/pith/VDUJBXQRMCITFLFZSUAK6W4FQI/action/citation_signature","submit_replication":"https://pith.science/pith/VDUJBXQRMCITFLFZSUAK6W4FQI/action/replication_record"}},"created_at":"2026-05-18T00:14:52.404140+00:00","updated_at":"2026-05-18T00:14:52.404140+00:00"}