{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:O2SMZJHE647ZOQM3ZZBDDVMBF4","short_pith_number":"pith:O2SMZJHE","canonical_record":{"source":{"id":"0905.4023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-25T14:31:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7520cc5cfbf785137e2a675fe0e485716b90359472dae4990d5d452c3e83108","abstract_canon_sha256":"1da436ab91e26accf8bcb1e7c708b62c3229855e3903b0a1891579d232bd98d6"},"schema_version":"1.0"},"canonical_sha256":"76a4cca4e4f73f97419bce4231d5812f21f323ceba9888c297395fa08a6f74a9","source":{"kind":"arxiv","id":"0905.4023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4023","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4023v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4023","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"O2SMZJHE647Z","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O2SMZJHE647ZOQM3","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O2SMZJHE","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:O2SMZJHE647ZOQM3ZZBDDVMBF4","target":"record","payload":{"canonical_record":{"source":{"id":"0905.4023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-25T14:31:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7520cc5cfbf785137e2a675fe0e485716b90359472dae4990d5d452c3e83108","abstract_canon_sha256":"1da436ab91e26accf8bcb1e7c708b62c3229855e3903b0a1891579d232bd98d6"},"schema_version":"1.0"},"canonical_sha256":"76a4cca4e4f73f97419bce4231d5812f21f323ceba9888c297395fa08a6f74a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.187667Z","signature_b64":"aF299ku6tb9lbL9if0C4azDxitP6tKC1MDDrU8dc7EWiFbEDi3+jWennHnJZGgrqkqdN4f7JhZi8Kk4F+1SODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a4cca4e4f73f97419bce4231d5812f21f323ceba9888c297395fa08a6f74a9","last_reissued_at":"2026-05-18T00:57:58.187010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.187010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.4023","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+Q7SC2BUo3Sib3TQr167zC9JxTHrG21mNdvqw6EicETrSR9+TGZRz4wqByMoZKBkM2eCBP+IWe2W45xDZ5PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:43:15.619372Z"},"content_sha256":"99ac8da2e409682ced03a235b760e55fb757e46246593029d995b242c931b77c","schema_version":"1.0","event_id":"sha256:99ac8da2e409682ced03a235b760e55fb757e46246593029d995b242c931b77c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:O2SMZJHE647ZOQM3ZZBDDVMBF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joakim Jalden, Petros Elia","submitted_at":"2009-05-25T14:31:40Z","abstract_excerpt":"The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive maximum-likelihood (ML) receiver. Specifically, the work establishes the DMT optimality of a class of regularized lattice decoders, and more importantly the DMT optimality of their lattice-reduction (LR)-aided linear counterparts. The results hold for all channel statistics, for all channel dimensions, and most interestingly, irrespective of the particular lattice-code a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4023","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uF540oKkmbhT/6Ni/y6Kf19wzT2gZwvaR8WaoC4JCZWh9yS8GaxzdBVu5P9LQB6tK5IWHch0Kv8LATVv+FoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:43:15.620058Z"},"content_sha256":"51e44d987b2b806e30c642f9730cedf9a07c6f7864c6e4d9047159f6266eed8b","schema_version":"1.0","event_id":"sha256:51e44d987b2b806e30c642f9730cedf9a07c6f7864c6e4d9047159f6266eed8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2SMZJHE647ZOQM3ZZBDDVMBF4/bundle.json","state_url":"https://pith.science/pith/O2SMZJHE647ZOQM3ZZBDDVMBF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2SMZJHE647ZOQM3ZZBDDVMBF4/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-26T13:43:15Z","links":{"resolver":"https://pith.science/pith/O2SMZJHE647ZOQM3ZZBDDVMBF4","bundle":"https://pith.science/pith/O2SMZJHE647ZOQM3ZZBDDVMBF4/bundle.json","state":"https://pith.science/pith/O2SMZJHE647ZOQM3ZZBDDVMBF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2SMZJHE647ZOQM3ZZBDDVMBF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:O2SMZJHE647ZOQM3ZZBDDVMBF4","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":"1da436ab91e26accf8bcb1e7c708b62c3229855e3903b0a1891579d232bd98d6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-25T14:31:40Z","title_canon_sha256":"b7520cc5cfbf785137e2a675fe0e485716b90359472dae4990d5d452c3e83108"},"schema_version":"1.0","source":{"id":"0905.4023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4023","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4023v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4023","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"O2SMZJHE647Z","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O2SMZJHE647ZOQM3","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O2SMZJHE","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:51e44d987b2b806e30c642f9730cedf9a07c6f7864c6e4d9047159f6266eed8b","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive maximum-likelihood (ML) receiver. Specifically, the work establishes the DMT optimality of a class of regularized lattice decoders, and more importantly the DMT optimality of their lattice-reduction (LR)-aided linear counterparts. The results hold for all channel statistics, for all channel dimensions, and most interestingly, irrespective of the particular lattice-code a","authors_text":"Joakim Jalden, Petros Elia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-25T14:31:40Z","title":"DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4023","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:99ac8da2e409682ced03a235b760e55fb757e46246593029d995b242c931b77c","target":"record","created_at":"2026-05-18T00:57:58Z","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":"1da436ab91e26accf8bcb1e7c708b62c3229855e3903b0a1891579d232bd98d6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-25T14:31:40Z","title_canon_sha256":"b7520cc5cfbf785137e2a675fe0e485716b90359472dae4990d5d452c3e83108"},"schema_version":"1.0","source":{"id":"0905.4023","kind":"arxiv","version":1}},"canonical_sha256":"76a4cca4e4f73f97419bce4231d5812f21f323ceba9888c297395fa08a6f74a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76a4cca4e4f73f97419bce4231d5812f21f323ceba9888c297395fa08a6f74a9","first_computed_at":"2026-05-18T00:57:58.187010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.187010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aF299ku6tb9lbL9if0C4azDxitP6tKC1MDDrU8dc7EWiFbEDi3+jWennHnJZGgrqkqdN4f7JhZi8Kk4F+1SODg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.187667Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.4023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99ac8da2e409682ced03a235b760e55fb757e46246593029d995b242c931b77c","sha256:51e44d987b2b806e30c642f9730cedf9a07c6f7864c6e4d9047159f6266eed8b"],"state_sha256":"463a86817cc2c9d333717e7c6b8125ce6bf747d7799b865400c8fdc2d691567b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwCg3MSOE4T492mNdxX9uWi6IORgye22W889POjXYQpIXiBOYb7UI0bbuz0FyHAFU93ssUeOwI8ITBms5VHpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:43:15.623535Z","bundle_sha256":"abbdf97850f88eb7588e2395d047163af91bad8867aab98d8e379bc71b129f5f"}}