{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ANWGS2T5GPD7QLK2FVVB65E5IF","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":"d5b6beefceb5c57b50693892d4c2c2502ceb6053cfe4db92b5fb0f30c11107dd","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:07:54Z","title_canon_sha256":"28d6a3e2f866e94215f7b54eee708b56aeaf04fb58c23ae412b6ad66c01ebb17"},"schema_version":"1.0","source":{"id":"1310.3946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3946","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3946v1","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3946","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"ANWGS2T5GPD7","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ANWGS2T5GPD7QLK2","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ANWGS2T5","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:68a1555f70e704933b59f457fdda3493d7fe4efe1aa43b5a057e18cdf822b08d","target":"graph","created_at":"2026-05-18T03:10:25Z","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":"Assuming noisy feedback channels, this paper investigates the data transmission efficiency and robustness of different automatic repeat request (ARQ) schemes using adaptive power allocation. Considering different block-fading channel assumptions, the long-term throughput, the delay-limited throughput, the outage probability and the feedback load of different ARQ protocols are studied. A closed-form expression for the power-limited throughput optimization problem is obtained which is valid for different ARQ protocols and feedback channel conditions. Furthermore, the paper presents numerical inv","authors_text":"Alexandre Graell i Amat, Behrooz Makki, Thomas Eriksson","cross_cats":["math.IT","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:07:54Z","title":"On Noisy ARQ in Block-Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3946","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:89172c768b4ff848171fe9fe37599c48df317a6ca5dded13047a8da3f7caabb9","target":"record","created_at":"2026-05-18T03:10:25Z","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":"d5b6beefceb5c57b50693892d4c2c2502ceb6053cfe4db92b5fb0f30c11107dd","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:07:54Z","title_canon_sha256":"28d6a3e2f866e94215f7b54eee708b56aeaf04fb58c23ae412b6ad66c01ebb17"},"schema_version":"1.0","source":{"id":"1310.3946","kind":"arxiv","version":1}},"canonical_sha256":"036c696a7d33c7f82d5a2d6a1f749d4146dcb0f3cf2d8ca425ca5d8793005558","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"036c696a7d33c7f82d5a2d6a1f749d4146dcb0f3cf2d8ca425ca5d8793005558","first_computed_at":"2026-05-18T03:10:25.627126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:25.627126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"05dsHJ2Hc3IHLkhaQlekkYL1ZFI+TLjYLGUyuKWpBczbkwCc1yQOz5TeTaaYeHbEPooBNslWoLZFkEIy3B0aAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:25.627902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89172c768b4ff848171fe9fe37599c48df317a6ca5dded13047a8da3f7caabb9","sha256:68a1555f70e704933b59f457fdda3493d7fe4efe1aa43b5a057e18cdf822b08d"],"state_sha256":"bdd69d368f20faad838dd970a18ea10e5d3682d7a54a878782e597f5f4a9efed"}