{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ON7XF6JHXSQDTYM3H44XDROIWU","short_pith_number":"pith:ON7XF6JH","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"},"canonical_sha256":"737f72f927bca039e19b3f3971c5c8b52f16b4c8cbd08d17d2ea134a1537a812","source":{"kind":"arxiv","id":"1607.06837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06837","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06837v1","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06837","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"ON7XF6JHXSQD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ON7XF6JHXSQDTYM3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ON7XF6JH","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ON7XF6JHXSQDTYM3H44XDROIWU","target":"record","payload":{"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"},"canonical_sha256":"737f72f927bca039e19b3f3971c5c8b52f16b4c8cbd08d17d2ea134a1537a812","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"},"source_kind":"arxiv","source_id":"1607.06837","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcP62ncKmBFc0B+EP/ZhzggJj+ZFBXlOxmEXhwq4O04dAC7EIBo6tOYlc4V+i1Hix9DSPF5TMo5rZyRe/YATBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:14:12.921957Z"},"content_sha256":"7d5a9f0ec31f8570e3b12dbfcba6794f1e3214b29b6a249450326718c7b67f93","schema_version":"1.0","event_id":"sha256:7d5a9f0ec31f8570e3b12dbfcba6794f1e3214b29b6a249450326718c7b67f93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ON7XF6JHXSQDTYM3H44XDROIWU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYpuKggrsp8Hwn4omwdW6egqSMriJojhoPlJJsxwRqOVM+MWAns89wO6o6tQ5UDCKreTTTSYOeJ5XlojHDssAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:14:12.922564Z"},"content_sha256":"6d666944c60acae3e20027f8fddad0a15042b4abc9f9facfb2d8701b2ea3e878","schema_version":"1.0","event_id":"sha256:6d666944c60acae3e20027f8fddad0a15042b4abc9f9facfb2d8701b2ea3e878"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/bundle.json","state_url":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ON7XF6JHXSQDTYM3H44XDROIWU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T07:14:12Z","links":{"resolver":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU","bundle":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/bundle.json","state":"https://pith.science/pith/ON7XF6JHXSQDTYM3H44XDROIWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ON7XF6JHXSQDTYM3H44XDROIWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ON7XF6JHXSQDTYM3H44XDROIWU","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":"f1d177d4b1ef9a52a757bca4d1bacd649574006e74037dbd15d62afa5ec612c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-22T20:44:59Z","title_canon_sha256":"d84a58af10546f6228e04731731a83c6c30d2a851e62385b9635d86c854d9c1e"},"schema_version":"1.0","source":{"id":"1607.06837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06837","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06837v1","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06837","created_at":"2026-05-18T01:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"ON7XF6JHXSQD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ON7XF6JHXSQDTYM3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ON7XF6JH","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:6d666944c60acae3e20027f8fddad0a15042b4abc9f9facfb2d8701b2ea3e878","target":"graph","created_at":"2026-05-18T01:10:35Z","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":"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","authors_text":"Benjamin Lindqvist, Giuseppe Durisi, Marco Dalai, Rahul Devassy, Wei Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-22T20:44:59Z","title":"Nonasymptotic coding-rate bounds for binary erasure channels with feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06837","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:7d5a9f0ec31f8570e3b12dbfcba6794f1e3214b29b6a249450326718c7b67f93","target":"record","created_at":"2026-05-18T01:10:35Z","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":"f1d177d4b1ef9a52a757bca4d1bacd649574006e74037dbd15d62afa5ec612c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-22T20:44:59Z","title_canon_sha256":"d84a58af10546f6228e04731731a83c6c30d2a851e62385b9635d86c854d9c1e"},"schema_version":"1.0","source":{"id":"1607.06837","kind":"arxiv","version":1}},"canonical_sha256":"737f72f927bca039e19b3f3971c5c8b52f16b4c8cbd08d17d2ea134a1537a812","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"737f72f927bca039e19b3f3971c5c8b52f16b4c8cbd08d17d2ea134a1537a812","first_computed_at":"2026-05-18T01:10:35.650235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:35.650235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gxat4e+z47TNo3GzmWffjHNozcC86TU0JCzpLMmh48YX5QoW3YgN2WyRrw2lZMYk2lJV3vkNiW5kGuiqSzNLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:35.650790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d5a9f0ec31f8570e3b12dbfcba6794f1e3214b29b6a249450326718c7b67f93","sha256:6d666944c60acae3e20027f8fddad0a15042b4abc9f9facfb2d8701b2ea3e878"],"state_sha256":"95aee842d89fd824723f2141f4237c360cae7e771df55cda4ec667e49280c0d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAOrrefcvqabxkT9gZMN5vgU7McKKJ0TtDxM/38AUC9ijgd8VwwZkqeBKK3mXqr/pchdRzp0eTw+ofVbdbkzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T07:14:12.925842Z","bundle_sha256":"3eb448342059c9c206e77bf44d59a4c152023650a0e0296716943638640ea84b"}}