{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3IMVER5MRHSDCVNVPBXJ75Z7QA","short_pith_number":"pith:3IMVER5M","canonical_record":{"source":{"id":"1501.06686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T08:31:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab6d585d253650ca3b0ac33f951457ea9692e142180e418f5e39338226ddea64","abstract_canon_sha256":"b14697ff0861c30380635635cc5ef7add4efe296e32504fa88830fc96ec4cb5b"},"schema_version":"1.0"},"canonical_sha256":"da195247ac89e43155b5786e9ff73f800a6f8b7305923e36c2fd5822319ab819","source":{"kind":"arxiv","id":"1501.06686","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3IMVER5MRHSDCVNVPBXJ75Z7QA","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T08:31:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab6d585d253650ca3b0ac33f951457ea9692e142180e418f5e39338226ddea64","abstract_canon_sha256":"b14697ff0861c30380635635cc5ef7add4efe296e32504fa88830fc96ec4cb5b"},"schema_version":"1.0"},"canonical_sha256":"da195247ac89e43155b5786e9ff73f800a6f8b7305923e36c2fd5822319ab819","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:39.352983Z","signature_b64":"xjKH/EiG2+XnDYUJk1vPhX8gtgjF7QGKbTD021OpM958bspSU3PJonE4qOVdQ65AGtht2b5umRBhT7w2bZZmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da195247ac89e43155b5786e9ff73f800a6f8b7305923e36c2fd5822319ab819","last_reissued_at":"2026-05-18T02:28:39.352425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:39.352425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06686","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-18T02:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CclQJHfg2b2aqgh3m3FFSILW81ufUQ1pAlNruQn6axbi7GOUy9YbDIr/458+iH1RM4zWypn4Lhv0YfefhPNCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:45:06.315100Z"},"content_sha256":"40075e89eb0a1d5b04c2e6e2e5baf06f705a9e09f75aa1fe50fa9057917f0f46","schema_version":"1.0","event_id":"sha256:40075e89eb0a1d5b04c2e6e2e5baf06f705a9e09f75aa1fe50fa9057917f0f46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3IMVER5MRHSDCVNVPBXJ75Z7QA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced Complexity Decoding of n x n Algebraic Space-Time Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amaro Barreal, Camilla Hollanti, David Karpuk","submitted_at":"2015-01-27T08:31:38Z","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)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06686","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-18T02:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okAXeHscyLcw9biJ08WX1DWFXQzv6HCZriLO57FDwGgRqm4M4L/zFqSvyc2pD3W8f7O78167v5cnsUkAoXmzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:45:06.315682Z"},"content_sha256":"bd5462bfbfe059643e42f0c0e05153c5f40e0cc8b597162e51931f1c7bc081db","schema_version":"1.0","event_id":"sha256:bd5462bfbfe059643e42f0c0e05153c5f40e0cc8b597162e51931f1c7bc081db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/bundle.json","state_url":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/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-21T23:45:06Z","links":{"resolver":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA","bundle":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/bundle.json","state":"https://pith.science/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IMVER5MRHSDCVNVPBXJ75Z7QA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2d+XFAZMg6puvpEPP9UeTVl6n3kZaw9d6IKORFr7GiNnkBFLVma6g5K1jjWek+4e/Rs5JLJFQEe65CPh6YeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:45:06.317842Z","bundle_sha256":"4ef3c4e5b9aa652be54c87eb7aa98251535f13ad9a353be08a024f9ba8b7cefd"}}