{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QKSTGWE7NKJ3O4VEQLTBM35D37","short_pith_number":"pith:QKSTGWE7","schema_version":"1.0","canonical_sha256":"82a533589f6a93b772a482e6166fa3dfe7a99eeab40764de1aa1713d0bf92abb","source":{"kind":"arxiv","id":"1401.2451","version":1},"attestation_state":"computed","paper":{"title":"Online Matrix Completion Through Nuclear Norm Regularisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Charanpal Dhanjal (LTCI), Romaric Gaudel (LIFL), St\\'ephan Cl\\'emen\\c{c}on (LTCI)","submitted_at":"2014-01-10T20:44:50Z","abstract_excerpt":"It is the main goal of this paper to propose a novel method to perform matrix completion on-line. Motivated by a wide variety of applications, ranging from the design of recommender systems to sensor network localization through seismic data reconstruction, we consider the matrix completion problem when entries of the matrix of interest are observed gradually. Precisely, we place ourselves in the situation where the predictive rule should be refined incrementally, rather than recomputed from scratch each time the sample of observed entries increases. The extension of existing matrix completion"},"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":"1401.2451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-10T20:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"349bb4339ce24e8685830135e18ea60ab693dc070e5c00bcb5318f91a085150c","abstract_canon_sha256":"a38d27f92067bb400b1760e764f6063f4eb1ce84fb8420bb59dbe7254060c9f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:45.214643Z","signature_b64":"jwWbd17fkt+T2LRg5JFh840mXSbN45Tu3rEvBuLNm36R0aEeYnR+vDhfvB9O3YhHmaL8kHsHuWIsuI/6QTwcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a533589f6a93b772a482e6166fa3dfe7a99eeab40764de1aa1713d0bf92abb","last_reissued_at":"2026-05-18T03:02:45.214080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:45.214080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Matrix Completion Through Nuclear Norm Regularisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Charanpal Dhanjal (LTCI), Romaric Gaudel (LIFL), St\\'ephan Cl\\'emen\\c{c}on (LTCI)","submitted_at":"2014-01-10T20:44:50Z","abstract_excerpt":"It is the main goal of this paper to propose a novel method to perform matrix completion on-line. Motivated by a wide variety of applications, ranging from the design of recommender systems to sensor network localization through seismic data reconstruction, we consider the matrix completion problem when entries of the matrix of interest are observed gradually. Precisely, we place ourselves in the situation where the predictive rule should be refined incrementally, rather than recomputed from scratch each time the sample of observed entries increases. The extension of existing matrix completion"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2451","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":"1401.2451","created_at":"2026-05-18T03:02:45.214170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2451v1","created_at":"2026-05-18T03:02:45.214170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2451","created_at":"2026-05-18T03:02:45.214170+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKSTGWE7NKJ3","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKSTGWE7NKJ3O4VE","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKSTGWE7","created_at":"2026-05-18T12:28:46.137349+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/QKSTGWE7NKJ3O4VEQLTBM35D37","json":"https://pith.science/pith/QKSTGWE7NKJ3O4VEQLTBM35D37.json","graph_json":"https://pith.science/api/pith-number/QKSTGWE7NKJ3O4VEQLTBM35D37/graph.json","events_json":"https://pith.science/api/pith-number/QKSTGWE7NKJ3O4VEQLTBM35D37/events.json","paper":"https://pith.science/paper/QKSTGWE7"},"agent_actions":{"view_html":"https://pith.science/pith/QKSTGWE7NKJ3O4VEQLTBM35D37","download_json":"https://pith.science/pith/QKSTGWE7NKJ3O4VEQLTBM35D37.json","view_paper":"https://pith.science/paper/QKSTGWE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2451&json=true","fetch_graph":"https://pith.science/api/pith-number/QKSTGWE7NKJ3O4VEQLTBM35D37/graph.json","fetch_events":"https://pith.science/api/pith-number/QKSTGWE7NKJ3O4VEQLTBM35D37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKSTGWE7NKJ3O4VEQLTBM35D37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKSTGWE7NKJ3O4VEQLTBM35D37/action/storage_attestation","attest_author":"https://pith.science/pith/QKSTGWE7NKJ3O4VEQLTBM35D37/action/author_attestation","sign_citation":"https://pith.science/pith/QKSTGWE7NKJ3O4VEQLTBM35D37/action/citation_signature","submit_replication":"https://pith.science/pith/QKSTGWE7NKJ3O4VEQLTBM35D37/action/replication_record"}},"created_at":"2026-05-18T03:02:45.214170+00:00","updated_at":"2026-05-18T03:02:45.214170+00:00"}