{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TCOTT2KYPMTIOFBN2GDQDBWWRI","short_pith_number":"pith:TCOTT2KY","schema_version":"1.0","canonical_sha256":"989d39e9587b2687142dd1870186d68a3dee66e19d17442a1d420b1cc34002c9","source":{"kind":"arxiv","id":"1301.1712","version":1},"attestation_state":"computed","paper":{"title":"Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation, Switched Decimation and Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Haardt, Raimundo Sampaio-Neto, Rodrigo C. de Lamare","submitted_at":"2013-01-08T22:42:54Z","abstract_excerpt":"This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications systems. The proposed scheme and algorithms are based on a two-stage processing framework that consists of a transformation matrix that performs dimensionality reduction followed by a reduced-rank estimator. The complex structure of the transformation matrix of existing methods motivates the development of a blind adaptive reduced-rank constrained (BARC) scheme along with a low-complexity reduced-rank decomposition. The propo"},"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":"1301.1712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-08T22:42:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"31f1d0e5e2afb75c59abccd26a90815ca5262f84ccdd85b5bc20c2f58d394fb6","abstract_canon_sha256":"c5043d1174a36b2c30939d50b33abc9bef862323d8cb76a9b35fb7c55c4d7dfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:56.051639Z","signature_b64":"4ILJfpw9L0SnPCjA+5wXVCTozQC5djMxBZ7I98rPUVgkttH/ZxTSCHidncfW2flFS/X1RrV7pWV8w+h35P94AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"989d39e9587b2687142dd1870186d68a3dee66e19d17442a1d420b1cc34002c9","last_reissued_at":"2026-05-18T03:36:56.051205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:56.051205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation, Switched Decimation and Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Haardt, Raimundo Sampaio-Neto, Rodrigo C. de Lamare","submitted_at":"2013-01-08T22:42:54Z","abstract_excerpt":"This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications systems. The proposed scheme and algorithms are based on a two-stage processing framework that consists of a transformation matrix that performs dimensionality reduction followed by a reduced-rank estimator. The complex structure of the transformation matrix of existing methods motivates the development of a blind adaptive reduced-rank constrained (BARC) scheme along with a low-complexity reduced-rank decomposition. The propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1712","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":"1301.1712","created_at":"2026-05-18T03:36:56.051265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1712v1","created_at":"2026-05-18T03:36:56.051265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1712","created_at":"2026-05-18T03:36:56.051265+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCOTT2KYPMTI","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCOTT2KYPMTIOFBN","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCOTT2KY","created_at":"2026-05-18T12:27:59.945178+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/TCOTT2KYPMTIOFBN2GDQDBWWRI","json":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI.json","graph_json":"https://pith.science/api/pith-number/TCOTT2KYPMTIOFBN2GDQDBWWRI/graph.json","events_json":"https://pith.science/api/pith-number/TCOTT2KYPMTIOFBN2GDQDBWWRI/events.json","paper":"https://pith.science/paper/TCOTT2KY"},"agent_actions":{"view_html":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI","download_json":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI.json","view_paper":"https://pith.science/paper/TCOTT2KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1712&json=true","fetch_graph":"https://pith.science/api/pith-number/TCOTT2KYPMTIOFBN2GDQDBWWRI/graph.json","fetch_events":"https://pith.science/api/pith-number/TCOTT2KYPMTIOFBN2GDQDBWWRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/action/storage_attestation","attest_author":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/action/author_attestation","sign_citation":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/action/citation_signature","submit_replication":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/action/replication_record"}},"created_at":"2026-05-18T03:36:56.051265+00:00","updated_at":"2026-05-18T03:36:56.051265+00:00"}