{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5HZU36E376RS6CXOJB5PM2ZPIZ","short_pith_number":"pith:5HZU36E3","canonical_record":{"source":{"id":"2507.11160","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-15T10:09:50Z","cross_cats_sorted":[],"title_canon_sha256":"21e2e276d552c6b0096e0b190ce4337febb8389405540c2a27c8c4214aeafab9","abstract_canon_sha256":"caffd65e0283d8c98ff90924b555862d42f4008e31cc06bdfb82d2bfe55e7794"},"schema_version":"1.0"},"canonical_sha256":"e9f34df89bffa32f0aee487af66b2f465b9d16d9d8d72979c172ded0e6415ed8","source":{"kind":"arxiv","id":"2507.11160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11160","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11160v1","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11160","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"5HZU36E376RS","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_16","alias_value":"5HZU36E376RS6CXO","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_8","alias_value":"5HZU36E3","created_at":"2026-07-05T11:37:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5HZU36E376RS6CXOJB5PM2ZPIZ","target":"record","payload":{"canonical_record":{"source":{"id":"2507.11160","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-15T10:09:50Z","cross_cats_sorted":[],"title_canon_sha256":"21e2e276d552c6b0096e0b190ce4337febb8389405540c2a27c8c4214aeafab9","abstract_canon_sha256":"caffd65e0283d8c98ff90924b555862d42f4008e31cc06bdfb82d2bfe55e7794"},"schema_version":"1.0"},"canonical_sha256":"e9f34df89bffa32f0aee487af66b2f465b9d16d9d8d72979c172ded0e6415ed8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:33.484949Z","signature_b64":"VYi0qXRjE2LXH8WVxxfyAYzhxMC+uSKqoJ+rCAMl5lsfjowtaK2B7tR1PL2qiqpDfJEWLrEBUVgTeTMaQVzDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9f34df89bffa32f0aee487af66b2f465b9d16d9d8d72979c172ded0e6415ed8","last_reissued_at":"2026-07-05T11:37:33.484387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:33.484387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.11160","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-05T11:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBJ1uZPQtf6TiPns7gnU0sH07FUMPqi29YOQbjRcCRP1BFOt5kXRzHS0old6ymRU5l7+XAaGEKF5zcawko84DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:57:25.632881Z"},"content_sha256":"8b2399d13b3b98d8465138aa9124112b79255c3a1e0d8119fddf8b9669f643aa","schema_version":"1.0","event_id":"sha256:8b2399d13b3b98d8465138aa9124112b79255c3a1e0d8119fddf8b9669f643aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5HZU36E376RS6CXOJB5PM2ZPIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Canonical Correlation Analysis with Sparsity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Claire Donnat, Elena Tuzhilina, Zixuan Wu","submitted_at":"2025-07-15T10:09:50Z","abstract_excerpt":"In high-dimensional settings, Canonical Correlation Analysis (CCA) often fails, and existing sparse methods force an untenable choice between computational speed and statistical rigor. This work introduces a fast and provably consistent sparse CCA algorithm (ECCAR) that resolves this trade-off. We formulate CCA as a high-dimensional reduced-rank regression problem, which allows us to derive consistent estimators with high-probability error bounds without relying on computationally expensive techniques like Fantope projections. The resulting algorithm is scalable, projection-free, and significa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11160","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/2507.11160/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-05T11:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zW5X6MFp491C7nXemj5ksCh6OfxzimQWDclh0jyMq8n+xfor+ywInU8PiJI4vgyuiuYJ3zQbCLxg3S9VZFqAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:57:25.633475Z"},"content_sha256":"d7d221e2e4290fcbbb85b165c08ba86d82bb5af89596e170c978128207cc0a57","schema_version":"1.0","event_id":"sha256:d7d221e2e4290fcbbb85b165c08ba86d82bb5af89596e170c978128207cc0a57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HZU36E376RS6CXOJB5PM2ZPIZ/bundle.json","state_url":"https://pith.science/pith/5HZU36E376RS6CXOJB5PM2ZPIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HZU36E376RS6CXOJB5PM2ZPIZ/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-14T01:57:25Z","links":{"resolver":"https://pith.science/pith/5HZU36E376RS6CXOJB5PM2ZPIZ","bundle":"https://pith.science/pith/5HZU36E376RS6CXOJB5PM2ZPIZ/bundle.json","state":"https://pith.science/pith/5HZU36E376RS6CXOJB5PM2ZPIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HZU36E376RS6CXOJB5PM2ZPIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5HZU36E376RS6CXOJB5PM2ZPIZ","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":"caffd65e0283d8c98ff90924b555862d42f4008e31cc06bdfb82d2bfe55e7794","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-15T10:09:50Z","title_canon_sha256":"21e2e276d552c6b0096e0b190ce4337febb8389405540c2a27c8c4214aeafab9"},"schema_version":"1.0","source":{"id":"2507.11160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11160","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11160v1","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11160","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"5HZU36E376RS","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_16","alias_value":"5HZU36E376RS6CXO","created_at":"2026-07-05T11:37:33Z"},{"alias_kind":"pith_short_8","alias_value":"5HZU36E3","created_at":"2026-07-05T11:37:33Z"}],"graph_snapshots":[{"event_id":"sha256:d7d221e2e4290fcbbb85b165c08ba86d82bb5af89596e170c978128207cc0a57","target":"graph","created_at":"2026-07-05T11:37: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.11160/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In high-dimensional settings, Canonical Correlation Analysis (CCA) often fails, and existing sparse methods force an untenable choice between computational speed and statistical rigor. This work introduces a fast and provably consistent sparse CCA algorithm (ECCAR) that resolves this trade-off. We formulate CCA as a high-dimensional reduced-rank regression problem, which allows us to derive consistent estimators with high-probability error bounds without relying on computationally expensive techniques like Fantope projections. The resulting algorithm is scalable, projection-free, and significa","authors_text":"Claire Donnat, Elena Tuzhilina, Zixuan Wu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-15T10:09:50Z","title":"Efficient Canonical Correlation Analysis with Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11160","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:8b2399d13b3b98d8465138aa9124112b79255c3a1e0d8119fddf8b9669f643aa","target":"record","created_at":"2026-07-05T11:37: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":"caffd65e0283d8c98ff90924b555862d42f4008e31cc06bdfb82d2bfe55e7794","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-15T10:09:50Z","title_canon_sha256":"21e2e276d552c6b0096e0b190ce4337febb8389405540c2a27c8c4214aeafab9"},"schema_version":"1.0","source":{"id":"2507.11160","kind":"arxiv","version":1}},"canonical_sha256":"e9f34df89bffa32f0aee487af66b2f465b9d16d9d8d72979c172ded0e6415ed8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9f34df89bffa32f0aee487af66b2f465b9d16d9d8d72979c172ded0e6415ed8","first_computed_at":"2026-07-05T11:37:33.484387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:33.484387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VYi0qXRjE2LXH8WVxxfyAYzhxMC+uSKqoJ+rCAMl5lsfjowtaK2B7tR1PL2qiqpDfJEWLrEBUVgTeTMaQVzDCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:33.484949Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b2399d13b3b98d8465138aa9124112b79255c3a1e0d8119fddf8b9669f643aa","sha256:d7d221e2e4290fcbbb85b165c08ba86d82bb5af89596e170c978128207cc0a57"],"state_sha256":"e95f77796dbbe2a7932b062ff567c235726879a543aa7f35807c5fb613729d08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTnjnBRUcCF4SOT0/zeCs1imXDlSxfmlOC6w1ZmeNsz1qw8bsajKsY7fU9k5abKuQV0YhIxl0JOpcO5Wv0ORAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T01:57:25.637373Z","bundle_sha256":"7dae98788b0777d22155bfb7752a51fbb180c9e7159c453951a14740f741f516"}}