{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BEE4TJCF6OGQDFYIC37BUTYO4S","short_pith_number":"pith:BEE4TJCF","canonical_record":{"source":{"id":"1412.1257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T10:13:41Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"aedad5c144a87c4de87ea29b96d7907af96d63b4848001d85e9ec810611d0ae5","abstract_canon_sha256":"f96fcd968b51bd55ab4fad58e87deda84bfe0c9298377a894bcd566c5f37f6a4"},"schema_version":"1.0"},"canonical_sha256":"0909c9a445f38d01970816fe1a4f0ee4b57fed6670d1506d9510ad45e25a33b7","source":{"kind":"arxiv","id":"1412.1257","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1257","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1257v2","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1257","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"BEE4TJCF6OGQ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BEE4TJCF6OGQDFYI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BEE4TJCF","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BEE4TJCF6OGQDFYIC37BUTYO4S","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T10:13:41Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"aedad5c144a87c4de87ea29b96d7907af96d63b4848001d85e9ec810611d0ae5","abstract_canon_sha256":"f96fcd968b51bd55ab4fad58e87deda84bfe0c9298377a894bcd566c5f37f6a4"},"schema_version":"1.0"},"canonical_sha256":"0909c9a445f38d01970816fe1a4f0ee4b57fed6670d1506d9510ad45e25a33b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:38.510070Z","signature_b64":"oabQ3Kluy8qkxsruMA5giRD7rTC6mVjzB1KMpCzDZYbLZ6hsH6PZGqHw1/YACOa18ekE+grV/nEcK6JCKaCKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0909c9a445f38d01970816fe1a4f0ee4b57fed6670d1506d9510ad45e25a33b7","last_reissued_at":"2026-05-18T01:24:38.509722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:38.509722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1257","source_version":2,"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-18T01:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7ycA6aWhuFJQsPlfgXijdiy8qPlgST6aikIUYbvfERd7atIJZrojXvk+1ftxtcUjDva6ouhsvd3toiOUXNfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:17:41.371065Z"},"content_sha256":"5455e4042c9427abe23796b4a907039a8b95014d17a84294edcbf2194ab56b18","schema_version":"1.0","event_id":"sha256:5455e4042c9427abe23796b4a907039a8b95014d17a84294edcbf2194ab56b18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BEE4TJCF6OGQDFYIC37BUTYO4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Amaro Barreal, Camilla Hollanti, Nadya Markin","submitted_at":"2014-12-03T10:13:41Z","abstract_excerpt":"In this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay channel under the half-duplex constraint are proposed. In this scenario, the source and the intermediate relays used for data amplification are allowed to employ multiple antennas for data transmission and reception. The worst-case decoding complexity of the obtained codes is reduced by up to $75%$. In addition to being fast-decodable, the proposed codes achie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1257","kind":"arxiv","version":2},"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-18T01:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+Tt8gqB6y3cdVZwkH+bqZJASX+SvdjUgI8Ydkw0JuY+Su1fryDszcRybaJRsbQmKdY/8OZgrcAo3uoiNzycCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:17:41.371426Z"},"content_sha256":"0ee94689b6aef0a93750b5d722a017eefff8e2726c72031d776c1a19825a1299","schema_version":"1.0","event_id":"sha256:0ee94689b6aef0a93750b5d722a017eefff8e2726c72031d776c1a19825a1299"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEE4TJCF6OGQDFYIC37BUTYO4S/bundle.json","state_url":"https://pith.science/pith/BEE4TJCF6OGQDFYIC37BUTYO4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEE4TJCF6OGQDFYIC37BUTYO4S/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-20T16:17:41Z","links":{"resolver":"https://pith.science/pith/BEE4TJCF6OGQDFYIC37BUTYO4S","bundle":"https://pith.science/pith/BEE4TJCF6OGQDFYIC37BUTYO4S/bundle.json","state":"https://pith.science/pith/BEE4TJCF6OGQDFYIC37BUTYO4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEE4TJCF6OGQDFYIC37BUTYO4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BEE4TJCF6OGQDFYIC37BUTYO4S","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":"f96fcd968b51bd55ab4fad58e87deda84bfe0c9298377a894bcd566c5f37f6a4","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T10:13:41Z","title_canon_sha256":"aedad5c144a87c4de87ea29b96d7907af96d63b4848001d85e9ec810611d0ae5"},"schema_version":"1.0","source":{"id":"1412.1257","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1257","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1257v2","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1257","created_at":"2026-05-18T01:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"BEE4TJCF6OGQ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BEE4TJCF6OGQDFYI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BEE4TJCF","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:0ee94689b6aef0a93750b5d722a017eefff8e2726c72031d776c1a19825a1299","target":"graph","created_at":"2026-05-18T01:24:38Z","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 this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay channel under the half-duplex constraint are proposed. In this scenario, the source and the intermediate relays used for data amplification are allowed to employ multiple antennas for data transmission and reception. The worst-case decoding complexity of the obtained codes is reduced by up to $75%$. In addition to being fast-decodable, the proposed codes achie","authors_text":"Amaro Barreal, Camilla Hollanti, Nadya Markin","cross_cats":["math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T10:13:41Z","title":"Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1257","kind":"arxiv","version":2},"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:5455e4042c9427abe23796b4a907039a8b95014d17a84294edcbf2194ab56b18","target":"record","created_at":"2026-05-18T01:24:38Z","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":"f96fcd968b51bd55ab4fad58e87deda84bfe0c9298377a894bcd566c5f37f6a4","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-03T10:13:41Z","title_canon_sha256":"aedad5c144a87c4de87ea29b96d7907af96d63b4848001d85e9ec810611d0ae5"},"schema_version":"1.0","source":{"id":"1412.1257","kind":"arxiv","version":2}},"canonical_sha256":"0909c9a445f38d01970816fe1a4f0ee4b57fed6670d1506d9510ad45e25a33b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0909c9a445f38d01970816fe1a4f0ee4b57fed6670d1506d9510ad45e25a33b7","first_computed_at":"2026-05-18T01:24:38.509722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:38.509722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oabQ3Kluy8qkxsruMA5giRD7rTC6mVjzB1KMpCzDZYbLZ6hsH6PZGqHw1/YACOa18ekE+grV/nEcK6JCKaCKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:38.510070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1257","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5455e4042c9427abe23796b4a907039a8b95014d17a84294edcbf2194ab56b18","sha256:0ee94689b6aef0a93750b5d722a017eefff8e2726c72031d776c1a19825a1299"],"state_sha256":"25efe8a8026de8920140d300fe09d19d87216e9506a8ae8f0b27cbde553ea665"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddbW9YI77DpUNWALGer7hqHF0nov94z7TlSia8vSdzc8brYllkS7MD5Mt5rgGM4U0aKzhiL+jP+2Bc7pIPBaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:17:41.373342Z","bundle_sha256":"886a67794b38916300db584de1e68516e25721a584bc64fc3480eef72788ec9b"}}