{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M3HLVA4VPSH4L52O2YTBQUFHLA","short_pith_number":"pith:M3HLVA4V","canonical_record":{"source":{"id":"1406.1381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-05T13:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"47fea04359c24b59ab88473953e965ba05be19e125103ca85bfc0b7abb2d226b","abstract_canon_sha256":"ef90a382af97253fc538acc08fc53117622c555ae0ebf2fa8bdd3a05727640ed"},"schema_version":"1.0"},"canonical_sha256":"66ceba83957c8fc5f74ed6261850a7583c0ddcb1a5a6dd1a6a4df0af7cd32663","source":{"kind":"arxiv","id":"1406.1381","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1381","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1381v2","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1381","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"M3HLVA4VPSH4","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M3HLVA4VPSH4L52O","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M3HLVA4V","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M3HLVA4VPSH4L52O2YTBQUFHLA","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-05T13:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"47fea04359c24b59ab88473953e965ba05be19e125103ca85bfc0b7abb2d226b","abstract_canon_sha256":"ef90a382af97253fc538acc08fc53117622c555ae0ebf2fa8bdd3a05727640ed"},"schema_version":"1.0"},"canonical_sha256":"66ceba83957c8fc5f74ed6261850a7583c0ddcb1a5a6dd1a6a4df0af7cd32663","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:04.021784Z","signature_b64":"bCpYz1T3vl7wmrvQbUKeizIgSoGkXgB7NnOJmHy8HsvarMalA330+5dU9MDXRRmpdh6lyICJBUqXnJTY3OUTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ceba83957c8fc5f74ed6261850a7583c0ddcb1a5a6dd1a6a4df0af7cd32663","last_reissued_at":"2026-05-18T02:45:04.021270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:04.021270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1381","source_version":2,"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-18T02:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SITv6GA0DRwpJn3cveeUcW2CduLQGVE7jTkdQ3/gQhoXA/52p+GaIMUpHRBO/svtx7sHWkwKrbAdPK0ePXnZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:00:18.305573Z"},"content_sha256":"c0658793cc20669de5b525415a677778dbe36dd9ace3e756b161f9f61bddd74e","schema_version":"1.0","event_id":"sha256:c0658793cc20669de5b525415a677778dbe36dd9ace3e756b161f9f61bddd74e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M3HLVA4VPSH4L52O2YTBQUFHLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Principal Component Analysis: a Least Squares approximation approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Giovanni Maria Merola","submitted_at":"2014-06-05T13:37:12Z","abstract_excerpt":"Sparse Principal Components Analysis aims to find principal components with few non-zero loadings. We derive such sparse solutions by adding a genuine sparsity requirement to the original Principal Components Analysis (PCA) objective function. This approach differs from others because it preserves PCA's original optimality: \\uns\\ of the components and Least Squares approximation of the data. To identify the best subset of non-zero loadings we propose a Branch-and-Bound search and an iterative elimination algorithm. This last algorithm finds sparse solutions with large loadings and can be run w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1381","kind":"arxiv","version":2},"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-18T02:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dt5BfxaEGW+9npRL/83H/MVwmYkEewZarPHRal55L8hLQ4us/uIwFxIoVgDAm0hpWT6ryB7BUIVGhlHGm01xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:00:18.306059Z"},"content_sha256":"ae3961730b94a39d4dfcd1a8253b1d69490b77c31629595ba8c02ef29dc4dae0","schema_version":"1.0","event_id":"sha256:ae3961730b94a39d4dfcd1a8253b1d69490b77c31629595ba8c02ef29dc4dae0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3HLVA4VPSH4L52O2YTBQUFHLA/bundle.json","state_url":"https://pith.science/pith/M3HLVA4VPSH4L52O2YTBQUFHLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3HLVA4VPSH4L52O2YTBQUFHLA/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-08-15T08:00:18Z","links":{"resolver":"https://pith.science/pith/M3HLVA4VPSH4L52O2YTBQUFHLA","bundle":"https://pith.science/pith/M3HLVA4VPSH4L52O2YTBQUFHLA/bundle.json","state":"https://pith.science/pith/M3HLVA4VPSH4L52O2YTBQUFHLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3HLVA4VPSH4L52O2YTBQUFHLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M3HLVA4VPSH4L52O2YTBQUFHLA","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":"ef90a382af97253fc538acc08fc53117622c555ae0ebf2fa8bdd3a05727640ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-05T13:37:12Z","title_canon_sha256":"47fea04359c24b59ab88473953e965ba05be19e125103ca85bfc0b7abb2d226b"},"schema_version":"1.0","source":{"id":"1406.1381","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1381","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1381v2","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1381","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"M3HLVA4VPSH4","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M3HLVA4VPSH4L52O","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M3HLVA4V","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:ae3961730b94a39d4dfcd1a8253b1d69490b77c31629595ba8c02ef29dc4dae0","target":"graph","created_at":"2026-05-18T02:45:04Z","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":"Sparse Principal Components Analysis aims to find principal components with few non-zero loadings. We derive such sparse solutions by adding a genuine sparsity requirement to the original Principal Components Analysis (PCA) objective function. This approach differs from others because it preserves PCA's original optimality: \\uns\\ of the components and Least Squares approximation of the data. To identify the best subset of non-zero loadings we propose a Branch-and-Bound search and an iterative elimination algorithm. This last algorithm finds sparse solutions with large loadings and can be run w","authors_text":"Giovanni Maria Merola","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-05T13:37:12Z","title":"Sparse Principal Component Analysis: a Least Squares approximation approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1381","kind":"arxiv","version":2},"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:c0658793cc20669de5b525415a677778dbe36dd9ace3e756b161f9f61bddd74e","target":"record","created_at":"2026-05-18T02:45:04Z","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":"ef90a382af97253fc538acc08fc53117622c555ae0ebf2fa8bdd3a05727640ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-05T13:37:12Z","title_canon_sha256":"47fea04359c24b59ab88473953e965ba05be19e125103ca85bfc0b7abb2d226b"},"schema_version":"1.0","source":{"id":"1406.1381","kind":"arxiv","version":2}},"canonical_sha256":"66ceba83957c8fc5f74ed6261850a7583c0ddcb1a5a6dd1a6a4df0af7cd32663","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66ceba83957c8fc5f74ed6261850a7583c0ddcb1a5a6dd1a6a4df0af7cd32663","first_computed_at":"2026-05-18T02:45:04.021270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:04.021270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bCpYz1T3vl7wmrvQbUKeizIgSoGkXgB7NnOJmHy8HsvarMalA330+5dU9MDXRRmpdh6lyICJBUqXnJTY3OUTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:04.021784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1381","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0658793cc20669de5b525415a677778dbe36dd9ace3e756b161f9f61bddd74e","sha256:ae3961730b94a39d4dfcd1a8253b1d69490b77c31629595ba8c02ef29dc4dae0"],"state_sha256":"5423a35a5fddc76d99b510f62553a6f0887288de8d151f25b7945753bdc7ee5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mt382W8ph2ZoalVWKnqU0f5iAouOCbkUf3uInAd/nTvNS2OZXEn8KIge32/YI4DdEwwqnpI71ziVWQu5OjiTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T08:00:18.311241Z","bundle_sha256":"dd3fffa6328d7546dbf37ca5dad27bbd2648060304b1867c59ff6cca21493486"}}