{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:37UYO2ZQMP7WSEZJYDOGKGUJMQ","short_pith_number":"pith:37UYO2ZQ","schema_version":"1.0","canonical_sha256":"dfe9876b3063ff691329c0dc651a8964160a7d48c7e748a3dfc95a5fc5e78107","source":{"kind":"arxiv","id":"1011.0474","version":1},"attestation_state":"computed","paper":{"title":"Construction of New Delay-Tolerant Space-Time Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore, Mireille Sarkiss, Mohamed Oussama Damen","submitted_at":"2010-11-01T23:56:27Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1011.0474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-01T23:56:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0df758ac29a24b040ac8053372ce25b139240d750f5edfc1fbf46a496b49c38d","abstract_canon_sha256":"59a80b764a6749431533579ca438a9b0440ffc552bd334cfc64bd029065c7fba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:21.637754Z","signature_b64":"naRH/tjRKa9aqLrXZS6dLAkBTMYFuXez1jMNTSrCiP/PsD1UMTrf+a2K559+ySyTFwgBkyWPAGEdhGugVLM2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfe9876b3063ff691329c0dc651a8964160a7d48c7e748a3dfc95a5fc5e78107","last_reissued_at":"2026-05-18T04:37:21.637107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:21.637107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of New Delay-Tolerant Space-Time Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore, Mireille Sarkiss, Mohamed Oussama Damen","submitted_at":"2010-11-01T23:56:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0474","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.0474","created_at":"2026-05-18T04:37:21.637199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0474v1","created_at":"2026-05-18T04:37:21.637199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0474","created_at":"2026-05-18T04:37:21.637199+00:00"},{"alias_kind":"pith_short_12","alias_value":"37UYO2ZQMP7W","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"37UYO2ZQMP7WSEZJ","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"37UYO2ZQ","created_at":"2026-05-18T12:26:03.138858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ","json":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ.json","graph_json":"https://pith.science/api/pith-number/37UYO2ZQMP7WSEZJYDOGKGUJMQ/graph.json","events_json":"https://pith.science/api/pith-number/37UYO2ZQMP7WSEZJYDOGKGUJMQ/events.json","paper":"https://pith.science/paper/37UYO2ZQ"},"agent_actions":{"view_html":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ","download_json":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ.json","view_paper":"https://pith.science/paper/37UYO2ZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0474&json=true","fetch_graph":"https://pith.science/api/pith-number/37UYO2ZQMP7WSEZJYDOGKGUJMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/37UYO2ZQMP7WSEZJYDOGKGUJMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ/action/storage_attestation","attest_author":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ/action/author_attestation","sign_citation":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ/action/citation_signature","submit_replication":"https://pith.science/pith/37UYO2ZQMP7WSEZJYDOGKGUJMQ/action/replication_record"}},"created_at":"2026-05-18T04:37:21.637199+00:00","updated_at":"2026-05-18T04:37:21.637199+00:00"}