{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ZH3FAZG2LM5A3KF6DHL4X5JNCN","short_pith_number":"pith:ZH3FAZG2","canonical_record":{"source":{"id":"0811.4724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-11-28T14:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"44cf082ef9828761dac51f0d899a1df6d089f139df35a78df13fa39d773690b7","abstract_canon_sha256":"968c870988b3188c064f986c9e048753d26b8626aadf668ceb8177f5c5fae48f"},"schema_version":"1.0"},"canonical_sha256":"c9f65064da5b3a0da8be19d7cbf52d13597b33d6201dcb39df2a7f4fd0cae588","source":{"kind":"arxiv","id":"0811.4724","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.4724","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"0811.4724v1","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4724","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZH3FAZG2LM5A","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZH3FAZG2LM5A3KF6","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZH3FAZG2","created_at":"2026-07-04T15:32:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ZH3FAZG2LM5A3KF6DHL4X5JNCN","target":"record","payload":{"canonical_record":{"source":{"id":"0811.4724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-11-28T14:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"44cf082ef9828761dac51f0d899a1df6d089f139df35a78df13fa39d773690b7","abstract_canon_sha256":"968c870988b3188c064f986c9e048753d26b8626aadf668ceb8177f5c5fae48f"},"schema_version":"1.0"},"canonical_sha256":"c9f65064da5b3a0da8be19d7cbf52d13597b33d6201dcb39df2a7f4fd0cae588","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:32:55.383339Z","signature_b64":"0cdDKKHtrdQgNRYVvM0POKx67flbg1z6tOGikvX/KOk2zDikKJaxnZNi92iQW0I1Q5XcfP1h4o9kJpM+sRyxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9f65064da5b3a0da8be19d7cbf52d13597b33d6201dcb39df2a7f4fd0cae588","last_reissued_at":"2026-07-04T15:32:55.382928Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:32:55.382928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.4724","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-07-04T15:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvRW62uv4oh6+TcQ+XZ914JT1aDQ/NIDBSBhTLKejF2Oyio2CuamMQDPkXUMuBSsGoPg+nPgkm1iGRfzdJjUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T19:36:35.201852Z"},"content_sha256":"fd6ac1a1e3a6b54460cc2ee3fe2c9ea527d4d9fde45e548baee81bda5519512b","schema_version":"1.0","event_id":"sha256:fd6ac1a1e3a6b54460cc2ee3fe2c9ea527d4d9fde45e548baee81bda5519512b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ZH3FAZG2LM5A3KF6DHL4X5JNCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized power method for sparse principal component analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michel Journ\\'ee, Peter Richt\\'arik, Rodolphe Sepulchre, Yurii Nesterov","submitted_at":"2008-11-28T14:32:49Z","abstract_excerpt":"In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.4724","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0811.4724/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQ6UjZsiKHS0/nANVhvDnmnzvetqmdyYkhfUiFUGogSalSD/BhVvnmCd212H3lmZ8Sq/o7PX3mwCp9Y6+qieCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T19:36:35.204790Z"},"content_sha256":"86bca59e55e9d4f5cfaedd09e7b5cb15573930edb95ea5d41e2b99ae8515ef8c","schema_version":"1.0","event_id":"sha256:86bca59e55e9d4f5cfaedd09e7b5cb15573930edb95ea5d41e2b99ae8515ef8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZH3FAZG2LM5A3KF6DHL4X5JNCN/bundle.json","state_url":"https://pith.science/pith/ZH3FAZG2LM5A3KF6DHL4X5JNCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZH3FAZG2LM5A3KF6DHL4X5JNCN/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-17T19:36:35Z","links":{"resolver":"https://pith.science/pith/ZH3FAZG2LM5A3KF6DHL4X5JNCN","bundle":"https://pith.science/pith/ZH3FAZG2LM5A3KF6DHL4X5JNCN/bundle.json","state":"https://pith.science/pith/ZH3FAZG2LM5A3KF6DHL4X5JNCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZH3FAZG2LM5A3KF6DHL4X5JNCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ZH3FAZG2LM5A3KF6DHL4X5JNCN","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":"968c870988b3188c064f986c9e048753d26b8626aadf668ceb8177f5c5fae48f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-11-28T14:32:49Z","title_canon_sha256":"44cf082ef9828761dac51f0d899a1df6d089f139df35a78df13fa39d773690b7"},"schema_version":"1.0","source":{"id":"0811.4724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.4724","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"0811.4724v1","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.4724","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZH3FAZG2LM5A","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZH3FAZG2LM5A3KF6","created_at":"2026-07-04T15:32:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZH3FAZG2","created_at":"2026-07-04T15:32:55Z"}],"graph_snapshots":[{"event_id":"sha256:86bca59e55e9d4f5cfaedd09e7b5cb15573930edb95ea5d41e2b99ae8515ef8c","target":"graph","created_at":"2026-07-04T15:32:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0811.4724/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if t","authors_text":"Michel Journ\\'ee, Peter Richt\\'arik, Rodolphe Sepulchre, Yurii Nesterov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-11-28T14:32:49Z","title":"Generalized power method for sparse principal component analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.4724","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:fd6ac1a1e3a6b54460cc2ee3fe2c9ea527d4d9fde45e548baee81bda5519512b","target":"record","created_at":"2026-07-04T15:32:55Z","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":"968c870988b3188c064f986c9e048753d26b8626aadf668ceb8177f5c5fae48f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2008-11-28T14:32:49Z","title_canon_sha256":"44cf082ef9828761dac51f0d899a1df6d089f139df35a78df13fa39d773690b7"},"schema_version":"1.0","source":{"id":"0811.4724","kind":"arxiv","version":1}},"canonical_sha256":"c9f65064da5b3a0da8be19d7cbf52d13597b33d6201dcb39df2a7f4fd0cae588","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9f65064da5b3a0da8be19d7cbf52d13597b33d6201dcb39df2a7f4fd0cae588","first_computed_at":"2026-07-04T15:32:55.382928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:32:55.382928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0cdDKKHtrdQgNRYVvM0POKx67flbg1z6tOGikvX/KOk2zDikKJaxnZNi92iQW0I1Q5XcfP1h4o9kJpM+sRyxCw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:32:55.383339Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.4724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd6ac1a1e3a6b54460cc2ee3fe2c9ea527d4d9fde45e548baee81bda5519512b","sha256:86bca59e55e9d4f5cfaedd09e7b5cb15573930edb95ea5d41e2b99ae8515ef8c"],"state_sha256":"6777c0be94990fda744941300265e7818de30a057a581a95f6851677cbd652ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvJV6U8hnV5J6rESiUrRysU7kt5AwAurcUWscb4slZce7DELn96+unqSPNELkWUZIrMZTXaFwQd5HufsinD4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T19:36:35.215287Z","bundle_sha256":"5270f1be706f32c237fac8bec4ca100f0193b707f867ee8eb6eb25ff715e3cd1"}}