{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TCOTT2KYPMTIOFBN2GDQDBWWRI","short_pith_number":"pith:TCOTT2KY","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"},"canonical_sha256":"989d39e9587b2687142dd1870186d68a3dee66e19d17442a1d420b1cc34002c9","source":{"kind":"arxiv","id":"1301.1712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1712","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1712v1","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1712","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"TCOTT2KYPMTI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"TCOTT2KYPMTIOFBN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"TCOTT2KY","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TCOTT2KYPMTIOFBN2GDQDBWWRI","target":"record","payload":{"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"},"canonical_sha256":"989d39e9587b2687142dd1870186d68a3dee66e19d17442a1d420b1cc34002c9","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"},"source_kind":"arxiv","source_id":"1301.1712","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ksf/ghGme4h63zpjWisp+BWPIE/N1u4al69Ec2LuupZQJx+NcsMRFBFt7W4fij+C2/BfZwVir9+FlLSgE9jhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:10:21.658183Z"},"content_sha256":"d923a4a26184baf5b723843763c6a4bffda10bbe338020c0348b750f0f5b415d","schema_version":"1.0","event_id":"sha256:d923a4a26184baf5b723843763c6a4bffda10bbe338020c0348b750f0f5b415d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TCOTT2KYPMTIOFBN2GDQDBWWRI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Iam/FtoUSh26gXoe88wC1JkdVhxF4S0xcSte8vqnZMfKIsUMtIvPot8O/8nO/nMJyi447tUWpsSymMtZbS7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:10:21.658912Z"},"content_sha256":"3ee62f70a9d3c84a74fc8cd9f026a696b7fe31b2dc53b76adc4e93bcd00bc1bc","schema_version":"1.0","event_id":"sha256:3ee62f70a9d3c84a74fc8cd9f026a696b7fe31b2dc53b76adc4e93bcd00bc1bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/bundle.json","state_url":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T10:10:21Z","links":{"resolver":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI","bundle":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/bundle.json","state":"https://pith.science/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCOTT2KYPMTIOFBN2GDQDBWWRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TCOTT2KYPMTIOFBN2GDQDBWWRI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c5043d1174a36b2c30939d50b33abc9bef862323d8cb76a9b35fb7c55c4d7dfd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-08T22:42:54Z","title_canon_sha256":"31f1d0e5e2afb75c59abccd26a90815ca5262f84ccdd85b5bc20c2f58d394fb6"},"schema_version":"1.0","source":{"id":"1301.1712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1712","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1712v1","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1712","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"TCOTT2KYPMTI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"TCOTT2KYPMTIOFBN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"TCOTT2KY","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:3ee62f70a9d3c84a74fc8cd9f026a696b7fe31b2dc53b76adc4e93bcd00bc1bc","target":"graph","created_at":"2026-05-18T03:36:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Martin Haardt, Raimundo Sampaio-Neto, Rodrigo C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-08T22:42:54Z","title":"Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation, Switched Decimation and Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1712","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d923a4a26184baf5b723843763c6a4bffda10bbe338020c0348b750f0f5b415d","target":"record","created_at":"2026-05-18T03:36:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c5043d1174a36b2c30939d50b33abc9bef862323d8cb76a9b35fb7c55c4d7dfd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-08T22:42:54Z","title_canon_sha256":"31f1d0e5e2afb75c59abccd26a90815ca5262f84ccdd85b5bc20c2f58d394fb6"},"schema_version":"1.0","source":{"id":"1301.1712","kind":"arxiv","version":1}},"canonical_sha256":"989d39e9587b2687142dd1870186d68a3dee66e19d17442a1d420b1cc34002c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"989d39e9587b2687142dd1870186d68a3dee66e19d17442a1d420b1cc34002c9","first_computed_at":"2026-05-18T03:36:56.051205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:56.051205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ILJfpw9L0SnPCjA+5wXVCTozQC5djMxBZ7I98rPUVgkttH/ZxTSCHidncfW2flFS/X1RrV7pWV8w+h35P94AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:56.051639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d923a4a26184baf5b723843763c6a4bffda10bbe338020c0348b750f0f5b415d","sha256:3ee62f70a9d3c84a74fc8cd9f026a696b7fe31b2dc53b76adc4e93bcd00bc1bc"],"state_sha256":"f8a77ae88ce51929d381eed0dcee35d3cf95361b88800fdd313fc9f5c3a32088"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTCm8pBorHy2Q4YynQZIdwX3ToyCLuoeRdfDH/KKUoINh7XntM4YuP64391YweKlBrbsINy0O5IRhZbKPIaDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:10:21.663225Z","bundle_sha256":"bdd14a5bd55a2af02acad6e6f6fd84904690aeb50dc731f3b06e8a58c6835532"}}