{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6XWQ6BZ5YB2LPUFA7WHCA25HE5","short_pith_number":"pith:6XWQ6BZ5","schema_version":"1.0","canonical_sha256":"f5ed0f073dc074b7d0a0fd8e206ba7277730cffa9ca4803c84847cea971aa466","source":{"kind":"arxiv","id":"1106.1651","version":1},"attestation_state":"computed","paper":{"title":"Sparse Principal Component of a Rank-deficient Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Dimitris S. Papailiopoulos, George N. Karystinos, Megasthenis Asteris","submitted_at":"2011-06-08T20:01:17Z","abstract_excerpt":"We consider the problem of identifying the sparse principal component of a rank-deficient matrix. We introduce auxiliary spherical variables and prove that there exists a set of candidate index-sets (that is, sets of indices to the nonzero elements of the vector argument) whose size is polynomially bounded, in terms of rank, and contains the optimal index-set, i.e. the index-set of the nonzero elements of the optimal solution. Finally, we develop an algorithm that computes the optimal sparse principal component in polynomial time for any sparsity degree."},"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":"1106.1651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-08T20:01:17Z","cross_cats_sorted":["cs.LG","cs.SY","math.IT","math.OC"],"title_canon_sha256":"4c8c5c15f9fa4c05d2fc81e76bb72684830841418c389d92456a36a80545964b","abstract_canon_sha256":"eabc02b097c82d32d7d34205f2362a1b5c73fa4ade690fc9adb19d30effe41f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:15.397712Z","signature_b64":"BovXGbn5KlQdZF+GQ7hjEpFq3KXRG4R26AgLga4k08880WZxmnH+JNHM+GJ5CWUhQcYGwBweY0dOCeQErSxzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5ed0f073dc074b7d0a0fd8e206ba7277730cffa9ca4803c84847cea971aa466","last_reissued_at":"2026-05-18T04:20:15.397122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:15.397122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Principal Component of a Rank-deficient Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Dimitris S. Papailiopoulos, George N. Karystinos, Megasthenis Asteris","submitted_at":"2011-06-08T20:01:17Z","abstract_excerpt":"We consider the problem of identifying the sparse principal component of a rank-deficient matrix. We introduce auxiliary spherical variables and prove that there exists a set of candidate index-sets (that is, sets of indices to the nonzero elements of the vector argument) whose size is polynomially bounded, in terms of rank, and contains the optimal index-set, i.e. the index-set of the nonzero elements of the optimal solution. Finally, we develop an algorithm that computes the optimal sparse principal component in polynomial time for any sparsity degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1651","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.1651","created_at":"2026-05-18T04:20:15.397214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1651v1","created_at":"2026-05-18T04:20:15.397214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1651","created_at":"2026-05-18T04:20:15.397214+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XWQ6BZ5YB2L","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XWQ6BZ5YB2LPUFA","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XWQ6BZ5","created_at":"2026-05-18T12:26:22.705136+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/6XWQ6BZ5YB2LPUFA7WHCA25HE5","json":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5.json","graph_json":"https://pith.science/api/pith-number/6XWQ6BZ5YB2LPUFA7WHCA25HE5/graph.json","events_json":"https://pith.science/api/pith-number/6XWQ6BZ5YB2LPUFA7WHCA25HE5/events.json","paper":"https://pith.science/paper/6XWQ6BZ5"},"agent_actions":{"view_html":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5","download_json":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5.json","view_paper":"https://pith.science/paper/6XWQ6BZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1651&json=true","fetch_graph":"https://pith.science/api/pith-number/6XWQ6BZ5YB2LPUFA7WHCA25HE5/graph.json","fetch_events":"https://pith.science/api/pith-number/6XWQ6BZ5YB2LPUFA7WHCA25HE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/action/storage_attestation","attest_author":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/action/author_attestation","sign_citation":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/action/citation_signature","submit_replication":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/action/replication_record"}},"created_at":"2026-05-18T04:20:15.397214+00:00","updated_at":"2026-05-18T04:20:15.397214+00:00"}