{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:J3L62IUQWOY3Q7FVF2KYABV5RK","short_pith_number":"pith:J3L62IUQ","canonical_record":{"source":{"id":"1312.5891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T11:11:03Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"b21e792f2f9e2a616b1b5503482d9962941496aea647e6d0cba2805c2590e164","abstract_canon_sha256":"3fa448831611b72c00991051edf8a774c90b0c9f6ecaf0d025a8207b6bffc5c5"},"schema_version":"1.0"},"canonical_sha256":"4ed7ed2290b3b1b87cb52e958006bd8a957072b77b08f33d9644f345087c2679","source":{"kind":"arxiv","id":"1312.5891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5891","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5891v1","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5891","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"J3L62IUQWOY3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J3L62IUQWOY3Q7FV","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J3L62IUQ","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:J3L62IUQWOY3Q7FVF2KYABV5RK","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T11:11:03Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"b21e792f2f9e2a616b1b5503482d9962941496aea647e6d0cba2805c2590e164","abstract_canon_sha256":"3fa448831611b72c00991051edf8a774c90b0c9f6ecaf0d025a8207b6bffc5c5"},"schema_version":"1.0"},"canonical_sha256":"4ed7ed2290b3b1b87cb52e958006bd8a957072b77b08f33d9644f345087c2679","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:07.592733Z","signature_b64":"+PiPOGcGM7HeOQFG/6fDG3XKhWLb6/fvKAkvNPu6rR2YuwxOtpYx+ALtHrfiSig+GhQD9oeT3oApVLHE2UxzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ed7ed2290b3b1b87cb52e958006bd8a957072b77b08f33d9644f345087c2679","last_reissued_at":"2026-05-18T03:04:07.591812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:07.591812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5891","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-18T03:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGhbrHQ/hEZwTj9NB/IHD6NeDM6NaHaINi5rg/Z/9CZ0o6eCQIFPiunatcJ3c7B1RXuMmiuj3yrbVBaFLrjEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:50:59.554912Z"},"content_sha256":"bf3c5c4bd14748577dd1c2aaa9aefd0be0df31351ace812d5cf26255efc4493e","schema_version":"1.0","event_id":"sha256:bf3c5c4bd14748577dd1c2aaa9aefd0be0df31351ace812d5cf26255efc4493e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:J3L62IUQWOY3Q7FVF2KYABV5RK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Sparse Principal Component of a Constant-rank Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Dimitris S. Papailiopoulos, George N. Karystinos, Megasthenis Asteris","submitted_at":"2013-12-20T11:11:03Z","abstract_excerpt":"The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem ${\\mathcal{NP}}$-hard. In this work, we prove that, if the matrix is positive semidefinite and its rank is constant, then its sparse principal component is polynomially computable. Our proof utilizes the auxiliary unit vector technique that has been recently developed to identify problems that are polynomially solvable. Moreover, we use this technique to design an algorithm wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5891","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-18T03:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIkN4IQEqSaGOaIbxApukkZh5xrNZg6yyMbW2mPmFAo0EIAy7mU97n3dXqsA7QPhmVVbTDQqW03sg51zT2ddCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:50:59.555346Z"},"content_sha256":"3730295657262ff91b14d200593339cf283a3f5871ee549adbd6c3c601f0e553","schema_version":"1.0","event_id":"sha256:3730295657262ff91b14d200593339cf283a3f5871ee549adbd6c3c601f0e553"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3L62IUQWOY3Q7FVF2KYABV5RK/bundle.json","state_url":"https://pith.science/pith/J3L62IUQWOY3Q7FVF2KYABV5RK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3L62IUQWOY3Q7FVF2KYABV5RK/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-02T20:50:59Z","links":{"resolver":"https://pith.science/pith/J3L62IUQWOY3Q7FVF2KYABV5RK","bundle":"https://pith.science/pith/J3L62IUQWOY3Q7FVF2KYABV5RK/bundle.json","state":"https://pith.science/pith/J3L62IUQWOY3Q7FVF2KYABV5RK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3L62IUQWOY3Q7FVF2KYABV5RK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:J3L62IUQWOY3Q7FVF2KYABV5RK","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":"3fa448831611b72c00991051edf8a774c90b0c9f6ecaf0d025a8207b6bffc5c5","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T11:11:03Z","title_canon_sha256":"b21e792f2f9e2a616b1b5503482d9962941496aea647e6d0cba2805c2590e164"},"schema_version":"1.0","source":{"id":"1312.5891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5891","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5891v1","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5891","created_at":"2026-05-18T03:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"J3L62IUQWOY3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J3L62IUQWOY3Q7FV","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J3L62IUQ","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:3730295657262ff91b14d200593339cf283a3f5871ee549adbd6c3c601f0e553","target":"graph","created_at":"2026-05-18T03:04:07Z","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":"The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem ${\\mathcal{NP}}$-hard. In this work, we prove that, if the matrix is positive semidefinite and its rank is constant, then its sparse principal component is polynomially computable. Our proof utilizes the auxiliary unit vector technique that has been recently developed to identify problems that are polynomially solvable. Moreover, we use this technique to design an algorithm wh","authors_text":"Dimitris S. Papailiopoulos, George N. Karystinos, Megasthenis Asteris","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T11:11:03Z","title":"The Sparse Principal Component of a Constant-rank Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5891","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:bf3c5c4bd14748577dd1c2aaa9aefd0be0df31351ace812d5cf26255efc4493e","target":"record","created_at":"2026-05-18T03:04:07Z","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":"3fa448831611b72c00991051edf8a774c90b0c9f6ecaf0d025a8207b6bffc5c5","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-20T11:11:03Z","title_canon_sha256":"b21e792f2f9e2a616b1b5503482d9962941496aea647e6d0cba2805c2590e164"},"schema_version":"1.0","source":{"id":"1312.5891","kind":"arxiv","version":1}},"canonical_sha256":"4ed7ed2290b3b1b87cb52e958006bd8a957072b77b08f33d9644f345087c2679","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ed7ed2290b3b1b87cb52e958006bd8a957072b77b08f33d9644f345087c2679","first_computed_at":"2026-05-18T03:04:07.591812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:07.591812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+PiPOGcGM7HeOQFG/6fDG3XKhWLb6/fvKAkvNPu6rR2YuwxOtpYx+ALtHrfiSig+GhQD9oeT3oApVLHE2UxzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:07.592733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf3c5c4bd14748577dd1c2aaa9aefd0be0df31351ace812d5cf26255efc4493e","sha256:3730295657262ff91b14d200593339cf283a3f5871ee549adbd6c3c601f0e553"],"state_sha256":"7b30d994ab4840b7d4d61f68f164d203a3297d02a173f9609cffc19a9899cac1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKXwRO+zJKjO8ez2aolW6IV3ehztI1WeUYTN70CAhaUsw8pxx+oZhDuQyOHNXtu6UlRD0hYua+xauLeS6773Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:50:59.557572Z","bundle_sha256":"5e743e59c1df2fc5ccdef8f0979402ed39e35ab19d3b822034327bf67b9e520b"}}