{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OYT3KMW3DHJJWJHIVJ2SMPIIOR","short_pith_number":"pith:OYT3KMW3","canonical_record":{"source":{"id":"1404.4132","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-16T03:57:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b30e929ad573480d924c6421e25b7d6d93143fd0cadbc8730798d64480f2338b","abstract_canon_sha256":"47c39791a4277f50135aeedce062ffdf86d845002d0964e2179d74d06f81a5d9"},"schema_version":"1.0"},"canonical_sha256":"7627b532db19d29b24e8aa75263d087454ba049a253368088cfd5e29f38c1792","source":{"kind":"arxiv","id":"1404.4132","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4132","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4132v5","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4132","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"OYT3KMW3DHJJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYT3KMW3DHJJWJHI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYT3KMW3","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OYT3KMW3DHJJWJHIVJ2SMPIIOR","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4132","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-16T03:57:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b30e929ad573480d924c6421e25b7d6d93143fd0cadbc8730798d64480f2338b","abstract_canon_sha256":"47c39791a4277f50135aeedce062ffdf86d845002d0964e2179d74d06f81a5d9"},"schema_version":"1.0"},"canonical_sha256":"7627b532db19d29b24e8aa75263d087454ba049a253368088cfd5e29f38c1792","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:18.250526Z","signature_b64":"5U5OKnSggsHXb4Dbqm3WahyXQhl98pHNoOXfwV8qgJNuan1YpUwzSefWmyb8LEF881fRk53JGSO7Rsm9etakCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7627b532db19d29b24e8aa75263d087454ba049a253368088cfd5e29f38c1792","last_reissued_at":"2026-05-17T23:49:18.249838Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:18.249838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4132","source_version":5,"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-17T23:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STwpCrwF84XUJ/oIJTMJjlmoshQ4caJx64wA3k7ycbWfzZ7E/Q3LtW3A5XrQMe//uLbEW/+V9fsAZ0AnJUv8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:10:31.582652Z"},"content_sha256":"722ae3455a0c0f97b490e7541318b808639aca91187161d2e5c4583a4199f3d0","schema_version":"1.0","event_id":"sha256:722ae3455a0c0f97b490e7541318b808639aca91187161d2e5c4583a4199f3d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OYT3KMW3DHJJWJHIVJ2SMPIIOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projection Algorithms for Non-Convex Minimization with Application to Sparse Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NA","authors_text":"Dzung T. Phan, Jia-Jie Zhu, William W. Hager","submitted_at":"2014-04-16T03:57:42Z","abstract_excerpt":"We consider concave minimization problems over non-convex sets.Optimization problems with this structure arise in sparse principal component analysis. We analyze both a gradient projection algorithm and an approximate Newton algorithm where the Hessian approximation is a multiple of the identity. Convergence results are established. In numerical experiments arising in sparse principal component analysis, it is seen that the performance of the gradient projection algorithm is very similar to that of the truncated power method and the generalized power method. In some cases, the approximate Newt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4132","kind":"arxiv","version":5},"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-17T23:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtXSM8rdQLRTdNUn4Yzm+OqCjD7aALAFpyydKH1aWsYhDdx6Njo/NrsCf3uZ2aKIE6/QRsaGQMIPmFNz47BVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:10:31.583004Z"},"content_sha256":"f1839de78daf36eb5f91ef05fe7f329f1348fe9bb7f3c8112062ea3548857ced","schema_version":"1.0","event_id":"sha256:f1839de78daf36eb5f91ef05fe7f329f1348fe9bb7f3c8112062ea3548857ced"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYT3KMW3DHJJWJHIVJ2SMPIIOR/bundle.json","state_url":"https://pith.science/pith/OYT3KMW3DHJJWJHIVJ2SMPIIOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYT3KMW3DHJJWJHIVJ2SMPIIOR/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-30T21:10:31Z","links":{"resolver":"https://pith.science/pith/OYT3KMW3DHJJWJHIVJ2SMPIIOR","bundle":"https://pith.science/pith/OYT3KMW3DHJJWJHIVJ2SMPIIOR/bundle.json","state":"https://pith.science/pith/OYT3KMW3DHJJWJHIVJ2SMPIIOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYT3KMW3DHJJWJHIVJ2SMPIIOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OYT3KMW3DHJJWJHIVJ2SMPIIOR","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":"47c39791a4277f50135aeedce062ffdf86d845002d0964e2179d74d06f81a5d9","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-16T03:57:42Z","title_canon_sha256":"b30e929ad573480d924c6421e25b7d6d93143fd0cadbc8730798d64480f2338b"},"schema_version":"1.0","source":{"id":"1404.4132","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4132","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4132v5","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4132","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"OYT3KMW3DHJJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYT3KMW3DHJJWJHI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYT3KMW3","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:f1839de78daf36eb5f91ef05fe7f329f1348fe9bb7f3c8112062ea3548857ced","target":"graph","created_at":"2026-05-17T23:49:18Z","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 consider concave minimization problems over non-convex sets.Optimization problems with this structure arise in sparse principal component analysis. We analyze both a gradient projection algorithm and an approximate Newton algorithm where the Hessian approximation is a multiple of the identity. Convergence results are established. In numerical experiments arising in sparse principal component analysis, it is seen that the performance of the gradient projection algorithm is very similar to that of the truncated power method and the generalized power method. In some cases, the approximate Newt","authors_text":"Dzung T. Phan, Jia-Jie Zhu, William W. Hager","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-16T03:57:42Z","title":"Projection Algorithms for Non-Convex Minimization with Application to Sparse Principal Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4132","kind":"arxiv","version":5},"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:722ae3455a0c0f97b490e7541318b808639aca91187161d2e5c4583a4199f3d0","target":"record","created_at":"2026-05-17T23:49:18Z","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":"47c39791a4277f50135aeedce062ffdf86d845002d0964e2179d74d06f81a5d9","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-04-16T03:57:42Z","title_canon_sha256":"b30e929ad573480d924c6421e25b7d6d93143fd0cadbc8730798d64480f2338b"},"schema_version":"1.0","source":{"id":"1404.4132","kind":"arxiv","version":5}},"canonical_sha256":"7627b532db19d29b24e8aa75263d087454ba049a253368088cfd5e29f38c1792","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7627b532db19d29b24e8aa75263d087454ba049a253368088cfd5e29f38c1792","first_computed_at":"2026-05-17T23:49:18.249838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:18.249838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5U5OKnSggsHXb4Dbqm3WahyXQhl98pHNoOXfwV8qgJNuan1YpUwzSefWmyb8LEF881fRk53JGSO7Rsm9etakCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:18.250526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4132","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:722ae3455a0c0f97b490e7541318b808639aca91187161d2e5c4583a4199f3d0","sha256:f1839de78daf36eb5f91ef05fe7f329f1348fe9bb7f3c8112062ea3548857ced"],"state_sha256":"fd1a809e9d0bdc201a91160eb1e6f851292b58641810a5b59f61fbcbf10aef58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tPnhFUKSMqSdDA8EeUomAsyL/dCPwDJRJ0g8tyDNMCtMzM04CWIkaFoq3y5vPSOL10devvIbpcxLFxTRdHF3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:10:31.585002Z","bundle_sha256":"1ac3a9f520d62b71b5613122745a47ead67c875090a19f4f434b84debe076d11"}}