{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YJGC44D7PALTJSL7QXM4NEGO2D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dce3fa687d67f697ce29674a7567fcbd6ddd10b18019dd360909103098cf34ce","cross_cats_sorted":["cs.IT","math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-02T17:29:48Z","title_canon_sha256":"622cf909b0b72ff3bffc9f7409873c937f3bbf9fbd067806c40321baf4f933af"},"schema_version":"1.0","source":{"id":"1411.0282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0282","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0282v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0282","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"YJGC44D7PALT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YJGC44D7PALTJSL7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YJGC44D7","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:752778d6213042200097aa9ffb7d6d8d57af997ef7efe76a6d6a9ecf7ca5f93b","target":"graph","created_at":"2026-05-18T00:57:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Akshay Soni, Jarvis Haupt, Stefano Gonella, Swayambhoo Jain","cross_cats":["cs.IT","math.IT","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-02T17:29:48Z","title":"Noisy Matrix Completion under Sparse Factor Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0282","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:615857209ee3ee3110149ca71d08cc98af6c912b22564c949cea8dff05eedcbd","target":"record","created_at":"2026-05-18T00:57:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dce3fa687d67f697ce29674a7567fcbd6ddd10b18019dd360909103098cf34ce","cross_cats_sorted":["cs.IT","math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-02T17:29:48Z","title_canon_sha256":"622cf909b0b72ff3bffc9f7409873c937f3bbf9fbd067806c40321baf4f933af"},"schema_version":"1.0","source":{"id":"1411.0282","kind":"arxiv","version":1}},"canonical_sha256":"c24c2e707f781734c97f85d9c690ced0c9a6915feb8c77b1ce4143d9ae33d1e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c24c2e707f781734c97f85d9c690ced0c9a6915feb8c77b1ce4143d9ae33d1e9","first_computed_at":"2026-05-18T00:57:51.372994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.372994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c0DTwvcickjpfHHx/v9zpxg8iQyKKxB0GYYSTFTkoZGeh59lHbfvGB+wv8dKSDIGfeK726lZdvrOZ4t0pqP1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.373615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:615857209ee3ee3110149ca71d08cc98af6c912b22564c949cea8dff05eedcbd","sha256:752778d6213042200097aa9ffb7d6d8d57af997ef7efe76a6d6a9ecf7ca5f93b"],"state_sha256":"965372180b0a8282297e773a9ecb72e0c0b0fc19786001a6287872947de8cef5"}