{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3IMVER5MRHSDCVNVPBXJ75Z7QA","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":"b14697ff0861c30380635635cc5ef7add4efe296e32504fa88830fc96ec4cb5b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T08:31:38Z","title_canon_sha256":"ab6d585d253650ca3b0ac33f951457ea9692e142180e418f5e39338226ddea64"},"schema_version":"1.0","source":{"id":"1501.06686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06686","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06686v1","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06686","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"3IMVER5MRHSD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3IMVER5MRHSDCVNV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3IMVER5M","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:bd5462bfbfe059643e42f0c0e05153c5f40e0cc8b597162e51931f1c7bc081db","target":"graph","created_at":"2026-05-18T02:28:39Z","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":"Algebraic space-time coding allows for reliable data exchange across fading multiple-input multiple-output channels. A powerful technique for decoding space-time codes in Maximum-Likelihood (ML) decoding, but well-performing and widely-used codes such as the Golden code often suffer from high ML-decoding complexity. In this article, a recursive algorithm for decoding general algebraic space-time codes of arbitrary dimension is proposed, which reduces the worst-case decoding complexity from $O(|S|^{n^2})$ to $O(|S|^n)$.","authors_text":"Amaro Barreal, Camilla Hollanti, David Karpuk","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T08:31:38Z","title":"Reduced Complexity Decoding of n x n Algebraic Space-Time Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06686","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:40075e89eb0a1d5b04c2e6e2e5baf06f705a9e09f75aa1fe50fa9057917f0f46","target":"record","created_at":"2026-05-18T02:28:39Z","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":"b14697ff0861c30380635635cc5ef7add4efe296e32504fa88830fc96ec4cb5b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T08:31:38Z","title_canon_sha256":"ab6d585d253650ca3b0ac33f951457ea9692e142180e418f5e39338226ddea64"},"schema_version":"1.0","source":{"id":"1501.06686","kind":"arxiv","version":1}},"canonical_sha256":"da195247ac89e43155b5786e9ff73f800a6f8b7305923e36c2fd5822319ab819","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da195247ac89e43155b5786e9ff73f800a6f8b7305923e36c2fd5822319ab819","first_computed_at":"2026-05-18T02:28:39.352425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:39.352425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xjKH/EiG2+XnDYUJk1vPhX8gtgjF7QGKbTD021OpM958bspSU3PJonE4qOVdQ65AGtht2b5umRBhT7w2bZZmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:39.352983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40075e89eb0a1d5b04c2e6e2e5baf06f705a9e09f75aa1fe50fa9057917f0f46","sha256:bd5462bfbfe059643e42f0c0e05153c5f40e0cc8b597162e51931f1c7bc081db"],"state_sha256":"b278e93399ce632c0c6031e03149db6a8bdc8e1c8c2b5a4ee49a5692eca85cf4"}