{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GCO7MXTWFKNYTB6CZBSEDTWHXR","short_pith_number":"pith:GCO7MXTW","schema_version":"1.0","canonical_sha256":"309df65e762a9b8987c2c86441cec7bc661d4eb2598e1758a7313b362998f5e4","source":{"kind":"arxiv","id":"1205.0121","version":2},"attestation_state":"computed","paper":{"title":"Approximation Bounds for Sparse Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Francis Bach, Laurent El Ghaoui","submitted_at":"2012-05-01T09:08:06Z","abstract_excerpt":"We produce approximation bounds on a semidefinite programming relaxation for sparse principal component analysis. These bounds control approximation ratios for tractable statistics in hypothesis testing problems where data points are sampled from Gaussian models with a single sparse leading component."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1205.0121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-01T09:08:06Z","cross_cats_sorted":[],"title_canon_sha256":"1df990232dc4cdc65e388357a723008340f34aa00c658668a09e9b5dcb3f5306","abstract_canon_sha256":"851f22441a9d9fd55b9da819bdcbbefad03c6baaccc3e8ac1ade2c224b859d2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:19.681193Z","signature_b64":"u1ShFqKUDOKUMlhKl3XOcvTsF1M9titpUDmQqCp1S6fcwX36+4eNLUOrASy8tqZ/foOOwJaYHqzoVg/HxAFPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"309df65e762a9b8987c2c86441cec7bc661d4eb2598e1758a7313b362998f5e4","last_reissued_at":"2026-05-18T03:53:19.680305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:19.680305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Bounds for Sparse Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Francis Bach, Laurent El Ghaoui","submitted_at":"2012-05-01T09:08:06Z","abstract_excerpt":"We produce approximation bounds on a semidefinite programming relaxation for sparse principal component analysis. These bounds control approximation ratios for tractable statistics in hypothesis testing problems where data points are sampled from Gaussian models with a single sparse leading component."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0121","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.0121","created_at":"2026-05-18T03:53:19.680468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0121v2","created_at":"2026-05-18T03:53:19.680468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0121","created_at":"2026-05-18T03:53:19.680468+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCO7MXTWFKNY","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCO7MXTWFKNYTB6C","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCO7MXTW","created_at":"2026-05-18T12:27:06.952714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR","json":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR.json","graph_json":"https://pith.science/api/pith-number/GCO7MXTWFKNYTB6CZBSEDTWHXR/graph.json","events_json":"https://pith.science/api/pith-number/GCO7MXTWFKNYTB6CZBSEDTWHXR/events.json","paper":"https://pith.science/paper/GCO7MXTW"},"agent_actions":{"view_html":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR","download_json":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR.json","view_paper":"https://pith.science/paper/GCO7MXTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0121&json=true","fetch_graph":"https://pith.science/api/pith-number/GCO7MXTWFKNYTB6CZBSEDTWHXR/graph.json","fetch_events":"https://pith.science/api/pith-number/GCO7MXTWFKNYTB6CZBSEDTWHXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR/action/storage_attestation","attest_author":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR/action/author_attestation","sign_citation":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR/action/citation_signature","submit_replication":"https://pith.science/pith/GCO7MXTWFKNYTB6CZBSEDTWHXR/action/replication_record"}},"created_at":"2026-05-18T03:53:19.680468+00:00","updated_at":"2026-05-18T03:53:19.680468+00:00"}