{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YP6WRJXXCFND6ALVOHKXVL6PKV","short_pith_number":"pith:YP6WRJXX","canonical_record":{"source":{"id":"1301.3708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-16T14:53:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bac2fc496b160b48c29e56b7d22c672e117b847798b8c93ebf1b32d759950d8b","abstract_canon_sha256":"91885a70a17523c0ea449d04760ec1a65f223f65baf2785ae9f0a8ed863724d8"},"schema_version":"1.0"},"canonical_sha256":"c3fd68a6f7115a3f017571d57aafcf554f067e49a69c398c7a6d6f04adda3779","source":{"kind":"arxiv","id":"1301.3708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3708","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3708v1","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3708","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"YP6WRJXXCFND","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YP6WRJXXCFND6ALV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YP6WRJXX","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YP6WRJXXCFND6ALVOHKXVL6PKV","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-16T14:53:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bac2fc496b160b48c29e56b7d22c672e117b847798b8c93ebf1b32d759950d8b","abstract_canon_sha256":"91885a70a17523c0ea449d04760ec1a65f223f65baf2785ae9f0a8ed863724d8"},"schema_version":"1.0"},"canonical_sha256":"c3fd68a6f7115a3f017571d57aafcf554f067e49a69c398c7a6d6f04adda3779","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:16.967560Z","signature_b64":"zzQwlgCBItDoH7/tlEhCxOBXVpwH1V37IPrdk0CJeq6eJ9rLUZsCxNiOayp6mqBJZNsl52NMyMd0GdS8cMLkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3fd68a6f7115a3f017571d57aafcf554f067e49a69c398c7a6d6f04adda3779","last_reissued_at":"2026-05-18T03:36:16.967030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:16.967030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3708","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:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DpjCv/vpRXmfnv3l6Rlq+rNtTOQzZ2Gpam1tpvyD09hBepr3qQPP70xTe7/Ow4iFFjCT2t8yN+wyamgwhOD6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:23:44.008694Z"},"content_sha256":"736bdee0540bda1b21fd6895dc56438f9d6cff4b910057adf7bb156c43acf3e2","schema_version":"1.0","event_id":"sha256:736bdee0540bda1b21fd6895dc56438f9d6cff4b910057adf7bb156c43acf3e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YP6WRJXXCFND6ALVOHKXVL6PKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Training Sequence Design for MIMO Channels: An Application-Oriented Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cristian R. Rojas, Dimitrios Katselis, Emil Bj\\\"ornson, H{\\aa}kan Hjalmarsson, Magnus Jansson, Mats Bengtsson, Nafiseh Shariati, Xavier Bombois","submitted_at":"2013-01-16T14:53:34Z","abstract_excerpt":"In this paper, the problem of training optimization for estimating a multiple-input multiple-output (MIMO) flat fading channel in the presence of spatially and temporally correlated Gaussian noise is studied in an application-oriented setup. So far, the problem of MIMO channel estimation has mostly been treated within the context of minimizing the mean square error (MSE) of the channel estimate subject to various constraints, such as an upper bound on the available training energy. We introduce a more general framework for the task of training sequence design in MIMO systems, which can treat n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3708","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:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bui9pFdlr8R9kXgdrAldLtIrFzzK3xP4CJA7moQfIEodzL6GBP2YcVMt5iKL5mbZ8HrExoZ21hhBJBWBuXgQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:23:44.009087Z"},"content_sha256":"5cb9845a8e9f3910d53376f5cc81191e317d0cd42575af1b1fed0fa62d32d337","schema_version":"1.0","event_id":"sha256:5cb9845a8e9f3910d53376f5cc81191e317d0cd42575af1b1fed0fa62d32d337"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YP6WRJXXCFND6ALVOHKXVL6PKV/bundle.json","state_url":"https://pith.science/pith/YP6WRJXXCFND6ALVOHKXVL6PKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YP6WRJXXCFND6ALVOHKXVL6PKV/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-01T22:23:44Z","links":{"resolver":"https://pith.science/pith/YP6WRJXXCFND6ALVOHKXVL6PKV","bundle":"https://pith.science/pith/YP6WRJXXCFND6ALVOHKXVL6PKV/bundle.json","state":"https://pith.science/pith/YP6WRJXXCFND6ALVOHKXVL6PKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YP6WRJXXCFND6ALVOHKXVL6PKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YP6WRJXXCFND6ALVOHKXVL6PKV","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":"91885a70a17523c0ea449d04760ec1a65f223f65baf2785ae9f0a8ed863724d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-16T14:53:34Z","title_canon_sha256":"bac2fc496b160b48c29e56b7d22c672e117b847798b8c93ebf1b32d759950d8b"},"schema_version":"1.0","source":{"id":"1301.3708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3708","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3708v1","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3708","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"YP6WRJXXCFND","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YP6WRJXXCFND6ALV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YP6WRJXX","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:5cb9845a8e9f3910d53376f5cc81191e317d0cd42575af1b1fed0fa62d32d337","target":"graph","created_at":"2026-05-18T03:36:16Z","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":"In this paper, the problem of training optimization for estimating a multiple-input multiple-output (MIMO) flat fading channel in the presence of spatially and temporally correlated Gaussian noise is studied in an application-oriented setup. So far, the problem of MIMO channel estimation has mostly been treated within the context of minimizing the mean square error (MSE) of the channel estimate subject to various constraints, such as an upper bound on the available training energy. We introduce a more general framework for the task of training sequence design in MIMO systems, which can treat n","authors_text":"Cristian R. Rojas, Dimitrios Katselis, Emil Bj\\\"ornson, H{\\aa}kan Hjalmarsson, Magnus Jansson, Mats Bengtsson, Nafiseh Shariati, Xavier Bombois","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-16T14:53:34Z","title":"Training Sequence Design for MIMO Channels: An Application-Oriented Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3708","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:736bdee0540bda1b21fd6895dc56438f9d6cff4b910057adf7bb156c43acf3e2","target":"record","created_at":"2026-05-18T03:36:16Z","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":"91885a70a17523c0ea449d04760ec1a65f223f65baf2785ae9f0a8ed863724d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-16T14:53:34Z","title_canon_sha256":"bac2fc496b160b48c29e56b7d22c672e117b847798b8c93ebf1b32d759950d8b"},"schema_version":"1.0","source":{"id":"1301.3708","kind":"arxiv","version":1}},"canonical_sha256":"c3fd68a6f7115a3f017571d57aafcf554f067e49a69c398c7a6d6f04adda3779","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3fd68a6f7115a3f017571d57aafcf554f067e49a69c398c7a6d6f04adda3779","first_computed_at":"2026-05-18T03:36:16.967030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:16.967030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zzQwlgCBItDoH7/tlEhCxOBXVpwH1V37IPrdk0CJeq6eJ9rLUZsCxNiOayp6mqBJZNsl52NMyMd0GdS8cMLkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:16.967560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:736bdee0540bda1b21fd6895dc56438f9d6cff4b910057adf7bb156c43acf3e2","sha256:5cb9845a8e9f3910d53376f5cc81191e317d0cd42575af1b1fed0fa62d32d337"],"state_sha256":"b68ed4242e1cccc2efa6ec2f68e2683a1cd2501e67bbbeb09756f9d3e9a6b557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/kUDtNXsv8Oon4SitjlaktEJAcBesSKS4UDxrfVsGAK+6M3W8UV4btBysg0zDwE0BLxA26p/a5avOc61oYkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:23:44.011701Z","bundle_sha256":"285bc53127f1c753396e853fd9271190f970f0d1ec70872037b9e33e7355f87f"}}