{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DC4RWD6EPUXU4TCKPZU2SESGFG","short_pith_number":"pith:DC4RWD6E","canonical_record":{"source":{"id":"1309.0141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-31T18:02:46Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"f44bfe967ad988b8bb2fc5ffcc1c254c0c4b1451e35c75ad0595e566ac1889c9","abstract_canon_sha256":"a89f8eac8b6aca2148f0b8d0913651dbf1ada10ebd8c5574a26ae59fe2d3075c"},"schema_version":"1.0"},"canonical_sha256":"18b91b0fc47d2f4e4c4a7e69a9124629ab323bf6040797c95f5697d0066ec446","source":{"kind":"arxiv","id":"1309.0141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0141","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0141v1","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0141","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"DC4RWD6EPUXU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DC4RWD6EPUXU4TCK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DC4RWD6E","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DC4RWD6EPUXU4TCKPZU2SESGFG","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-31T18:02:46Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"f44bfe967ad988b8bb2fc5ffcc1c254c0c4b1451e35c75ad0595e566ac1889c9","abstract_canon_sha256":"a89f8eac8b6aca2148f0b8d0913651dbf1ada10ebd8c5574a26ae59fe2d3075c"},"schema_version":"1.0"},"canonical_sha256":"18b91b0fc47d2f4e4c4a7e69a9124629ab323bf6040797c95f5697d0066ec446","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:28.741790Z","signature_b64":"frmGiEoy6XKeOIcxQkLGm4E/phLr+lnnQ7cNrq8CzAmzEF7zLZ2pmF4reQ3KbVTatLO11lM49K4OST8AIBVYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18b91b0fc47d2f4e4c4a7e69a9124629ab323bf6040797c95f5697d0066ec446","last_reissued_at":"2026-05-18T03:14:28.741238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:28.741238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0141","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-18T03:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcDqrS9FgFRy+mahAWatZpQETe2POGrGYTc5naoxtykx7NHSx8m8HUZtqDfnDs7+ULfGh4jpf4At4H8+qN9OAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:29:08.703466Z"},"content_sha256":"f28bd7b57cf6d1bd48ab2270546b5f4a655bfaa4bca641d4aedfda8cbb8360d1","schema_version":"1.0","event_id":"sha256:f28bd7b57cf6d1bd48ab2270546b5f4a655bfaa4bca641d4aedfda8cbb8360d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DC4RWD6EPUXU4TCKPZU2SESGFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Empirical distribution of good channel codes with non-vanishing error probability (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Sergio Verdu, Yury Polyanskiy","submitted_at":"2013-08-31T18:02:46Z","abstract_excerpt":"This paper studies several properties of channel codes that approach the fundamental limits of a given (discrete or Gaussian) memoryless channel with a non-vanishing probability of error. The output distribution induced by an $\\epsilon$-capacity-achieving code is shown to be close in a strong sense to the capacity achieving output distribution. Relying on the concentration of measure (isoperimetry) property enjoyed by the latter, it is shown that regular (Lipschitz) functions of channel outputs can be precisely estimated and turn out to be essentially non-random and independent of the actual c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0141","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-18T03:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bb7D12rGANxOHD8oY7VeSrRpI5ZvUfXQ/NacltRtyyftE8g7jAaFX09JFDGn0hg0syEwx1dESynOpcgdsisSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:29:08.704107Z"},"content_sha256":"2f159b4f5ec4bc25882431774c43dccedc6b62bc1366eceb68adcecba28d747b","schema_version":"1.0","event_id":"sha256:2f159b4f5ec4bc25882431774c43dccedc6b62bc1366eceb68adcecba28d747b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DC4RWD6EPUXU4TCKPZU2SESGFG/bundle.json","state_url":"https://pith.science/pith/DC4RWD6EPUXU4TCKPZU2SESGFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DC4RWD6EPUXU4TCKPZU2SESGFG/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-05-31T07:29:08Z","links":{"resolver":"https://pith.science/pith/DC4RWD6EPUXU4TCKPZU2SESGFG","bundle":"https://pith.science/pith/DC4RWD6EPUXU4TCKPZU2SESGFG/bundle.json","state":"https://pith.science/pith/DC4RWD6EPUXU4TCKPZU2SESGFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DC4RWD6EPUXU4TCKPZU2SESGFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DC4RWD6EPUXU4TCKPZU2SESGFG","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":"a89f8eac8b6aca2148f0b8d0913651dbf1ada10ebd8c5574a26ae59fe2d3075c","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-31T18:02:46Z","title_canon_sha256":"f44bfe967ad988b8bb2fc5ffcc1c254c0c4b1451e35c75ad0595e566ac1889c9"},"schema_version":"1.0","source":{"id":"1309.0141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0141","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0141v1","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0141","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"DC4RWD6EPUXU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DC4RWD6EPUXU4TCK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DC4RWD6E","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:2f159b4f5ec4bc25882431774c43dccedc6b62bc1366eceb68adcecba28d747b","target":"graph","created_at":"2026-05-18T03:14:28Z","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":"This paper studies several properties of channel codes that approach the fundamental limits of a given (discrete or Gaussian) memoryless channel with a non-vanishing probability of error. The output distribution induced by an $\\epsilon$-capacity-achieving code is shown to be close in a strong sense to the capacity achieving output distribution. Relying on the concentration of measure (isoperimetry) property enjoyed by the latter, it is shown that regular (Lipschitz) functions of channel outputs can be precisely estimated and turn out to be essentially non-random and independent of the actual c","authors_text":"Sergio Verdu, Yury Polyanskiy","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-31T18:02:46Z","title":"Empirical distribution of good channel codes with non-vanishing error probability (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0141","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:f28bd7b57cf6d1bd48ab2270546b5f4a655bfaa4bca641d4aedfda8cbb8360d1","target":"record","created_at":"2026-05-18T03:14:28Z","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":"a89f8eac8b6aca2148f0b8d0913651dbf1ada10ebd8c5574a26ae59fe2d3075c","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-31T18:02:46Z","title_canon_sha256":"f44bfe967ad988b8bb2fc5ffcc1c254c0c4b1451e35c75ad0595e566ac1889c9"},"schema_version":"1.0","source":{"id":"1309.0141","kind":"arxiv","version":1}},"canonical_sha256":"18b91b0fc47d2f4e4c4a7e69a9124629ab323bf6040797c95f5697d0066ec446","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18b91b0fc47d2f4e4c4a7e69a9124629ab323bf6040797c95f5697d0066ec446","first_computed_at":"2026-05-18T03:14:28.741238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:28.741238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"frmGiEoy6XKeOIcxQkLGm4E/phLr+lnnQ7cNrq8CzAmzEF7zLZ2pmF4reQ3KbVTatLO11lM49K4OST8AIBVYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:28.741790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f28bd7b57cf6d1bd48ab2270546b5f4a655bfaa4bca641d4aedfda8cbb8360d1","sha256:2f159b4f5ec4bc25882431774c43dccedc6b62bc1366eceb68adcecba28d747b"],"state_sha256":"c01b07970602f7080874eb67f7a80cfcd5f17d8e6dd9f355537e4981052c0e97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0GpBiiZYUoL+8/kxfpD0gmiKKrNloMgwkd9BjLE8wAf3yHzalECWBYKC9R0+H/IqaNs8wOlnO6ucu+dU1B1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:29:08.707775Z","bundle_sha256":"11d6b29deb646452fefccb6dda75d22273f7282f69f8f5e22b7463f202abf9da"}}