{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6JAZGWMCDLSQ6ASLDYJZ6SPOJD","short_pith_number":"pith:6JAZGWMC","canonical_record":{"source":{"id":"1401.6978","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-01-27T19:38:27Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"48971adc9725c5abe4a3664690c9d9edf06ac5ed1a59547c9f58963ed4158a45","abstract_canon_sha256":"9561eb847182797fdf7142c790f0df14f35ed1dcfe856a692c268e11fced1528"},"schema_version":"1.0"},"canonical_sha256":"f2419359821ae50f024b1e139f49ee48e999d2f1a8564dd36d6af7f5d6b828c8","source":{"kind":"arxiv","id":"1401.6978","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6978","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6978v3","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6978","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"6JAZGWMCDLSQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6JAZGWMCDLSQ6ASL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6JAZGWMC","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6JAZGWMCDLSQ6ASLDYJZ6SPOJD","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6978","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-01-27T19:38:27Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"48971adc9725c5abe4a3664690c9d9edf06ac5ed1a59547c9f58963ed4158a45","abstract_canon_sha256":"9561eb847182797fdf7142c790f0df14f35ed1dcfe856a692c268e11fced1528"},"schema_version":"1.0"},"canonical_sha256":"f2419359821ae50f024b1e139f49ee48e999d2f1a8564dd36d6af7f5d6b828c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:34.203970Z","signature_b64":"aD4KT1xaZZVtAwYgK0skhcVl2tM/ssVdTo2ANAEbFhLc35GinGGdUj8S6iJmwLCManjKN6y/Y5YcxttWw9r9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2419359821ae50f024b1e139f49ee48e999d2f1a8564dd36d6af7f5d6b828c8","last_reissued_at":"2026-05-18T02:25:34.203532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:34.203532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6978","source_version":3,"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-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91bXqbabxl00rmQkTkd/St4FFsVFtJG4StFwdiIiY2vX5WMkovDCz1sqvucdBgc8B1RRpJh6KAaSOd6Zj5XWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:23:16.093603Z"},"content_sha256":"3310b175feace64b670f315566a65a8f2089d603a563984e640d754dc7c86c50","schema_version":"1.0","event_id":"sha256:3310b175feace64b670f315566a65a8f2089d603a563984e640d754dc7c86c50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6JAZGWMCDLSQ6ASLDYJZ6SPOJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsistency and agnostic inference in sparse PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jing Lei, Vincent Q. Vu","submitted_at":"2014-01-27T19:38:27Z","abstract_excerpt":"The presence of a sparse \"truth\" has been a constant assumption in the theoretical analysis of sparse PCA and is often implicit in its methodological development. This naturally raises questions about the properties of sparse PCA methods and how they depend on the assumption of sparsity. Under what conditions can the relevant variables be selected consistently if the truth is assumed to be sparse? What can be said about the results of sparse PCA without assuming a sparse and unique truth? We answer these questions by investigating the properties of the recently proposed Fantope projection and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6978","kind":"arxiv","version":3},"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-18T02:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+HYo0JDMpTdKLgWvO1ajj1mgW5ei2Uh8bLAE+SYTMgr7J+5OAkxAOmYWqMXvYSYKNX2bfcaFPLx2hOAUnuXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:23:16.094262Z"},"content_sha256":"09222c9ac299fdd2b17aebfb563296d6b9bb3a84ad8e6d051736c6309ced6cb3","schema_version":"1.0","event_id":"sha256:09222c9ac299fdd2b17aebfb563296d6b9bb3a84ad8e6d051736c6309ced6cb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JAZGWMCDLSQ6ASLDYJZ6SPOJD/bundle.json","state_url":"https://pith.science/pith/6JAZGWMCDLSQ6ASLDYJZ6SPOJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JAZGWMCDLSQ6ASLDYJZ6SPOJD/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-31T15:23:16Z","links":{"resolver":"https://pith.science/pith/6JAZGWMCDLSQ6ASLDYJZ6SPOJD","bundle":"https://pith.science/pith/6JAZGWMCDLSQ6ASLDYJZ6SPOJD/bundle.json","state":"https://pith.science/pith/6JAZGWMCDLSQ6ASLDYJZ6SPOJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JAZGWMCDLSQ6ASLDYJZ6SPOJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6JAZGWMCDLSQ6ASLDYJZ6SPOJD","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":"9561eb847182797fdf7142c790f0df14f35ed1dcfe856a692c268e11fced1528","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-01-27T19:38:27Z","title_canon_sha256":"48971adc9725c5abe4a3664690c9d9edf06ac5ed1a59547c9f58963ed4158a45"},"schema_version":"1.0","source":{"id":"1401.6978","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6978","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6978v3","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6978","created_at":"2026-05-18T02:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"6JAZGWMCDLSQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6JAZGWMCDLSQ6ASL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6JAZGWMC","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:09222c9ac299fdd2b17aebfb563296d6b9bb3a84ad8e6d051736c6309ced6cb3","target":"graph","created_at":"2026-05-18T02:25:34Z","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":"The presence of a sparse \"truth\" has been a constant assumption in the theoretical analysis of sparse PCA and is often implicit in its methodological development. This naturally raises questions about the properties of sparse PCA methods and how they depend on the assumption of sparsity. Under what conditions can the relevant variables be selected consistently if the truth is assumed to be sparse? What can be said about the results of sparse PCA without assuming a sparse and unique truth? We answer these questions by investigating the properties of the recently proposed Fantope projection and ","authors_text":"Jing Lei, Vincent Q. Vu","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-01-27T19:38:27Z","title":"Sparsistency and agnostic inference in sparse PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6978","kind":"arxiv","version":3},"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:3310b175feace64b670f315566a65a8f2089d603a563984e640d754dc7c86c50","target":"record","created_at":"2026-05-18T02:25:34Z","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":"9561eb847182797fdf7142c790f0df14f35ed1dcfe856a692c268e11fced1528","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-01-27T19:38:27Z","title_canon_sha256":"48971adc9725c5abe4a3664690c9d9edf06ac5ed1a59547c9f58963ed4158a45"},"schema_version":"1.0","source":{"id":"1401.6978","kind":"arxiv","version":3}},"canonical_sha256":"f2419359821ae50f024b1e139f49ee48e999d2f1a8564dd36d6af7f5d6b828c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2419359821ae50f024b1e139f49ee48e999d2f1a8564dd36d6af7f5d6b828c8","first_computed_at":"2026-05-18T02:25:34.203532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:34.203532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aD4KT1xaZZVtAwYgK0skhcVl2tM/ssVdTo2ANAEbFhLc35GinGGdUj8S6iJmwLCManjKN6y/Y5YcxttWw9r9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:34.203970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6978","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3310b175feace64b670f315566a65a8f2089d603a563984e640d754dc7c86c50","sha256:09222c9ac299fdd2b17aebfb563296d6b9bb3a84ad8e6d051736c6309ced6cb3"],"state_sha256":"a6122c4584f969c2937af5a0feb9c16a099ffec51a1d35f66dd030f61096b500"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gVSnylcLJVpf/iAwltBVa7ejF8QRlV7/c0YRFp17bLX8oxjbjV9jy6/LLw7PaBPR0EY2l09mKFUIMakNhurCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:23:16.098376Z","bundle_sha256":"e6b78889e40e9c8ce7e7dd95e30164b810dd6471919210a10822ae0fc391678d"}}