{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FJCYPOANU7ZJAKNMPEWU3XK63A","short_pith_number":"pith:FJCYPOAN","canonical_record":{"source":{"id":"1102.1265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T10:24:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41019b3198495b51c8ba12d65b7e2d108f8c4498b8c699749ab3b54e21373aac","abstract_canon_sha256":"4a7919c254749243a4d00aec789f0459a4420a05934189ef978b917e25bc5f3b"},"schema_version":"1.0"},"canonical_sha256":"2a4587b80da7f29029ac792d4ddd5ed825e5f1cbe7f2833083232a6bc2d04bdf","source":{"kind":"arxiv","id":"1102.1265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1265","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1265v1","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1265","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"FJCYPOANU7ZJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FJCYPOANU7ZJAKNM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FJCYPOAN","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FJCYPOANU7ZJAKNMPEWU3XK63A","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T10:24:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41019b3198495b51c8ba12d65b7e2d108f8c4498b8c699749ab3b54e21373aac","abstract_canon_sha256":"4a7919c254749243a4d00aec789f0459a4420a05934189ef978b917e25bc5f3b"},"schema_version":"1.0"},"canonical_sha256":"2a4587b80da7f29029ac792d4ddd5ed825e5f1cbe7f2833083232a6bc2d04bdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.633127Z","signature_b64":"aF85llwMq41qQEa9LU1hq7I3I5X2Q7FKJFPbwZAD+klS7WNAmNmL5MuEXny/fX7maK5RjDuf59+8yDDhDG54Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a4587b80da7f29029ac792d4ddd5ed825e5f1cbe7f2833083232a6bc2d04bdf","last_reissued_at":"2026-05-18T04:29:54.632532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.632532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1265","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-18T04:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvDOuoNucguT0198H9EQDLe+VFgxDhob2vi0obkXMYKsmjQoQspEAceerX6vUL3rA7BUndtsimK8d5Gs3x4yDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:09:49.423610Z"},"content_sha256":"5c3bde9a35a007bab6ca1e2f5702239d5eba13210b333ee1b537b2384e9b33d7","schema_version":"1.0","event_id":"sha256:5c3bde9a35a007bab6ca1e2f5702239d5eba13210b333ee1b537b2384e9b33d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FJCYPOANU7ZJAKNMPEWU3XK63A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sphere decoding complexity exponent for decoding full rate codes over the quasi-static MIMO channel","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":"2011-02-07T10:24:09Z","abstract_excerpt":"In the setting of quasi-static multiple-input multiple-output (MIMO) channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full rate linear space-time codes. With SD complexity having random fluctuations induced by the random channel, noise and codeword realizations, the introduced SD complexity exponent manages to concisely describe the computational reserves required by the SD algorithm to achieve arbitrarily close to optimal decoding performance. Bounds and exact expressions for the SD co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1265","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-18T04:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9kdFc/3S9ogyc+yKwtFROYqXnMkSxF1WnFJ0uSvr5xy2zoMGFq/7yuFNYs5jscTkVbA5VWK2SDzXNFycXTdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:09:49.424252Z"},"content_sha256":"9dc1e66a3500cd2943c990a8513f0188a844c079151388fc1f698b99f7cb999a","schema_version":"1.0","event_id":"sha256:9dc1e66a3500cd2943c990a8513f0188a844c079151388fc1f698b99f7cb999a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJCYPOANU7ZJAKNMPEWU3XK63A/bundle.json","state_url":"https://pith.science/pith/FJCYPOANU7ZJAKNMPEWU3XK63A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJCYPOANU7ZJAKNMPEWU3XK63A/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-28T23:09:49Z","links":{"resolver":"https://pith.science/pith/FJCYPOANU7ZJAKNMPEWU3XK63A","bundle":"https://pith.science/pith/FJCYPOANU7ZJAKNMPEWU3XK63A/bundle.json","state":"https://pith.science/pith/FJCYPOANU7ZJAKNMPEWU3XK63A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJCYPOANU7ZJAKNMPEWU3XK63A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FJCYPOANU7ZJAKNMPEWU3XK63A","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":"4a7919c254749243a4d00aec789f0459a4420a05934189ef978b917e25bc5f3b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T10:24:09Z","title_canon_sha256":"41019b3198495b51c8ba12d65b7e2d108f8c4498b8c699749ab3b54e21373aac"},"schema_version":"1.0","source":{"id":"1102.1265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1265","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1265v1","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1265","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"FJCYPOANU7ZJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FJCYPOANU7ZJAKNM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FJCYPOAN","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:9dc1e66a3500cd2943c990a8513f0188a844c079151388fc1f698b99f7cb999a","target":"graph","created_at":"2026-05-18T04:29:54Z","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 the setting of quasi-static multiple-input multiple-output (MIMO) channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full rate linear space-time codes. With SD complexity having random fluctuations induced by the random channel, noise and codeword realizations, the introduced SD complexity exponent manages to concisely describe the computational reserves required by the SD algorithm to achieve arbitrarily close to optimal decoding performance. Bounds and exact expressions for the SD co","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":"2011-02-07T10:24:09Z","title":"Sphere decoding complexity exponent for decoding full rate codes over the quasi-static MIMO channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1265","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:5c3bde9a35a007bab6ca1e2f5702239d5eba13210b333ee1b537b2384e9b33d7","target":"record","created_at":"2026-05-18T04:29:54Z","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":"4a7919c254749243a4d00aec789f0459a4420a05934189ef978b917e25bc5f3b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-07T10:24:09Z","title_canon_sha256":"41019b3198495b51c8ba12d65b7e2d108f8c4498b8c699749ab3b54e21373aac"},"schema_version":"1.0","source":{"id":"1102.1265","kind":"arxiv","version":1}},"canonical_sha256":"2a4587b80da7f29029ac792d4ddd5ed825e5f1cbe7f2833083232a6bc2d04bdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a4587b80da7f29029ac792d4ddd5ed825e5f1cbe7f2833083232a6bc2d04bdf","first_computed_at":"2026-05-18T04:29:54.632532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:54.632532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aF85llwMq41qQEa9LU1hq7I3I5X2Q7FKJFPbwZAD+klS7WNAmNmL5MuEXny/fX7maK5RjDuf59+8yDDhDG54Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:54.633127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c3bde9a35a007bab6ca1e2f5702239d5eba13210b333ee1b537b2384e9b33d7","sha256:9dc1e66a3500cd2943c990a8513f0188a844c079151388fc1f698b99f7cb999a"],"state_sha256":"eb186b1a4156e23e10f58d1658a7e07f5c70c92275563fa8cc63a55ddd10a610"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0C/bGZyf9HvRqMVfDPK8OCN9eNBCxFR2TU95RH50+7FMQ2oG7II4DZndGyNWPUQ+ZfEMBz2dKOlL0u3ododLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:09:49.427410Z","bundle_sha256":"7c9f9aa0db426576e117676acb664508f654ec19391a4e5935578ef060b38a6b"}}