{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ACPYLV6IHLC6LSYJVDOOTC35E7","short_pith_number":"pith:ACPYLV6I","canonical_record":{"source":{"id":"1204.4000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T07:52:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eeed09998232302a99f50074db4f975cd1d4e196da9610116144d35ed2f4cfee","abstract_canon_sha256":"02b73d8f62b54679fb1d44a6ac36c935ab937281f2bc5ebae381589b6b837939"},"schema_version":"1.0"},"canonical_sha256":"009f85d7c83ac5e5cb09a8dce98b7d27cf24e13d34dbcccaaee4c45d7d7d0b5d","source":{"kind":"arxiv","id":"1204.4000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4000","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4000v1","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4000","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"ACPYLV6IHLC6","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ACPYLV6IHLC6LSYJ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ACPYLV6I","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ACPYLV6IHLC6LSYJVDOOTC35E7","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T07:52:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eeed09998232302a99f50074db4f975cd1d4e196da9610116144d35ed2f4cfee","abstract_canon_sha256":"02b73d8f62b54679fb1d44a6ac36c935ab937281f2bc5ebae381589b6b837939"},"schema_version":"1.0"},"canonical_sha256":"009f85d7c83ac5e5cb09a8dce98b7d27cf24e13d34dbcccaaee4c45d7d7d0b5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:18.294277Z","signature_b64":"sRySb2LEVffL4BzFwgjChqQjvVwSe9ZIvU09VUkacazqMC45BHV2UJMzw1xR0t1JWCvSKTniKbvgDvrOaawoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009f85d7c83ac5e5cb09a8dce98b7d27cf24e13d34dbcccaaee4c45d7d7d0b5d","last_reissued_at":"2026-05-18T00:58:18.293596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:18.293596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4000","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-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42+irQoCqqfiBUz8wby+EtQOPiyYntctjlzMHKVHed3SCxnE5oA+5xXiI8huAyeOjJUa9+QSU+mZrMbUqLL9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:51:05.181507Z"},"content_sha256":"f7e3693b9afda7dafc578973467158ab7bfb8a087af31eba075b8253bd30c0d8","schema_version":"1.0","event_id":"sha256:f7e3693b9afda7dafc578973467158ab7bfb8a087af31eba075b8253bd30c0d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ACPYLV6IHLC6LSYJVDOOTC35E7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Family of Low-Complexity Decodable STBCs for Four Transmit Antennas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amr Ismail, Hikmet Sari, Jocelyn Fiorina","submitted_at":"2012-04-18T07:52:48Z","abstract_excerpt":"In this paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest worst-case decoding complexity among existing comparable STBCs. The coding gain of the new rate-1 code is then optimized through constellation stretching and proved to be constant irrespective of the underlying QAM constellation prior to normalization. In a second step, we propose a new rate-2 STBC that multiplexes two of our rate-1 codes by the means of a unitary ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4000","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-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clD00zotVDV+E8GUhoy3vL97YVt/bzSCOwfQTQbiEaGOEOOUBmoyoWCyDMp80tSQejDSetHDv8w9K6mo3o41Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:51:05.181853Z"},"content_sha256":"77277b3a1039f2d21ffa7aaa6bb0a2538862d0e0255e5acb5cb07c30f1496d98","schema_version":"1.0","event_id":"sha256:77277b3a1039f2d21ffa7aaa6bb0a2538862d0e0255e5acb5cb07c30f1496d98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/bundle.json","state_url":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/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-28T12:51:05Z","links":{"resolver":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7","bundle":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/bundle.json","state":"https://pith.science/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACPYLV6IHLC6LSYJVDOOTC35E7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ACPYLV6IHLC6LSYJVDOOTC35E7","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":"02b73d8f62b54679fb1d44a6ac36c935ab937281f2bc5ebae381589b6b837939","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T07:52:48Z","title_canon_sha256":"eeed09998232302a99f50074db4f975cd1d4e196da9610116144d35ed2f4cfee"},"schema_version":"1.0","source":{"id":"1204.4000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4000","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4000v1","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4000","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"ACPYLV6IHLC6","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ACPYLV6IHLC6LSYJ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ACPYLV6I","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:77277b3a1039f2d21ffa7aaa6bb0a2538862d0e0255e5acb5cb07c30f1496d98","target":"graph","created_at":"2026-05-18T00:58:18Z","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 paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest worst-case decoding complexity among existing comparable STBCs. The coding gain of the new rate-1 code is then optimized through constellation stretching and proved to be constant irrespective of the underlying QAM constellation prior to normalization. In a second step, we propose a new rate-2 STBC that multiplexes two of our rate-1 codes by the means of a unitary ma","authors_text":"Amr Ismail, Hikmet Sari, Jocelyn Fiorina","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T07:52:48Z","title":"A New Family of Low-Complexity Decodable STBCs for Four Transmit Antennas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4000","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:f7e3693b9afda7dafc578973467158ab7bfb8a087af31eba075b8253bd30c0d8","target":"record","created_at":"2026-05-18T00:58:18Z","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":"02b73d8f62b54679fb1d44a6ac36c935ab937281f2bc5ebae381589b6b837939","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T07:52:48Z","title_canon_sha256":"eeed09998232302a99f50074db4f975cd1d4e196da9610116144d35ed2f4cfee"},"schema_version":"1.0","source":{"id":"1204.4000","kind":"arxiv","version":1}},"canonical_sha256":"009f85d7c83ac5e5cb09a8dce98b7d27cf24e13d34dbcccaaee4c45d7d7d0b5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"009f85d7c83ac5e5cb09a8dce98b7d27cf24e13d34dbcccaaee4c45d7d7d0b5d","first_computed_at":"2026-05-18T00:58:18.293596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:18.293596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sRySb2LEVffL4BzFwgjChqQjvVwSe9ZIvU09VUkacazqMC45BHV2UJMzw1xR0t1JWCvSKTniKbvgDvrOaawoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:18.294277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7e3693b9afda7dafc578973467158ab7bfb8a087af31eba075b8253bd30c0d8","sha256:77277b3a1039f2d21ffa7aaa6bb0a2538862d0e0255e5acb5cb07c30f1496d98"],"state_sha256":"8ca3b549873eea26283f012019775b959ef6767ee785d3262fef4d99db594cbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HW8kMcympODvsjZc/0p3InB64qv5IQb9GZawrDYwavnu5Ws7ufT3fllFFzqBnitWFTUSZsEHMbWT0pA2/Q8yAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:51:05.183845Z","bundle_sha256":"1bbe2f3e4ecae6bb7b602f6ed60be518acbb504b9c6e6f197ffb24c7099dbc87"}}