{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4BBTAXJUD7V7VPV6V7S5QJ5RIM","short_pith_number":"pith:4BBTAXJU","schema_version":"1.0","canonical_sha256":"e043305d341febfabebeafe5d827b143292d0aeb911ad5553f42016d70b29c33","source":{"kind":"arxiv","id":"1301.2696","version":1},"attestation_state":"computed","paper":{"title":"Reduced-Rank Space-Time Interference Suppression with Joint Iterative Least Squares Algorithms for Spread Spectrum Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Raimundo Sampaio-Neto, Rodrigo C. de Lamare","submitted_at":"2013-01-12T16:33:58Z","abstract_excerpt":"This paper presents novel adaptive space-time reduced-rank interference suppression least squares algorithms based on joint iterative optimization of parameter vectors. The proposed space-time reduced-rank scheme consists of a joint iterative optimization of a projection matrix that performs dimensionality reduction and an adaptive reduced-rank parameter vector that yields the symbol estimates. The proposed techniques do not require singular value decomposition (SVD) and automatically find the best set of basis for reduced-rank processing. We present least squares (LS) expressions for the desi"},"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.2696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-12T16:33:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"18d81ddfe3f393a54b8a34d7cc4190c36c4d321ee478190b9f9cb28b33f5071b","abstract_canon_sha256":"36118d246984488e1a4dce50b81eba90b0fe0c41f330262c2ade9372a4de7461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:35.528973Z","signature_b64":"0+u13zJ04cBcKQfde6WtXj042jmmmSOht51MmlpwFofwvWVYC4MbkxkC0Kd/cUIgkrz0bCWuHaBZP7h3ydcbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e043305d341febfabebeafe5d827b143292d0aeb911ad5553f42016d70b29c33","last_reissued_at":"2026-05-18T03:36:35.528248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:35.528248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduced-Rank Space-Time Interference Suppression with Joint Iterative Least Squares Algorithms for Spread Spectrum Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Raimundo Sampaio-Neto, Rodrigo C. de Lamare","submitted_at":"2013-01-12T16:33:58Z","abstract_excerpt":"This paper presents novel adaptive space-time reduced-rank interference suppression least squares algorithms based on joint iterative optimization of parameter vectors. The proposed space-time reduced-rank scheme consists of a joint iterative optimization of a projection matrix that performs dimensionality reduction and an adaptive reduced-rank parameter vector that yields the symbol estimates. The proposed techniques do not require singular value decomposition (SVD) and automatically find the best set of basis for reduced-rank processing. We present least squares (LS) expressions for the desi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2696","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.2696","created_at":"2026-05-18T03:36:35.528376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2696v1","created_at":"2026-05-18T03:36:35.528376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2696","created_at":"2026-05-18T03:36:35.528376+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BBTAXJUD7V7","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BBTAXJUD7V7VPV6","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BBTAXJU","created_at":"2026-05-18T12:27:32.513160+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/4BBTAXJUD7V7VPV6V7S5QJ5RIM","json":"https://pith.science/pith/4BBTAXJUD7V7VPV6V7S5QJ5RIM.json","graph_json":"https://pith.science/api/pith-number/4BBTAXJUD7V7VPV6V7S5QJ5RIM/graph.json","events_json":"https://pith.science/api/pith-number/4BBTAXJUD7V7VPV6V7S5QJ5RIM/events.json","paper":"https://pith.science/paper/4BBTAXJU"},"agent_actions":{"view_html":"https://pith.science/pith/4BBTAXJUD7V7VPV6V7S5QJ5RIM","download_json":"https://pith.science/pith/4BBTAXJUD7V7VPV6V7S5QJ5RIM.json","view_paper":"https://pith.science/paper/4BBTAXJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2696&json=true","fetch_graph":"https://pith.science/api/pith-number/4BBTAXJUD7V7VPV6V7S5QJ5RIM/graph.json","fetch_events":"https://pith.science/api/pith-number/4BBTAXJUD7V7VPV6V7S5QJ5RIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BBTAXJUD7V7VPV6V7S5QJ5RIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BBTAXJUD7V7VPV6V7S5QJ5RIM/action/storage_attestation","attest_author":"https://pith.science/pith/4BBTAXJUD7V7VPV6V7S5QJ5RIM/action/author_attestation","sign_citation":"https://pith.science/pith/4BBTAXJUD7V7VPV6V7S5QJ5RIM/action/citation_signature","submit_replication":"https://pith.science/pith/4BBTAXJUD7V7VPV6V7S5QJ5RIM/action/replication_record"}},"created_at":"2026-05-18T03:36:35.528376+00:00","updated_at":"2026-05-18T03:36:35.528376+00:00"}