{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ROHAIZOPMGAQWXFQXFDD5OH3GO","short_pith_number":"pith:ROHAIZOP","canonical_record":{"source":{"id":"2507.09148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-07-12T05:43:56Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"809b8b27c727b9287fdcda50add46959760a5b0c879a41969e29fb198527bb31","abstract_canon_sha256":"632b255266b646549f0327bb1a8004ee3b1e121b148c1b08586fcfcb9c1500fa"},"schema_version":"1.0"},"canonical_sha256":"8b8e0465cf61810b5cb0b9463eb8fb3381cbb160351202242b720588e5d7bcca","source":{"kind":"arxiv","id":"2507.09148","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09148","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09148v2","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09148","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"ROHAIZOPMGAQ","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"pith_short_16","alias_value":"ROHAIZOPMGAQWXFQ","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"pith_short_8","alias_value":"ROHAIZOP","created_at":"2026-05-20T00:02:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ROHAIZOPMGAQWXFQXFDD5OH3GO","target":"record","payload":{"canonical_record":{"source":{"id":"2507.09148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-07-12T05:43:56Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"809b8b27c727b9287fdcda50add46959760a5b0c879a41969e29fb198527bb31","abstract_canon_sha256":"632b255266b646549f0327bb1a8004ee3b1e121b148c1b08586fcfcb9c1500fa"},"schema_version":"1.0"},"canonical_sha256":"8b8e0465cf61810b5cb0b9463eb8fb3381cbb160351202242b720588e5d7bcca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:05.558973Z","signature_b64":"UxLvhRrTGx97IIllnOowVhmijUVD5ohjJPdK43aEAi0MBqjwytZo1JJohlSTfLWB28UOra2YfiANTlGJ/FoaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b8e0465cf61810b5cb0b9463eb8fb3381cbb160351202242b720588e5d7bcca","last_reissued_at":"2026-05-20T00:02:05.558080Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:05.558080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.09148","source_version":2,"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-20T00:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZlDX8fdETOQkj1p7R6pp5K9pb0896b2BUdy6a+mUVsHGl74+qLpixE+DPu6PTi/oXx3FAIQrOMBMdye6wWWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:13:27.119003Z"},"content_sha256":"2d64957511d7b2a7f84363a50260ac7432b9313bd8a66244ef530b3fec004cac","schema_version":"1.0","event_id":"sha256:2d64957511d7b2a7f84363a50260ac7432b9313bd8a66244ef530b3fec004cac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ROHAIZOPMGAQWXFQXFDD5OH3GO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Alberto Del Pia, Dekun Zhou","submitted_at":"2025-07-12T05:43:56Z","abstract_excerpt":"Sparse Principal Component Analysis (SPCA) is a fundamental technique for dimensionality reduction, and is NP-hard. In this paper, we introduce a randomized approximation algorithm for SPCA, which is based on the basic SDP relaxation. Our algorithm takes an (approximate) SDP solution, constructs one deterministic sparse solution and several randomized solutions, and outputs the best among them. Our algorithm has an approximation ratio of at most the sparsity constant with high probability, if called enough times. Under a technical assumption, which is consistently satisfied in our numerical te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09148","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/2507.09148/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-05-20T00:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imZ0J30TWg0yPuW9a8k+8WsehM+94vNY1fIlQlRb3RlKUpJY//dsGL74iPx9FJyWE1mi6eEpjcZwIDlB3dnrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:13:27.119736Z"},"content_sha256":"231f40c57531fb48bcf778c4dcbcf1391893a99c48e95332a2475271837e326d","schema_version":"1.0","event_id":"sha256:231f40c57531fb48bcf778c4dcbcf1391893a99c48e95332a2475271837e326d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROHAIZOPMGAQWXFQXFDD5OH3GO/bundle.json","state_url":"https://pith.science/pith/ROHAIZOPMGAQWXFQXFDD5OH3GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROHAIZOPMGAQWXFQXFDD5OH3GO/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-24T07:13:27Z","links":{"resolver":"https://pith.science/pith/ROHAIZOPMGAQWXFQXFDD5OH3GO","bundle":"https://pith.science/pith/ROHAIZOPMGAQWXFQXFDD5OH3GO/bundle.json","state":"https://pith.science/pith/ROHAIZOPMGAQWXFQXFDD5OH3GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROHAIZOPMGAQWXFQXFDD5OH3GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ROHAIZOPMGAQWXFQXFDD5OH3GO","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":"632b255266b646549f0327bb1a8004ee3b1e121b148c1b08586fcfcb9c1500fa","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-07-12T05:43:56Z","title_canon_sha256":"809b8b27c727b9287fdcda50add46959760a5b0c879a41969e29fb198527bb31"},"schema_version":"1.0","source":{"id":"2507.09148","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09148","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09148v2","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09148","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"ROHAIZOPMGAQ","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"pith_short_16","alias_value":"ROHAIZOPMGAQWXFQ","created_at":"2026-05-20T00:02:05Z"},{"alias_kind":"pith_short_8","alias_value":"ROHAIZOP","created_at":"2026-05-20T00:02:05Z"}],"graph_snapshots":[{"event_id":"sha256:231f40c57531fb48bcf778c4dcbcf1391893a99c48e95332a2475271837e326d","target":"graph","created_at":"2026-05-20T00:02:05Z","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.09148/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparse Principal Component Analysis (SPCA) is a fundamental technique for dimensionality reduction, and is NP-hard. In this paper, we introduce a randomized approximation algorithm for SPCA, which is based on the basic SDP relaxation. Our algorithm takes an (approximate) SDP solution, constructs one deterministic sparse solution and several randomized solutions, and outputs the best among them. Our algorithm has an approximation ratio of at most the sparsity constant with high probability, if called enough times. Under a technical assumption, which is consistently satisfied in our numerical te","authors_text":"Alberto Del Pia, Dekun Zhou","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-07-12T05:43:56Z","title":"A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09148","kind":"arxiv","version":2},"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:2d64957511d7b2a7f84363a50260ac7432b9313bd8a66244ef530b3fec004cac","target":"record","created_at":"2026-05-20T00:02:05Z","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":"632b255266b646549f0327bb1a8004ee3b1e121b148c1b08586fcfcb9c1500fa","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-07-12T05:43:56Z","title_canon_sha256":"809b8b27c727b9287fdcda50add46959760a5b0c879a41969e29fb198527bb31"},"schema_version":"1.0","source":{"id":"2507.09148","kind":"arxiv","version":2}},"canonical_sha256":"8b8e0465cf61810b5cb0b9463eb8fb3381cbb160351202242b720588e5d7bcca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b8e0465cf61810b5cb0b9463eb8fb3381cbb160351202242b720588e5d7bcca","first_computed_at":"2026-05-20T00:02:05.558080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:05.558080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UxLvhRrTGx97IIllnOowVhmijUVD5ohjJPdK43aEAi0MBqjwytZo1JJohlSTfLWB28UOra2YfiANTlGJ/FoaAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:05.558973Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.09148","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d64957511d7b2a7f84363a50260ac7432b9313bd8a66244ef530b3fec004cac","sha256:231f40c57531fb48bcf778c4dcbcf1391893a99c48e95332a2475271837e326d"],"state_sha256":"8ebf27e53c9b6ec1a664e75dfed72695570702e0bfdf459ea61ccd3dbf34d082"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9o8uk5hrlWzzli+MqtwKuJKCGXmFIQBueXRZfVH6dnrrc66JDSbqdidrq6CuN8DIpl/yHXNWurYtV73mNqsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T07:13:27.123247Z","bundle_sha256":"7069b00c8c492dd971f4ed2c689a32efe99a793777fa1c081a81d86cf3e78dfc"}}