{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SHBZSKPMOJZK5LIMCOJZF2NODF","short_pith_number":"pith:SHBZSKPM","schema_version":"1.0","canonical_sha256":"91c39929ec7272aead0c139392e9ae195ea09d9371ec3b1d3a4a4cb412d569e4","source":{"kind":"arxiv","id":"1807.09692","version":1},"attestation_state":"computed","paper":{"title":"An Adaptive CM Array Preconditioner for Blind Multi-User Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"and Martin Haardt, Jo\\~ao Paulo C. L. da Costa, Stanislaw Gorlow","submitted_at":"2018-07-25T16:11:40Z","abstract_excerpt":"The family of constant-modulus algorithms is widely used in wireless communication systems and in radar. The classical constant-modulus adaptive (CMA) algorithm, however, fails to lock onto a single mode when used in conjunction with an antenna array. Instead, it equalizes the entire spatial spectrum. In this paper, we describe in full detail our recently proposed approach for the separation of multiple users in a radio system with frequency reuse, such as a cellular network, making use of the CMA algorithm. Based on the observation that the differential filter weights resemble a superposition"},"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":"1807.09692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-07-25T16:11:40Z","cross_cats_sorted":[],"title_canon_sha256":"8efd1b8b4df3830e0dde6fc1c9ff1b1337023f54429caacd1f8c0b92436f7f96","abstract_canon_sha256":"a49e10d36a077e58a0688631fd74fcfe6a7504d313a609ed7d4a905d491fe900"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:48.518117Z","signature_b64":"E2gS8cYduupeLObiYgAzs23sLtCJzfBAqMFBeSzUaBm8SLY9mbiprNzBmqysGXqxD2myzJicyyIY7YX+JilUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91c39929ec7272aead0c139392e9ae195ea09d9371ec3b1d3a4a4cb412d569e4","last_reissued_at":"2026-05-18T00:09:48.517661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:48.517661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adaptive CM Array Preconditioner for Blind Multi-User Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"and Martin Haardt, Jo\\~ao Paulo C. L. da Costa, Stanislaw Gorlow","submitted_at":"2018-07-25T16:11:40Z","abstract_excerpt":"The family of constant-modulus algorithms is widely used in wireless communication systems and in radar. The classical constant-modulus adaptive (CMA) algorithm, however, fails to lock onto a single mode when used in conjunction with an antenna array. Instead, it equalizes the entire spatial spectrum. In this paper, we describe in full detail our recently proposed approach for the separation of multiple users in a radio system with frequency reuse, such as a cellular network, making use of the CMA algorithm. Based on the observation that the differential filter weights resemble a superposition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09692","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":"1807.09692","created_at":"2026-05-18T00:09:48.517735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09692v1","created_at":"2026-05-18T00:09:48.517735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09692","created_at":"2026-05-18T00:09:48.517735+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHBZSKPMOJZK","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHBZSKPMOJZK5LIM","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHBZSKPM","created_at":"2026-05-18T12:32:53.628368+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/SHBZSKPMOJZK5LIMCOJZF2NODF","json":"https://pith.science/pith/SHBZSKPMOJZK5LIMCOJZF2NODF.json","graph_json":"https://pith.science/api/pith-number/SHBZSKPMOJZK5LIMCOJZF2NODF/graph.json","events_json":"https://pith.science/api/pith-number/SHBZSKPMOJZK5LIMCOJZF2NODF/events.json","paper":"https://pith.science/paper/SHBZSKPM"},"agent_actions":{"view_html":"https://pith.science/pith/SHBZSKPMOJZK5LIMCOJZF2NODF","download_json":"https://pith.science/pith/SHBZSKPMOJZK5LIMCOJZF2NODF.json","view_paper":"https://pith.science/paper/SHBZSKPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09692&json=true","fetch_graph":"https://pith.science/api/pith-number/SHBZSKPMOJZK5LIMCOJZF2NODF/graph.json","fetch_events":"https://pith.science/api/pith-number/SHBZSKPMOJZK5LIMCOJZF2NODF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHBZSKPMOJZK5LIMCOJZF2NODF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHBZSKPMOJZK5LIMCOJZF2NODF/action/storage_attestation","attest_author":"https://pith.science/pith/SHBZSKPMOJZK5LIMCOJZF2NODF/action/author_attestation","sign_citation":"https://pith.science/pith/SHBZSKPMOJZK5LIMCOJZF2NODF/action/citation_signature","submit_replication":"https://pith.science/pith/SHBZSKPMOJZK5LIMCOJZF2NODF/action/replication_record"}},"created_at":"2026-05-18T00:09:48.517735+00:00","updated_at":"2026-05-18T00:09:48.517735+00:00"}