{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CYPM6KAGEC7WTWK6YKE5XCG75I","short_pith_number":"pith:CYPM6KAG","canonical_record":{"source":{"id":"1312.6875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-24T19:16:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b575c94a56d8f79572942b214d375d721587c2688d0afc20ae70f6d7a4f8d4f0","abstract_canon_sha256":"9eabee682ec36ad50c43aa18f066c850effcf27767d02b74b65e474174a7f35a"},"schema_version":"1.0"},"canonical_sha256":"161ecf280620bf69d95ec289db88dfea052ed6e22183dfc371dfbb5af8cd2ab2","source":{"kind":"arxiv","id":"1312.6875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6875","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6875v1","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6875","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"CYPM6KAGEC7W","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CYPM6KAGEC7WTWK6","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CYPM6KAG","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CYPM6KAGEC7WTWK6YKE5XCG75I","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-24T19:16:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b575c94a56d8f79572942b214d375d721587c2688d0afc20ae70f6d7a4f8d4f0","abstract_canon_sha256":"9eabee682ec36ad50c43aa18f066c850effcf27767d02b74b65e474174a7f35a"},"schema_version":"1.0"},"canonical_sha256":"161ecf280620bf69d95ec289db88dfea052ed6e22183dfc371dfbb5af8cd2ab2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:55.778082Z","signature_b64":"vSznTmplj2xWIFfC71miRJEVHwSRzO3lHySg8UeG5qA2hx4FJXr4NB6Nm+yq+qSulx7PLa/UAFKRJ0cnQ3XvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"161ecf280620bf69d95ec289db88dfea052ed6e22183dfc371dfbb5af8cd2ab2","last_reissued_at":"2026-05-18T03:03:55.777312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:55.777312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6875","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:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgvPZdAZeOCHcy9vAou+YiA92dMvK4X76ImBw+oimxWs79fQjzIEpLvuBH1NXxhAWeEdyMt/T2LpebeWfyK2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:28:24.151588Z"},"content_sha256":"364b4a72e4843222dc0b48bc63e9311d40fa0744a22a10a617c0b98141d53dee","schema_version":"1.0","event_id":"sha256:364b4a72e4843222dc0b48bc63e9311d40fa0744a22a10a617c0b98141d53dee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CYPM6KAGEC7WTWK6YKE5XCG75I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Refinement of the random coding bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner, Yucel Altug","submitted_at":"2013-12-24T19:16:59Z","abstract_excerpt":"An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not satisfied), then for any $\\epsilon >0$ a pre-factor of $O(N^{-\\frac{1}{2}\\left( 1 - \\epsilon + \\bar{\\rho}^\\ast_R \\right)})$ (resp. $O(N^{-\\frac{1}{2}})$) is achievable for rates above the critical rate, where $N$ and $R$ is the blocklength and rate, respectively. The extra term $\\bar{\\rho}^\\ast_R$ is related to the slope of the random coding exponent. Further, the relation of these bounds with the authors' recent re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6875","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:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"noOO4FDS/wfryclhvzmGDoR1v+pdceRgaIJijCRnwMNhiK6sXH0uocyYTxFJitbY2YortvC8da968cK1iOk6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:28:24.151932Z"},"content_sha256":"98f94261e1226fff5e181bda136393f57092d9cf6ec50e75b4f676af75668fe6","schema_version":"1.0","event_id":"sha256:98f94261e1226fff5e181bda136393f57092d9cf6ec50e75b4f676af75668fe6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/bundle.json","state_url":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/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-26T14:28:24Z","links":{"resolver":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I","bundle":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/bundle.json","state":"https://pith.science/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYPM6KAGEC7WTWK6YKE5XCG75I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CYPM6KAGEC7WTWK6YKE5XCG75I","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":"9eabee682ec36ad50c43aa18f066c850effcf27767d02b74b65e474174a7f35a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-24T19:16:59Z","title_canon_sha256":"b575c94a56d8f79572942b214d375d721587c2688d0afc20ae70f6d7a4f8d4f0"},"schema_version":"1.0","source":{"id":"1312.6875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6875","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6875v1","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6875","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"CYPM6KAGEC7W","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CYPM6KAGEC7WTWK6","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CYPM6KAG","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:98f94261e1226fff5e181bda136393f57092d9cf6ec50e75b4f676af75668fe6","target":"graph","created_at":"2026-05-18T03:03:55Z","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":"An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not satisfied), then for any $\\epsilon >0$ a pre-factor of $O(N^{-\\frac{1}{2}\\left( 1 - \\epsilon + \\bar{\\rho}^\\ast_R \\right)})$ (resp. $O(N^{-\\frac{1}{2}})$) is achievable for rates above the critical rate, where $N$ and $R$ is the blocklength and rate, respectively. The extra term $\\bar{\\rho}^\\ast_R$ is related to the slope of the random coding exponent. Further, the relation of these bounds with the authors' recent re","authors_text":"Aaron B. Wagner, Yucel Altug","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-24T19:16:59Z","title":"Refinement of the random coding bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6875","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:364b4a72e4843222dc0b48bc63e9311d40fa0744a22a10a617c0b98141d53dee","target":"record","created_at":"2026-05-18T03:03:55Z","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":"9eabee682ec36ad50c43aa18f066c850effcf27767d02b74b65e474174a7f35a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-24T19:16:59Z","title_canon_sha256":"b575c94a56d8f79572942b214d375d721587c2688d0afc20ae70f6d7a4f8d4f0"},"schema_version":"1.0","source":{"id":"1312.6875","kind":"arxiv","version":1}},"canonical_sha256":"161ecf280620bf69d95ec289db88dfea052ed6e22183dfc371dfbb5af8cd2ab2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"161ecf280620bf69d95ec289db88dfea052ed6e22183dfc371dfbb5af8cd2ab2","first_computed_at":"2026-05-18T03:03:55.777312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:55.777312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vSznTmplj2xWIFfC71miRJEVHwSRzO3lHySg8UeG5qA2hx4FJXr4NB6Nm+yq+qSulx7PLa/UAFKRJ0cnQ3XvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:55.778082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:364b4a72e4843222dc0b48bc63e9311d40fa0744a22a10a617c0b98141d53dee","sha256:98f94261e1226fff5e181bda136393f57092d9cf6ec50e75b4f676af75668fe6"],"state_sha256":"469712ed0e8eebd47f571228200ac13846d1482649f9344a7ac2eca5c1511a60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OeyJpUgeUMkT/kAWjhsIxfrCkWNXWUGpnOrwNERt00ocIZKCB1pTh0HDuWP1oCZS6RpopK7Yftu8AeaWLaW9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:28:24.153861Z","bundle_sha256":"d2ee75fb618dec5dc2ce3902e1ecce258f06013ccee978f0ec79ac253e71ae65"}}