{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:37YIG4CTTYLA4DBAJVLENA5LNJ","short_pith_number":"pith:37YIG4CT","canonical_record":{"source":{"id":"2412.17792","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2024-12-23T18:50:34Z","cross_cats_sorted":[],"title_canon_sha256":"580f33a1ce8054c1f33cd902657a50fdb841c5577f58caae7a25cd231f016b54","abstract_canon_sha256":"07ca3ec50fbeaec802ee5e36f06d3128386938b1fae35dfd92b655f449f542fa"},"schema_version":"1.0"},"canonical_sha256":"dff08370539e160e0c204d564683ab6a69acfe8b534506f8b375b6c6cc0a9d21","source":{"kind":"arxiv","id":"2412.17792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17792","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17792v1","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17792","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"37YIG4CTTYLA","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"pith_short_16","alias_value":"37YIG4CTTYLA4DBA","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"pith_short_8","alias_value":"37YIG4CT","created_at":"2026-07-05T09:53:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:37YIG4CTTYLA4DBAJVLENA5LNJ","target":"record","payload":{"canonical_record":{"source":{"id":"2412.17792","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2024-12-23T18:50:34Z","cross_cats_sorted":[],"title_canon_sha256":"580f33a1ce8054c1f33cd902657a50fdb841c5577f58caae7a25cd231f016b54","abstract_canon_sha256":"07ca3ec50fbeaec802ee5e36f06d3128386938b1fae35dfd92b655f449f542fa"},"schema_version":"1.0"},"canonical_sha256":"dff08370539e160e0c204d564683ab6a69acfe8b534506f8b375b6c6cc0a9d21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:27.406016Z","signature_b64":"lzNxZGzatl5KXQHF7nyZNz3amPABvXMtBb3CaLqOkFSrCywOwqschlaWbMB+gz2RhdA1PG/Do+eOn90NxvFpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dff08370539e160e0c204d564683ab6a69acfe8b534506f8b375b6c6cc0a9d21","last_reissued_at":"2026-07-05T09:53:27.405418Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:27.405418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.17792","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-05T09:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEb03+3wXZ5NtKCnNF8GGrzQB0yQM0IWtCwIs98c20L9hIpby545la1ROFtBIQousWUwNzJOOpYjlQZV/JI+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T21:23:11.886661Z"},"content_sha256":"49f543439011b1f35c2dc083dc798dbd97120d25a975bf2d7941b2df4117e1cc","schema_version":"1.0","event_id":"sha256:49f543439011b1f35c2dc083dc798dbd97120d25a975bf2d7941b2df4117e1cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:37YIG4CTTYLA4DBAJVLENA5LNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Estimation and Gap-Free Analysis of Canonical Correlations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Canyi Chen, Liping Zhu","submitted_at":"2024-12-23T18:50:34Z","abstract_excerpt":"Massive data analysis calls for distributed algorithms and theories. We design a multi-round distributed algorithm for canonical correlation analysis. We construct principal directions through the convex formulation of canonical correlation analysis and use the shift-and-invert preconditioning iteration to expedite the convergence rate. This distributed algorithm is communication-efficient. The resultant estimate achieves the same convergence rate as if all observations were pooled together, but does not impose stringent restrictions on the number of machines. We take a gap-free analysis to by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17792","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/2412.17792/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-05T09:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wR1VlLibWwZmuak7OoEm/FfJ+TIHEouTVIcDV60ychUZyRRMRJWcUOBOZ5gOHrcEEll8kV910fvmO/maQdtYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T21:23:11.887658Z"},"content_sha256":"969fa281ac086b690a85805f34ce3779a844652fe4c4e76a5405189de7cb0b2f","schema_version":"1.0","event_id":"sha256:969fa281ac086b690a85805f34ce3779a844652fe4c4e76a5405189de7cb0b2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37YIG4CTTYLA4DBAJVLENA5LNJ/bundle.json","state_url":"https://pith.science/pith/37YIG4CTTYLA4DBAJVLENA5LNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37YIG4CTTYLA4DBAJVLENA5LNJ/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-13T21:23:11Z","links":{"resolver":"https://pith.science/pith/37YIG4CTTYLA4DBAJVLENA5LNJ","bundle":"https://pith.science/pith/37YIG4CTTYLA4DBAJVLENA5LNJ/bundle.json","state":"https://pith.science/pith/37YIG4CTTYLA4DBAJVLENA5LNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37YIG4CTTYLA4DBAJVLENA5LNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:37YIG4CTTYLA4DBAJVLENA5LNJ","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":"07ca3ec50fbeaec802ee5e36f06d3128386938b1fae35dfd92b655f449f542fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2024-12-23T18:50:34Z","title_canon_sha256":"580f33a1ce8054c1f33cd902657a50fdb841c5577f58caae7a25cd231f016b54"},"schema_version":"1.0","source":{"id":"2412.17792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17792","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17792v1","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17792","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"37YIG4CTTYLA","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"pith_short_16","alias_value":"37YIG4CTTYLA4DBA","created_at":"2026-07-05T09:53:27Z"},{"alias_kind":"pith_short_8","alias_value":"37YIG4CT","created_at":"2026-07-05T09:53:27Z"}],"graph_snapshots":[{"event_id":"sha256:969fa281ac086b690a85805f34ce3779a844652fe4c4e76a5405189de7cb0b2f","target":"graph","created_at":"2026-07-05T09:53:27Z","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/2412.17792/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Massive data analysis calls for distributed algorithms and theories. We design a multi-round distributed algorithm for canonical correlation analysis. We construct principal directions through the convex formulation of canonical correlation analysis and use the shift-and-invert preconditioning iteration to expedite the convergence rate. This distributed algorithm is communication-efficient. The resultant estimate achieves the same convergence rate as if all observations were pooled together, but does not impose stringent restrictions on the number of machines. We take a gap-free analysis to by","authors_text":"Canyi Chen, Liping Zhu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2024-12-23T18:50:34Z","title":"Distributed Estimation and Gap-Free Analysis of Canonical Correlations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17792","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:49f543439011b1f35c2dc083dc798dbd97120d25a975bf2d7941b2df4117e1cc","target":"record","created_at":"2026-07-05T09:53:27Z","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":"07ca3ec50fbeaec802ee5e36f06d3128386938b1fae35dfd92b655f449f542fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2024-12-23T18:50:34Z","title_canon_sha256":"580f33a1ce8054c1f33cd902657a50fdb841c5577f58caae7a25cd231f016b54"},"schema_version":"1.0","source":{"id":"2412.17792","kind":"arxiv","version":1}},"canonical_sha256":"dff08370539e160e0c204d564683ab6a69acfe8b534506f8b375b6c6cc0a9d21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dff08370539e160e0c204d564683ab6a69acfe8b534506f8b375b6c6cc0a9d21","first_computed_at":"2026-07-05T09:53:27.405418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:27.405418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lzNxZGzatl5KXQHF7nyZNz3amPABvXMtBb3CaLqOkFSrCywOwqschlaWbMB+gz2RhdA1PG/Do+eOn90NxvFpBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:27.406016Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49f543439011b1f35c2dc083dc798dbd97120d25a975bf2d7941b2df4117e1cc","sha256:969fa281ac086b690a85805f34ce3779a844652fe4c4e76a5405189de7cb0b2f"],"state_sha256":"5c72ee39de984a2d1859e76c5e2b82372b7c078a8e8cfcfd702ddbc8b1ddbc92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCS7RjNWBEnqjBejj0V6FGCD3rNc2bwfQQm7z7E7IeULSjtkZ0OKHqaXazIz5BKkk7SVATtGCKW6WchwZeeaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T21:23:11.901616Z","bundle_sha256":"c1acf508db8a7b0fd04956dae740ffcd90c61c6031ead291395b872f2a5e4a81"}}