{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WRKPZ22QBXNKEP665JWPL4K2RB","short_pith_number":"pith:WRKPZ22Q","schema_version":"1.0","canonical_sha256":"b454fceb500ddaa23fdeea6cf5f15a8845df4519b5c0f2a20e4778ac2745041a","source":{"kind":"arxiv","id":"1412.4442","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Delay-Tolerant DSTBC in Opportunistic Relaying Cooperative MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. C. de Lamare, T. Peng","submitted_at":"2014-12-15T01:26:57Z","abstract_excerpt":"An adaptive delay-tolerant distributed space-time coding (DSTC) scheme with feedback is proposed for two-hop cooperative multiple-input multiple-output (MIMO) networks using an amplify-and-forward strategy and opportunistic relaying algorithms. Maximum likelihood receivers and adjustable code matrices are considered subject to a power constraint. In the proposed delay-tolerant DSTC scheme, an adjustable code matrix is employed to transform the space-time coded matrices at the relay nodes. Stochastic gradient algorithms are developed with reduced computational complexity to estimate the paramet"},"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":"1412.4442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-15T01:26:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a02f5940823a2ffcc206ed1b3449ea7d88843d82df5d08f74f3d0674af5b5789","abstract_canon_sha256":"134579834d4d2eea906bb929557606f49be4ad2ed63c8a33232b0b5da8c2050d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:19.190766Z","signature_b64":"hdBdJUa/bKtPdAGTAGzW11smCap5YU0zD8w5J27w0YIW/FeZDEAZiSo1tkEclIodAWhz/VOcj/Yx/p1I0SrCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b454fceb500ddaa23fdeea6cf5f15a8845df4519b5c0f2a20e4778ac2745041a","last_reissued_at":"2026-05-18T02:31:19.190168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:19.190168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Delay-Tolerant DSTBC in Opportunistic Relaying Cooperative MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. C. de Lamare, T. Peng","submitted_at":"2014-12-15T01:26:57Z","abstract_excerpt":"An adaptive delay-tolerant distributed space-time coding (DSTC) scheme with feedback is proposed for two-hop cooperative multiple-input multiple-output (MIMO) networks using an amplify-and-forward strategy and opportunistic relaying algorithms. Maximum likelihood receivers and adjustable code matrices are considered subject to a power constraint. In the proposed delay-tolerant DSTC scheme, an adjustable code matrix is employed to transform the space-time coded matrices at the relay nodes. Stochastic gradient algorithms are developed with reduced computational complexity to estimate the paramet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4442","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":"1412.4442","created_at":"2026-05-18T02:31:19.190247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4442v1","created_at":"2026-05-18T02:31:19.190247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4442","created_at":"2026-05-18T02:31:19.190247+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRKPZ22QBXNK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRKPZ22QBXNKEP66","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRKPZ22Q","created_at":"2026-05-18T12:28:54.890064+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/WRKPZ22QBXNKEP665JWPL4K2RB","json":"https://pith.science/pith/WRKPZ22QBXNKEP665JWPL4K2RB.json","graph_json":"https://pith.science/api/pith-number/WRKPZ22QBXNKEP665JWPL4K2RB/graph.json","events_json":"https://pith.science/api/pith-number/WRKPZ22QBXNKEP665JWPL4K2RB/events.json","paper":"https://pith.science/paper/WRKPZ22Q"},"agent_actions":{"view_html":"https://pith.science/pith/WRKPZ22QBXNKEP665JWPL4K2RB","download_json":"https://pith.science/pith/WRKPZ22QBXNKEP665JWPL4K2RB.json","view_paper":"https://pith.science/paper/WRKPZ22Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4442&json=true","fetch_graph":"https://pith.science/api/pith-number/WRKPZ22QBXNKEP665JWPL4K2RB/graph.json","fetch_events":"https://pith.science/api/pith-number/WRKPZ22QBXNKEP665JWPL4K2RB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRKPZ22QBXNKEP665JWPL4K2RB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRKPZ22QBXNKEP665JWPL4K2RB/action/storage_attestation","attest_author":"https://pith.science/pith/WRKPZ22QBXNKEP665JWPL4K2RB/action/author_attestation","sign_citation":"https://pith.science/pith/WRKPZ22QBXNKEP665JWPL4K2RB/action/citation_signature","submit_replication":"https://pith.science/pith/WRKPZ22QBXNKEP665JWPL4K2RB/action/replication_record"}},"created_at":"2026-05-18T02:31:19.190247+00:00","updated_at":"2026-05-18T02:31:19.190247+00:00"}