{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6THNSDWZUB5AJSXRL35SRC42RK","short_pith_number":"pith:6THNSDWZ","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"},"canonical_sha256":"f4ced90ed9a07a04caf15efb288b9a8aa9399f0976977d1aecfc35ba4107619d","source":{"kind":"arxiv","id":"1312.4717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4717","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4717v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4717","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"6THNSDWZUB5A","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6THNSDWZUB5AJSXR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6THNSDWZ","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6THNSDWZUB5AJSXRL35SRC42RK","target":"record","payload":{"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"},"canonical_sha256":"f4ced90ed9a07a04caf15efb288b9a8aa9399f0976977d1aecfc35ba4107619d","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"},"source_kind":"arxiv","source_id":"1312.4717","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akmke7rNoqODqT2B2MaoEwvsIq2DBk7WaBlOm6WQuWXSERD+1JjqW3AF2WTub4yrfeZoSImJlAWd6SFplVGkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:02:46.984147Z"},"content_sha256":"2506d146acb383072a38d27243e1496fad28aa32c01ba5905ac67b5d0a63f579","schema_version":"1.0","event_id":"sha256:2506d146acb383072a38d27243e1496fad28aa32c01ba5905ac67b5d0a63f579"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6THNSDWZUB5AJSXRL35SRC42RK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0Z7t8AqFs9bAAnPzCtoIiu5woi6T1TU0nc4pht4mFUiHEFyHcWat1L/3+23x60BMCGIkrWUWBm6YY0tSoutBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:02:46.984909Z"},"content_sha256":"c23dc19ae93108c1846d31f860d84df34b955cda77f91a6998a4385d02b3ff2d","schema_version":"1.0","event_id":"sha256:c23dc19ae93108c1846d31f860d84df34b955cda77f91a6998a4385d02b3ff2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/bundle.json","state_url":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6THNSDWZUB5AJSXRL35SRC42RK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T23:02:46Z","links":{"resolver":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK","bundle":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/bundle.json","state":"https://pith.science/pith/6THNSDWZUB5AJSXRL35SRC42RK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6THNSDWZUB5AJSXRL35SRC42RK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6THNSDWZUB5AJSXRL35SRC42RK","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":"275fdf101d307facf7e04596f817a3086b246645f1db1a4cc801ce809d3f5246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T11:01:29Z","title_canon_sha256":"08fac2c8312d334b66d972d176a704aaec22040bd038a8586059317b722cbf7d"},"schema_version":"1.0","source":{"id":"1312.4717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4717","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4717v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4717","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"6THNSDWZUB5A","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6THNSDWZUB5AJSXR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6THNSDWZ","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:c23dc19ae93108c1846d31f860d84df34b955cda77f91a6998a4385d02b3ff2d","target":"graph","created_at":"2026-05-18T03:04:23Z","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":"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","authors_text":"Zhihua Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T11:01:29Z","title":"The Matrix Ridge Approximation: Algorithms and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4717","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:2506d146acb383072a38d27243e1496fad28aa32c01ba5905ac67b5d0a63f579","target":"record","created_at":"2026-05-18T03:04:23Z","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":"275fdf101d307facf7e04596f817a3086b246645f1db1a4cc801ce809d3f5246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-17T11:01:29Z","title_canon_sha256":"08fac2c8312d334b66d972d176a704aaec22040bd038a8586059317b722cbf7d"},"schema_version":"1.0","source":{"id":"1312.4717","kind":"arxiv","version":1}},"canonical_sha256":"f4ced90ed9a07a04caf15efb288b9a8aa9399f0976977d1aecfc35ba4107619d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4ced90ed9a07a04caf15efb288b9a8aa9399f0976977d1aecfc35ba4107619d","first_computed_at":"2026-05-18T03:04:23.292906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:23.292906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p45ial/T9JyTXVE7EdRsWsRH4KaCZoUESMqb3jmSUNbIMJGgXsC/sIHbyyMtSyYxYf/4UhCE7jN8wTFTrpbOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:23.293262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2506d146acb383072a38d27243e1496fad28aa32c01ba5905ac67b5d0a63f579","sha256:c23dc19ae93108c1846d31f860d84df34b955cda77f91a6998a4385d02b3ff2d"],"state_sha256":"c27fffce2b1d1a683ecfbf8ca7ccef9a6b7b668f89efee158102f14e1468eca8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJTUz5A8hfZ2SSPS+3fAgDc9aIDuAIq7ZQsc9NmNl5U80w7Rl/rTly6FdFfjqJdom8xbxnJPycknOzay28a/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:02:46.989368Z","bundle_sha256":"fb6a659d7cea308e066fbb1bb127b933f5ca284c717a15d6ece23f93c83fcf86"}}