{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:P7Q2JVBWYNWBRAMGLKIDDCPR57","short_pith_number":"pith:P7Q2JVBW","canonical_record":{"source":{"id":"1503.03903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T22:16:55Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT","stat.ML"],"title_canon_sha256":"295b28aa1d105fa9a709b4bd75518776d25fe34f037a9577047ead3b5cb59496","abstract_canon_sha256":"3a422d30c960f305133fb7fe577843d870345d33034b944cafb08db0a0a24f62"},"schema_version":"1.0"},"canonical_sha256":"7fe1a4d436c36c1881865a903189f1effa2d9f09b11cdd90058fee877e44e1ec","source":{"kind":"arxiv","id":"1503.03903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03903","created_at":"2026-05-18T02:23:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03903v1","created_at":"2026-05-18T02:23:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03903","created_at":"2026-05-18T02:23:57Z"},{"alias_kind":"pith_short_12","alias_value":"P7Q2JVBWYNWB","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P7Q2JVBWYNWBRAMG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P7Q2JVBW","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:P7Q2JVBWYNWBRAMGLKIDDCPR57","target":"record","payload":{"canonical_record":{"source":{"id":"1503.03903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T22:16:55Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT","stat.ML"],"title_canon_sha256":"295b28aa1d105fa9a709b4bd75518776d25fe34f037a9577047ead3b5cb59496","abstract_canon_sha256":"3a422d30c960f305133fb7fe577843d870345d33034b944cafb08db0a0a24f62"},"schema_version":"1.0"},"canonical_sha256":"7fe1a4d436c36c1881865a903189f1effa2d9f09b11cdd90058fee877e44e1ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:57.835415Z","signature_b64":"FoxRW484Rt/aD84ldEVTumi+f3UCxS4z93rayFwkqWF/y+rj7O2Hvsu1jy5K+QgF95aK0PdVl8oDcfbqvPUnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fe1a4d436c36c1881865a903189f1effa2d9f09b11cdd90058fee877e44e1ec","last_reissued_at":"2026-05-18T02:23:57.834805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:57.834805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.03903","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-05-18T02:23:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p35lG9JViBtDEEv4N6Lk6zFCPlgMSAqcj0btLmMceYd8bmkn6BbMdjnSxHPcgobD927VhQ2QRPSOW6zUfb2pDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:47:05.691972Z"},"content_sha256":"d06ea1c64cc4af7262fc020e514a451fc8cbf60370f1f66a96e6a2c9a15bd06a","schema_version":"1.0","event_id":"sha256:d06ea1c64cc4af7262fc020e514a451fc8cbf60370f1f66a96e6a2c9a15bd06a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:P7Q2JVBWYNWBRAMGLKIDDCPR57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Sparse PCA from Incomplete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhisek Kundu, Malik Magdon-Ismail, Petros Drineas","submitted_at":"2015-03-12T22:16:55Z","abstract_excerpt":"We study how well one can recover sparse principal components of a data matrix using a sketch formed from a few of its elements. We show that for a wide class of optimization problems, if the sketch is close (in the spectral norm) to the original data matrix, then one can recover a near optimal solution to the optimization problem by using the sketch. In particular, we use this approach to obtain sparse principal components and show that for \\math{m} data points in \\math{n} dimensions, \\math{O(\\epsilon^{-2}\\tilde k\\max\\{m,n\\})} elements gives an \\math{\\epsilon}-additive approximation to the sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03903","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":""},"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:23:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qcLQ3TGhJH3DBaMLH7rbRTKJUPDSI3i6FDHb9IQcEL75O37MGH5YJrAinHSTLBJKAblf6wCUBSMTA72QVtSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:47:05.692618Z"},"content_sha256":"b69792db43603c4ccbedf0966015cef7152259bf4b8f3743cd7541c486ba21cb","schema_version":"1.0","event_id":"sha256:b69792db43603c4ccbedf0966015cef7152259bf4b8f3743cd7541c486ba21cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7Q2JVBWYNWBRAMGLKIDDCPR57/bundle.json","state_url":"https://pith.science/pith/P7Q2JVBWYNWBRAMGLKIDDCPR57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7Q2JVBWYNWBRAMGLKIDDCPR57/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-30T07:47:05Z","links":{"resolver":"https://pith.science/pith/P7Q2JVBWYNWBRAMGLKIDDCPR57","bundle":"https://pith.science/pith/P7Q2JVBWYNWBRAMGLKIDDCPR57/bundle.json","state":"https://pith.science/pith/P7Q2JVBWYNWBRAMGLKIDDCPR57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7Q2JVBWYNWBRAMGLKIDDCPR57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:P7Q2JVBWYNWBRAMGLKIDDCPR57","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":"3a422d30c960f305133fb7fe577843d870345d33034b944cafb08db0a0a24f62","cross_cats_sorted":["cs.IT","cs.NA","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T22:16:55Z","title_canon_sha256":"295b28aa1d105fa9a709b4bd75518776d25fe34f037a9577047ead3b5cb59496"},"schema_version":"1.0","source":{"id":"1503.03903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03903","created_at":"2026-05-18T02:23:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03903v1","created_at":"2026-05-18T02:23:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03903","created_at":"2026-05-18T02:23:57Z"},{"alias_kind":"pith_short_12","alias_value":"P7Q2JVBWYNWB","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"P7Q2JVBWYNWBRAMG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"P7Q2JVBW","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:b69792db43603c4ccbedf0966015cef7152259bf4b8f3743cd7541c486ba21cb","target":"graph","created_at":"2026-05-18T02:23:57Z","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 study how well one can recover sparse principal components of a data matrix using a sketch formed from a few of its elements. We show that for a wide class of optimization problems, if the sketch is close (in the spectral norm) to the original data matrix, then one can recover a near optimal solution to the optimization problem by using the sketch. In particular, we use this approach to obtain sparse principal components and show that for \\math{m} data points in \\math{n} dimensions, \\math{O(\\epsilon^{-2}\\tilde k\\max\\{m,n\\})} elements gives an \\math{\\epsilon}-additive approximation to the sp","authors_text":"Abhisek Kundu, Malik Magdon-Ismail, Petros Drineas","cross_cats":["cs.IT","cs.NA","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T22:16:55Z","title":"Approximating Sparse PCA from Incomplete Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03903","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:d06ea1c64cc4af7262fc020e514a451fc8cbf60370f1f66a96e6a2c9a15bd06a","target":"record","created_at":"2026-05-18T02:23:57Z","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":"3a422d30c960f305133fb7fe577843d870345d33034b944cafb08db0a0a24f62","cross_cats_sorted":["cs.IT","cs.NA","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T22:16:55Z","title_canon_sha256":"295b28aa1d105fa9a709b4bd75518776d25fe34f037a9577047ead3b5cb59496"},"schema_version":"1.0","source":{"id":"1503.03903","kind":"arxiv","version":1}},"canonical_sha256":"7fe1a4d436c36c1881865a903189f1effa2d9f09b11cdd90058fee877e44e1ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fe1a4d436c36c1881865a903189f1effa2d9f09b11cdd90058fee877e44e1ec","first_computed_at":"2026-05-18T02:23:57.834805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:57.834805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FoxRW484Rt/aD84ldEVTumi+f3UCxS4z93rayFwkqWF/y+rj7O2Hvsu1jy5K+QgF95aK0PdVl8oDcfbqvPUnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:57.835415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d06ea1c64cc4af7262fc020e514a451fc8cbf60370f1f66a96e6a2c9a15bd06a","sha256:b69792db43603c4ccbedf0966015cef7152259bf4b8f3743cd7541c486ba21cb"],"state_sha256":"b43fef5b18e4c827a17fc3b5f25d2fd95e5875f3faa3277fc95dc55a48d54a3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHicjLYQMGEejmfhxwYQRQSgpIEhF8n44+c/x6GXtpl350SIVE2l2TkvDDfeXVEYlnSor27WXYqByEOWYXv/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:47:05.695528Z","bundle_sha256":"ddbc036b14f09c14244efd063c92feef92d147eb53dc5985a30d9f4293fcc134"}}