{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:M2HKGCIZJRN3SUBLNY37M2AYY5","short_pith_number":"pith:M2HKGCIZ","canonical_record":{"source":{"id":"1101.0339","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-01T13:43:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9789ca090af1bba57d672c2131277cc258b6de6b2a89074271e1945e8926182","abstract_canon_sha256":"340fd10eb781d45d21d11f0a519252edba89baa22f1169fbcf7dd2f58c52eb4a"},"schema_version":"1.0"},"canonical_sha256":"668ea309194c5bb9502b6e37f66818c772eed7bcd5f53185461acee56f20edab","source":{"kind":"arxiv","id":"1101.0339","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0339","created_at":"2026-05-18T02:23:05Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0339v3","created_at":"2026-05-18T02:23:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0339","created_at":"2026-05-18T02:23:05Z"},{"alias_kind":"pith_short_12","alias_value":"M2HKGCIZJRN3","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M2HKGCIZJRN3SUBL","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M2HKGCIZ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:M2HKGCIZJRN3SUBLNY37M2AYY5","target":"record","payload":{"canonical_record":{"source":{"id":"1101.0339","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-01T13:43:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9789ca090af1bba57d672c2131277cc258b6de6b2a89074271e1945e8926182","abstract_canon_sha256":"340fd10eb781d45d21d11f0a519252edba89baa22f1169fbcf7dd2f58c52eb4a"},"schema_version":"1.0"},"canonical_sha256":"668ea309194c5bb9502b6e37f66818c772eed7bcd5f53185461acee56f20edab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:05.810436Z","signature_b64":"+3ZraTJlefonslwErexpwWW7/yHfRK3g9vsjSpAvEUFfOiy3kvJStoE9QPcPPbi7rw+H+VGCVkAVKEOFJ78hAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"668ea309194c5bb9502b6e37f66818c772eed7bcd5f53185461acee56f20edab","last_reissued_at":"2026-05-18T02:23:05.809916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:05.809916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.0339","source_version":3,"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-18T02:23:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQttCrwE/XZdmLRbPooGhViChPyWAKukmIoYj0YBukYycNWCcizk+FC36eVwV70ozjeTWxS5Cim5ul7v3JiTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:31:54.963237Z"},"content_sha256":"48ad5ff8b90b9999aa8179fbabaa2c80cb2fdfc743a9d8737209ffb8062ad94f","schema_version":"1.0","event_id":"sha256:48ad5ff8b90b9999aa8179fbabaa2c80cb2fdfc743a9d8737209ffb8062ad94f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:M2HKGCIZJRN3SUBLNY37M2AYY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice Sequential Decoding for LAST Coded MIMO Channels: Achievable Rate, DMT, and Complexity Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohamed Oussama Damen, Walid Abediseid","submitted_at":"2011-01-01T13:43:17Z","abstract_excerpt":"In this paper, the asymptotic performance of the lattice sequential decoder for LAttice Space-Time (LAST) coded MIMO channel is analyzed. We determine the rates achievable by lattice coding and sequential decoding applied to such a channel. The diversity-multiplexing tradeoff (DMT) under lattice sequential decoding is derived as a function of its parameter---the bias term, which is critical for controlling the amount of computations required at the decoding stage. Achieving low decoding complexity requires increasing the value of the bias term. However, this is done at the expense of losing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0339","kind":"arxiv","version":3},"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-18T02:23:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zZ+jaELxxJs27Ug0WBFzNGH0Oz4yrbk3F8SCgmdw9haIWmaBix2lTzPAB3X2d/qX9qZv3TFDVzh3JtFjrhBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:31:54.963585Z"},"content_sha256":"e4da3a551fa0bcde86ddf670dbf7c72fedba5d51d4d1756163a06b6871b1940d","schema_version":"1.0","event_id":"sha256:e4da3a551fa0bcde86ddf670dbf7c72fedba5d51d4d1756163a06b6871b1940d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2HKGCIZJRN3SUBLNY37M2AYY5/bundle.json","state_url":"https://pith.science/pith/M2HKGCIZJRN3SUBLNY37M2AYY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2HKGCIZJRN3SUBLNY37M2AYY5/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-28T16:31:54Z","links":{"resolver":"https://pith.science/pith/M2HKGCIZJRN3SUBLNY37M2AYY5","bundle":"https://pith.science/pith/M2HKGCIZJRN3SUBLNY37M2AYY5/bundle.json","state":"https://pith.science/pith/M2HKGCIZJRN3SUBLNY37M2AYY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2HKGCIZJRN3SUBLNY37M2AYY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:M2HKGCIZJRN3SUBLNY37M2AYY5","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":"340fd10eb781d45d21d11f0a519252edba89baa22f1169fbcf7dd2f58c52eb4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-01T13:43:17Z","title_canon_sha256":"c9789ca090af1bba57d672c2131277cc258b6de6b2a89074271e1945e8926182"},"schema_version":"1.0","source":{"id":"1101.0339","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0339","created_at":"2026-05-18T02:23:05Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0339v3","created_at":"2026-05-18T02:23:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0339","created_at":"2026-05-18T02:23:05Z"},{"alias_kind":"pith_short_12","alias_value":"M2HKGCIZJRN3","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M2HKGCIZJRN3SUBL","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M2HKGCIZ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:e4da3a551fa0bcde86ddf670dbf7c72fedba5d51d4d1756163a06b6871b1940d","target":"graph","created_at":"2026-05-18T02:23:05Z","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 asymptotic performance of the lattice sequential decoder for LAttice Space-Time (LAST) coded MIMO channel is analyzed. We determine the rates achievable by lattice coding and sequential decoding applied to such a channel. The diversity-multiplexing tradeoff (DMT) under lattice sequential decoding is derived as a function of its parameter---the bias term, which is critical for controlling the amount of computations required at the decoding stage. Achieving low decoding complexity requires increasing the value of the bias term. However, this is done at the expense of losing th","authors_text":"Mohamed Oussama Damen, Walid Abediseid","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-01T13:43:17Z","title":"Lattice Sequential Decoding for LAST Coded MIMO Channels: Achievable Rate, DMT, and Complexity Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0339","kind":"arxiv","version":3},"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:48ad5ff8b90b9999aa8179fbabaa2c80cb2fdfc743a9d8737209ffb8062ad94f","target":"record","created_at":"2026-05-18T02:23:05Z","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":"340fd10eb781d45d21d11f0a519252edba89baa22f1169fbcf7dd2f58c52eb4a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-01T13:43:17Z","title_canon_sha256":"c9789ca090af1bba57d672c2131277cc258b6de6b2a89074271e1945e8926182"},"schema_version":"1.0","source":{"id":"1101.0339","kind":"arxiv","version":3}},"canonical_sha256":"668ea309194c5bb9502b6e37f66818c772eed7bcd5f53185461acee56f20edab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"668ea309194c5bb9502b6e37f66818c772eed7bcd5f53185461acee56f20edab","first_computed_at":"2026-05-18T02:23:05.809916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:05.809916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3ZraTJlefonslwErexpwWW7/yHfRK3g9vsjSpAvEUFfOiy3kvJStoE9QPcPPbi7rw+H+VGCVkAVKEOFJ78hAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:05.810436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0339","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48ad5ff8b90b9999aa8179fbabaa2c80cb2fdfc743a9d8737209ffb8062ad94f","sha256:e4da3a551fa0bcde86ddf670dbf7c72fedba5d51d4d1756163a06b6871b1940d"],"state_sha256":"51f2f067341ca9b30e31eecf01aa9b4b00faeae903c8d82bf7be86f7ec687177"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYL3o/KehfW6QXTDsJuOrshkjuT3UcZE4x/ib+pj0OxaxzQSpPxM6Zc+mMgZ2NfyzefKAKi958nSjgRIgxk2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T16:31:54.965402Z","bundle_sha256":"3fbad5139632d2a6c0e7dd8ea19f41643ce94925b4f9bc7d587838396650ea4b"}}