{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZNCYZXWWKZR6QYN6BZBAUDJU6E","short_pith_number":"pith:ZNCYZXWW","canonical_record":{"source":{"id":"1112.2679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-12T20:11:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a742a0c595c0dfb936558dc0a4b14eed1ff902a546896ba925a11ef64c7a17fd","abstract_canon_sha256":"9bf0747f6530bc756630185f3cd4cc2171b45a1079c135eb6b8cc3b3d896c3d6"},"schema_version":"1.0"},"canonical_sha256":"cb458cded65663e861be0e420a0d34f107ec940075e5795f9cf0a9bfacf462e0","source":{"kind":"arxiv","id":"1112.2679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2679","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2679v1","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2679","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZNCYZXWWKZR6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZNCYZXWWKZR6QYN6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZNCYZXWW","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZNCYZXWWKZR6QYN6BZBAUDJU6E","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-12T20:11:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a742a0c595c0dfb936558dc0a4b14eed1ff902a546896ba925a11ef64c7a17fd","abstract_canon_sha256":"9bf0747f6530bc756630185f3cd4cc2171b45a1079c135eb6b8cc3b3d896c3d6"},"schema_version":"1.0"},"canonical_sha256":"cb458cded65663e861be0e420a0d34f107ec940075e5795f9cf0a9bfacf462e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:33.638478Z","signature_b64":"bYcZi2A/f6bMTTb6ShoMTMKIY80H9s1GinBNSvWOL9t96eoQ5DH9nQ59yeKmxBC3dDS+5HH9oBQIaEtsLM86Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb458cded65663e861be0e420a0d34f107ec940075e5795f9cf0a9bfacf462e0","last_reissued_at":"2026-05-18T04:06:33.637773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:33.637773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2679","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-18T04:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4Dr3a/JyDq/bLiUUkHkOSonQnR5Xq+1LzsafCL64IJoOR7Yk96OFCSTKgf7UM44A+h/2W4fvWgB7l+rnOFZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:45:54.642672Z"},"content_sha256":"3040ab447f58472a225e8bb819347b8666fbe35eaa37209e8cd2130249c362c4","schema_version":"1.0","event_id":"sha256:3040ab447f58472a225e8bb819347b8666fbe35eaa37209e8cd2130249c362c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZNCYZXWWKZR6QYN6BZBAUDJU6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Truncated Power Method for Sparse Eigenvalue Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"stat.ML","authors_text":"Tong Zhang, Xiao-Tong Yuan","submitted_at":"2011-12-12T20:11:41Z","abstract_excerpt":"This paper considers the sparse eigenvalue problem, which is to extract dominant (largest) sparse eigenvectors with at most $k$ non-zero components. We propose a simple yet effective solution called truncated power method that can approximately solve the underlying nonconvex optimization problem. A strong sparse recovery result is proved for the truncated power method, and this theory is our key motivation for developing the new algorithm. The proposed method is tested on applications such as sparse principal component analysis and the densest $k$-subgraph problem. Extensive experiments on sev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2679","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-18T04:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8AQmGiRBTcI/qIINxvbuTbt9QWhVors5zmqNqA4YecvALb/1ELm8dQXmvgbZY3qS+iMdqIL+t9qP9rzVCzFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:45:54.643352Z"},"content_sha256":"eb8d4c4fde3a1415830e4bda84f5459a8edb6f45e806ab5b965cd054afbe7e44","schema_version":"1.0","event_id":"sha256:eb8d4c4fde3a1415830e4bda84f5459a8edb6f45e806ab5b965cd054afbe7e44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNCYZXWWKZR6QYN6BZBAUDJU6E/bundle.json","state_url":"https://pith.science/pith/ZNCYZXWWKZR6QYN6BZBAUDJU6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNCYZXWWKZR6QYN6BZBAUDJU6E/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-25T02:45:54Z","links":{"resolver":"https://pith.science/pith/ZNCYZXWWKZR6QYN6BZBAUDJU6E","bundle":"https://pith.science/pith/ZNCYZXWWKZR6QYN6BZBAUDJU6E/bundle.json","state":"https://pith.science/pith/ZNCYZXWWKZR6QYN6BZBAUDJU6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNCYZXWWKZR6QYN6BZBAUDJU6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZNCYZXWWKZR6QYN6BZBAUDJU6E","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":"9bf0747f6530bc756630185f3cd4cc2171b45a1079c135eb6b8cc3b3d896c3d6","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-12T20:11:41Z","title_canon_sha256":"a742a0c595c0dfb936558dc0a4b14eed1ff902a546896ba925a11ef64c7a17fd"},"schema_version":"1.0","source":{"id":"1112.2679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2679","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2679v1","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2679","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZNCYZXWWKZR6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZNCYZXWWKZR6QYN6","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZNCYZXWW","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:eb8d4c4fde3a1415830e4bda84f5459a8edb6f45e806ab5b965cd054afbe7e44","target":"graph","created_at":"2026-05-18T04:06:33Z","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":"This paper considers the sparse eigenvalue problem, which is to extract dominant (largest) sparse eigenvectors with at most $k$ non-zero components. We propose a simple yet effective solution called truncated power method that can approximately solve the underlying nonconvex optimization problem. A strong sparse recovery result is proved for the truncated power method, and this theory is our key motivation for developing the new algorithm. The proposed method is tested on applications such as sparse principal component analysis and the densest $k$-subgraph problem. Extensive experiments on sev","authors_text":"Tong Zhang, Xiao-Tong Yuan","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-12T20:11:41Z","title":"Truncated Power Method for Sparse Eigenvalue Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2679","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:3040ab447f58472a225e8bb819347b8666fbe35eaa37209e8cd2130249c362c4","target":"record","created_at":"2026-05-18T04:06:33Z","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":"9bf0747f6530bc756630185f3cd4cc2171b45a1079c135eb6b8cc3b3d896c3d6","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-12T20:11:41Z","title_canon_sha256":"a742a0c595c0dfb936558dc0a4b14eed1ff902a546896ba925a11ef64c7a17fd"},"schema_version":"1.0","source":{"id":"1112.2679","kind":"arxiv","version":1}},"canonical_sha256":"cb458cded65663e861be0e420a0d34f107ec940075e5795f9cf0a9bfacf462e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb458cded65663e861be0e420a0d34f107ec940075e5795f9cf0a9bfacf462e0","first_computed_at":"2026-05-18T04:06:33.637773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:33.637773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bYcZi2A/f6bMTTb6ShoMTMKIY80H9s1GinBNSvWOL9t96eoQ5DH9nQ59yeKmxBC3dDS+5HH9oBQIaEtsLM86Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:33.638478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3040ab447f58472a225e8bb819347b8666fbe35eaa37209e8cd2130249c362c4","sha256:eb8d4c4fde3a1415830e4bda84f5459a8edb6f45e806ab5b965cd054afbe7e44"],"state_sha256":"2d915079a7463c262558e6ba7c972791dcf3ee67efac77986bdfbc98ceaf060b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chITRFXew9gsmy/bNiMSRgQeto305kXTBDihVVHsgrOsva97sFoUkah2Bte0cSPXQimqXZ51z1/hj0qabSh2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:45:54.648625Z","bundle_sha256":"08315f07b9fa062103203fee703a7de2fda95101f74325d1d2ff6be4b7f8d26f"}}