{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ANWGS2T5GPD7QLK2FVVB65E5IF","short_pith_number":"pith:ANWGS2T5","schema_version":"1.0","canonical_sha256":"036c696a7d33c7f82d5a2d6a1f749d4146dcb0f3cf2d8ca425ca5d8793005558","source":{"kind":"arxiv","id":"1310.3946","version":1},"attestation_state":"computed","paper":{"title":"On Noisy ARQ in Block-Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Behrooz Makki, Thomas Eriksson","submitted_at":"2013-10-15T08:07:54Z","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"},"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":"1310.3946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:07:54Z","cross_cats_sorted":["math.IT","stat.AP"],"title_canon_sha256":"28d6a3e2f866e94215f7b54eee708b56aeaf04fb58c23ae412b6ad66c01ebb17","abstract_canon_sha256":"d5b6beefceb5c57b50693892d4c2c2502ceb6053cfe4db92b5fb0f30c11107dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:25.627902Z","signature_b64":"05dsHJ2Hc3IHLkhaQlekkYL1ZFI+TLjYLGUyuKWpBczbkwCc1yQOz5TeTaaYeHbEPooBNslWoLZFkEIy3B0aAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"036c696a7d33c7f82d5a2d6a1f749d4146dcb0f3cf2d8ca425ca5d8793005558","last_reissued_at":"2026-05-18T03:10:25.627126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:25.627126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Noisy ARQ in Block-Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Behrooz Makki, Thomas Eriksson","submitted_at":"2013-10-15T08:07:54Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3946","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":"1310.3946","created_at":"2026-05-18T03:10:25.627250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3946v1","created_at":"2026-05-18T03:10:25.627250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3946","created_at":"2026-05-18T03:10:25.627250+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANWGS2T5GPD7","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANWGS2T5GPD7QLK2","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANWGS2T5","created_at":"2026-05-18T12:27:38.830355+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/ANWGS2T5GPD7QLK2FVVB65E5IF","json":"https://pith.science/pith/ANWGS2T5GPD7QLK2FVVB65E5IF.json","graph_json":"https://pith.science/api/pith-number/ANWGS2T5GPD7QLK2FVVB65E5IF/graph.json","events_json":"https://pith.science/api/pith-number/ANWGS2T5GPD7QLK2FVVB65E5IF/events.json","paper":"https://pith.science/paper/ANWGS2T5"},"agent_actions":{"view_html":"https://pith.science/pith/ANWGS2T5GPD7QLK2FVVB65E5IF","download_json":"https://pith.science/pith/ANWGS2T5GPD7QLK2FVVB65E5IF.json","view_paper":"https://pith.science/paper/ANWGS2T5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3946&json=true","fetch_graph":"https://pith.science/api/pith-number/ANWGS2T5GPD7QLK2FVVB65E5IF/graph.json","fetch_events":"https://pith.science/api/pith-number/ANWGS2T5GPD7QLK2FVVB65E5IF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANWGS2T5GPD7QLK2FVVB65E5IF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANWGS2T5GPD7QLK2FVVB65E5IF/action/storage_attestation","attest_author":"https://pith.science/pith/ANWGS2T5GPD7QLK2FVVB65E5IF/action/author_attestation","sign_citation":"https://pith.science/pith/ANWGS2T5GPD7QLK2FVVB65E5IF/action/citation_signature","submit_replication":"https://pith.science/pith/ANWGS2T5GPD7QLK2FVVB65E5IF/action/replication_record"}},"created_at":"2026-05-18T03:10:25.627250+00:00","updated_at":"2026-05-18T03:10:25.627250+00:00"}