{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IPEGYWPJTJZFUY7C7CCC65CUVI","short_pith_number":"pith:IPEGYWPJ","schema_version":"1.0","canonical_sha256":"43c86c59e99a725a63e2f8842f7454aa224313e298ea5020818778e7e39f83ab","source":{"kind":"arxiv","id":"1306.4128","version":1},"attestation_state":"computed","paper":{"title":"Constant Modulus Algorithms Using Hyperbolic Givens Rotation","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Abdelouahab Boudjellal, Adel Belouchrani, Aissa Ikhlef, Karim Abed-Meraim, Redha Iferroujene","submitted_at":"2013-06-18T10:17:56Z","abstract_excerpt":"We propose two new algorithms to minimize the constant modulus (CM) criterion in the context of blind source separation. The first algorithm, referred to as Givens CMA (G-CMA) uses unitary Givens rotations and proceeds in two stages: prewhitening step, which reduces the channel matrix to a unitary one followed by a separation step where the resulting unitary matrix is computed using Givens rotations by minimizing the CM criterion. However, for small sample sizes, the prewhitening does not make the channel matrix close enough to unitary and hence applying Givens rotations alone does not provide"},"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":"1306.4128","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.ME","submitted_at":"2013-06-18T10:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"5a9bd9286f901b069e572e3433e07cb38bdc3584bc9c3e099ffb9259a635abf5","abstract_canon_sha256":"f58837049dc97d3fb4d5908c3305fda931db9b1809510d7355340ff176290858"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:37.067459Z","signature_b64":"zc0bZp0DmQaTFNCnm4Y6+6g0ffNhymsLEC/EDOAsX13CGHw686+uRav14bNLAjbf5NCpXpHUI6PXBt/9U5OECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c86c59e99a725a63e2f8842f7454aa224313e298ea5020818778e7e39f83ab","last_reissued_at":"2026-05-18T03:20:37.066584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:37.066584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Modulus Algorithms Using Hyperbolic Givens Rotation","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Abdelouahab Boudjellal, Adel Belouchrani, Aissa Ikhlef, Karim Abed-Meraim, Redha Iferroujene","submitted_at":"2013-06-18T10:17:56Z","abstract_excerpt":"We propose two new algorithms to minimize the constant modulus (CM) criterion in the context of blind source separation. The first algorithm, referred to as Givens CMA (G-CMA) uses unitary Givens rotations and proceeds in two stages: prewhitening step, which reduces the channel matrix to a unitary one followed by a separation step where the resulting unitary matrix is computed using Givens rotations by minimizing the CM criterion. However, for small sample sizes, the prewhitening does not make the channel matrix close enough to unitary and hence applying Givens rotations alone does not provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4128","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":"1306.4128","created_at":"2026-05-18T03:20:37.066738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4128v1","created_at":"2026-05-18T03:20:37.066738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4128","created_at":"2026-05-18T03:20:37.066738+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPEGYWPJTJZF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPEGYWPJTJZFUY7C","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPEGYWPJ","created_at":"2026-05-18T12:27:46.883200+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/IPEGYWPJTJZFUY7C7CCC65CUVI","json":"https://pith.science/pith/IPEGYWPJTJZFUY7C7CCC65CUVI.json","graph_json":"https://pith.science/api/pith-number/IPEGYWPJTJZFUY7C7CCC65CUVI/graph.json","events_json":"https://pith.science/api/pith-number/IPEGYWPJTJZFUY7C7CCC65CUVI/events.json","paper":"https://pith.science/paper/IPEGYWPJ"},"agent_actions":{"view_html":"https://pith.science/pith/IPEGYWPJTJZFUY7C7CCC65CUVI","download_json":"https://pith.science/pith/IPEGYWPJTJZFUY7C7CCC65CUVI.json","view_paper":"https://pith.science/paper/IPEGYWPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4128&json=true","fetch_graph":"https://pith.science/api/pith-number/IPEGYWPJTJZFUY7C7CCC65CUVI/graph.json","fetch_events":"https://pith.science/api/pith-number/IPEGYWPJTJZFUY7C7CCC65CUVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPEGYWPJTJZFUY7C7CCC65CUVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPEGYWPJTJZFUY7C7CCC65CUVI/action/storage_attestation","attest_author":"https://pith.science/pith/IPEGYWPJTJZFUY7C7CCC65CUVI/action/author_attestation","sign_citation":"https://pith.science/pith/IPEGYWPJTJZFUY7C7CCC65CUVI/action/citation_signature","submit_replication":"https://pith.science/pith/IPEGYWPJTJZFUY7C7CCC65CUVI/action/replication_record"}},"created_at":"2026-05-18T03:20:37.066738+00:00","updated_at":"2026-05-18T03:20:37.066738+00:00"}