{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QFXHUMZJTX3NI7SBOYKJR23MSX","short_pith_number":"pith:QFXHUMZJ","canonical_record":{"source":{"id":"1507.05950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-21T19:34:32Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"title_canon_sha256":"4129b9c6719a9785d915b164f38dc96a67d8f4fcbfc8e0ff4d604bf9d8de8451","abstract_canon_sha256":"acc953ad6d0520243bfe44a9a255e822a3ab692a371a2d99c044ed17706da69c"},"schema_version":"1.0"},"canonical_sha256":"816e7a33299df6d47e41761498eb6c95fc6633f3bbe27dbd2f002906f16030e0","source":{"kind":"arxiv","id":"1507.05950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05950","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05950v1","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05950","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"pith_short_12","alias_value":"QFXHUMZJTX3N","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QFXHUMZJTX3NI7SB","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QFXHUMZJ","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QFXHUMZJTX3NI7SBOYKJR23MSX","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-21T19:34:32Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"title_canon_sha256":"4129b9c6719a9785d915b164f38dc96a67d8f4fcbfc8e0ff4d604bf9d8de8451","abstract_canon_sha256":"acc953ad6d0520243bfe44a9a255e822a3ab692a371a2d99c044ed17706da69c"},"schema_version":"1.0"},"canonical_sha256":"816e7a33299df6d47e41761498eb6c95fc6633f3bbe27dbd2f002906f16030e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:32.064368Z","signature_b64":"ov1wlP9RbTbHMYF1WnyDZOlWkzYlu58M3zbYxI959P60MT4Yt+OOtvGwMS4V7g30Bh5NsANVv0F4mwW0u7bYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"816e7a33299df6d47e41761498eb6c95fc6633f3bbe27dbd2f002906f16030e0","last_reissued_at":"2026-05-18T01:36:32.063708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:32.063708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05950","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-18T01:36:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7J5fDczxPWRH/dZw/DDIM7nFbHE+73yLsnpKn2PzHmQM0pRzJyYSLu7cMfw62nH/EasOjJ8MuN0zW4EjhJwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T16:28:41.885796Z"},"content_sha256":"589aeb87c471ef5aad0b0a96b40bc2cbca763ef29b1db25ee0b0a50d440b4b41","schema_version":"1.0","event_id":"sha256:589aeb87c471ef5aad0b0a96b40bc2cbca763ef29b1db25ee0b0a50d440b4b41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QFXHUMZJTX3NI7SBOYKJR23MSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Worst-Case Approximability of Sparse PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aviad Rubinstein, Dimitris Papailiopoulos, Siu On Chan","submitted_at":"2015-07-21T19:34:32Z","abstract_excerpt":"It is well known that Sparse PCA (Sparse Principal Component Analysis) is NP-hard to solve exactly on worst-case instances. What is the complexity of solving Sparse PCA approximately? Our contributions include: 1) a simple and efficient algorithm that achieves an $n^{-1/3}$-approximation; 2) NP-hardness of approximation to within $(1-\\varepsilon)$, for some small constant $\\varepsilon > 0$; 3) SSE-hardness of approximation to within any constant factor; and 4) an $\\exp\\exp\\left(\\Omega\\left(\\sqrt{\\log \\log n}\\right)\\right)$ (\"quasi-quasi-polynomial\") gap for the standard semidefinite program."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05950","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-18T01:36:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5oC8uQpzLlTHMOZxGNUqPVY398sYYp6JJZ71pQ23cpcBPHGYXHVwpBV9gbN0K+/ATmoo/NyxAo8Pnb6PLuoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T16:28:41.886168Z"},"content_sha256":"464382d2ad2e13bdab2894fa42d93291f789e41d410659f9762508a013c33fbb","schema_version":"1.0","event_id":"sha256:464382d2ad2e13bdab2894fa42d93291f789e41d410659f9762508a013c33fbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFXHUMZJTX3NI7SBOYKJR23MSX/bundle.json","state_url":"https://pith.science/pith/QFXHUMZJTX3NI7SBOYKJR23MSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFXHUMZJTX3NI7SBOYKJR23MSX/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-24T16:28:41Z","links":{"resolver":"https://pith.science/pith/QFXHUMZJTX3NI7SBOYKJR23MSX","bundle":"https://pith.science/pith/QFXHUMZJTX3NI7SBOYKJR23MSX/bundle.json","state":"https://pith.science/pith/QFXHUMZJTX3NI7SBOYKJR23MSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFXHUMZJTX3NI7SBOYKJR23MSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QFXHUMZJTX3NI7SBOYKJR23MSX","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":"acc953ad6d0520243bfe44a9a255e822a3ab692a371a2d99c044ed17706da69c","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-21T19:34:32Z","title_canon_sha256":"4129b9c6719a9785d915b164f38dc96a67d8f4fcbfc8e0ff4d604bf9d8de8451"},"schema_version":"1.0","source":{"id":"1507.05950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05950","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05950v1","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05950","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"pith_short_12","alias_value":"QFXHUMZJTX3N","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QFXHUMZJTX3NI7SB","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QFXHUMZJ","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:464382d2ad2e13bdab2894fa42d93291f789e41d410659f9762508a013c33fbb","target":"graph","created_at":"2026-05-18T01:36:32Z","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":"It is well known that Sparse PCA (Sparse Principal Component Analysis) is NP-hard to solve exactly on worst-case instances. What is the complexity of solving Sparse PCA approximately? Our contributions include: 1) a simple and efficient algorithm that achieves an $n^{-1/3}$-approximation; 2) NP-hardness of approximation to within $(1-\\varepsilon)$, for some small constant $\\varepsilon > 0$; 3) SSE-hardness of approximation to within any constant factor; and 4) an $\\exp\\exp\\left(\\Omega\\left(\\sqrt{\\log \\log n}\\right)\\right)$ (\"quasi-quasi-polynomial\") gap for the standard semidefinite program.","authors_text":"Aviad Rubinstein, Dimitris Papailiopoulos, Siu On Chan","cross_cats":["cs.CC","cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-21T19:34:32Z","title":"On the Worst-Case Approximability of Sparse PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05950","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:589aeb87c471ef5aad0b0a96b40bc2cbca763ef29b1db25ee0b0a50d440b4b41","target":"record","created_at":"2026-05-18T01:36:32Z","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":"acc953ad6d0520243bfe44a9a255e822a3ab692a371a2d99c044ed17706da69c","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-21T19:34:32Z","title_canon_sha256":"4129b9c6719a9785d915b164f38dc96a67d8f4fcbfc8e0ff4d604bf9d8de8451"},"schema_version":"1.0","source":{"id":"1507.05950","kind":"arxiv","version":1}},"canonical_sha256":"816e7a33299df6d47e41761498eb6c95fc6633f3bbe27dbd2f002906f16030e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"816e7a33299df6d47e41761498eb6c95fc6633f3bbe27dbd2f002906f16030e0","first_computed_at":"2026-05-18T01:36:32.063708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:32.063708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ov1wlP9RbTbHMYF1WnyDZOlWkzYlu58M3zbYxI959P60MT4Yt+OOtvGwMS4V7g30Bh5NsANVv0F4mwW0u7bYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:32.064368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:589aeb87c471ef5aad0b0a96b40bc2cbca763ef29b1db25ee0b0a50d440b4b41","sha256:464382d2ad2e13bdab2894fa42d93291f789e41d410659f9762508a013c33fbb"],"state_sha256":"12e7b4733e66e3cdea8c18d96cca8f9d3a7cb4ff8bba998800a266819ec97376"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MneGpE7tFWWaJrcEM3slwBrdLkEYpVFTj2skrVo5VWWOqXy2cDGdvaB3HyBqI5TjM7G7csAe9s0Fxoz5BAGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T16:28:41.889078Z","bundle_sha256":"b8d48f16e568fb9840db8af026c53a1cb72965b18867e5feb07109ec7086711e"}}