{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AG63YG3YYBTDURK6NN2WSBPRDF","short_pith_number":"pith:AG63YG3Y","schema_version":"1.0","canonical_sha256":"01bdbc1b78c0663a455e6b756905f11954eee8cb3bbb43e6eb5ddc53d2cc23da","source":{"kind":"arxiv","id":"1708.01249","version":1},"attestation_state":"computed","paper":{"title":"L1-norm Principal-Component Analysis of Complex Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitris A. Pados, Nicholas Tsagkarakis, Panos P. Markopoulos","submitted_at":"2017-08-03T17:54:21Z","abstract_excerpt":"L1-norm Principal-Component Analysis (L1-PCA) of real-valued data has attracted significant research interest over the past decade. However, L1-PCA of complex-valued data remains to date unexplored despite the many possible applications (e.g., in communication systems). In this work, we establish theoretical and algorithmic foundations of L1-PCA of complex-valued data matrices. Specifically, we first show that, in contrast to the real-valued case for which an optimal polynomial-cost algorithm was recently reported by Markopoulos et al., complex L1-PCA is formally NP-hard in the number of data "},"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":"1708.01249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T17:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"1b45c1e65472398cf16baf1c7449738cc49a0ffdce8f5a3522170611cfc2828f","abstract_canon_sha256":"ea9580626f384ffaed004782b1f84e1bdb9bad01f3a467d671907a5cc6907759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:21.472452Z","signature_b64":"jpNn8g6uhSMYcjd6Szrt7AWcma4wo2EO65Zfiv7kkWxP/fFUDkUa+ghxsvDWaFCuvfSBUjMuMRnijc8dn+BzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01bdbc1b78c0663a455e6b756905f11954eee8cb3bbb43e6eb5ddc53d2cc23da","last_reissued_at":"2026-05-18T00:15:21.471767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:21.471767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L1-norm Principal-Component Analysis of Complex Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitris A. Pados, Nicholas Tsagkarakis, Panos P. Markopoulos","submitted_at":"2017-08-03T17:54:21Z","abstract_excerpt":"L1-norm Principal-Component Analysis (L1-PCA) of real-valued data has attracted significant research interest over the past decade. However, L1-PCA of complex-valued data remains to date unexplored despite the many possible applications (e.g., in communication systems). In this work, we establish theoretical and algorithmic foundations of L1-PCA of complex-valued data matrices. Specifically, we first show that, in contrast to the real-valued case for which an optimal polynomial-cost algorithm was recently reported by Markopoulos et al., complex L1-PCA is formally NP-hard in the number of data "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01249","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":"1708.01249","created_at":"2026-05-18T00:15:21.471869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01249v1","created_at":"2026-05-18T00:15:21.471869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01249","created_at":"2026-05-18T00:15:21.471869+00:00"},{"alias_kind":"pith_short_12","alias_value":"AG63YG3YYBTD","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AG63YG3YYBTDURK6","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AG63YG3Y","created_at":"2026-05-18T12:31:05.417338+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/AG63YG3YYBTDURK6NN2WSBPRDF","json":"https://pith.science/pith/AG63YG3YYBTDURK6NN2WSBPRDF.json","graph_json":"https://pith.science/api/pith-number/AG63YG3YYBTDURK6NN2WSBPRDF/graph.json","events_json":"https://pith.science/api/pith-number/AG63YG3YYBTDURK6NN2WSBPRDF/events.json","paper":"https://pith.science/paper/AG63YG3Y"},"agent_actions":{"view_html":"https://pith.science/pith/AG63YG3YYBTDURK6NN2WSBPRDF","download_json":"https://pith.science/pith/AG63YG3YYBTDURK6NN2WSBPRDF.json","view_paper":"https://pith.science/paper/AG63YG3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01249&json=true","fetch_graph":"https://pith.science/api/pith-number/AG63YG3YYBTDURK6NN2WSBPRDF/graph.json","fetch_events":"https://pith.science/api/pith-number/AG63YG3YYBTDURK6NN2WSBPRDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AG63YG3YYBTDURK6NN2WSBPRDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AG63YG3YYBTDURK6NN2WSBPRDF/action/storage_attestation","attest_author":"https://pith.science/pith/AG63YG3YYBTDURK6NN2WSBPRDF/action/author_attestation","sign_citation":"https://pith.science/pith/AG63YG3YYBTDURK6NN2WSBPRDF/action/citation_signature","submit_replication":"https://pith.science/pith/AG63YG3YYBTDURK6NN2WSBPRDF/action/replication_record"}},"created_at":"2026-05-18T00:15:21.471869+00:00","updated_at":"2026-05-18T00:15:21.471869+00:00"}