{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WB2SBO2PDXOPYFEJTHGFZYJZGV","short_pith_number":"pith:WB2SBO2P","schema_version":"1.0","canonical_sha256":"b07520bb4f1ddcfc148999cc5ce139356fda25c081fd3a5f9aad8615ed1a3e91","source":{"kind":"arxiv","id":"1410.0342","version":4},"attestation_state":"computed","paper":{"title":"Generalized Low Rank Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Corinne Horn, Madeleine Udell, Reza Zadeh, Stephen Boyd","submitted_at":"2014-10-01T19:31:40Z","abstract_excerpt":"Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, $k$-means, $k$-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing"},"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":"1410.0342","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-01T19:31:40Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"2834a175ad0c8b8da574f7e3a9bbcbcd027f7faf960dfd275e5fe4af3ba6b7e1","abstract_canon_sha256":"2342151be7e51ddd15bd1b20fbf0b8ab8b3efb6d72f73580b011adea2dcca456"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:01.126058Z","signature_b64":"bLVNga8YJbe7qKVXGYnoQxSTEnvNfR5f4bwyxUIGfA64nPzVgG047NOT4M7CtB4Qd6LAobhAacX9S4evDWbWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b07520bb4f1ddcfc148999cc5ce139356fda25c081fd3a5f9aad8615ed1a3e91","last_reissued_at":"2026-05-18T02:17:01.125337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:01.125337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Low Rank Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Corinne Horn, Madeleine Udell, Reza Zadeh, Stephen Boyd","submitted_at":"2014-10-01T19:31:40Z","abstract_excerpt":"Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, $k$-means, $k$-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0342","kind":"arxiv","version":4},"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":"1410.0342","created_at":"2026-05-18T02:17:01.125459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0342v4","created_at":"2026-05-18T02:17:01.125459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0342","created_at":"2026-05-18T02:17:01.125459+00:00"},{"alias_kind":"pith_short_12","alias_value":"WB2SBO2PDXOP","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WB2SBO2PDXOPYFEJ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WB2SBO2P","created_at":"2026-05-18T12:28:54.890064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08279","citing_title":"Statistical Clear Sky Fitting Algorithm","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV","json":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV.json","graph_json":"https://pith.science/api/pith-number/WB2SBO2PDXOPYFEJTHGFZYJZGV/graph.json","events_json":"https://pith.science/api/pith-number/WB2SBO2PDXOPYFEJTHGFZYJZGV/events.json","paper":"https://pith.science/paper/WB2SBO2P"},"agent_actions":{"view_html":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV","download_json":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV.json","view_paper":"https://pith.science/paper/WB2SBO2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0342&json=true","fetch_graph":"https://pith.science/api/pith-number/WB2SBO2PDXOPYFEJTHGFZYJZGV/graph.json","fetch_events":"https://pith.science/api/pith-number/WB2SBO2PDXOPYFEJTHGFZYJZGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV/action/storage_attestation","attest_author":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV/action/author_attestation","sign_citation":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV/action/citation_signature","submit_replication":"https://pith.science/pith/WB2SBO2PDXOPYFEJTHGFZYJZGV/action/replication_record"}},"created_at":"2026-05-18T02:17:01.125459+00:00","updated_at":"2026-05-18T02:17:01.125459+00:00"}