{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EUC73JIQIQSH5RRTK3ISZKPGX3","short_pith_number":"pith:EUC73JIQ","schema_version":"1.0","canonical_sha256":"2505fda51044247ec63356d12ca9e6bee2168864a3ef51672670df37b3ea0556","source":{"kind":"arxiv","id":"1009.0050","version":1},"attestation_state":"computed","paper":{"title":"Golden Coded Multiple Beamforming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boyu Li, Ender Ayanoglu","submitted_at":"2010-08-31T23:15:15Z","abstract_excerpt":"The Golden Code is a full-rate full-diversity space-time code, which achieves maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two transmit and two receive antennas. Since four information symbols taken from an M-QAM constellation are selected to construct one Golden Code codeword, a maximum likelihood decoder using sphere decoding has the worst-case complexity of O(M^4), when the Channel State Information (CSI) is available at the receiver. Previously, this worst-case complexity was reduced to O(M^(2.5)) without performance degradation. When the CSI is known by the t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1009.0050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-31T23:15:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61686e689683bae6e3f6501c7c3fd8498ac7ba0a9269ad2f2c6df4e833906cd8","abstract_canon_sha256":"94585ea2f67f2efe511b4df6d06e621d6b707a9b6b3806f5d6b1ef2e809716a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.241195Z","signature_b64":"q8teQ7vJb1TUXY/Xkdv6b0GdbcuKBAA0qAtKO5oUwK3RatOLbAfXYaxT6DrJOtponY2xdvIVHq72vZkSe/cnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2505fda51044247ec63356d12ca9e6bee2168864a3ef51672670df37b3ea0556","last_reissued_at":"2026-05-18T03:48:45.240616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.240616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Golden Coded Multiple Beamforming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boyu Li, Ender Ayanoglu","submitted_at":"2010-08-31T23:15:15Z","abstract_excerpt":"The Golden Code is a full-rate full-diversity space-time code, which achieves maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two transmit and two receive antennas. Since four information symbols taken from an M-QAM constellation are selected to construct one Golden Code codeword, a maximum likelihood decoder using sphere decoding has the worst-case complexity of O(M^4), when the Channel State Information (CSI) is available at the receiver. Previously, this worst-case complexity was reduced to O(M^(2.5)) without performance degradation. When the CSI is known by the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0050","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.0050","created_at":"2026-05-18T03:48:45.240702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0050v1","created_at":"2026-05-18T03:48:45.240702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0050","created_at":"2026-05-18T03:48:45.240702+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUC73JIQIQSH","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUC73JIQIQSH5RRT","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUC73JIQ","created_at":"2026-05-18T12:26:06.534383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3","json":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3.json","graph_json":"https://pith.science/api/pith-number/EUC73JIQIQSH5RRTK3ISZKPGX3/graph.json","events_json":"https://pith.science/api/pith-number/EUC73JIQIQSH5RRTK3ISZKPGX3/events.json","paper":"https://pith.science/paper/EUC73JIQ"},"agent_actions":{"view_html":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3","download_json":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3.json","view_paper":"https://pith.science/paper/EUC73JIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0050&json=true","fetch_graph":"https://pith.science/api/pith-number/EUC73JIQIQSH5RRTK3ISZKPGX3/graph.json","fetch_events":"https://pith.science/api/pith-number/EUC73JIQIQSH5RRTK3ISZKPGX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3/action/storage_attestation","attest_author":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3/action/author_attestation","sign_citation":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3/action/citation_signature","submit_replication":"https://pith.science/pith/EUC73JIQIQSH5RRTK3ISZKPGX3/action/replication_record"}},"created_at":"2026-05-18T03:48:45.240702+00:00","updated_at":"2026-05-18T03:48:45.240702+00:00"}