{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6XWQ6BZ5YB2LPUFA7WHCA25HE5","short_pith_number":"pith:6XWQ6BZ5","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"},"canonical_sha256":"f5ed0f073dc074b7d0a0fd8e206ba7277730cffa9ca4803c84847cea971aa466","source":{"kind":"arxiv","id":"1106.1651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1651","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1651v1","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1651","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"6XWQ6BZ5YB2L","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6XWQ6BZ5YB2LPUFA","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6XWQ6BZ5","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6XWQ6BZ5YB2LPUFA7WHCA25HE5","target":"record","payload":{"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"},"canonical_sha256":"f5ed0f073dc074b7d0a0fd8e206ba7277730cffa9ca4803c84847cea971aa466","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"},"source_kind":"arxiv","source_id":"1106.1651","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-18T04:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"runCgoMF2c8Jgw9FzlvJG/DPCdrWyEoNt1XZwt5rHW86WU96YDksSXfKMMFSsJ+uog3WCaO6Ngd9veAF7S6aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:09:11.811368Z"},"content_sha256":"da776a9f2c8aeb244fbffd35ac296a47ec606a179d6e0f9e151f63a23b734199","schema_version":"1.0","event_id":"sha256:da776a9f2c8aeb244fbffd35ac296a47ec606a179d6e0f9e151f63a23b734199"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6XWQ6BZ5YB2LPUFA7WHCA25HE5","target":"graph","payload":{"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"},"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-18T04:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKsKll5FSspo0oDqm+CSZwum+d4NooIPNhx/OfBKtDpcwAmUTQRHuNuRABxNafjYlT7jVxau4HgzC7cLkcpGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:09:11.811745Z"},"content_sha256":"cc62fe6e4c1b012a607d7b719af36a4321a99bc0b4ba0cc19be823e8f85d7ec0","schema_version":"1.0","event_id":"sha256:cc62fe6e4c1b012a607d7b719af36a4321a99bc0b4ba0cc19be823e8f85d7ec0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/bundle.json","state_url":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/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-06-02T08:09:11Z","links":{"resolver":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5","bundle":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/bundle.json","state":"https://pith.science/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XWQ6BZ5YB2LPUFA7WHCA25HE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6XWQ6BZ5YB2LPUFA7WHCA25HE5","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":"eabc02b097c82d32d7d34205f2362a1b5c73fa4ade690fc9adb19d30effe41f4","cross_cats_sorted":["cs.LG","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-08T20:01:17Z","title_canon_sha256":"4c8c5c15f9fa4c05d2fc81e76bb72684830841418c389d92456a36a80545964b"},"schema_version":"1.0","source":{"id":"1106.1651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1651","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1651v1","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1651","created_at":"2026-05-18T04:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"6XWQ6BZ5YB2L","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6XWQ6BZ5YB2LPUFA","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6XWQ6BZ5","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:cc62fe6e4c1b012a607d7b719af36a4321a99bc0b4ba0cc19be823e8f85d7ec0","target":"graph","created_at":"2026-05-18T04:20:15Z","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 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.","authors_text":"Dimitris S. Papailiopoulos, George N. Karystinos, Megasthenis Asteris","cross_cats":["cs.LG","cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-08T20:01:17Z","title":"Sparse Principal Component of a Rank-deficient Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1651","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:da776a9f2c8aeb244fbffd35ac296a47ec606a179d6e0f9e151f63a23b734199","target":"record","created_at":"2026-05-18T04:20:15Z","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":"eabc02b097c82d32d7d34205f2362a1b5c73fa4ade690fc9adb19d30effe41f4","cross_cats_sorted":["cs.LG","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-08T20:01:17Z","title_canon_sha256":"4c8c5c15f9fa4c05d2fc81e76bb72684830841418c389d92456a36a80545964b"},"schema_version":"1.0","source":{"id":"1106.1651","kind":"arxiv","version":1}},"canonical_sha256":"f5ed0f073dc074b7d0a0fd8e206ba7277730cffa9ca4803c84847cea971aa466","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5ed0f073dc074b7d0a0fd8e206ba7277730cffa9ca4803c84847cea971aa466","first_computed_at":"2026-05-18T04:20:15.397122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:15.397122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BovXGbn5KlQdZF+GQ7hjEpFq3KXRG4R26AgLga4k08880WZxmnH+JNHM+GJ5CWUhQcYGwBweY0dOCeQErSxzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:15.397712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da776a9f2c8aeb244fbffd35ac296a47ec606a179d6e0f9e151f63a23b734199","sha256:cc62fe6e4c1b012a607d7b719af36a4321a99bc0b4ba0cc19be823e8f85d7ec0"],"state_sha256":"bfd44fef12ff5700fbea7748d3a962156ad161c4525c4b77ca47ff50bca85f96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTyeCzVViMq67ZZvXxwdG9GdyBAyfPa5tyg2jZ4fTuHwy+qkbMWE8dM8nz/uTCmyLLjGN2WCSrceCEW/xw+BDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:09:11.813736Z","bundle_sha256":"3b6e1d5d7e9a75a59479e64a19634ef637e9c757c402a29134adcbf31bdf3276"}}