{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:34IFW7VMC7GIXFVBRMWFULIXXC","short_pith_number":"pith:34IFW7VM","canonical_record":{"source":{"id":"1311.0100","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:35:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6b8e99557b6d890a004f6124bf7e74763bcc6cb5f6a83b890565f0820d59d7b1","abstract_canon_sha256":"b1b140e36dc62b4d0ec87210e9161f4d59e69404964b1e455565fb346951c7bb"},"schema_version":"1.0"},"canonical_sha256":"df105b7eac17cc8b96a18b2c5a2d17b8ae6776b65acc78ed9efbfc3e2c4aecc9","source":{"kind":"arxiv","id":"1311.0100","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0100","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0100v4","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0100","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"34IFW7VMC7GI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"34IFW7VMC7GIXFVB","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"34IFW7VM","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:34IFW7VMC7GIXFVBRMWFULIXXC","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0100","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:35:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6b8e99557b6d890a004f6124bf7e74763bcc6cb5f6a83b890565f0820d59d7b1","abstract_canon_sha256":"b1b140e36dc62b4d0ec87210e9161f4d59e69404964b1e455565fb346951c7bb"},"schema_version":"1.0"},"canonical_sha256":"df105b7eac17cc8b96a18b2c5a2d17b8ae6776b65acc78ed9efbfc3e2c4aecc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:13.039934Z","signature_b64":"//g87ys63D0I5mv6C5rz51p2aDIuG+G4CNE3fOCliD5KHmqIxf1t9U0jcYBlodPJDMlDbZ/CPQDPON22DOY0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df105b7eac17cc8b96a18b2c5a2d17b8ae6776b65acc78ed9efbfc3e2c4aecc9","last_reissued_at":"2026-05-18T01:05:13.039231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:13.039231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0100","source_version":4,"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:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1Czw7xM0OjZkVcVqlcUadwaFOc2vOjwkXDuNY5H8gzvrLMnf0Xw6z8QYMVkZCLzapPOs1neHqeoGIYmASsPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:50:25.125582Z"},"content_sha256":"16e413527e19b78b9433fc76678b2c7e975de2e37679192c23c357fefeaf9e20","schema_version":"1.0","event_id":"sha256:16e413527e19b78b9433fc76678b2c7e975de2e37679192c23c357fefeaf9e20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:34IFW7VMC7GIXFVBRMWFULIXXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Feedback Coding Scheme with Low Error Probability for Discrete Memoryless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas El Gamal, Cheuk Ting Li","submitted_at":"2013-11-01T06:35:17Z","abstract_excerpt":"Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are difficult to analyze (posterior matching). This paper introduces a new fixed-length feedback coding scheme which achieves the capacity for all discrete memoryless channels, has an error exponent that approaches the sphere packing bound as the rate approaches the capacity, and has $O(n\\log n)$ coding complexity. These benefits are achieved by judiciously combining fe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0100","kind":"arxiv","version":4},"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:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oESDOeFdxefvi21VhYziu73yL5JTTtPbkVv//HloT3UQVhuN+IZNOQk6w7O3oiqqQsea2QGEspzdtrV6l1QiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:50:25.125933Z"},"content_sha256":"6649dcb3f6f94de153edcdd63d05ce5b481862b04539f1da85466829abffc1ee","schema_version":"1.0","event_id":"sha256:6649dcb3f6f94de153edcdd63d05ce5b481862b04539f1da85466829abffc1ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34IFW7VMC7GIXFVBRMWFULIXXC/bundle.json","state_url":"https://pith.science/pith/34IFW7VMC7GIXFVBRMWFULIXXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34IFW7VMC7GIXFVBRMWFULIXXC/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-02T23:50:25Z","links":{"resolver":"https://pith.science/pith/34IFW7VMC7GIXFVBRMWFULIXXC","bundle":"https://pith.science/pith/34IFW7VMC7GIXFVBRMWFULIXXC/bundle.json","state":"https://pith.science/pith/34IFW7VMC7GIXFVBRMWFULIXXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34IFW7VMC7GIXFVBRMWFULIXXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:34IFW7VMC7GIXFVBRMWFULIXXC","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":"b1b140e36dc62b4d0ec87210e9161f4d59e69404964b1e455565fb346951c7bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:35:17Z","title_canon_sha256":"6b8e99557b6d890a004f6124bf7e74763bcc6cb5f6a83b890565f0820d59d7b1"},"schema_version":"1.0","source":{"id":"1311.0100","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0100","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0100v4","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0100","created_at":"2026-05-18T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"34IFW7VMC7GI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"34IFW7VMC7GIXFVB","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"34IFW7VM","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:6649dcb3f6f94de153edcdd63d05ce5b481862b04539f1da85466829abffc1ee","target":"graph","created_at":"2026-05-18T01:05:13Z","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":"Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are difficult to analyze (posterior matching). This paper introduces a new fixed-length feedback coding scheme which achieves the capacity for all discrete memoryless channels, has an error exponent that approaches the sphere packing bound as the rate approaches the capacity, and has $O(n\\log n)$ coding complexity. These benefits are achieved by judiciously combining fe","authors_text":"Abbas El Gamal, Cheuk Ting Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:35:17Z","title":"An Efficient Feedback Coding Scheme with Low Error Probability for Discrete Memoryless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0100","kind":"arxiv","version":4},"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:16e413527e19b78b9433fc76678b2c7e975de2e37679192c23c357fefeaf9e20","target":"record","created_at":"2026-05-18T01:05:13Z","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":"b1b140e36dc62b4d0ec87210e9161f4d59e69404964b1e455565fb346951c7bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:35:17Z","title_canon_sha256":"6b8e99557b6d890a004f6124bf7e74763bcc6cb5f6a83b890565f0820d59d7b1"},"schema_version":"1.0","source":{"id":"1311.0100","kind":"arxiv","version":4}},"canonical_sha256":"df105b7eac17cc8b96a18b2c5a2d17b8ae6776b65acc78ed9efbfc3e2c4aecc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df105b7eac17cc8b96a18b2c5a2d17b8ae6776b65acc78ed9efbfc3e2c4aecc9","first_computed_at":"2026-05-18T01:05:13.039231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:13.039231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"//g87ys63D0I5mv6C5rz51p2aDIuG+G4CNE3fOCliD5KHmqIxf1t9U0jcYBlodPJDMlDbZ/CPQDPON22DOY0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:13.039934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0100","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e413527e19b78b9433fc76678b2c7e975de2e37679192c23c357fefeaf9e20","sha256:6649dcb3f6f94de153edcdd63d05ce5b481862b04539f1da85466829abffc1ee"],"state_sha256":"2af9fae401e0dad2326f6212f7a8aaa7d9b733b914700fcedaba875b5a4f84ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8KtQ0R/Rjl6G3hNlspY054iulTgCQ4BTikOYzRLCsfXPaisV2Op84uxBXMH3X5BF3KkGgyTuFAr2ayFRLovBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:50:25.127982Z","bundle_sha256":"e74728415eb5ceed8b85ed1f8247706a050ba338c0a2c80a01eefb059db7c621"}}