{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ORBZSWOOZHOCLCMZYRXD5UTZRJ","short_pith_number":"pith:ORBZSWOO","canonical_record":{"source":{"id":"1401.4936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-20T15:21:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"170b836c3f585dc9619307c1bc63e350da939c4113f0fd8c5cc67ee5cb32af14","abstract_canon_sha256":"b92063395bc54f3017aa0ebbea84895fd527034f21333c40379dcb1ef50c9475"},"schema_version":"1.0"},"canonical_sha256":"74439959cec9dc258999c46e3ed2798a405b61a4c046f868812734bae8d48f88","source":{"kind":"arxiv","id":"1401.4936","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4936","created_at":"2026-05-18T03:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4936v1","created_at":"2026-05-18T03:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4936","created_at":"2026-05-18T03:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"ORBZSWOOZHOC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORBZSWOOZHOCLCMZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORBZSWOO","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ORBZSWOOZHOCLCMZYRXD5UTZRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-20T15:21:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"170b836c3f585dc9619307c1bc63e350da939c4113f0fd8c5cc67ee5cb32af14","abstract_canon_sha256":"b92063395bc54f3017aa0ebbea84895fd527034f21333c40379dcb1ef50c9475"},"schema_version":"1.0"},"canonical_sha256":"74439959cec9dc258999c46e3ed2798a405b61a4c046f868812734bae8d48f88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:43.955855Z","signature_b64":"GtZoPt4Cfie1JT7gC+DBOd7CKwxoWtHjEeWB05J35fpXcUGUinxskWP8/wvD7Q7MHUJZBsuKc8rBufJ7ptMBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74439959cec9dc258999c46e3ed2798a405b61a4c046f868812734bae8d48f88","last_reissued_at":"2026-05-18T03:01:43.955012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:43.955012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4936","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:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kaySOLkVawqzqbOVDuyzraK7tb1H6haMUaE8ptke3D4kbvoLQOThh5m4tyfXfcNwKVg/UeOGrkGclGP4jvahDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:02:48.591738Z"},"content_sha256":"01b9b02be5221effeba95b533f94eb395d1dcf468f56619c9ff9c5b8345edbac","schema_version":"1.0","event_id":"sha256:01b9b02be5221effeba95b533f94eb395d1dcf468f56619c9ff9c5b8345edbac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ORBZSWOOZHOCLCMZYRXD5UTZRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Robust Data-Adaptive Dimensionality Reduction Based on Joint Iterative Optimization of Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"P. Li, R. C. de Lamare","submitted_at":"2014-01-20T15:21:49Z","abstract_excerpt":"This paper presents a low-complexity robust data-dependent dimensionality reduction based on a modified joint iterative optimization (MJIO) algorithm for reduced-rank beamforming and steering vector estimation. The proposed robust optimization procedure jointly adjusts the parameters of a rank-reduction matrix and an adaptive beamformer. The optimized rank-reduction matrix projects the received signal vector onto a subspace with lower dimension. The beamformer/steering vector optimization is then performed in a reduced-dimension subspace. We devise efficient stochastic gradient and recursive l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4936","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:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1K8CO/VKU/ACwHHdMYMZbl7LXR6Ll8Qdo9RNfvHVRgyu1LcCGeV9JJ9NGG3PxWdipbighHT1wxIjpA9eK1RCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:02:48.592089Z"},"content_sha256":"1aeaecf11694fd8cb062609a7a92ef80a1317d8ac226019de16c7e11b83b7914","schema_version":"1.0","event_id":"sha256:1aeaecf11694fd8cb062609a7a92ef80a1317d8ac226019de16c7e11b83b7914"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORBZSWOOZHOCLCMZYRXD5UTZRJ/bundle.json","state_url":"https://pith.science/pith/ORBZSWOOZHOCLCMZYRXD5UTZRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORBZSWOOZHOCLCMZYRXD5UTZRJ/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-05-20T13:02:48Z","links":{"resolver":"https://pith.science/pith/ORBZSWOOZHOCLCMZYRXD5UTZRJ","bundle":"https://pith.science/pith/ORBZSWOOZHOCLCMZYRXD5UTZRJ/bundle.json","state":"https://pith.science/pith/ORBZSWOOZHOCLCMZYRXD5UTZRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORBZSWOOZHOCLCMZYRXD5UTZRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ORBZSWOOZHOCLCMZYRXD5UTZRJ","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":"b92063395bc54f3017aa0ebbea84895fd527034f21333c40379dcb1ef50c9475","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-20T15:21:49Z","title_canon_sha256":"170b836c3f585dc9619307c1bc63e350da939c4113f0fd8c5cc67ee5cb32af14"},"schema_version":"1.0","source":{"id":"1401.4936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4936","created_at":"2026-05-18T03:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4936v1","created_at":"2026-05-18T03:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4936","created_at":"2026-05-18T03:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"ORBZSWOOZHOC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORBZSWOOZHOCLCMZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORBZSWOO","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:1aeaecf11694fd8cb062609a7a92ef80a1317d8ac226019de16c7e11b83b7914","target":"graph","created_at":"2026-05-18T03:01:43Z","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 a low-complexity robust data-dependent dimensionality reduction based on a modified joint iterative optimization (MJIO) algorithm for reduced-rank beamforming and steering vector estimation. The proposed robust optimization procedure jointly adjusts the parameters of a rank-reduction matrix and an adaptive beamformer. The optimized rank-reduction matrix projects the received signal vector onto a subspace with lower dimension. The beamformer/steering vector optimization is then performed in a reduced-dimension subspace. We devise efficient stochastic gradient and recursive l","authors_text":"P. Li, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-20T15:21:49Z","title":"Low-Complexity Robust Data-Adaptive Dimensionality Reduction Based on Joint Iterative Optimization of Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4936","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:01b9b02be5221effeba95b533f94eb395d1dcf468f56619c9ff9c5b8345edbac","target":"record","created_at":"2026-05-18T03:01:43Z","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":"b92063395bc54f3017aa0ebbea84895fd527034f21333c40379dcb1ef50c9475","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-20T15:21:49Z","title_canon_sha256":"170b836c3f585dc9619307c1bc63e350da939c4113f0fd8c5cc67ee5cb32af14"},"schema_version":"1.0","source":{"id":"1401.4936","kind":"arxiv","version":1}},"canonical_sha256":"74439959cec9dc258999c46e3ed2798a405b61a4c046f868812734bae8d48f88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74439959cec9dc258999c46e3ed2798a405b61a4c046f868812734bae8d48f88","first_computed_at":"2026-05-18T03:01:43.955012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:43.955012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtZoPt4Cfie1JT7gC+DBOd7CKwxoWtHjEeWB05J35fpXcUGUinxskWP8/wvD7Q7MHUJZBsuKc8rBufJ7ptMBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:43.955855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01b9b02be5221effeba95b533f94eb395d1dcf468f56619c9ff9c5b8345edbac","sha256:1aeaecf11694fd8cb062609a7a92ef80a1317d8ac226019de16c7e11b83b7914"],"state_sha256":"60a1d9e8488641addd4bfa6df3cce37c9f0882af0fe0eb7685a666f037384425"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUzLu1vknIbkAUW0tF/+1ZBn6yCjgECTMZGLCn47z+Y0PXLFLcLvrKQadp+DanadB5g1saiB6NIGLn0ytoONBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T13:02:48.594095Z","bundle_sha256":"63863f902cee93c92ff6c97d7d4c1564ff98147f3dc7959ef98e591a3624e370"}}