{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C7SU36HIWUQPYPA4KE32WQ6MSC","short_pith_number":"pith:C7SU36HI","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"},"canonical_sha256":"17e54df8e8b520fc3c1c5137ab43cc90864c39808d54b5fc432493360da5aff0","source":{"kind":"arxiv","id":"1405.4571","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4571","created_at":"2026-05-18T02:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4571v1","created_at":"2026-05-18T02:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4571","created_at":"2026-05-18T02:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"C7SU36HIWUQP","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C7SU36HIWUQPYPA4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C7SU36HI","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C7SU36HIWUQPYPA4KE32WQ6MSC","target":"record","payload":{"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"},"canonical_sha256":"17e54df8e8b520fc3c1c5137ab43cc90864c39808d54b5fc432493360da5aff0","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"},"source_kind":"arxiv","source_id":"1405.4571","source_version":1,"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-18T02:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pDLa4qxaC3hueTlSaw9zvttUGFJN5AV2gjqfx60dqid0emyzCDEZ9uQ0u8qEd3uQW4KUrPntpn4+OpV4aaWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:05:09.194119Z"},"content_sha256":"af89b4120786833cc5b734b4526974eea7ba377788392e7933273dc77789149e","schema_version":"1.0","event_id":"sha256:af89b4120786833cc5b734b4526974eea7ba377788392e7933273dc77789149e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C7SU36HIWUQPYPA4KE32WQ6MSC","target":"graph","payload":{"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"},"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-18T02:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YlvJ7aeW+xLIXPtnFak5lElvcMxwJbJUPEAbYnUtzuwk7nEcudmGlcmgyl30D4MBfg1MFhWTICkv0jm8/UPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:05:09.194494Z"},"content_sha256":"71a49fb067931ff8a7805429d26ddddedbdd6ce5122d47ccdf7151f8d7282fa1","schema_version":"1.0","event_id":"sha256:71a49fb067931ff8a7805429d26ddddedbdd6ce5122d47ccdf7151f8d7282fa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/bundle.json","state_url":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/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-06-22T14:05:09Z","links":{"resolver":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC","bundle":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/bundle.json","state":"https://pith.science/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7SU36HIWUQPYPA4KE32WQ6MSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C7SU36HIWUQPYPA4KE32WQ6MSC","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":"494772fea8d0f3e4aaa73c18297f137b9cb29e4afd54d5b6026414e7b154302a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T01:14:59Z","title_canon_sha256":"745b9c18a36068fc7387d74723444dd0a478c89045ed0e25825d28f583ea4e25"},"schema_version":"1.0","source":{"id":"1405.4571","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4571","created_at":"2026-05-18T02:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4571v1","created_at":"2026-05-18T02:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4571","created_at":"2026-05-18T02:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"C7SU36HIWUQP","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C7SU36HIWUQPYPA4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C7SU36HI","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:71a49fb067931ff8a7805429d26ddddedbdd6ce5122d47ccdf7151f8d7282fa1","target":"graph","created_at":"2026-05-18T02:51:35Z","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":"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","authors_text":"Rodrigo C. de Lamare, Tong Peng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T01:14:59Z","title":"Adaptive Delay-Tolerant Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4571","kind":"arxiv","version":1},"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:af89b4120786833cc5b734b4526974eea7ba377788392e7933273dc77789149e","target":"record","created_at":"2026-05-18T02:51:35Z","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":"494772fea8d0f3e4aaa73c18297f137b9cb29e4afd54d5b6026414e7b154302a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-19T01:14:59Z","title_canon_sha256":"745b9c18a36068fc7387d74723444dd0a478c89045ed0e25825d28f583ea4e25"},"schema_version":"1.0","source":{"id":"1405.4571","kind":"arxiv","version":1}},"canonical_sha256":"17e54df8e8b520fc3c1c5137ab43cc90864c39808d54b5fc432493360da5aff0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17e54df8e8b520fc3c1c5137ab43cc90864c39808d54b5fc432493360da5aff0","first_computed_at":"2026-05-18T02:51:35.188537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:35.188537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uNQo17X/qdCiCMQqHD48mfyGYKDV0geHurpBtnCv+Pt3qNQnp3Ie1qtdKU0VVJhIj4X2GhhGf8NVhVYAe2lYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:35.189022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4571","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af89b4120786833cc5b734b4526974eea7ba377788392e7933273dc77789149e","sha256:71a49fb067931ff8a7805429d26ddddedbdd6ce5122d47ccdf7151f8d7282fa1"],"state_sha256":"d71ea975273bcfe18477afd5c7b1470c24fcbbcfdde87d98c0bb35379974f216"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7QhX9Ai6rGV566MmwyF4eKbG5LXjSaw0gvr/loA0vY1eUmvaFqeni98lGUcGaDfwGwtfnioO6MzOzHE3XOpOAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:05:09.196481Z","bundle_sha256":"f0e83f4f30cdaa9691e21e187135cbb678df26ea31ff5d2c0c93d1a7ae1fe2e8"}}