{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GORDRICCDLKRGBAOBX6KJ43YBJ","short_pith_number":"pith:GORDRICC","canonical_record":{"source":{"id":"1204.3658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T21:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eefdfc692e7b20e549e79536433d5e5f97191d2b5bb653a5d78f88189c076c9e","abstract_canon_sha256":"19bf2b3b735eefbcd5087d97d3306ab90debcc80ef4c9c71cb5544a415f770fc"},"schema_version":"1.0"},"canonical_sha256":"33a238a0421ad513040e0dfca4f3780a627b8b504ffb667668ad04d558119db9","source":{"kind":"arxiv","id":"1204.3658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3658","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3658v1","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3658","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"pith_short_12","alias_value":"GORDRICCDLKR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GORDRICCDLKRGBAO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GORDRICC","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GORDRICCDLKRGBAOBX6KJ43YBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T21:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eefdfc692e7b20e549e79536433d5e5f97191d2b5bb653a5d78f88189c076c9e","abstract_canon_sha256":"19bf2b3b735eefbcd5087d97d3306ab90debcc80ef4c9c71cb5544a415f770fc"},"schema_version":"1.0"},"canonical_sha256":"33a238a0421ad513040e0dfca4f3780a627b8b504ffb667668ad04d558119db9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:40.020241Z","signature_b64":"4bHFB89yodDnoBTMCIfYPIKkLCmHngHQfJIkqtmMbWAW02h8pd73Ea4HBj4o+iICO18mKENPJRleROL0DaBuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33a238a0421ad513040e0dfca4f3780a627b8b504ffb667668ad04d558119db9","last_reissued_at":"2026-05-18T03:57:40.019662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:40.019662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3658","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:57:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uGVdXeodm1+Du/LT+RxXfYU5HWZiD6PRSBBlAZTd125AlUCubIZTejDLMCjpSs6GIzp96RDpOscvHGUJSjV5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:06:08.119004Z"},"content_sha256":"5aeaa2bb844167d15ba802e4bcc2f298d1a154f659bf4ef72d472e5e75144d3f","schema_version":"1.0","event_id":"sha256:5aeaa2bb844167d15ba802e4bcc2f298d1a154f659bf4ef72d472e5e75144d3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GORDRICCDLKRGBAOBX6KJ43YBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Jar Decoding: Non-Asymptotic Converse Coding Theorems, Taylor-Type Expansion, and Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"En-hui Yang, Jin Meng","submitted_at":"2012-04-16T21:25:32Z","abstract_excerpt":"Recently, a new decoding rule called jar decoding was proposed; under jar decoding, a non-asymptotic achievable tradeoff between the coding rate and word error probability was also established for any discrete input memoryless channel with discrete or continuous output (DIMC). Along the path of non-asymptotic analysis, in this paper, it is further shown that jar decoding is actually optimal up to the second order coding performance by establishing new non-asymptotic converse coding theorems, and determining the Taylor expansion of the (best) coding rate $R_n (\\epsilon)$ of finite block length "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3658","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:57:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEy2l+xx4krOdDRi+O8rTH4lw5/jZHjTWX+OccAYOgdcs8u1Y5NglOxCBEnarkxijUSwMZnK9BD/zbyX0ufECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:06:08.119780Z"},"content_sha256":"0f756eec677c1cb7a757c585bff63f087f4df9ab99527fd2ab3b9c7221fb54d5","schema_version":"1.0","event_id":"sha256:0f756eec677c1cb7a757c585bff63f087f4df9ab99527fd2ab3b9c7221fb54d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GORDRICCDLKRGBAOBX6KJ43YBJ/bundle.json","state_url":"https://pith.science/pith/GORDRICCDLKRGBAOBX6KJ43YBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GORDRICCDLKRGBAOBX6KJ43YBJ/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-07T23:06:08Z","links":{"resolver":"https://pith.science/pith/GORDRICCDLKRGBAOBX6KJ43YBJ","bundle":"https://pith.science/pith/GORDRICCDLKRGBAOBX6KJ43YBJ/bundle.json","state":"https://pith.science/pith/GORDRICCDLKRGBAOBX6KJ43YBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GORDRICCDLKRGBAOBX6KJ43YBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GORDRICCDLKRGBAOBX6KJ43YBJ","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":"19bf2b3b735eefbcd5087d97d3306ab90debcc80ef4c9c71cb5544a415f770fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T21:25:32Z","title_canon_sha256":"eefdfc692e7b20e549e79536433d5e5f97191d2b5bb653a5d78f88189c076c9e"},"schema_version":"1.0","source":{"id":"1204.3658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3658","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3658v1","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3658","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"pith_short_12","alias_value":"GORDRICCDLKR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GORDRICCDLKRGBAO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GORDRICC","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:0f756eec677c1cb7a757c585bff63f087f4df9ab99527fd2ab3b9c7221fb54d5","target":"graph","created_at":"2026-05-18T03:57:40Z","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":"Recently, a new decoding rule called jar decoding was proposed; under jar decoding, a non-asymptotic achievable tradeoff between the coding rate and word error probability was also established for any discrete input memoryless channel with discrete or continuous output (DIMC). Along the path of non-asymptotic analysis, in this paper, it is further shown that jar decoding is actually optimal up to the second order coding performance by establishing new non-asymptotic converse coding theorems, and determining the Taylor expansion of the (best) coding rate $R_n (\\epsilon)$ of finite block length ","authors_text":"En-hui Yang, Jin Meng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T21:25:32Z","title":"Jar Decoding: Non-Asymptotic Converse Coding Theorems, Taylor-Type Expansion, and Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3658","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:5aeaa2bb844167d15ba802e4bcc2f298d1a154f659bf4ef72d472e5e75144d3f","target":"record","created_at":"2026-05-18T03:57:40Z","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":"19bf2b3b735eefbcd5087d97d3306ab90debcc80ef4c9c71cb5544a415f770fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T21:25:32Z","title_canon_sha256":"eefdfc692e7b20e549e79536433d5e5f97191d2b5bb653a5d78f88189c076c9e"},"schema_version":"1.0","source":{"id":"1204.3658","kind":"arxiv","version":1}},"canonical_sha256":"33a238a0421ad513040e0dfca4f3780a627b8b504ffb667668ad04d558119db9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33a238a0421ad513040e0dfca4f3780a627b8b504ffb667668ad04d558119db9","first_computed_at":"2026-05-18T03:57:40.019662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:40.019662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4bHFB89yodDnoBTMCIfYPIKkLCmHngHQfJIkqtmMbWAW02h8pd73Ea4HBj4o+iICO18mKENPJRleROL0DaBuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:40.020241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5aeaa2bb844167d15ba802e4bcc2f298d1a154f659bf4ef72d472e5e75144d3f","sha256:0f756eec677c1cb7a757c585bff63f087f4df9ab99527fd2ab3b9c7221fb54d5"],"state_sha256":"3e0f36c8c0fa018019f167bca35cf6bff3f555eb427c6590f361b053b80f221a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZiTP0UVHVWbNEkZEg3VoKu179MPzdWOzKVgWze8pBFyIEl0UM521Dg/CGtnEuCLeC/LPiecbt2QIMenOROEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:06:08.123639Z","bundle_sha256":"376440259672447059e0d5f90769ae4fc410f6e1212862270f32b878d7d52f22"}}