{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3M3IGN4MM6DYK4I4IUSGPHBQIQ","short_pith_number":"pith:3M3IGN4M","schema_version":"1.0","canonical_sha256":"db3683378c678785711c4524679c3044202852e197eaee17d573cd9a52c69efa","source":{"kind":"arxiv","id":"1904.12369","version":1},"attestation_state":"computed","paper":{"title":"Low-Rank Principal Eigenmatrix Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Elynn Y. Chen, Jianqing Fan, Krishna Balasubramanian, Xiang Wu","submitted_at":"2019-04-28T18:51:39Z","abstract_excerpt":"Sparse PCA is a widely used technique for high-dimensional data analysis. In this paper, we propose a new method called low-rank principal eigenmatrix analysis. Different from sparse PCA, the dominant eigenvectors are allowed to be dense but are assumed to have a low-rank structure when matricized appropriately. Such a structure arises naturally in several practical cases: Indeed the top eigenvector of a circulant matrix, when matricized appropriately is a rank-1 matrix. We propose a matricized rank-truncated power method that could be efficiently implemented and establish its computational an"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1904.12369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-28T18:51:39Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"ad1ef44427fe2901f6f763a3f25e7f20b957ffd62d65e2186ea8c8530730050d","abstract_canon_sha256":"81879dc95f1990b98cf892ebf7b703bdddb49d62e4aeee7df32b104dcb1635de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:35.332534Z","signature_b64":"FJ7RWH3SlYg62LGhGd5hakh8Zy7iya9rHlgh2sYu2gxVFAVCOivrs/q2ckx/axuDdCwpqLkpmp600bswiYy4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db3683378c678785711c4524679c3044202852e197eaee17d573cd9a52c69efa","last_reissued_at":"2026-05-17T23:47:35.332133Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:35.332133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Principal Eigenmatrix Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Elynn Y. Chen, Jianqing Fan, Krishna Balasubramanian, Xiang Wu","submitted_at":"2019-04-28T18:51:39Z","abstract_excerpt":"Sparse PCA is a widely used technique for high-dimensional data analysis. In this paper, we propose a new method called low-rank principal eigenmatrix analysis. Different from sparse PCA, the dominant eigenvectors are allowed to be dense but are assumed to have a low-rank structure when matricized appropriately. Such a structure arises naturally in several practical cases: Indeed the top eigenvector of a circulant matrix, when matricized appropriately is a rank-1 matrix. We propose a matricized rank-truncated power method that could be efficiently implemented and establish its computational an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12369","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.12369","created_at":"2026-05-17T23:47:35.332202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12369v1","created_at":"2026-05-17T23:47:35.332202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12369","created_at":"2026-05-17T23:47:35.332202+00:00"},{"alias_kind":"pith_short_12","alias_value":"3M3IGN4MM6DY","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3M3IGN4MM6DYK4I4","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3M3IGN4M","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19122","citing_title":"Dual-Channel Tensor Neural Networks: Finite-Sample Theory and Conformal Structure Selection","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ","json":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ.json","graph_json":"https://pith.science/api/pith-number/3M3IGN4MM6DYK4I4IUSGPHBQIQ/graph.json","events_json":"https://pith.science/api/pith-number/3M3IGN4MM6DYK4I4IUSGPHBQIQ/events.json","paper":"https://pith.science/paper/3M3IGN4M"},"agent_actions":{"view_html":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ","download_json":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ.json","view_paper":"https://pith.science/paper/3M3IGN4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12369&json=true","fetch_graph":"https://pith.science/api/pith-number/3M3IGN4MM6DYK4I4IUSGPHBQIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3M3IGN4MM6DYK4I4IUSGPHBQIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ/action/storage_attestation","attest_author":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ/action/author_attestation","sign_citation":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ/action/citation_signature","submit_replication":"https://pith.science/pith/3M3IGN4MM6DYK4I4IUSGPHBQIQ/action/replication_record"}},"created_at":"2026-05-17T23:47:35.332202+00:00","updated_at":"2026-05-17T23:47:35.332202+00:00"}