{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BRDGESCNRMYS3LUWAO7BSC6HFS","short_pith_number":"pith:BRDGESCN","schema_version":"1.0","canonical_sha256":"0c4662484d8b312dae9603be190bc72ca6276ec8e0c5f21c251e891ad604baff","source":{"kind":"arxiv","id":"2107.00371","version":2},"attestation_state":"computed","paper":{"title":"Sparse GCA and Thresholded Gradient Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Sheng Gao, Zongming Ma","submitted_at":"2021-07-01T11:15:20Z","abstract_excerpt":"Generalized correlation analysis (GCA) is concerned with uncovering linear relationships across multiple datasets. It generalizes canonical correlation analysis that is designed for two datasets. We study sparse GCA when there are potentially multiple generalized correlation tuples in data and the loading matrix has a small number of nonzero rows. It includes sparse CCA and sparse PCA of correlation matrices as special cases. We first formulate sparse GCA as generalized eigenvalue problems at both population and sample levels via a careful choice of normalization constraints. Based on a Lagran"},"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":"2107.00371","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-07-01T11:15:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"32bdee0cc90f7464cb3d6ed1802210460c931198a1ecb6002f417697d7aa0ecb","abstract_canon_sha256":"0e8a85927ae8d936d36caf04de4f9c54c794111afbf4a189b2f1625ca73be2e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:39.691776Z","signature_b64":"Sxlo6h2niRtZR5UqV6eNlaI1NIaMn4LZ4SLe6sNeI2BriIu1/FqgBHDFDPf/VIs6/+a0AF770GUVkBVYyzNsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c4662484d8b312dae9603be190bc72ca6276ec8e0c5f21c251e891ad604baff","last_reissued_at":"2026-07-05T05:38:39.691368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:39.691368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse GCA and Thresholded Gradient Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Sheng Gao, Zongming Ma","submitted_at":"2021-07-01T11:15:20Z","abstract_excerpt":"Generalized correlation analysis (GCA) is concerned with uncovering linear relationships across multiple datasets. It generalizes canonical correlation analysis that is designed for two datasets. We study sparse GCA when there are potentially multiple generalized correlation tuples in data and the loading matrix has a small number of nonzero rows. It includes sparse CCA and sparse PCA of correlation matrices as special cases. We first formulate sparse GCA as generalized eigenvalue problems at both population and sample levels via a careful choice of normalization constraints. Based on a Lagran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00371","kind":"arxiv","version":2},"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/2107.00371/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2107.00371","created_at":"2026-07-05T05:38:39.691427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.00371v2","created_at":"2026-07-05T05:38:39.691427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00371","created_at":"2026-07-05T05:38:39.691427+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRDGESCNRMYS","created_at":"2026-07-05T05:38:39.691427+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRDGESCNRMYS3LUW","created_at":"2026-07-05T05:38:39.691427+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRDGESCN","created_at":"2026-07-05T05:38:39.691427+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.20008","citing_title":"Stochastic optimization over expectation-formulated generalized Stiefel manifold","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS","json":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS.json","graph_json":"https://pith.science/api/pith-number/BRDGESCNRMYS3LUWAO7BSC6HFS/graph.json","events_json":"https://pith.science/api/pith-number/BRDGESCNRMYS3LUWAO7BSC6HFS/events.json","paper":"https://pith.science/paper/BRDGESCN"},"agent_actions":{"view_html":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS","download_json":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS.json","view_paper":"https://pith.science/paper/BRDGESCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.00371&json=true","fetch_graph":"https://pith.science/api/pith-number/BRDGESCNRMYS3LUWAO7BSC6HFS/graph.json","fetch_events":"https://pith.science/api/pith-number/BRDGESCNRMYS3LUWAO7BSC6HFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS/action/storage_attestation","attest_author":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS/action/author_attestation","sign_citation":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS/action/citation_signature","submit_replication":"https://pith.science/pith/BRDGESCNRMYS3LUWAO7BSC6HFS/action/replication_record"}},"created_at":"2026-07-05T05:38:39.691427+00:00","updated_at":"2026-07-05T05:38:39.691427+00:00"}