{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:47RNPLOKBGTLHWE4FMLTYZNVYM","short_pith_number":"pith:47RNPLOK","schema_version":"1.0","canonical_sha256":"e7e2d7adca09a6b3d89c2b173c65b5c3101f6f6162ab94ceb5beea71a76bd645","source":{"kind":"arxiv","id":"1811.05148","version":1},"attestation_state":"computed","paper":{"title":"Fast HARQ over Finite Blocklength Codes: A Technique for Low-Latency Reliable Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Makki, Giuseppe Caire, Michele Zorzi, Tommy Svensson","submitted_at":"2018-11-13T07:56:43Z","abstract_excerpt":"This paper studies the performance of delay-constrained hybrid automatic repeat request HARQ protocols. Particularly, we propose a fast HARQ protocol where, to increase the end-to-end throughput, some HARQ feedback signals and successive message decodings are omitted. Considering quasi-static channels and a bursty communication model, we derive closed-form expressions for the message decoding probabilities as well as the throughput, the expected delay and the error probability of the HARQ setups. The analysis is based on recent results on the achievable rates of finite-length codes and shows t"},"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":"1811.05148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T07:56:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd37bc3b734b70d35d2a2a2c7f482aa746f9f136108ed66141d15ee26221d8e7","abstract_canon_sha256":"aea1b576f0297c55eb56cd0772f4039cbc7fdf1b0cd8a8411d078bb2baff0351"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:46.791135Z","signature_b64":"cwnk4qEoUPbDpqO44AMuOi9KKYe4N4CzZcftZl8fcTOI2sUzGKAsLMFlJO72WVWcKylwYrZr7wlg0cPFzhbzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7e2d7adca09a6b3d89c2b173c65b5c3101f6f6162ab94ceb5beea71a76bd645","last_reissued_at":"2026-05-18T00:00:46.790738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:46.790738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast HARQ over Finite Blocklength Codes: A Technique for Low-Latency Reliable Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Makki, Giuseppe Caire, Michele Zorzi, Tommy Svensson","submitted_at":"2018-11-13T07:56:43Z","abstract_excerpt":"This paper studies the performance of delay-constrained hybrid automatic repeat request HARQ protocols. Particularly, we propose a fast HARQ protocol where, to increase the end-to-end throughput, some HARQ feedback signals and successive message decodings are omitted. Considering quasi-static channels and a bursty communication model, we derive closed-form expressions for the message decoding probabilities as well as the throughput, the expected delay and the error probability of the HARQ setups. The analysis is based on recent results on the achievable rates of finite-length codes and shows t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05148","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":"1811.05148","created_at":"2026-05-18T00:00:46.790805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05148v1","created_at":"2026-05-18T00:00:46.790805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05148","created_at":"2026-05-18T00:00:46.790805+00:00"},{"alias_kind":"pith_short_12","alias_value":"47RNPLOKBGTL","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"47RNPLOKBGTLHWE4","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"47RNPLOK","created_at":"2026-05-18T12:32:05.422762+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/47RNPLOKBGTLHWE4FMLTYZNVYM","json":"https://pith.science/pith/47RNPLOKBGTLHWE4FMLTYZNVYM.json","graph_json":"https://pith.science/api/pith-number/47RNPLOKBGTLHWE4FMLTYZNVYM/graph.json","events_json":"https://pith.science/api/pith-number/47RNPLOKBGTLHWE4FMLTYZNVYM/events.json","paper":"https://pith.science/paper/47RNPLOK"},"agent_actions":{"view_html":"https://pith.science/pith/47RNPLOKBGTLHWE4FMLTYZNVYM","download_json":"https://pith.science/pith/47RNPLOKBGTLHWE4FMLTYZNVYM.json","view_paper":"https://pith.science/paper/47RNPLOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05148&json=true","fetch_graph":"https://pith.science/api/pith-number/47RNPLOKBGTLHWE4FMLTYZNVYM/graph.json","fetch_events":"https://pith.science/api/pith-number/47RNPLOKBGTLHWE4FMLTYZNVYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47RNPLOKBGTLHWE4FMLTYZNVYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47RNPLOKBGTLHWE4FMLTYZNVYM/action/storage_attestation","attest_author":"https://pith.science/pith/47RNPLOKBGTLHWE4FMLTYZNVYM/action/author_attestation","sign_citation":"https://pith.science/pith/47RNPLOKBGTLHWE4FMLTYZNVYM/action/citation_signature","submit_replication":"https://pith.science/pith/47RNPLOKBGTLHWE4FMLTYZNVYM/action/replication_record"}},"created_at":"2026-05-18T00:00:46.790805+00:00","updated_at":"2026-05-18T00:00:46.790805+00:00"}