{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QZBJIRJVCMIN3P3HUGWS33ISG6","short_pith_number":"pith:QZBJIRJV","canonical_record":{"source":{"id":"1103.1424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T03:05:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f208250d3086919cb4fc69e1657881fbbf21a3ee3a198393f073551263e4466","abstract_canon_sha256":"4152921ecef8393230c570c07e55901aab58717a837031106a57e92287ddb0f0"},"schema_version":"1.0"},"canonical_sha256":"86429445351310ddbf67a1ad2ded1237b97a2d429d3d276b29ec7faccff5ff7e","source":{"kind":"arxiv","id":"1103.1424","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1424","created_at":"2026-05-18T03:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1424v3","created_at":"2026-05-18T03:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1424","created_at":"2026-05-18T03:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"QZBJIRJVCMIN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZBJIRJVCMIN3P3H","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZBJIRJV","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QZBJIRJVCMIN3P3HUGWS33ISG6","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T03:05:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f208250d3086919cb4fc69e1657881fbbf21a3ee3a198393f073551263e4466","abstract_canon_sha256":"4152921ecef8393230c570c07e55901aab58717a837031106a57e92287ddb0f0"},"schema_version":"1.0"},"canonical_sha256":"86429445351310ddbf67a1ad2ded1237b97a2d429d3d276b29ec7faccff5ff7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:15.330818Z","signature_b64":"f5N3McOz2vbOowhAZZ/BRKentJuE1Rl8htvthyDq424awc8MhccXQ0tNJNrPF+FirEwoiMFFFzCRTLf3BAvKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86429445351310ddbf67a1ad2ded1237b97a2d429d3d276b29ec7faccff5ff7e","last_reissued_at":"2026-05-18T03:54:15.330229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:15.330229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1424","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-18T03:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ig1vcpldjKnyfGnLmmqhYPWZ+zWFOheov9bH6/9y5veThCKmu+N0sQ0Lbhoa+2FsPgSJHT1qRi7YKtzGnVhNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:40:20.327868Z"},"content_sha256":"06d7a344b512e46fe0cd21c0e86f2cc93afeb9118c5e12627e952b68d6423ff3","schema_version":"1.0","event_id":"sha256:06d7a344b512e46fe0cd21c0e86f2cc93afeb9118c5e12627e952b68d6423ff3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QZBJIRJVCMIN3P3HUGWS33ISG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Average Complexity of Sphere Decoding in Lattice Space-Time Coded MIMO Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Walid Abediseid","submitted_at":"2011-03-08T03:05:42Z","abstract_excerpt":"The exact average complexity analysis of the basic sphere decoder for general space-time codes applied to multiple-input multiple-output (MIMO) wireless channel is known to be difficult. In this work, we shed the light on the computational complexity of sphere decoding for the quasi-static, LAttice Space-Time (LAST) coded MIMO channel. Specifically, we drive an upper bound of the tail distribution of the decoder's computational complexity. We show that, when the computational complexity exceeds a certain limit, this upper bound becomes dominated by the outage probability achieved by LAST codin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1424","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-18T03:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98BIXWbWIqIJk7xlZFRdYrZVDHKPdpGlhAmZ2+YRmU2VY/zbshp7ROD1Z5AebJ5vJAJ2PRpcISj/O0mChvUECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:40:20.328210Z"},"content_sha256":"622809fc694dbd7f06b729df0888f9e056a8d5163140f16c5a235757935b8a0b","schema_version":"1.0","event_id":"sha256:622809fc694dbd7f06b729df0888f9e056a8d5163140f16c5a235757935b8a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/bundle.json","state_url":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/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-28T12:40:20Z","links":{"resolver":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6","bundle":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/bundle.json","state":"https://pith.science/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZBJIRJVCMIN3P3HUGWS33ISG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QZBJIRJVCMIN3P3HUGWS33ISG6","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":"4152921ecef8393230c570c07e55901aab58717a837031106a57e92287ddb0f0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T03:05:42Z","title_canon_sha256":"0f208250d3086919cb4fc69e1657881fbbf21a3ee3a198393f073551263e4466"},"schema_version":"1.0","source":{"id":"1103.1424","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1424","created_at":"2026-05-18T03:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1424v3","created_at":"2026-05-18T03:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1424","created_at":"2026-05-18T03:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"QZBJIRJVCMIN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZBJIRJVCMIN3P3H","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZBJIRJV","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:622809fc694dbd7f06b729df0888f9e056a8d5163140f16c5a235757935b8a0b","target":"graph","created_at":"2026-05-18T03:54:15Z","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 exact average complexity analysis of the basic sphere decoder for general space-time codes applied to multiple-input multiple-output (MIMO) wireless channel is known to be difficult. In this work, we shed the light on the computational complexity of sphere decoding for the quasi-static, LAttice Space-Time (LAST) coded MIMO channel. Specifically, we drive an upper bound of the tail distribution of the decoder's computational complexity. We show that, when the computational complexity exceeds a certain limit, this upper bound becomes dominated by the outage probability achieved by LAST codin","authors_text":"Walid Abediseid","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T03:05:42Z","title":"On the Average Complexity of Sphere Decoding in Lattice Space-Time Coded MIMO Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1424","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:06d7a344b512e46fe0cd21c0e86f2cc93afeb9118c5e12627e952b68d6423ff3","target":"record","created_at":"2026-05-18T03:54:15Z","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":"4152921ecef8393230c570c07e55901aab58717a837031106a57e92287ddb0f0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T03:05:42Z","title_canon_sha256":"0f208250d3086919cb4fc69e1657881fbbf21a3ee3a198393f073551263e4466"},"schema_version":"1.0","source":{"id":"1103.1424","kind":"arxiv","version":3}},"canonical_sha256":"86429445351310ddbf67a1ad2ded1237b97a2d429d3d276b29ec7faccff5ff7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86429445351310ddbf67a1ad2ded1237b97a2d429d3d276b29ec7faccff5ff7e","first_computed_at":"2026-05-18T03:54:15.330229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:15.330229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f5N3McOz2vbOowhAZZ/BRKentJuE1Rl8htvthyDq424awc8MhccXQ0tNJNrPF+FirEwoiMFFFzCRTLf3BAvKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:15.330818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1424","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06d7a344b512e46fe0cd21c0e86f2cc93afeb9118c5e12627e952b68d6423ff3","sha256:622809fc694dbd7f06b729df0888f9e056a8d5163140f16c5a235757935b8a0b"],"state_sha256":"a276969db6f259c1cdf967d20cbd37c4fd29dc80edcc5ee4f01055c6df5b95c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJqtzcvWbGQEZ7aDGTzxUtv3sW3W64TJRVqqVo9Ncb3+6/QWfzUpdKAA5lJ4x+dT/e7Oz8IB0Rx2a8ZjkuF8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:40:20.330098Z","bundle_sha256":"12c06f97949524d25ff2903f786da2dff03feca1b9e0aeea465fedb5c0c4f19a"}}