{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:37UYO2ZQMP7WSEZJYDOGKGUJMQ","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":"59a80b764a6749431533579ca438a9b0440ffc552bd334cfc64bd029065c7fba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-01T23:56:27Z","title_canon_sha256":"0df758ac29a24b040ac8053372ce25b139240d750f5edfc1fbf46a496b49c38d"},"schema_version":"1.0","source":{"id":"1011.0474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0474","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0474v1","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0474","created_at":"2026-05-18T04:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"37UYO2ZQMP7W","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"37UYO2ZQMP7WSEZJ","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"37UYO2ZQ","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:b8651c5385d3b2e89a2870674a065d743d60c0febba13f2a28f4bbde0ec69c6d","target":"graph","created_at":"2026-05-18T04:37:21Z","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":"Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing Determinants (NVD) and hence achieve Diversity-Multiplexing Tradeoff (DMT). In addition, these codes have led to optimal distributed space-time codes when applied in cooperative networks under the assumption of perfect synchronization between relays. However, they loose their diversity when delays are introduced and thus are not delay-tolerant. In this paper, using","authors_text":"Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore, Mireille Sarkiss, Mohamed Oussama Damen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-01T23:56:27Z","title":"Construction of New Delay-Tolerant Space-Time Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0474","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:f578a578235d69779cc5bf3a96479532359ebb2cc93536103e54c46dca47580a","target":"record","created_at":"2026-05-18T04:37:21Z","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":"59a80b764a6749431533579ca438a9b0440ffc552bd334cfc64bd029065c7fba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-01T23:56:27Z","title_canon_sha256":"0df758ac29a24b040ac8053372ce25b139240d750f5edfc1fbf46a496b49c38d"},"schema_version":"1.0","source":{"id":"1011.0474","kind":"arxiv","version":1}},"canonical_sha256":"dfe9876b3063ff691329c0dc651a8964160a7d48c7e748a3dfc95a5fc5e78107","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfe9876b3063ff691329c0dc651a8964160a7d48c7e748a3dfc95a5fc5e78107","first_computed_at":"2026-05-18T04:37:21.637107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:37:21.637107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"naRH/tjRKa9aqLrXZS6dLAkBTMYFuXez1jMNTSrCiP/PsD1UMTrf+a2K559+ySyTFwgBkyWPAGEdhGugVLM2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:37:21.637754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f578a578235d69779cc5bf3a96479532359ebb2cc93536103e54c46dca47580a","sha256:b8651c5385d3b2e89a2870674a065d743d60c0febba13f2a28f4bbde0ec69c6d"],"state_sha256":"d3dbe445d3c6bc906961a23d0d93cf22f72d10e7a102c67f4f4035db1471530a"}