{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HH5EHEDHAGRQGQDMFBQHVYKXDL","short_pith_number":"pith:HH5EHEDH","schema_version":"1.0","canonical_sha256":"39fa43906701a303406c28607ae1571aeaca09f423c39ee876875753d13a6820","source":{"kind":"arxiv","id":"1801.03773","version":1},"attestation_state":"computed","paper":{"title":"Polar $n$-Complex and $n$-Bicomplex Singular Value Decomposition and Principal Component Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.SD","eess.AS","stat.ML"],"primary_cat":"eess.SP","authors_text":"Tak-Shing T. Chan, Yi-Hsuan Yang","submitted_at":"2018-01-09T00:45:01Z","abstract_excerpt":"Informed by recent work on tensor singular value decomposition and circulant algebra matrices, this paper presents a new theoretical bridge that unifies the hypercomplex and tensor-based approaches to singular value decomposition and robust principal component analysis. We begin our work by extending the principal component pursuit to Olariu's polar $n$-complex numbers as well as their bicomplex counterparts. In so doing, we have derived the polar $n$-complex and $n$-bicomplex proximity operators for both the $\\ell_1$- and trace-norm regularizers, which can be used by proximal optimization met"},"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":"1801.03773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-09T00:45:01Z","cross_cats_sorted":["cs.MM","cs.SD","eess.AS","stat.ML"],"title_canon_sha256":"0c204a4a626d94853a773b59da188cab0ea1993e8c929997ed8311065d18abe8","abstract_canon_sha256":"8c7289330658a3931f514caa65e381938c2353d1d1fc4933eed7d13f3b260469"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.486820Z","signature_b64":"vBzYuZ3ZBuAlwE6TwVs0/UMIpnMuY/g2bB4WAghJcymHI2n55ZVjbjd3xAsjow0oItXY81Pm5+nWe0Vv5lh/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39fa43906701a303406c28607ae1571aeaca09f423c39ee876875753d13a6820","last_reissued_at":"2026-05-18T00:26:13.486180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.486180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar $n$-Complex and $n$-Bicomplex Singular Value Decomposition and Principal Component Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.SD","eess.AS","stat.ML"],"primary_cat":"eess.SP","authors_text":"Tak-Shing T. Chan, Yi-Hsuan Yang","submitted_at":"2018-01-09T00:45:01Z","abstract_excerpt":"Informed by recent work on tensor singular value decomposition and circulant algebra matrices, this paper presents a new theoretical bridge that unifies the hypercomplex and tensor-based approaches to singular value decomposition and robust principal component analysis. We begin our work by extending the principal component pursuit to Olariu's polar $n$-complex numbers as well as their bicomplex counterparts. In so doing, we have derived the polar $n$-complex and $n$-bicomplex proximity operators for both the $\\ell_1$- and trace-norm regularizers, which can be used by proximal optimization met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03773","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":"1801.03773","created_at":"2026-05-18T00:26:13.486279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03773v1","created_at":"2026-05-18T00:26:13.486279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03773","created_at":"2026-05-18T00:26:13.486279+00:00"},{"alias_kind":"pith_short_12","alias_value":"HH5EHEDHAGRQ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HH5EHEDHAGRQGQDM","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HH5EHEDH","created_at":"2026-05-18T12:32:28.185984+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/HH5EHEDHAGRQGQDMFBQHVYKXDL","json":"https://pith.science/pith/HH5EHEDHAGRQGQDMFBQHVYKXDL.json","graph_json":"https://pith.science/api/pith-number/HH5EHEDHAGRQGQDMFBQHVYKXDL/graph.json","events_json":"https://pith.science/api/pith-number/HH5EHEDHAGRQGQDMFBQHVYKXDL/events.json","paper":"https://pith.science/paper/HH5EHEDH"},"agent_actions":{"view_html":"https://pith.science/pith/HH5EHEDHAGRQGQDMFBQHVYKXDL","download_json":"https://pith.science/pith/HH5EHEDHAGRQGQDMFBQHVYKXDL.json","view_paper":"https://pith.science/paper/HH5EHEDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03773&json=true","fetch_graph":"https://pith.science/api/pith-number/HH5EHEDHAGRQGQDMFBQHVYKXDL/graph.json","fetch_events":"https://pith.science/api/pith-number/HH5EHEDHAGRQGQDMFBQHVYKXDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HH5EHEDHAGRQGQDMFBQHVYKXDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HH5EHEDHAGRQGQDMFBQHVYKXDL/action/storage_attestation","attest_author":"https://pith.science/pith/HH5EHEDHAGRQGQDMFBQHVYKXDL/action/author_attestation","sign_citation":"https://pith.science/pith/HH5EHEDHAGRQGQDMFBQHVYKXDL/action/citation_signature","submit_replication":"https://pith.science/pith/HH5EHEDHAGRQGQDMFBQHVYKXDL/action/replication_record"}},"created_at":"2026-05-18T00:26:13.486279+00:00","updated_at":"2026-05-18T00:26:13.486279+00:00"}