{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JDM6PNOHOEIEDNOSOWYM2AZZX3","short_pith_number":"pith:JDM6PNOH","canonical_record":{"source":{"id":"1304.7548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-29T01:41:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b61dd03eed8f1040174bae514310bd6fd200c1898f7d0d5206e9e7bc4ad08f83","abstract_canon_sha256":"4d3b439fdf3a578eed878f553f644f3e11b2e1812c04f0f24452b6f6fdaaf8b2"},"schema_version":"1.0"},"canonical_sha256":"48d9e7b5c7711041b5d275b0cd0339bef0f0c27defc530663fb7838cf8fd7e86","source":{"kind":"arxiv","id":"1304.7548","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7548","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7548v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7548","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"JDM6PNOHOEIE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JDM6PNOHOEIEDNOS","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JDM6PNOH","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JDM6PNOHOEIEDNOSOWYM2AZZX3","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-29T01:41:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b61dd03eed8f1040174bae514310bd6fd200c1898f7d0d5206e9e7bc4ad08f83","abstract_canon_sha256":"4d3b439fdf3a578eed878f553f644f3e11b2e1812c04f0f24452b6f6fdaaf8b2"},"schema_version":"1.0"},"canonical_sha256":"48d9e7b5c7711041b5d275b0cd0339bef0f0c27defc530663fb7838cf8fd7e86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:53.692596Z","signature_b64":"8WVVPQv/NN6w8DkZ4s3kDYrckiWSOzvBpHmy1LxKmNZvI7Ts5B59ch2VpNaNShRErdEDn4jCgyNcANkkIoQGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48d9e7b5c7711041b5d275b0cd0339bef0f0c27defc530663fb7838cf8fd7e86","last_reissued_at":"2026-05-18T03:26:53.692047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:53.692047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7548","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:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQ/z38bfnVonNjZ9f91NknCIGy6g71NO63VBEfliFV78EQ46jLYsU3jUdhOZNKNGYBiPdwwoAFKuUh0dtv0/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:39:10.035703Z"},"content_sha256":"7d21ceffd593450d7670625d67b23afac658fb65e21b5bf5a628e1a8c186a9da","schema_version":"1.0","event_id":"sha256:7d21ceffd593450d7670625d67b23afac658fb65e21b5bf5a628e1a8c186a9da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JDM6PNOHOEIEDNOSOWYM2AZZX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Reduced-Rank RLS Algorithms based on Joint Iterative Optimization of Filters for Space-Time Interference Suppression","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-04-29T01:41:53Z","abstract_excerpt":"This paper presents novel adaptive reduced-rank filtering algorithms based on joint iterative optimization of adaptive filters. The novel scheme consists of a joint iterative optimization of a bank of full-rank adaptive filters that constitute the projection matrix and an adaptive reduced-rank filter that operates at the output of the bank of filters. We describe least squares (LS) expressions for the design of the projection matrix and the reduced-rank filter and recursive least squares (RLS) adaptive algorithms for its computationally efficient implementation. Simulations for a space-time in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7548","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:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71ksc/5Or0nU93XRmnD/GVZxIaj9rBPiL6avAXM66iMzEWj/ng05CeOhNvABaDAenpmY+YLgYeao7yhzHKcnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:39:10.036352Z"},"content_sha256":"df5779fd98a2a8e97198edb8325212a40468da681f9611c0cfcfa6f0db3a4069","schema_version":"1.0","event_id":"sha256:df5779fd98a2a8e97198edb8325212a40468da681f9611c0cfcfa6f0db3a4069"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/bundle.json","state_url":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/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-08T13:39:10Z","links":{"resolver":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3","bundle":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/bundle.json","state":"https://pith.science/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDM6PNOHOEIEDNOSOWYM2AZZX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JDM6PNOHOEIEDNOSOWYM2AZZX3","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":"4d3b439fdf3a578eed878f553f644f3e11b2e1812c04f0f24452b6f6fdaaf8b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-29T01:41:53Z","title_canon_sha256":"b61dd03eed8f1040174bae514310bd6fd200c1898f7d0d5206e9e7bc4ad08f83"},"schema_version":"1.0","source":{"id":"1304.7548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7548","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7548v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7548","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"JDM6PNOHOEIE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JDM6PNOHOEIEDNOS","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JDM6PNOH","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:df5779fd98a2a8e97198edb8325212a40468da681f9611c0cfcfa6f0db3a4069","target":"graph","created_at":"2026-05-18T03:26:53Z","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 paper presents novel adaptive reduced-rank filtering algorithms based on joint iterative optimization of adaptive filters. The novel scheme consists of a joint iterative optimization of a bank of full-rank adaptive filters that constitute the projection matrix and an adaptive reduced-rank filter that operates at the output of the bank of filters. We describe least squares (LS) expressions for the design of the projection matrix and the reduced-rank filter and recursive least squares (RLS) adaptive algorithms for its computationally efficient implementation. Simulations for a space-time in","authors_text":"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-04-29T01:41:53Z","title":"Adaptive Reduced-Rank RLS Algorithms based on Joint Iterative Optimization of Filters for Space-Time Interference Suppression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7548","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:7d21ceffd593450d7670625d67b23afac658fb65e21b5bf5a628e1a8c186a9da","target":"record","created_at":"2026-05-18T03:26:53Z","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":"4d3b439fdf3a578eed878f553f644f3e11b2e1812c04f0f24452b6f6fdaaf8b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-29T01:41:53Z","title_canon_sha256":"b61dd03eed8f1040174bae514310bd6fd200c1898f7d0d5206e9e7bc4ad08f83"},"schema_version":"1.0","source":{"id":"1304.7548","kind":"arxiv","version":1}},"canonical_sha256":"48d9e7b5c7711041b5d275b0cd0339bef0f0c27defc530663fb7838cf8fd7e86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48d9e7b5c7711041b5d275b0cd0339bef0f0c27defc530663fb7838cf8fd7e86","first_computed_at":"2026-05-18T03:26:53.692047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:53.692047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8WVVPQv/NN6w8DkZ4s3kDYrckiWSOzvBpHmy1LxKmNZvI7Ts5B59ch2VpNaNShRErdEDn4jCgyNcANkkIoQGDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:53.692596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d21ceffd593450d7670625d67b23afac658fb65e21b5bf5a628e1a8c186a9da","sha256:df5779fd98a2a8e97198edb8325212a40468da681f9611c0cfcfa6f0db3a4069"],"state_sha256":"401619abc603654a572dcb2d75a4c660ddc9064c0058c5c28cdd5a13228dd00a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWeMnRA77CP3kT6X+H5CkO8GvEYc8QvSyeFDrM4HkCea22A1/ISYWB+SnJwmLXOwTO+H2Yz3pq5U3XYzeirhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:39:10.039416Z","bundle_sha256":"d6b89966a9572aa27c48ce474389cf8135c0181bdc7e1dddd0c7255f1b032883"}}