{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:54BGYIFCJAPYW7RH27TYHS2PWK","short_pith_number":"pith:54BGYIFC","canonical_record":{"source":{"id":"1312.6182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-12-21T00:38:02Z","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"title_canon_sha256":"2c1e1baa0caa5cacd0c980accaf4bfea65339063fb3b01af1017f0c633ee535a","abstract_canon_sha256":"90572700c835bb2f945ec133c59e4f78854e465d691c9c11c001494bb9c3404a"},"schema_version":"1.0"},"canonical_sha256":"ef026c20a2481f8b7e27d7e783cb4fb2a0bbab99f0d6778c321754502aea91d9","source":{"kind":"arxiv","id":"1312.6182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6182","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6182v1","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6182","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"54BGYIFCJAPY","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"54BGYIFCJAPYW7RH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"54BGYIFC","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:54BGYIFCJAPYW7RH27TYHS2PWK","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-12-21T00:38:02Z","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"title_canon_sha256":"2c1e1baa0caa5cacd0c980accaf4bfea65339063fb3b01af1017f0c633ee535a","abstract_canon_sha256":"90572700c835bb2f945ec133c59e4f78854e465d691c9c11c001494bb9c3404a"},"schema_version":"1.0"},"canonical_sha256":"ef026c20a2481f8b7e27d7e783cb4fb2a0bbab99f0d6778c321754502aea91d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:57.466274Z","signature_b64":"xB54coAjYQBWpmw4kaU3fBW9wPOxILAtDXrawq7x2wF3+G2/sgjAn2A0PeTYYrlot+4VBiKQTHt2ZEAkuAC1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef026c20a2481f8b7e27d7e783cb4fb2a0bbab99f0d6778c321754502aea91d9","last_reissued_at":"2026-05-18T03:03:57.465551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:57.465551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6182","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:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u617n8UNHBj9nSU5RAj8UygEKhKfbT7rxGx4AJdMUECMR74B2BZjNs7H+9aRScvN2S5jrquH9pYD86LSUammDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:39:05.228946Z"},"content_sha256":"292ae0f34f45c6b8e45128b18a45915f26fc6d7e33e81c9dd9aaf41f66e66676","schema_version":"1.0","event_id":"sha256:292ae0f34f45c6b8e45128b18a45915f26fc6d7e33e81c9dd9aaf41f66e66676"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:54BGYIFCJAPYW7RH27TYHS2PWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Scale Paralleled Sparse Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","stat.ML"],"primary_cat":"cs.MS","authors_text":"D. Tao, H. Zhang, K. Lu, W. Liu, Y. Wang","submitted_at":"2013-12-21T00:38:02Z","abstract_excerpt":"Principal component analysis (PCA) is a statistical technique commonly used in multivariate data analysis. However, PCA can be difficult to interpret and explain since the principal components (PCs) are linear combinations of the original variables. Sparse PCA (SPCA) aims to balance statistical fidelity and interpretability by approximating sparse PCs whose projections capture the maximal variance of original data. In this paper we present an efficient and paralleled method of SPCA using graphics processing units (GPUs), which can process large blocks of data in parallel. Specifically, we cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6182","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:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fw9SMOkd8P7n3cIZna/QXqIf5knY3VTkV68STFYtfFrmEALASxEfzLggSDbcJM5KB47fNdyvXQuKRjqRJExyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:39:05.229638Z"},"content_sha256":"a13e6dfe110c2c3f68635857ca5d7b554379c1caa068eb2d3f7cf026eff70f29","schema_version":"1.0","event_id":"sha256:a13e6dfe110c2c3f68635857ca5d7b554379c1caa068eb2d3f7cf026eff70f29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54BGYIFCJAPYW7RH27TYHS2PWK/bundle.json","state_url":"https://pith.science/pith/54BGYIFCJAPYW7RH27TYHS2PWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54BGYIFCJAPYW7RH27TYHS2PWK/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-05-30T10:39:05Z","links":{"resolver":"https://pith.science/pith/54BGYIFCJAPYW7RH27TYHS2PWK","bundle":"https://pith.science/pith/54BGYIFCJAPYW7RH27TYHS2PWK/bundle.json","state":"https://pith.science/pith/54BGYIFCJAPYW7RH27TYHS2PWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54BGYIFCJAPYW7RH27TYHS2PWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:54BGYIFCJAPYW7RH27TYHS2PWK","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":"90572700c835bb2f945ec133c59e4f78854e465d691c9c11c001494bb9c3404a","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-12-21T00:38:02Z","title_canon_sha256":"2c1e1baa0caa5cacd0c980accaf4bfea65339063fb3b01af1017f0c633ee535a"},"schema_version":"1.0","source":{"id":"1312.6182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6182","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6182v1","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6182","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"54BGYIFCJAPY","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"54BGYIFCJAPYW7RH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"54BGYIFC","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:a13e6dfe110c2c3f68635857ca5d7b554379c1caa068eb2d3f7cf026eff70f29","target":"graph","created_at":"2026-05-18T03:03:57Z","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":"Principal component analysis (PCA) is a statistical technique commonly used in multivariate data analysis. However, PCA can be difficult to interpret and explain since the principal components (PCs) are linear combinations of the original variables. Sparse PCA (SPCA) aims to balance statistical fidelity and interpretability by approximating sparse PCs whose projections capture the maximal variance of original data. In this paper we present an efficient and paralleled method of SPCA using graphics processing units (GPUs), which can process large blocks of data in parallel. Specifically, we cons","authors_text":"D. Tao, H. Zhang, K. Lu, W. Liu, Y. Wang","cross_cats":["cs.LG","cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-12-21T00:38:02Z","title":"Large-Scale Paralleled Sparse Principal Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6182","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:292ae0f34f45c6b8e45128b18a45915f26fc6d7e33e81c9dd9aaf41f66e66676","target":"record","created_at":"2026-05-18T03:03:57Z","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":"90572700c835bb2f945ec133c59e4f78854e465d691c9c11c001494bb9c3404a","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-12-21T00:38:02Z","title_canon_sha256":"2c1e1baa0caa5cacd0c980accaf4bfea65339063fb3b01af1017f0c633ee535a"},"schema_version":"1.0","source":{"id":"1312.6182","kind":"arxiv","version":1}},"canonical_sha256":"ef026c20a2481f8b7e27d7e783cb4fb2a0bbab99f0d6778c321754502aea91d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef026c20a2481f8b7e27d7e783cb4fb2a0bbab99f0d6778c321754502aea91d9","first_computed_at":"2026-05-18T03:03:57.465551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:57.465551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xB54coAjYQBWpmw4kaU3fBW9wPOxILAtDXrawq7x2wF3+G2/sgjAn2A0PeTYYrlot+4VBiKQTHt2ZEAkuAC1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:57.466274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:292ae0f34f45c6b8e45128b18a45915f26fc6d7e33e81c9dd9aaf41f66e66676","sha256:a13e6dfe110c2c3f68635857ca5d7b554379c1caa068eb2d3f7cf026eff70f29"],"state_sha256":"cf9d6dcbeacc4d5c3252466596ae842f99622ef4f3fdb86a6368f3d330f6830e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mskazu5+YMijLC9yoibBrqG9vmmDhAkrLCEq5n2QS6krgJV1ch1/3WVnjGOHNQ591ctz/8Ovk78kMRTypku4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:39:05.233241Z","bundle_sha256":"43e1c55a8f88b201fd6e4849dd2bf684c31a61369276c1a84a8f5e4b263a3f8d"}}