{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SNVHXPSV3AKUWZX7DULI46FRXQ","short_pith_number":"pith:SNVHXPSV","schema_version":"1.0","canonical_sha256":"936a7bbe55d8154b66ff1d168e78b1bc09ef701a872224d32e488028d425089a","source":{"kind":"arxiv","id":"1304.1926","version":1},"attestation_state":"computed","paper":{"title":"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":"A. Schmeink, R. C. de Lamare, T. Peng","submitted_at":"2013-04-06T19:21:48Z","abstract_excerpt":"An adaptive distributed space-time coding (DSTC) scheme is proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receive filters and adjustable code matrices are considered subject to a power constraint with an amplify-and-forward (AF) cooperation strategy. In the proposed adaptive DSTC scheme, an adjustable code matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. The effects of the limited feedback and the feedback errors are assessed. Linear MMSE expressions are devised to compute the parameters of th"},"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":"1304.1926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-06T19:21:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c31a5ccee2ced9c65f0aa748711b7a4ace9c1723377cc3ae74c68eaef5852b9f","abstract_canon_sha256":"fa0e75c1fbdb62b0ced2d476f28e41b74fc95e93fb43e70b37c440b0e7078c1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.437562Z","signature_b64":"FPrJ1usKubc+L2hrpqcdTnpkXne1cb1FI0HHwjeZkfiTe644qsr0GQiXJtcZ56X5OsJVd/YY+USGYC6xqcAvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"936a7bbe55d8154b66ff1d168e78b1bc09ef701a872224d32e488028d425089a","last_reissued_at":"2026-05-18T00:58:17.436788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.436788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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":"A. Schmeink, R. C. de Lamare, T. Peng","submitted_at":"2013-04-06T19:21:48Z","abstract_excerpt":"An adaptive distributed space-time coding (DSTC) scheme is proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receive filters and adjustable code matrices are considered subject to a power constraint with an amplify-and-forward (AF) cooperation strategy. In the proposed adaptive DSTC scheme, an adjustable code matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. The effects of the limited feedback and the feedback errors are assessed. Linear MMSE expressions are devised to compute the parameters of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1926","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":"1304.1926","created_at":"2026-05-18T00:58:17.436916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1926v1","created_at":"2026-05-18T00:58:17.436916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1926","created_at":"2026-05-18T00:58:17.436916+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNVHXPSV3AKU","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNVHXPSV3AKUWZX7","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNVHXPSV","created_at":"2026-05-18T12:27:59.945178+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/SNVHXPSV3AKUWZX7DULI46FRXQ","json":"https://pith.science/pith/SNVHXPSV3AKUWZX7DULI46FRXQ.json","graph_json":"https://pith.science/api/pith-number/SNVHXPSV3AKUWZX7DULI46FRXQ/graph.json","events_json":"https://pith.science/api/pith-number/SNVHXPSV3AKUWZX7DULI46FRXQ/events.json","paper":"https://pith.science/paper/SNVHXPSV"},"agent_actions":{"view_html":"https://pith.science/pith/SNVHXPSV3AKUWZX7DULI46FRXQ","download_json":"https://pith.science/pith/SNVHXPSV3AKUWZX7DULI46FRXQ.json","view_paper":"https://pith.science/paper/SNVHXPSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1926&json=true","fetch_graph":"https://pith.science/api/pith-number/SNVHXPSV3AKUWZX7DULI46FRXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SNVHXPSV3AKUWZX7DULI46FRXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNVHXPSV3AKUWZX7DULI46FRXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNVHXPSV3AKUWZX7DULI46FRXQ/action/storage_attestation","attest_author":"https://pith.science/pith/SNVHXPSV3AKUWZX7DULI46FRXQ/action/author_attestation","sign_citation":"https://pith.science/pith/SNVHXPSV3AKUWZX7DULI46FRXQ/action/citation_signature","submit_replication":"https://pith.science/pith/SNVHXPSV3AKUWZX7DULI46FRXQ/action/replication_record"}},"created_at":"2026-05-18T00:58:17.436916+00:00","updated_at":"2026-05-18T00:58:17.436916+00:00"}