{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6THNSDWZUB5AJSXRL35SRC42RK","short_pith_number":"pith:6THNSDWZ","schema_version":"1.0","canonical_sha256":"f4ced90ed9a07a04caf15efb288b9a8aa9399f0976977d1aecfc35ba4107619d","source":{"kind":"arxiv","id":"1312.4717","version":1},"attestation_state":"computed","paper":{"title":"The Matrix Ridge Approximation: Algorithms and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Zhihua Zhang","submitted_at":"2013-12-17T11:01:29Z","abstract_excerpt":"We are concerned with an approximation problem for a symmetric positive semidefinite matrix due to motivation from a class of nonlinear machine learning methods. We discuss an approximation approach that we call {matrix ridge approximation}. In particular, we define the matrix ridge approximation as an incomplete matrix factorization plus a ridge term. Moreover, we present probabilistic interpretations using a normal latent variable model and a Wishart model for this approximation approach. The idea behind the latent variable model in turn leads us to an efficient EM iterative method for handl"},"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":"1312.4717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T11:01:29Z","cross_cats_sorted":[],"title_canon_sha256":"08fac2c8312d334b66d972d176a704aaec22040bd038a8586059317b722cbf7d","abstract_canon_sha256":"275fdf101d307facf7e04596f817a3086b246645f1db1a4cc801ce809d3f5246"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.293262Z","signature_b64":"p45ial/T9JyTXVE7EdRsWsRH4KaCZoUESMqb3jmSUNbIMJGgXsC/sIHbyyMtSyYxYf/4UhCE7jN8wTFTrpbOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4ced90ed9a07a04caf15efb288b9a8aa9399f0976977d1aecfc35ba4107619d","last_reissued_at":"2026-05-18T03:04:23.292906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.292906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Matrix Ridge Approximation: Algorithms and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Zhihua Zhang","submitted_at":"2013-12-17T11:01:29Z","abstract_excerpt":"We are concerned with an approximation problem for a symmetric positive semidefinite matrix due to motivation from a class of nonlinear machine learning methods. We discuss an approximation approach that we call {matrix ridge approximation}. In particular, we define the matrix ridge approximation as an incomplete matrix factorization plus a ridge term. Moreover, we present probabilistic interpretations using a normal latent variable model and a Wishart model for this approximation approach. The idea behind the latent variable model in turn leads us to an efficient EM iterative method for handl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4717","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":"1312.4717","created_at":"2026-05-18T03:04:23.292965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4717v1","created_at":"2026-05-18T03:04:23.292965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4717","created_at":"2026-05-18T03:04:23.292965+00:00"},{"alias_kind":"pith_short_12","alias_value":"6THNSDWZUB5A","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6THNSDWZUB5AJSXR","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6THNSDWZ","created_at":"2026-05-18T12:27:36.564083+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/6THNSDWZUB5AJSXRL35SRC42RK","json":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK.json","graph_json":"https://pith.science/api/pith-number/6THNSDWZUB5AJSXRL35SRC42RK/graph.json","events_json":"https://pith.science/api/pith-number/6THNSDWZUB5AJSXRL35SRC42RK/events.json","paper":"https://pith.science/paper/6THNSDWZ"},"agent_actions":{"view_html":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK","download_json":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK.json","view_paper":"https://pith.science/paper/6THNSDWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4717&json=true","fetch_graph":"https://pith.science/api/pith-number/6THNSDWZUB5AJSXRL35SRC42RK/graph.json","fetch_events":"https://pith.science/api/pith-number/6THNSDWZUB5AJSXRL35SRC42RK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/action/storage_attestation","attest_author":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/action/author_attestation","sign_citation":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/action/citation_signature","submit_replication":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/action/replication_record"}},"created_at":"2026-05-18T03:04:23.292965+00:00","updated_at":"2026-05-18T03:04:23.292965+00:00"}