{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GZKSTFN2ABRYOKJSNXV533J4U3","short_pith_number":"pith:GZKSTFN2","canonical_record":{"source":{"id":"1712.05630","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-15T11:55:39Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"9987acb41d5d90dde5d42da2f70bac798a4a97b305063f1548d0dfaa4ec4d840","abstract_canon_sha256":"bbf04c65577d64c75fe90d10363dd702d8a942fe588ebb04130311f6d7697aa1"},"schema_version":"1.0"},"canonical_sha256":"36552995ba00638729326debdded3ca6ded8426eca565b5208fc1110811061da","source":{"kind":"arxiv","id":"1712.05630","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05630","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05630v4","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05630","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"GZKSTFN2ABRY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GZKSTFN2ABRYOKJS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GZKSTFN2","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GZKSTFN2ABRYOKJSNXV533J4U3","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05630","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-15T11:55:39Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"9987acb41d5d90dde5d42da2f70bac798a4a97b305063f1548d0dfaa4ec4d840","abstract_canon_sha256":"bbf04c65577d64c75fe90d10363dd702d8a942fe588ebb04130311f6d7697aa1"},"schema_version":"1.0"},"canonical_sha256":"36552995ba00638729326debdded3ca6ded8426eca565b5208fc1110811061da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:03.630643Z","signature_b64":"Y5QLc2/NIBKiXL98DRuAhYGEBdRLlOknRv4P3p8qbBMw6et2Q/FoRtUq/AmIXorwOHk8Zcb1D81kcvWu6PAGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36552995ba00638729326debdded3ca6ded8426eca565b5208fc1110811061da","last_reissued_at":"2026-05-17T23:47:03.629976Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:03.629976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05630","source_version":4,"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-17T23:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuH1qsNFj66G0xhJEw35mN3fsFw13yatnHa6jHMUJByt8SwM7Ar7ooswbrYrk90xepktzpcjv3npDEZsOSKUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:10:19.202382Z"},"content_sha256":"4ad5f3e59cf3603bc17ecf1ac41b9703f0e160bd1b1c0e451e14ededa34d3cd2","schema_version":"1.0","event_id":"sha256:4ad5f3e59cf3603bc17ecf1ac41b9703f0e160bd1b1c0e451e14ededa34d3cd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GZKSTFN2ABRYOKJSNXV533J4U3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse principal component analysis via axis-aligned random projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Milana Gataric, Richard J. Samworth, Tengyao Wang","submitted_at":"2017-12-15T11:55:39Z","abstract_excerpt":"We introduce a new method for sparse principal component analysis, based on the aggregation of eigenvector information from carefully-selected axis-aligned random projections of the sample covariance matrix. Unlike most alternative approaches, our algorithm is non-iterative, so is not vulnerable to a bad choice of initialisation. We provide theoretical guarantees under which our principal subspace estimator can attain the minimax optimal rate of convergence in polynomial time. In addition, our theory provides a more refined understanding of the statistical and computational trade-off in the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05630","kind":"arxiv","version":4},"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-17T23:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAAELZyo0zuy9qogtKBZR6dS6cJ5vYmuAwh02pKmuMlPzr1o4hE1lqA6PqO6/pQGwldE6nJnaHwhy6CCOXK1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:10:19.203078Z"},"content_sha256":"4f58b09b807aec3493f8e354bfde49f1e3db71a0ea035890b9858218f8228c33","schema_version":"1.0","event_id":"sha256:4f58b09b807aec3493f8e354bfde49f1e3db71a0ea035890b9858218f8228c33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZKSTFN2ABRYOKJSNXV533J4U3/bundle.json","state_url":"https://pith.science/pith/GZKSTFN2ABRYOKJSNXV533J4U3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZKSTFN2ABRYOKJSNXV533J4U3/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-27T21:10:19Z","links":{"resolver":"https://pith.science/pith/GZKSTFN2ABRYOKJSNXV533J4U3","bundle":"https://pith.science/pith/GZKSTFN2ABRYOKJSNXV533J4U3/bundle.json","state":"https://pith.science/pith/GZKSTFN2ABRYOKJSNXV533J4U3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZKSTFN2ABRYOKJSNXV533J4U3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GZKSTFN2ABRYOKJSNXV533J4U3","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":"bbf04c65577d64c75fe90d10363dd702d8a942fe588ebb04130311f6d7697aa1","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-15T11:55:39Z","title_canon_sha256":"9987acb41d5d90dde5d42da2f70bac798a4a97b305063f1548d0dfaa4ec4d840"},"schema_version":"1.0","source":{"id":"1712.05630","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05630","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05630v4","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05630","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"GZKSTFN2ABRY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GZKSTFN2ABRYOKJS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GZKSTFN2","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:4f58b09b807aec3493f8e354bfde49f1e3db71a0ea035890b9858218f8228c33","target":"graph","created_at":"2026-05-17T23:47:03Z","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":"We introduce a new method for sparse principal component analysis, based on the aggregation of eigenvector information from carefully-selected axis-aligned random projections of the sample covariance matrix. Unlike most alternative approaches, our algorithm is non-iterative, so is not vulnerable to a bad choice of initialisation. We provide theoretical guarantees under which our principal subspace estimator can attain the minimax optimal rate of convergence in polynomial time. In addition, our theory provides a more refined understanding of the statistical and computational trade-off in the pr","authors_text":"Milana Gataric, Richard J. Samworth, Tengyao Wang","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-15T11:55:39Z","title":"Sparse principal component analysis via axis-aligned random projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05630","kind":"arxiv","version":4},"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:4ad5f3e59cf3603bc17ecf1ac41b9703f0e160bd1b1c0e451e14ededa34d3cd2","target":"record","created_at":"2026-05-17T23:47:03Z","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":"bbf04c65577d64c75fe90d10363dd702d8a942fe588ebb04130311f6d7697aa1","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-15T11:55:39Z","title_canon_sha256":"9987acb41d5d90dde5d42da2f70bac798a4a97b305063f1548d0dfaa4ec4d840"},"schema_version":"1.0","source":{"id":"1712.05630","kind":"arxiv","version":4}},"canonical_sha256":"36552995ba00638729326debdded3ca6ded8426eca565b5208fc1110811061da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36552995ba00638729326debdded3ca6ded8426eca565b5208fc1110811061da","first_computed_at":"2026-05-17T23:47:03.629976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:03.629976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y5QLc2/NIBKiXL98DRuAhYGEBdRLlOknRv4P3p8qbBMw6et2Q/FoRtUq/AmIXorwOHk8Zcb1D81kcvWu6PAGAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:03.630643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05630","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ad5f3e59cf3603bc17ecf1ac41b9703f0e160bd1b1c0e451e14ededa34d3cd2","sha256:4f58b09b807aec3493f8e354bfde49f1e3db71a0ea035890b9858218f8228c33"],"state_sha256":"b27235b4815653588f146bb09aa71c21e7014a9364970da7e419390d06f0af4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79aDwq4fECyouDzfG+his/wHLI/Z1orXfTHBg36lvjdVGNcBUYAbLECHgD9Lcrn8Yg1heRKUvW6lC7ai4eVbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:10:19.206886Z","bundle_sha256":"e3c6fab5611d0fd6cee2a70de38bde574492463780be58e25fe2b59cb06ef466"}}