{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:EXJP5UOR6EZDZ5WR462B3EU2B5","short_pith_number":"pith:EXJP5UOR","canonical_record":{"source":{"id":"0801.2242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-01-15T10:00:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3285ef4f7aae12dc820dc33ea68a247c17d95dfba94ba75efe761d01ff8f8e13","abstract_canon_sha256":"131573e796a9906c32246230060b853e8c07ab178b9856638e114b9e46184a62"},"schema_version":"1.0"},"canonical_sha256":"25d2fed1d1f1323cf6d1e7b41d929a0f6684c705d85b66ba45b9149d1022f66c","source":{"kind":"arxiv","id":"0801.2242","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.2242","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0801.2242v2","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.2242","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"EXJP5UOR6EZD","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"EXJP5UOR6EZDZ5WR","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"EXJP5UOR","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:EXJP5UOR6EZDZ5WR462B3EU2B5","target":"record","payload":{"canonical_record":{"source":{"id":"0801.2242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-01-15T10:00:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3285ef4f7aae12dc820dc33ea68a247c17d95dfba94ba75efe761d01ff8f8e13","abstract_canon_sha256":"131573e796a9906c32246230060b853e8c07ab178b9856638e114b9e46184a62"},"schema_version":"1.0"},"canonical_sha256":"25d2fed1d1f1323cf6d1e7b41d929a0f6684c705d85b66ba45b9149d1022f66c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.941464Z","signature_b64":"aXUog8PvTDjeHToDtPY9rGBY+Tz7PsoFh8bnERB+16Y/78sH0bCGbSm88BxagT83SKthGwOXPMFKuVLDe/VMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25d2fed1d1f1323cf6d1e7b41d929a0f6684c705d85b66ba45b9149d1022f66c","last_reissued_at":"2026-05-18T00:59:11.940624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.940624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0801.2242","source_version":2,"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-18T00:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USmY03Cuan3ZcfA7aPuRkvIWvy9r3KRwfRI246OdxqKLUiNQBKTyDxA0WTZLFvvG0TVO5V11YIEn1ap8a0BPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:52:00.909809Z"},"content_sha256":"38ff1c15ff1cf5e7173ab2abc61eb5ac3ccc88a04e43f7444a3db857cb40e3c9","schema_version":"1.0","event_id":"sha256:38ff1c15ff1cf5e7173ab2abc61eb5ac3ccc88a04e43f7444a3db857cb40e3c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:EXJP5UOR6EZDZ5WR462B3EU2B5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Spectrum Approach to Second-Order Coding Rate in Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi","submitted_at":"2008-01-15T10:00:46Z","abstract_excerpt":"Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\\epsilon$ is obtained by using the information spectrum method. We apply this result to the discrete memoryless case, the discrete memoryless case with a cost constraint, the additive Markovian case, and the Gaussian channel case with an energy constraint. We also clarify that the Gallager bound does not give the optimum evaluation in the second-order coding rate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.2242","kind":"arxiv","version":2},"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-18T00:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsK852xjQR4/TqgHgpRPyauci2Dw/ciZMjuCIhDpy7ctzNZdZV84z6cOsMhW52AI0n32EMrw8NTkc418ZdmRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:52:00.910156Z"},"content_sha256":"6c2a201f083c654a10d91a40aed56b71e4e62bff4101b8354549b6d502582cc5","schema_version":"1.0","event_id":"sha256:6c2a201f083c654a10d91a40aed56b71e4e62bff4101b8354549b6d502582cc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXJP5UOR6EZDZ5WR462B3EU2B5/bundle.json","state_url":"https://pith.science/pith/EXJP5UOR6EZDZ5WR462B3EU2B5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXJP5UOR6EZDZ5WR462B3EU2B5/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-02T13:52:00Z","links":{"resolver":"https://pith.science/pith/EXJP5UOR6EZDZ5WR462B3EU2B5","bundle":"https://pith.science/pith/EXJP5UOR6EZDZ5WR462B3EU2B5/bundle.json","state":"https://pith.science/pith/EXJP5UOR6EZDZ5WR462B3EU2B5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXJP5UOR6EZDZ5WR462B3EU2B5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:EXJP5UOR6EZDZ5WR462B3EU2B5","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":"131573e796a9906c32246230060b853e8c07ab178b9856638e114b9e46184a62","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-01-15T10:00:46Z","title_canon_sha256":"3285ef4f7aae12dc820dc33ea68a247c17d95dfba94ba75efe761d01ff8f8e13"},"schema_version":"1.0","source":{"id":"0801.2242","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.2242","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0801.2242v2","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.2242","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"EXJP5UOR6EZD","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"EXJP5UOR6EZDZ5WR","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"EXJP5UOR","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:6c2a201f083c654a10d91a40aed56b71e4e62bff4101b8354549b6d502582cc5","target":"graph","created_at":"2026-05-18T00:59:11Z","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":"Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\\epsilon$ is obtained by using the information spectrum method. We apply this result to the discrete memoryless case, the discrete memoryless case with a cost constraint, the additive Markovian case, and the Gaussian channel case with an energy constraint. We also clarify that the Gallager bound does not give the optimum evaluation in the second-order coding rate.","authors_text":"Masahito Hayashi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-01-15T10:00:46Z","title":"Information Spectrum Approach to Second-Order Coding Rate in Channel Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.2242","kind":"arxiv","version":2},"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:38ff1c15ff1cf5e7173ab2abc61eb5ac3ccc88a04e43f7444a3db857cb40e3c9","target":"record","created_at":"2026-05-18T00:59:11Z","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":"131573e796a9906c32246230060b853e8c07ab178b9856638e114b9e46184a62","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-01-15T10:00:46Z","title_canon_sha256":"3285ef4f7aae12dc820dc33ea68a247c17d95dfba94ba75efe761d01ff8f8e13"},"schema_version":"1.0","source":{"id":"0801.2242","kind":"arxiv","version":2}},"canonical_sha256":"25d2fed1d1f1323cf6d1e7b41d929a0f6684c705d85b66ba45b9149d1022f66c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25d2fed1d1f1323cf6d1e7b41d929a0f6684c705d85b66ba45b9149d1022f66c","first_computed_at":"2026-05-18T00:59:11.940624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.940624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aXUog8PvTDjeHToDtPY9rGBY+Tz7PsoFh8bnERB+16Y/78sH0bCGbSm88BxagT83SKthGwOXPMFKuVLDe/VMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.941464Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.2242","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38ff1c15ff1cf5e7173ab2abc61eb5ac3ccc88a04e43f7444a3db857cb40e3c9","sha256:6c2a201f083c654a10d91a40aed56b71e4e62bff4101b8354549b6d502582cc5"],"state_sha256":"2a35a92979774ef503ab85be5778c55fbe5d298995552a819559ce782439da8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbeCboF+oKSX6nFIIBHIG8ai3LN8UgJ1bCs6slBzU8ukeiapyfLiTvc0qaZNHC33xzJQ3EwDs+d+TnmpbcUZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:52:00.912239Z","bundle_sha256":"ee84bc8eda2d4dc30ffbf02eedf1b4fdaa88b0f1b36c93b5450b5aec9926b805"}}