{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:CLLLQIH63EPHDE7AWRLBZTXALL","short_pith_number":"pith:CLLLQIH6","schema_version":"1.0","canonical_sha256":"12d6b820fed91e7193e0b4561ccee05ae590110132a69e2c8cc5bf68d000d32f","source":{"kind":"arxiv","id":"cs/0610106","version":1},"attestation_state":"computed","paper":{"title":"On the Error Exponents of ARQ Channels with Deadlines","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hesham El Gamal, Praveen Kumar Gopala, Young-Han Nam","submitted_at":"2006-10-18T04:31:03Z","abstract_excerpt":"We consider communication over Automatic Repeat reQuest (ARQ) memoryless channels with deadlines. In particular, an upper bound L is imposed on the maximum number of ARQ transmission rounds. In this setup, it is shown that incremental redundancy ARQ outperforms Forney's memoryless decoding in terms of the achievable error exponents."},"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":"cs/0610106","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-10-18T04:31:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"72d4d1f1d5d19c637ee82d3a885700981685cf70d67c7488d278392010ef2fdf","abstract_canon_sha256":"1a790ab0498a0f9f42259d7d10c49893031c41cf9522570983e68762fa8846a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:05.112748Z","signature_b64":"NVRuwt2G4ZDpiYU3SASx5fsQG/riTZUgKJb8oTWbo+YC+x3ISY8MbZeEEUgyHdtijV76A5diCYLbkAZIllxOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12d6b820fed91e7193e0b4561ccee05ae590110132a69e2c8cc5bf68d000d32f","last_reissued_at":"2026-05-18T00:58:05.112405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:05.112405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Error Exponents of ARQ Channels with Deadlines","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hesham El Gamal, Praveen Kumar Gopala, Young-Han Nam","submitted_at":"2006-10-18T04:31:03Z","abstract_excerpt":"We consider communication over Automatic Repeat reQuest (ARQ) memoryless channels with deadlines. In particular, an upper bound L is imposed on the maximum number of ARQ transmission rounds. In this setup, it is shown that incremental redundancy ARQ outperforms Forney's memoryless decoding in terms of the achievable error exponents."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610106","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":"cs/0610106","created_at":"2026-05-18T00:58:05.112460+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0610106v1","created_at":"2026-05-18T00:58:05.112460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610106","created_at":"2026-05-18T00:58:05.112460+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLLLQIH63EPH","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLLLQIH63EPHDE7A","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLLLQIH6","created_at":"2026-05-18T12:25:53.939244+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/CLLLQIH63EPHDE7AWRLBZTXALL","json":"https://pith.science/pith/CLLLQIH63EPHDE7AWRLBZTXALL.json","graph_json":"https://pith.science/api/pith-number/CLLLQIH63EPHDE7AWRLBZTXALL/graph.json","events_json":"https://pith.science/api/pith-number/CLLLQIH63EPHDE7AWRLBZTXALL/events.json","paper":"https://pith.science/paper/CLLLQIH6"},"agent_actions":{"view_html":"https://pith.science/pith/CLLLQIH63EPHDE7AWRLBZTXALL","download_json":"https://pith.science/pith/CLLLQIH63EPHDE7AWRLBZTXALL.json","view_paper":"https://pith.science/paper/CLLLQIH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0610106&json=true","fetch_graph":"https://pith.science/api/pith-number/CLLLQIH63EPHDE7AWRLBZTXALL/graph.json","fetch_events":"https://pith.science/api/pith-number/CLLLQIH63EPHDE7AWRLBZTXALL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLLLQIH63EPHDE7AWRLBZTXALL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLLLQIH63EPHDE7AWRLBZTXALL/action/storage_attestation","attest_author":"https://pith.science/pith/CLLLQIH63EPHDE7AWRLBZTXALL/action/author_attestation","sign_citation":"https://pith.science/pith/CLLLQIH63EPHDE7AWRLBZTXALL/action/citation_signature","submit_replication":"https://pith.science/pith/CLLLQIH63EPHDE7AWRLBZTXALL/action/replication_record"}},"created_at":"2026-05-18T00:58:05.112460+00:00","updated_at":"2026-05-18T00:58:05.112460+00:00"}