{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3PIWDRS6AAZTWZDWLW7VSS6XGC","short_pith_number":"pith:3PIWDRS6","schema_version":"1.0","canonical_sha256":"dbd161c65e00333b64765dbf594bd73082803436d7901d242829c97a803bc19b","source":{"kind":"arxiv","id":"1202.5349","version":2},"attestation_state":"computed","paper":{"title":"Buffer-Aided Relaying with Adaptive Link Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nikola Zlatanov, Petar Popovski, Robert Schober","submitted_at":"2012-02-24T00:22:16Z","abstract_excerpt":"In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the channel state information of the source-relay and the relay-destination link a decision is made whether the source or the relay transmits. In order to avoid data loss at the relay, adaptive link selection requires the relay to be equipped with a buffer such that data can be queued until the relay-destination link is selected for transmission. We study both d"},"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":"1202.5349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T00:22:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ea71e3dc6d732fd9b1d7aa10b1e1c767f0912bb4d8613b477e1c0c961ef2c343","abstract_canon_sha256":"01e71a38451cdaf630b6b9cc26c89f647eff3fad7fa81ae51dbac02cc37df8f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.591042Z","signature_b64":"lrLqvMSBOxe3az6nLe1V8FD0DYMHD89Nnv0cS151RQXVtr8i0deVMauiogMtpd/2RbvIRpvreEgzg8qEDcuPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbd161c65e00333b64765dbf594bd73082803436d7901d242829c97a803bc19b","last_reissued_at":"2026-05-18T02:21:17.590374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.590374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Buffer-Aided Relaying with Adaptive Link Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nikola Zlatanov, Petar Popovski, Robert Schober","submitted_at":"2012-02-24T00:22:16Z","abstract_excerpt":"In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the channel state information of the source-relay and the relay-destination link a decision is made whether the source or the relay transmits. In order to avoid data loss at the relay, adaptive link selection requires the relay to be equipped with a buffer such that data can be queued until the relay-destination link is selected for transmission. We study both d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5349","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":"1202.5349","created_at":"2026-05-18T02:21:17.590475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5349v2","created_at":"2026-05-18T02:21:17.590475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5349","created_at":"2026-05-18T02:21:17.590475+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PIWDRS6AAZT","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PIWDRS6AAZTWZDW","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PIWDRS6","created_at":"2026-05-18T12:26:53.410803+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/3PIWDRS6AAZTWZDWLW7VSS6XGC","json":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC.json","graph_json":"https://pith.science/api/pith-number/3PIWDRS6AAZTWZDWLW7VSS6XGC/graph.json","events_json":"https://pith.science/api/pith-number/3PIWDRS6AAZTWZDWLW7VSS6XGC/events.json","paper":"https://pith.science/paper/3PIWDRS6"},"agent_actions":{"view_html":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC","download_json":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC.json","view_paper":"https://pith.science/paper/3PIWDRS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5349&json=true","fetch_graph":"https://pith.science/api/pith-number/3PIWDRS6AAZTWZDWLW7VSS6XGC/graph.json","fetch_events":"https://pith.science/api/pith-number/3PIWDRS6AAZTWZDWLW7VSS6XGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/action/storage_attestation","attest_author":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/action/author_attestation","sign_citation":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/action/citation_signature","submit_replication":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/action/replication_record"}},"created_at":"2026-05-18T02:21:17.590475+00:00","updated_at":"2026-05-18T02:21:17.590475+00:00"}