{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:DLML6AGVEZUSPX5MO6C7LHG7EJ","short_pith_number":"pith:DLML6AGV","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"},"canonical_sha256":"1ad8bf00d5266927dfac7785f59cdf225dfc3dc4479da38082e89d6cdfd9bd04","source":{"kind":"arxiv","id":"0812.1203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.1203","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0812.1203v2","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1203","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"DLML6AGVEZUS","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"DLML6AGVEZUSPX5M","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"DLML6AGV","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:DLML6AGVEZUSPX5MO6C7LHG7EJ","target":"record","payload":{"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"},"canonical_sha256":"1ad8bf00d5266927dfac7785f59cdf225dfc3dc4479da38082e89d6cdfd9bd04","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"},"source_kind":"arxiv","source_id":"0812.1203","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2PkVWpWgbkVzdTeLUf7crqD4h0N07oRA7HFqjTXFOhvh/gWRkdU3aWSc8EomkjnDd9x3uV8PHN7mFZvsX7nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:48:46.702469Z"},"content_sha256":"4d140b38d5041f31006ed1542885d7381e2a9e036d5b180a8407cd80e4636dc8","schema_version":"1.0","event_id":"sha256:4d140b38d5041f31006ed1542885d7381e2a9e036d5b180a8407cd80e4636dc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:DLML6AGVEZUSPX5MO6C7LHG7EJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdYOAVocgCBNPhho6y2wEkLdHMhemqSMXmiF3SEygPif2cqzU0ZdisEcmVQG029bxMigj4FYCN/bc8Q4Izk8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:48:46.703186Z"},"content_sha256":"a4d04bf6bcf7db32725ee474ed2bc4a1df388d09464808cc8b4f174ebbdbd511","schema_version":"1.0","event_id":"sha256:a4d04bf6bcf7db32725ee474ed2bc4a1df388d09464808cc8b4f174ebbdbd511"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/bundle.json","state_url":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T19:48:46Z","links":{"resolver":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ","bundle":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/bundle.json","state":"https://pith.science/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLML6AGVEZUSPX5MO6C7LHG7EJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:DLML6AGVEZUSPX5MO6C7LHG7EJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2eeef97e6a502b935e9a053ec7e4d3938efc726d83573cbdf4ff291f8f67b2f5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-05T19:34:03Z","title_canon_sha256":"ed4b9f85ff2a7f20be7a90aea40c136225e3f3771008639e1f58043f7c098923"},"schema_version":"1.0","source":{"id":"0812.1203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.1203","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0812.1203v2","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1203","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"DLML6AGVEZUS","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"DLML6AGVEZUSPX5M","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"DLML6AGV","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:a4d04bf6bcf7db32725ee474ed2bc4a1df388d09464808cc8b4f174ebbdbd511","target":"graph","created_at":"2026-05-18T00:57:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amir K. Khandani, Hossein Bagheri, Jamshid Abouei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-05T19:34:03Z","title":"An Efficient Adaptive Distributed Space-Time Coding Scheme for Cooperative Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.1203","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4d140b38d5041f31006ed1542885d7381e2a9e036d5b180a8407cd80e4636dc8","target":"record","created_at":"2026-05-18T00:57:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2eeef97e6a502b935e9a053ec7e4d3938efc726d83573cbdf4ff291f8f67b2f5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-12-05T19:34:03Z","title_canon_sha256":"ed4b9f85ff2a7f20be7a90aea40c136225e3f3771008639e1f58043f7c098923"},"schema_version":"1.0","source":{"id":"0812.1203","kind":"arxiv","version":2}},"canonical_sha256":"1ad8bf00d5266927dfac7785f59cdf225dfc3dc4479da38082e89d6cdfd9bd04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ad8bf00d5266927dfac7785f59cdf225dfc3dc4479da38082e89d6cdfd9bd04","first_computed_at":"2026-05-18T00:57:58.379595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.379595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mtOkQfxNrMEeFRn9c/7U2BWPgRIANx599IfBy0/ew7QqtQBAIw5rnz47kKD3DoHk7saOxRwQiuv2bqvQYVFKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.380387Z","signed_message":"canonical_sha256_bytes"},"source_id":"0812.1203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d140b38d5041f31006ed1542885d7381e2a9e036d5b180a8407cd80e4636dc8","sha256:a4d04bf6bcf7db32725ee474ed2bc4a1df388d09464808cc8b4f174ebbdbd511"],"state_sha256":"d638e20947e15521e5845ea8bd6529d044f88d0eedad99a2042e126a8f1d3547"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gb7vyMqmDNxvyg/aL1SNzBVgnmQgUu3+DBxyy8BVKaRNdeYpdPz/uXQZmd4eISP3OAXifSpWlAFyH3YN/lcTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:48:46.707078Z","bundle_sha256":"4bba968c988052a57c7d54d273b157b56da56891fe3d661e2d02a500400192de"}}