{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:DLML6AGVEZUSPX5MO6C7LHG7EJ","short_pith_number":"pith:DLML6AGV","schema_version":"1.0","canonical_sha256":"1ad8bf00d5266927dfac7785f59cdf225dfc3dc4479da38082e89d6cdfd9bd04","source":{"kind":"arxiv","id":"0812.1203","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Adaptive Distributed Space-Time Coding Scheme for Cooperative Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani, Hossein Bagheri, Jamshid Abouei","submitted_at":"2008-12-05T19:34:03Z","abstract_excerpt":"A non-regenerative dual-hop wireless system based on a distributed space-time coding strategy is considered. It is assumed that each relay retransmits an appropriately scaled space-time coded version of its received signal. The main goal of this paper is to investigate a power allocation strategy in relay stations, which is based on minimizing the outage probability. In the high signal-to-noise ratio regime for the relay-destination link, it is shown that a threshold-based power allocation scheme (i.e., the relay remains silent if its channel gain with the source is less than a prespecified 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":"0812.1203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-05T19:34:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ed4b9f85ff2a7f20be7a90aea40c136225e3f3771008639e1f58043f7c098923","abstract_canon_sha256":"2eeef97e6a502b935e9a053ec7e4d3938efc726d83573cbdf4ff291f8f67b2f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.380387Z","signature_b64":"mtOkQfxNrMEeFRn9c/7U2BWPgRIANx599IfBy0/ew7QqtQBAIw5rnz47kKD3DoHk7saOxRwQiuv2bqvQYVFKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ad8bf00d5266927dfac7785f59cdf225dfc3dc4479da38082e89d6cdfd9bd04","last_reissued_at":"2026-05-18T00:57:58.379595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.379595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Adaptive Distributed Space-Time Coding Scheme for Cooperative Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir K. Khandani, Hossein Bagheri, Jamshid Abouei","submitted_at":"2008-12-05T19:34:03Z","abstract_excerpt":"A non-regenerative dual-hop wireless system based on a distributed space-time coding strategy is considered. It is assumed that each relay retransmits an appropriately scaled space-time coded version of its received signal. The main goal of this paper is to investigate a power allocation strategy in relay stations, which is based on minimizing the outage probability. In the high signal-to-noise ratio regime for the relay-destination link, it is shown that a threshold-based power allocation scheme (i.e., the relay remains silent if its channel gain with the source is less than a prespecified th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.1203","kind":"arxiv","version":2},"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":"0812.1203","created_at":"2026-05-18T00:57:58.379701+00:00"},{"alias_kind":"arxiv_version","alias_value":"0812.1203v2","created_at":"2026-05-18T00:57:58.379701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1203","created_at":"2026-05-18T00:57:58.379701+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLML6AGVEZUS","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLML6AGVEZUSPX5M","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLML6AGV","created_at":"2026-05-18T12:25:57.157939+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/DLML6AGVEZUSPX5MO6C7LHG7EJ","json":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ.json","graph_json":"https://pith.science/api/pith-number/DLML6AGVEZUSPX5MO6C7LHG7EJ/graph.json","events_json":"https://pith.science/api/pith-number/DLML6AGVEZUSPX5MO6C7LHG7EJ/events.json","paper":"https://pith.science/paper/DLML6AGV"},"agent_actions":{"view_html":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ","download_json":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ.json","view_paper":"https://pith.science/paper/DLML6AGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0812.1203&json=true","fetch_graph":"https://pith.science/api/pith-number/DLML6AGVEZUSPX5MO6C7LHG7EJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DLML6AGVEZUSPX5MO6C7LHG7EJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/action/storage_attestation","attest_author":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/action/author_attestation","sign_citation":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/action/citation_signature","submit_replication":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/action/replication_record"}},"created_at":"2026-05-18T00:57:58.379701+00:00","updated_at":"2026-05-18T00:57:58.379701+00:00"}