{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ON7XF6JHXSQDTYM3H44XDROIWU","short_pith_number":"pith:ON7XF6JH","schema_version":"1.0","canonical_sha256":"737f72f927bca039e19b3f3971c5c8b52f16b4c8cbd08d17d2ea134a1537a812","source":{"kind":"arxiv","id":"1607.06837","version":1},"attestation_state":"computed","paper":{"title":"Nonasymptotic coding-rate bounds for binary erasure channels with feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Benjamin Lindqvist, Giuseppe Durisi, Marco Dalai, Rahul Devassy, Wei Yang","submitted_at":"2016-07-22T20:44:59Z","abstract_excerpt":"We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC). For the VLF setup, the achievability bound relies on a scheme that maps each message onto a variable-length Huffman codeword and then repeats each bit of the codeword until it is received correctly. The converse bound is inspired by the meta-converse framework by Polyanskiy, Poor, and Verd\\'u (2010) and reli"},"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":"1607.06837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-22T20:44:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d84a58af10546f6228e04731731a83c6c30d2a851e62385b9635d86c854d9c1e","abstract_canon_sha256":"f1d177d4b1ef9a52a757bca4d1bacd649574006e74037dbd15d62afa5ec612c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:35.650790Z","signature_b64":"Gxat4e+z47TNo3GzmWffjHNozcC86TU0JCzpLMmh48YX5QoW3YgN2WyRrw2lZMYk2lJV3vkNiW5kGuiqSzNLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737f72f927bca039e19b3f3971c5c8b52f16b4c8cbd08d17d2ea134a1537a812","last_reissued_at":"2026-05-18T01:10:35.650235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:35.650235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonasymptotic coding-rate bounds for binary erasure channels with feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Benjamin Lindqvist, Giuseppe Durisi, Marco Dalai, Rahul Devassy, Wei Yang","submitted_at":"2016-07-22T20:44:59Z","abstract_excerpt":"We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC). For the VLF setup, the achievability bound relies on a scheme that maps each message onto a variable-length Huffman codeword and then repeats each bit of the codeword until it is received correctly. The converse bound is inspired by the meta-converse framework by Polyanskiy, Poor, and Verd\\'u (2010) and reli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06837","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":"1607.06837","created_at":"2026-05-18T01:10:35.650329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06837v1","created_at":"2026-05-18T01:10:35.650329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06837","created_at":"2026-05-18T01:10:35.650329+00:00"},{"alias_kind":"pith_short_12","alias_value":"ON7XF6JHXSQD","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ON7XF6JHXSQDTYM3","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ON7XF6JH","created_at":"2026-05-18T12:30:36.002864+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/ON7XF6JHXSQDTYM3H44XDROIWU","json":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU.json","graph_json":"https://pith.science/api/pith-number/ON7XF6JHXSQDTYM3H44XDROIWU/graph.json","events_json":"https://pith.science/api/pith-number/ON7XF6JHXSQDTYM3H44XDROIWU/events.json","paper":"https://pith.science/paper/ON7XF6JH"},"agent_actions":{"view_html":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU","download_json":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU.json","view_paper":"https://pith.science/paper/ON7XF6JH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06837&json=true","fetch_graph":"https://pith.science/api/pith-number/ON7XF6JHXSQDTYM3H44XDROIWU/graph.json","fetch_events":"https://pith.science/api/pith-number/ON7XF6JHXSQDTYM3H44XDROIWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/action/storage_attestation","attest_author":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/action/author_attestation","sign_citation":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/action/citation_signature","submit_replication":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/action/replication_record"}},"created_at":"2026-05-18T01:10:35.650329+00:00","updated_at":"2026-05-18T01:10:35.650329+00:00"}