{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PP4CIJWVU7VBC3UR6AWD5HEWIY","short_pith_number":"pith:PP4CIJWV","canonical_record":{"source":{"id":"1502.06654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-23T23:46:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f2475ad0c5bbe42ff52d2e2cc0853a711d0b0bd5b3bf04c4f53e7990575dfd1e","abstract_canon_sha256":"8d579bf01e8bf45f66ad7408443d3767bd8074e9d546b806197ad5f5fd4b1c19"},"schema_version":"1.0"},"canonical_sha256":"7bf82426d5a7ea116e91f02c3e9c96460caf4e90f10bff1849c8f0c6a688787a","source":{"kind":"arxiv","id":"1502.06654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06654","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06654v1","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06654","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"pith_short_12","alias_value":"PP4CIJWVU7VB","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PP4CIJWVU7VBC3UR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PP4CIJWV","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PP4CIJWVU7VBC3UR6AWD5HEWIY","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-23T23:46:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f2475ad0c5bbe42ff52d2e2cc0853a711d0b0bd5b3bf04c4f53e7990575dfd1e","abstract_canon_sha256":"8d579bf01e8bf45f66ad7408443d3767bd8074e9d546b806197ad5f5fd4b1c19"},"schema_version":"1.0"},"canonical_sha256":"7bf82426d5a7ea116e91f02c3e9c96460caf4e90f10bff1849c8f0c6a688787a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:29.519943Z","signature_b64":"x0nvX+r3TWe+YqChfsfRQH8cUkvysgoNQIXke49pVjMQ5Z0EJxP2qOK/9N0FdoEWIO6x+RGLZdXEgru+P41SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bf82426d5a7ea116e91f02c3e9c96460caf4e90f10bff1849c8f0c6a688787a","last_reissued_at":"2026-05-18T02:26:29.519133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:29.519133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06654","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-18T02:26:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yo68LZf64vL7H3YLon4/3ONcM/Sw6K4xVlrPoKJmBBeqJVC6ux0oRkLDgQmGOW7M2y5d4slN67uc9PMDk3kXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:11:51.611243Z"},"content_sha256":"0f55ba58d2da78a493d732dd318d33a148a5cad147aa8247bbd0a50f4c5d923c","schema_version":"1.0","event_id":"sha256:0f55ba58d2da78a493d732dd318d33a148a5cad147aa8247bbd0a50f4c5d923c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PP4CIJWVU7VBC3UR6AWD5HEWIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable-Length Feedback Codes under a Strict Delay Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dan Keun Sung, Seong Hwan Kim, Tho Le-Ngoc","submitted_at":"2015-02-23T23:46:15Z","abstract_excerpt":"We study variable-length feedback (VLF) codes under a strict delay constraint to maximize their average transmission rate (ATR) in a discrete memoryless channel (DMC) while considering periodic decoding attempts. We first derive a lower bound on the maximum achievable ATR, and confirm that the VLF code can outperform non-feedback codes with a larger delay constraint. We show that for a given decoding period, as the strict delay constraint, L, increases, the gap between the ATR of the VLF code and the DMC capacity scales at most on the order of O(L^{-1}) instead of O(L^{-1/2}) for non-feedback "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06654","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-18T02:26:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZjceFTWMT7IDau6jEJVI44xcCz7ej5Pa9giDwsoAJi0/KOmfRav19mnPWSiqWGljJr3mjK+fP3r1Rwh8ATSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:11:51.612003Z"},"content_sha256":"b08812aee306422e1b4adbfd4a660e2c90228d78531cc1ec6ce0e199b709342e","schema_version":"1.0","event_id":"sha256:b08812aee306422e1b4adbfd4a660e2c90228d78531cc1ec6ce0e199b709342e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PP4CIJWVU7VBC3UR6AWD5HEWIY/bundle.json","state_url":"https://pith.science/pith/PP4CIJWVU7VBC3UR6AWD5HEWIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PP4CIJWVU7VBC3UR6AWD5HEWIY/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-08T02:11:51Z","links":{"resolver":"https://pith.science/pith/PP4CIJWVU7VBC3UR6AWD5HEWIY","bundle":"https://pith.science/pith/PP4CIJWVU7VBC3UR6AWD5HEWIY/bundle.json","state":"https://pith.science/pith/PP4CIJWVU7VBC3UR6AWD5HEWIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PP4CIJWVU7VBC3UR6AWD5HEWIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PP4CIJWVU7VBC3UR6AWD5HEWIY","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":"8d579bf01e8bf45f66ad7408443d3767bd8074e9d546b806197ad5f5fd4b1c19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-23T23:46:15Z","title_canon_sha256":"f2475ad0c5bbe42ff52d2e2cc0853a711d0b0bd5b3bf04c4f53e7990575dfd1e"},"schema_version":"1.0","source":{"id":"1502.06654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06654","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06654v1","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06654","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"pith_short_12","alias_value":"PP4CIJWVU7VB","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PP4CIJWVU7VBC3UR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PP4CIJWV","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:b08812aee306422e1b4adbfd4a660e2c90228d78531cc1ec6ce0e199b709342e","target":"graph","created_at":"2026-05-18T02:26:29Z","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 study variable-length feedback (VLF) codes under a strict delay constraint to maximize their average transmission rate (ATR) in a discrete memoryless channel (DMC) while considering periodic decoding attempts. We first derive a lower bound on the maximum achievable ATR, and confirm that the VLF code can outperform non-feedback codes with a larger delay constraint. We show that for a given decoding period, as the strict delay constraint, L, increases, the gap between the ATR of the VLF code and the DMC capacity scales at most on the order of O(L^{-1}) instead of O(L^{-1/2}) for non-feedback ","authors_text":"Dan Keun Sung, Seong Hwan Kim, Tho Le-Ngoc","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-23T23:46:15Z","title":"Variable-Length Feedback Codes under a Strict Delay Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06654","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:0f55ba58d2da78a493d732dd318d33a148a5cad147aa8247bbd0a50f4c5d923c","target":"record","created_at":"2026-05-18T02:26:29Z","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":"8d579bf01e8bf45f66ad7408443d3767bd8074e9d546b806197ad5f5fd4b1c19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-23T23:46:15Z","title_canon_sha256":"f2475ad0c5bbe42ff52d2e2cc0853a711d0b0bd5b3bf04c4f53e7990575dfd1e"},"schema_version":"1.0","source":{"id":"1502.06654","kind":"arxiv","version":1}},"canonical_sha256":"7bf82426d5a7ea116e91f02c3e9c96460caf4e90f10bff1849c8f0c6a688787a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bf82426d5a7ea116e91f02c3e9c96460caf4e90f10bff1849c8f0c6a688787a","first_computed_at":"2026-05-18T02:26:29.519133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:29.519133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0nvX+r3TWe+YqChfsfRQH8cUkvysgoNQIXke49pVjMQ5Z0EJxP2qOK/9N0FdoEWIO6x+RGLZdXEgru+P41SBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:29.519943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f55ba58d2da78a493d732dd318d33a148a5cad147aa8247bbd0a50f4c5d923c","sha256:b08812aee306422e1b4adbfd4a660e2c90228d78531cc1ec6ce0e199b709342e"],"state_sha256":"17111cdee32eba607e680f3c2b8a4c000c65722b08924dec5fb9d40a725f6225"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iB6AxrQq2pxyL9tqgsUE5okSu7B9dzzAwGWIqPJOXVREyI/XHh5xW1v8k/XAHq1pcM4/SUpNfackTvaKipsCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:11:51.615890Z","bundle_sha256":"b4dc68710ee4c3b8363445a02f7d6bd830563d2fdb39bacccc6099e5fbb870de"}}