{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UQZRADQFZBABI2B7EO5Q6BWLFK","short_pith_number":"pith:UQZRADQF","schema_version":"1.0","canonical_sha256":"a433100e05c84014683f23bb0f06cb2ab39d77cac4586d8eff474f2c223bddae","source":{"kind":"arxiv","id":"1309.1194","version":1},"attestation_state":"computed","paper":{"title":"Some Options for L1-Subspace Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Dimitris A. Pados, George N. Karystinos, Panos P. Markopoulos","submitted_at":"2013-09-04T22:00:43Z","abstract_excerpt":"We describe ways to define and calculate $L_1$-norm signal subspaces which are less sensitive to outlying data than $L_2$-calculated subspaces. We focus on the computation of the $L_1$ maximum-projection principal component of a data matrix containing N signal samples of dimension D and conclude that the general problem is formally NP-hard in asymptotically large N, D. We prove, however, that the case of engineering interest of fixed dimension D and asymptotically large sample support N is not and we present an optimal algorithm of complexity $O(N^D)$. We generalize to multiple $L_1$-max-proje"},"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":"1309.1194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-04T22:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"74b98c2e0e9fec2d9d06c8a55f96eaa192846e09c9221f9bd3415e5b14a737b9","abstract_canon_sha256":"2293fd64d1ce8dd6ec7b13715a7a5b648e47c55c516f8b5c39c82747608c609a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:07.222021Z","signature_b64":"3Kd7OPbpsNydXT3pKdEP1/iOBeCrdl/Z5xFh3/cPXfETMeuqtmwR1eWXvSjGKK0EmZm/03+XANL07RKXQbXJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a433100e05c84014683f23bb0f06cb2ab39d77cac4586d8eff474f2c223bddae","last_reissued_at":"2026-05-18T03:14:07.221566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:07.221566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Options for L1-Subspace Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Dimitris A. Pados, George N. Karystinos, Panos P. Markopoulos","submitted_at":"2013-09-04T22:00:43Z","abstract_excerpt":"We describe ways to define and calculate $L_1$-norm signal subspaces which are less sensitive to outlying data than $L_2$-calculated subspaces. We focus on the computation of the $L_1$ maximum-projection principal component of a data matrix containing N signal samples of dimension D and conclude that the general problem is formally NP-hard in asymptotically large N, D. We prove, however, that the case of engineering interest of fixed dimension D and asymptotically large sample support N is not and we present an optimal algorithm of complexity $O(N^D)$. We generalize to multiple $L_1$-max-proje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1194","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":"1309.1194","created_at":"2026-05-18T03:14:07.221629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1194v1","created_at":"2026-05-18T03:14:07.221629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1194","created_at":"2026-05-18T03:14:07.221629+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQZRADQFZBAB","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQZRADQFZBABI2B7","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQZRADQF","created_at":"2026-05-18T12:28:02.375192+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/UQZRADQFZBABI2B7EO5Q6BWLFK","json":"https://pith.science/pith/UQZRADQFZBABI2B7EO5Q6BWLFK.json","graph_json":"https://pith.science/api/pith-number/UQZRADQFZBABI2B7EO5Q6BWLFK/graph.json","events_json":"https://pith.science/api/pith-number/UQZRADQFZBABI2B7EO5Q6BWLFK/events.json","paper":"https://pith.science/paper/UQZRADQF"},"agent_actions":{"view_html":"https://pith.science/pith/UQZRADQFZBABI2B7EO5Q6BWLFK","download_json":"https://pith.science/pith/UQZRADQFZBABI2B7EO5Q6BWLFK.json","view_paper":"https://pith.science/paper/UQZRADQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1194&json=true","fetch_graph":"https://pith.science/api/pith-number/UQZRADQFZBABI2B7EO5Q6BWLFK/graph.json","fetch_events":"https://pith.science/api/pith-number/UQZRADQFZBABI2B7EO5Q6BWLFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQZRADQFZBABI2B7EO5Q6BWLFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQZRADQFZBABI2B7EO5Q6BWLFK/action/storage_attestation","attest_author":"https://pith.science/pith/UQZRADQFZBABI2B7EO5Q6BWLFK/action/author_attestation","sign_citation":"https://pith.science/pith/UQZRADQFZBABI2B7EO5Q6BWLFK/action/citation_signature","submit_replication":"https://pith.science/pith/UQZRADQFZBABI2B7EO5Q6BWLFK/action/replication_record"}},"created_at":"2026-05-18T03:14:07.221629+00:00","updated_at":"2026-05-18T03:14:07.221629+00:00"}