{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:C7SU36HIWUQPYPA4KE32WQ6MSC","short_pith_number":"pith:C7SU36HI","schema_version":"1.0","canonical_sha256":"17e54df8e8b520fc3c1c5137ab43cc90864c39808d54b5fc432493360da5aff0","source":{"kind":"arxiv","id":"1405.4571","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Delay-Tolerant Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rodrigo C. de Lamare, Tong Peng","submitted_at":"2014-05-19T01:14:59Z","abstract_excerpt":"An adaptive delay-tolerant distributed space-time coding (DSTC) scheme that exploits feedback is proposed for two-hop cooperative MIMO networks. Maximum likelihood (ML) receivers and adjustable code matrices are considered subject to a power constraint with a decode-and-forward (DF) cooperation strategy. In the proposed delay-tolerant DSTC scheme, an adjustable code matrix is employed to transform the space-time coded matrix at the relay nodes. Least-squares (LS) algorithms are developed with reduced computational complexity to adjust the parameters of the codes. Simulation results show that t"},"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":"1405.4571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T01:14:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"745b9c18a36068fc7387d74723444dd0a478c89045ed0e25825d28f583ea4e25","abstract_canon_sha256":"494772fea8d0f3e4aaa73c18297f137b9cb29e4afd54d5b6026414e7b154302a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:35.189022Z","signature_b64":"uNQo17X/qdCiCMQqHD48mfyGYKDV0geHurpBtnCv+Pt3qNQnp3Ie1qtdKU0VVJhIj4X2GhhGf8NVhVYAe2lYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17e54df8e8b520fc3c1c5137ab43cc90864c39808d54b5fc432493360da5aff0","last_reissued_at":"2026-05-18T02:51:35.188537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:35.188537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Delay-Tolerant Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rodrigo C. de Lamare, Tong Peng","submitted_at":"2014-05-19T01:14:59Z","abstract_excerpt":"An adaptive delay-tolerant distributed space-time coding (DSTC) scheme that exploits feedback is proposed for two-hop cooperative MIMO networks. Maximum likelihood (ML) receivers and adjustable code matrices are considered subject to a power constraint with a decode-and-forward (DF) cooperation strategy. In the proposed delay-tolerant DSTC scheme, an adjustable code matrix is employed to transform the space-time coded matrix at the relay nodes. Least-squares (LS) algorithms are developed with reduced computational complexity to adjust the parameters of the codes. Simulation results show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4571","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":"1405.4571","created_at":"2026-05-18T02:51:35.188603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4571v1","created_at":"2026-05-18T02:51:35.188603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4571","created_at":"2026-05-18T02:51:35.188603+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7SU36HIWUQP","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7SU36HIWUQPYPA4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7SU36HI","created_at":"2026-05-18T12:28:22.404517+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/C7SU36HIWUQPYPA4KE32WQ6MSC","json":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC.json","graph_json":"https://pith.science/api/pith-number/C7SU36HIWUQPYPA4KE32WQ6MSC/graph.json","events_json":"https://pith.science/api/pith-number/C7SU36HIWUQPYPA4KE32WQ6MSC/events.json","paper":"https://pith.science/paper/C7SU36HI"},"agent_actions":{"view_html":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC","download_json":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC.json","view_paper":"https://pith.science/paper/C7SU36HI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4571&json=true","fetch_graph":"https://pith.science/api/pith-number/C7SU36HIWUQPYPA4KE32WQ6MSC/graph.json","fetch_events":"https://pith.science/api/pith-number/C7SU36HIWUQPYPA4KE32WQ6MSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/action/storage_attestation","attest_author":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/action/author_attestation","sign_citation":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/action/citation_signature","submit_replication":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/action/replication_record"}},"created_at":"2026-05-18T02:51:35.188603+00:00","updated_at":"2026-05-18T02:51:35.188603+00:00"}