{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3PIWDRS6AAZTWZDWLW7VSS6XGC","short_pith_number":"pith:3PIWDRS6","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"},"canonical_sha256":"dbd161c65e00333b64765dbf594bd73082803436d7901d242829c97a803bc19b","source":{"kind":"arxiv","id":"1202.5349","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5349","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5349v2","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5349","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"3PIWDRS6AAZT","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3PIWDRS6AAZTWZDW","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3PIWDRS6","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3PIWDRS6AAZTWZDWLW7VSS6XGC","target":"record","payload":{"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"},"canonical_sha256":"dbd161c65e00333b64765dbf594bd73082803436d7901d242829c97a803bc19b","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"},"source_kind":"arxiv","source_id":"1202.5349","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-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gorTQ41wm0eJiGlLbCXkAQO9FctexHqCaE7VO4nXWj3EWdt6Fm043jkGzYVtOxeO627vxSEmktduAu+86mkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:42:54.650658Z"},"content_sha256":"edb19e444d400b57fbb8f73da6da933b1c5bf926c63c25bd390ba7e27a062f45","schema_version":"1.0","event_id":"sha256:edb19e444d400b57fbb8f73da6da933b1c5bf926c63c25bd390ba7e27a062f45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3PIWDRS6AAZTWZDWLW7VSS6XGC","target":"graph","payload":{"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"},"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:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86iMAmQu7Of6sQ8h/zfyj4Z5ndxxGwPAQiwLUWjbxP1iO3oxUmNS+EIn/yMIIX3JegwVnvoKEVlPE/9wdUv1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:42:54.651077Z"},"content_sha256":"461811c40879738deb54c18bf0dd556a7abeb8c88f74e4ae327e981681218c21","schema_version":"1.0","event_id":"sha256:461811c40879738deb54c18bf0dd556a7abeb8c88f74e4ae327e981681218c21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/bundle.json","state_url":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/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-26T15:42:54Z","links":{"resolver":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC","bundle":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/bundle.json","state":"https://pith.science/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PIWDRS6AAZTWZDWLW7VSS6XGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3PIWDRS6AAZTWZDWLW7VSS6XGC","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":"01e71a38451cdaf630b6b9cc26c89f647eff3fad7fa81ae51dbac02cc37df8f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T00:22:16Z","title_canon_sha256":"ea71e3dc6d732fd9b1d7aa10b1e1c767f0912bb4d8613b477e1c0c961ef2c343"},"schema_version":"1.0","source":{"id":"1202.5349","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5349","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5349v2","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5349","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"3PIWDRS6AAZT","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3PIWDRS6AAZTWZDW","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3PIWDRS6","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:461811c40879738deb54c18bf0dd556a7abeb8c88f74e4ae327e981681218c21","target":"graph","created_at":"2026-05-18T02:21:17Z","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 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","authors_text":"Nikola Zlatanov, Petar Popovski, Robert Schober","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T00:22:16Z","title":"Buffer-Aided Relaying with Adaptive Link Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5349","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:edb19e444d400b57fbb8f73da6da933b1c5bf926c63c25bd390ba7e27a062f45","target":"record","created_at":"2026-05-18T02:21:17Z","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":"01e71a38451cdaf630b6b9cc26c89f647eff3fad7fa81ae51dbac02cc37df8f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T00:22:16Z","title_canon_sha256":"ea71e3dc6d732fd9b1d7aa10b1e1c767f0912bb4d8613b477e1c0c961ef2c343"},"schema_version":"1.0","source":{"id":"1202.5349","kind":"arxiv","version":2}},"canonical_sha256":"dbd161c65e00333b64765dbf594bd73082803436d7901d242829c97a803bc19b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbd161c65e00333b64765dbf594bd73082803436d7901d242829c97a803bc19b","first_computed_at":"2026-05-18T02:21:17.590374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.590374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lrLqvMSBOxe3az6nLe1V8FD0DYMHD89Nnv0cS151RQXVtr8i0deVMauiogMtpd/2RbvIRpvreEgzg8qEDcuPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.591042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5349","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edb19e444d400b57fbb8f73da6da933b1c5bf926c63c25bd390ba7e27a062f45","sha256:461811c40879738deb54c18bf0dd556a7abeb8c88f74e4ae327e981681218c21"],"state_sha256":"4c74313757cacfde9ba0fd528488d7a2d7939f4039804270737499ddfe8d04d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTBQShqO9gug9Gbta/F8qrB8IPVLGL2Q+dHWzZI0l+9zlOcY5BKu86J4YPtQ3ZS6HGv1JEn/1mt6PJv7pUGmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:42:54.653297Z","bundle_sha256":"3d6bd6ef89eb9dd815206cc7c847d13a44e23106af7178aecfe4c01f4f769f63"}}