{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2YUVK6WVOMU7GN72BSCJHO3SLC","short_pith_number":"pith:2YUVK6WV","canonical_record":{"source":{"id":"1506.08487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T02:03:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd798b23923dc2e6d04785ee54482d914ceb7d8c1d927ff3c773201d20e3956b","abstract_canon_sha256":"61efb0539a5a0e54656e8be2f174032d99390d2c1413f578bd5122ea83bcf915"},"schema_version":"1.0"},"canonical_sha256":"d629557ad57329f337fa0c8493bb7258a7d149ba5c4a32a9bde2de40e46f3694","source":{"kind":"arxiv","id":"1506.08487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08487","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08487v2","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08487","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"2YUVK6WVOMU7","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2YUVK6WVOMU7GN72","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2YUVK6WV","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2YUVK6WVOMU7GN72BSCJHO3SLC","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T02:03:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd798b23923dc2e6d04785ee54482d914ceb7d8c1d927ff3c773201d20e3956b","abstract_canon_sha256":"61efb0539a5a0e54656e8be2f174032d99390d2c1413f578bd5122ea83bcf915"},"schema_version":"1.0"},"canonical_sha256":"d629557ad57329f337fa0c8493bb7258a7d149ba5c4a32a9bde2de40e46f3694","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:18.510562Z","signature_b64":"EeXmeWF1FI/P9e8UPsIc+xXSwvE8T2aB68m07dGiJNn2yK1gVaJbpA3qH7xgP/9FsDAznmv3b6XZPJ8Hhh59CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d629557ad57329f337fa0c8493bb7258a7d149ba5c4a32a9bde2de40e46f3694","last_reissued_at":"2026-05-18T01:37:18.509876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:18.509876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08487","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-18T01:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucKtw3snlmUIq6x033FVXHdsh9KTOo5Qpc9r6C6EeiuUsTxLakjc/vZEoygtLK6gGuQINOUiqwaAlEhuoOM3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:54:21.875499Z"},"content_sha256":"269892e2ede366601d55fc41d0e188822d2e659bc540396abed2fab882de96a5","schema_version":"1.0","event_id":"sha256:269892e2ede366601d55fc41d0e188822d2e659bc540396abed2fab882de96a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2YUVK6WVOMU7GN72BSCJHO3SLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study of Buffer-Aided Space-Time Coding for Multiple-Antenna Cooperative Wireless Networks","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":"2015-06-29T02:03:53Z","abstract_excerpt":"In this work we propose an adaptive buffer-aided space-time coding scheme for cooperative wireless networks. A maximum likelihood receiver and adjustable code vectors are considered subject to a power constraint with an amplify-and-forward cooperation strategy. Each multiple-antenna relay is equipped with a buffer and is capable of storing the received symbols before forwarding them to the destination. We also present an adaptive relay selection and optimization algorithm, in which the instantaneous signal to noise ratio in each link is calculated and compared at the destination. An adjustable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08487","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-18T01:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w46p8nXYM1lOdPVwXmA8LC8Vc/48Q27R/2r8if82m1c9+i3EuWXpgzZjNRcxF9SZ130R7Sm/xiPTV8z0VX2HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:54:21.876149Z"},"content_sha256":"0a00eeb41a9b2587baac68959c99c2e5a9476295e7f2aea6a45ffa41240351d6","schema_version":"1.0","event_id":"sha256:0a00eeb41a9b2587baac68959c99c2e5a9476295e7f2aea6a45ffa41240351d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YUVK6WVOMU7GN72BSCJHO3SLC/bundle.json","state_url":"https://pith.science/pith/2YUVK6WVOMU7GN72BSCJHO3SLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YUVK6WVOMU7GN72BSCJHO3SLC/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-25T02:54:21Z","links":{"resolver":"https://pith.science/pith/2YUVK6WVOMU7GN72BSCJHO3SLC","bundle":"https://pith.science/pith/2YUVK6WVOMU7GN72BSCJHO3SLC/bundle.json","state":"https://pith.science/pith/2YUVK6WVOMU7GN72BSCJHO3SLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YUVK6WVOMU7GN72BSCJHO3SLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2YUVK6WVOMU7GN72BSCJHO3SLC","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":"61efb0539a5a0e54656e8be2f174032d99390d2c1413f578bd5122ea83bcf915","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T02:03:53Z","title_canon_sha256":"bd798b23923dc2e6d04785ee54482d914ceb7d8c1d927ff3c773201d20e3956b"},"schema_version":"1.0","source":{"id":"1506.08487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08487","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08487v2","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08487","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"2YUVK6WVOMU7","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2YUVK6WVOMU7GN72","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2YUVK6WV","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:0a00eeb41a9b2587baac68959c99c2e5a9476295e7f2aea6a45ffa41240351d6","target":"graph","created_at":"2026-05-18T01:37:18Z","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":"In this work we propose an adaptive buffer-aided space-time coding scheme for cooperative wireless networks. A maximum likelihood receiver and adjustable code vectors are considered subject to a power constraint with an amplify-and-forward cooperation strategy. Each multiple-antenna relay is equipped with a buffer and is capable of storing the received symbols before forwarding them to the destination. We also present an adaptive relay selection and optimization algorithm, in which the instantaneous signal to noise ratio in each link is calculated and compared at the destination. An adjustable","authors_text":"R. C. de Lamare, T. Peng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T02:03:53Z","title":"Study of Buffer-Aided Space-Time Coding for Multiple-Antenna Cooperative Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08487","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:269892e2ede366601d55fc41d0e188822d2e659bc540396abed2fab882de96a5","target":"record","created_at":"2026-05-18T01:37:18Z","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":"61efb0539a5a0e54656e8be2f174032d99390d2c1413f578bd5122ea83bcf915","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-29T02:03:53Z","title_canon_sha256":"bd798b23923dc2e6d04785ee54482d914ceb7d8c1d927ff3c773201d20e3956b"},"schema_version":"1.0","source":{"id":"1506.08487","kind":"arxiv","version":2}},"canonical_sha256":"d629557ad57329f337fa0c8493bb7258a7d149ba5c4a32a9bde2de40e46f3694","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d629557ad57329f337fa0c8493bb7258a7d149ba5c4a32a9bde2de40e46f3694","first_computed_at":"2026-05-18T01:37:18.509876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:18.509876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EeXmeWF1FI/P9e8UPsIc+xXSwvE8T2aB68m07dGiJNn2yK1gVaJbpA3qH7xgP/9FsDAznmv3b6XZPJ8Hhh59CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:18.510562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:269892e2ede366601d55fc41d0e188822d2e659bc540396abed2fab882de96a5","sha256:0a00eeb41a9b2587baac68959c99c2e5a9476295e7f2aea6a45ffa41240351d6"],"state_sha256":"4281fd2e42cc302aef7a3f39c16417a2d3652ce0bb99d4183ed0c2bad3a48e72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvEvM5f1uHTER1E7L8GL0HDL7sXoWf1U6FJib5F/M2AyvRbe8m5fl+YKp4c/TksUl/HAWrRp4NkZTPr69UnyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:54:21.879977Z","bundle_sha256":"87ff6bb000e8063ee18cf8a9a243cdf32585bb2628bf88539d5166c23ef0430f"}}