{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YJGC44D7PALTJSL7QXM4NEGO2D","short_pith_number":"pith:YJGC44D7","schema_version":"1.0","canonical_sha256":"c24c2e707f781734c97f85d9c690ced0c9a6915feb8c77b1ce4143d9ae33d1e9","source":{"kind":"arxiv","id":"1411.0282","version":1},"attestation_state":"computed","paper":{"title":"Noisy Matrix Completion under Sparse Factor Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.AP"],"primary_cat":"stat.ML","authors_text":"Akshay Soni, Jarvis Haupt, Stefano Gonella, Swayambhoo Jain","submitted_at":"2014-11-02T17:29:48Z","abstract_excerpt":"This paper examines a general class of noisy matrix completion tasks where the goal is to estimate a matrix from observations obtained at a subset of its entries, each of which is subject to random noise or corruption. Our specific focus is on settings where the matrix to be estimated is well-approximated by a product of two (a priori unknown) matrices, one of which is sparse. Such structural models - referred to here as \"sparse factor models\" - have been widely used, for example, in subspace clustering applications, as well as in contemporary sparse modeling and dictionary learning tasks. Our"},"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":"1411.0282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-02T17:29:48Z","cross_cats_sorted":["cs.IT","math.IT","stat.AP"],"title_canon_sha256":"622cf909b0b72ff3bffc9f7409873c937f3bbf9fbd067806c40321baf4f933af","abstract_canon_sha256":"dce3fa687d67f697ce29674a7567fcbd6ddd10b18019dd360909103098cf34ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.373615Z","signature_b64":"c0DTwvcickjpfHHx/v9zpxg8iQyKKxB0GYYSTFTkoZGeh59lHbfvGB+wv8dKSDIGfeK726lZdvrOZ4t0pqP1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c24c2e707f781734c97f85d9c690ced0c9a6915feb8c77b1ce4143d9ae33d1e9","last_reissued_at":"2026-05-18T00:57:51.372994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.372994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Matrix Completion under Sparse Factor Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.AP"],"primary_cat":"stat.ML","authors_text":"Akshay Soni, Jarvis Haupt, Stefano Gonella, Swayambhoo Jain","submitted_at":"2014-11-02T17:29:48Z","abstract_excerpt":"This paper examines a general class of noisy matrix completion tasks where the goal is to estimate a matrix from observations obtained at a subset of its entries, each of which is subject to random noise or corruption. Our specific focus is on settings where the matrix to be estimated is well-approximated by a product of two (a priori unknown) matrices, one of which is sparse. Such structural models - referred to here as \"sparse factor models\" - have been widely used, for example, in subspace clustering applications, as well as in contemporary sparse modeling and dictionary learning tasks. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0282","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":"1411.0282","created_at":"2026-05-18T00:57:51.373092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0282v1","created_at":"2026-05-18T00:57:51.373092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0282","created_at":"2026-05-18T00:57:51.373092+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJGC44D7PALT","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJGC44D7PALTJSL7","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJGC44D7","created_at":"2026-05-18T12:28:57.508820+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/YJGC44D7PALTJSL7QXM4NEGO2D","json":"https://pith.science/pith/YJGC44D7PALTJSL7QXM4NEGO2D.json","graph_json":"https://pith.science/api/pith-number/YJGC44D7PALTJSL7QXM4NEGO2D/graph.json","events_json":"https://pith.science/api/pith-number/YJGC44D7PALTJSL7QXM4NEGO2D/events.json","paper":"https://pith.science/paper/YJGC44D7"},"agent_actions":{"view_html":"https://pith.science/pith/YJGC44D7PALTJSL7QXM4NEGO2D","download_json":"https://pith.science/pith/YJGC44D7PALTJSL7QXM4NEGO2D.json","view_paper":"https://pith.science/paper/YJGC44D7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0282&json=true","fetch_graph":"https://pith.science/api/pith-number/YJGC44D7PALTJSL7QXM4NEGO2D/graph.json","fetch_events":"https://pith.science/api/pith-number/YJGC44D7PALTJSL7QXM4NEGO2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJGC44D7PALTJSL7QXM4NEGO2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJGC44D7PALTJSL7QXM4NEGO2D/action/storage_attestation","attest_author":"https://pith.science/pith/YJGC44D7PALTJSL7QXM4NEGO2D/action/author_attestation","sign_citation":"https://pith.science/pith/YJGC44D7PALTJSL7QXM4NEGO2D/action/citation_signature","submit_replication":"https://pith.science/pith/YJGC44D7PALTJSL7QXM4NEGO2D/action/replication_record"}},"created_at":"2026-05-18T00:57:51.373092+00:00","updated_at":"2026-05-18T00:57:51.373092+00:00"}