{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RA3YPYVK7KWZT2S4PMCVCXFYFE","short_pith_number":"pith:RA3YPYVK","schema_version":"1.0","canonical_sha256":"883787e2aafaad99ea5c7b05515cb829143ec4b6e9039f0e1569efbb2ea33ebf","source":{"kind":"arxiv","id":"1610.00058","version":1},"attestation_state":"computed","paper":{"title":"Review of Buffer-Aided Distributed Space-Time Coding Schemes and Algorithms for Cooperative Wireless Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J. Gu, R. C. de Lamare","submitted_at":"2016-09-30T23:47:27Z","abstract_excerpt":"In this work, we propose buffer-aided distributed space-time coding (DSTC) schemes and relay selection algorithms for cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We first devise a relay pair selection algorithm that can form relay pairs and then select the optimum set of relays among both the source-relay phase and the relay-destination phase according to the signal-to-interference-plus-noise ratio (SINR) criterion. Multiple relays equipped with dynamic buffers are then introduced in the network, which allows the relays to store data received from the sources a"},"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":"1610.00058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-30T23:47:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7585882431434372a11f68a8c5d676ab8e0e2ffee66c23a86f96c3db3a6ad45c","abstract_canon_sha256":"9c5d85d58a8e985885ab7f09895f2534840fbea7ed83912dd81882eb3edc289c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:31.999260Z","signature_b64":"i7FKRAlKDuQAj414rYN18DPmhAa9bcNwURm1HCui35QkqJHDOW5j9uB0k6HGXS18Mzuk8qEQ/9NwikA3GhaEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"883787e2aafaad99ea5c7b05515cb829143ec4b6e9039f0e1569efbb2ea33ebf","last_reissued_at":"2026-05-18T01:03:31.998733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:31.998733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Review of Buffer-Aided Distributed Space-Time Coding Schemes and Algorithms for Cooperative Wireless Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J. Gu, R. C. de Lamare","submitted_at":"2016-09-30T23:47:27Z","abstract_excerpt":"In this work, we propose buffer-aided distributed space-time coding (DSTC) schemes and relay selection algorithms for cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We first devise a relay pair selection algorithm that can form relay pairs and then select the optimum set of relays among both the source-relay phase and the relay-destination phase according to the signal-to-interference-plus-noise ratio (SINR) criterion. Multiple relays equipped with dynamic buffers are then introduced in the network, which allows the relays to store data received from the sources a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00058","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":"1610.00058","created_at":"2026-05-18T01:03:31.998807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00058v1","created_at":"2026-05-18T01:03:31.998807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00058","created_at":"2026-05-18T01:03:31.998807+00:00"},{"alias_kind":"pith_short_12","alias_value":"RA3YPYVK7KWZ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RA3YPYVK7KWZT2S4","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RA3YPYVK","created_at":"2026-05-18T12:30:41.710351+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/RA3YPYVK7KWZT2S4PMCVCXFYFE","json":"https://pith.science/pith/RA3YPYVK7KWZT2S4PMCVCXFYFE.json","graph_json":"https://pith.science/api/pith-number/RA3YPYVK7KWZT2S4PMCVCXFYFE/graph.json","events_json":"https://pith.science/api/pith-number/RA3YPYVK7KWZT2S4PMCVCXFYFE/events.json","paper":"https://pith.science/paper/RA3YPYVK"},"agent_actions":{"view_html":"https://pith.science/pith/RA3YPYVK7KWZT2S4PMCVCXFYFE","download_json":"https://pith.science/pith/RA3YPYVK7KWZT2S4PMCVCXFYFE.json","view_paper":"https://pith.science/paper/RA3YPYVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00058&json=true","fetch_graph":"https://pith.science/api/pith-number/RA3YPYVK7KWZT2S4PMCVCXFYFE/graph.json","fetch_events":"https://pith.science/api/pith-number/RA3YPYVK7KWZT2S4PMCVCXFYFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RA3YPYVK7KWZT2S4PMCVCXFYFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RA3YPYVK7KWZT2S4PMCVCXFYFE/action/storage_attestation","attest_author":"https://pith.science/pith/RA3YPYVK7KWZT2S4PMCVCXFYFE/action/author_attestation","sign_citation":"https://pith.science/pith/RA3YPYVK7KWZT2S4PMCVCXFYFE/action/citation_signature","submit_replication":"https://pith.science/pith/RA3YPYVK7KWZT2S4PMCVCXFYFE/action/replication_record"}},"created_at":"2026-05-18T01:03:31.998807+00:00","updated_at":"2026-05-18T01:03:31.998807+00:00"}