{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JEJEGIJ2EN5QF2FMEQSREQCVIZ","short_pith_number":"pith:JEJEGIJ2","canonical_record":{"source":{"id":"1811.00262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T07:07:01Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"547ad25c04d57514bc9ffad5ec40b1f71403536f5794b7b426102eac33546b18","abstract_canon_sha256":"2d1341f3cf55c9935bbf0ed34768d8e5c2cb948ca6b65c9d348988ea771b602a"},"schema_version":"1.0"},"canonical_sha256":"491243213a237b02e8ac2425124055465149b75df9685d107ab95c17d1b6c6cc","source":{"kind":"arxiv","id":"1811.00262","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00262","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00262v2","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00262","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"JEJEGIJ2EN5Q","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JEJEGIJ2EN5QF2FM","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JEJEGIJ2","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JEJEGIJ2EN5QF2FMEQSREQCVIZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T07:07:01Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"547ad25c04d57514bc9ffad5ec40b1f71403536f5794b7b426102eac33546b18","abstract_canon_sha256":"2d1341f3cf55c9935bbf0ed34768d8e5c2cb948ca6b65c9d348988ea771b602a"},"schema_version":"1.0"},"canonical_sha256":"491243213a237b02e8ac2425124055465149b75df9685d107ab95c17d1b6c6cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:06.548984Z","signature_b64":"+rmgdew4zzbVcUXDS5mcbdV79PODCaRQj/isVAmrgwl9QHwnwEEkP4fMMISpeeRjyQ4K2I1Gd4KMHY/Vmat4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"491243213a237b02e8ac2425124055465149b75df9685d107ab95c17d1b6c6cc","last_reissued_at":"2026-05-18T00:01:06.548525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:06.548525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00262","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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdtGTE/PasSOyNylGk9qfj2BcQwxARzPqLUvhJ9HLL1umIwqFAH53TaqR8Yh3fRMyLYL29s29KihTjQQZUVhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:44:22.284158Z"},"content_sha256":"b116cce9c145780843dda66d904ed86553e09dfcef1f537e42c13f19235398e4","schema_version":"1.0","event_id":"sha256:b116cce9c145780843dda66d904ed86553e09dfcef1f537e42c13f19235398e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JEJEGIJ2EN5QF2FMEQSREQCVIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Finite Length Analysis for Information Theoretic Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi","submitted_at":"2018-11-01T07:07:01Z","abstract_excerpt":"We focus on the optimal value for various information-theoretical tasks. There are several studies for the asymptotic expansion for these optimal values up to the order $\\sqrt{n}$ or $\\log n$. However, these expansions have errors of the order $o(\\sqrt{n})$ or $o(\\log n)$, which does not goes to zero asymptotically. To resolve this problem, we derive the asymptotic expansion up to the constant order for upper and lower bounds of these optimal values. While the expansions of upper and lower bonds do not match, they clarify the ranges of these optimal values, whose errors go to zero asymptotical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00262","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:01:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rz4GUivi4CueOQzkld6hgSYRMbi51ReAvIYCH0HBwqupE0sP2g64EGHPkrwCakgS2Rhnr1HrrZuvaz0SDvPSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:44:22.284560Z"},"content_sha256":"7df640174d4259bed6a3a6120a1df0565d929b7745f1cc69fe1732511c96d93a","schema_version":"1.0","event_id":"sha256:7df640174d4259bed6a3a6120a1df0565d929b7745f1cc69fe1732511c96d93a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEJEGIJ2EN5QF2FMEQSREQCVIZ/bundle.json","state_url":"https://pith.science/pith/JEJEGIJ2EN5QF2FMEQSREQCVIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEJEGIJ2EN5QF2FMEQSREQCVIZ/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-02T21:44:22Z","links":{"resolver":"https://pith.science/pith/JEJEGIJ2EN5QF2FMEQSREQCVIZ","bundle":"https://pith.science/pith/JEJEGIJ2EN5QF2FMEQSREQCVIZ/bundle.json","state":"https://pith.science/pith/JEJEGIJ2EN5QF2FMEQSREQCVIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEJEGIJ2EN5QF2FMEQSREQCVIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JEJEGIJ2EN5QF2FMEQSREQCVIZ","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":"2d1341f3cf55c9935bbf0ed34768d8e5c2cb948ca6b65c9d348988ea771b602a","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T07:07:01Z","title_canon_sha256":"547ad25c04d57514bc9ffad5ec40b1f71403536f5794b7b426102eac33546b18"},"schema_version":"1.0","source":{"id":"1811.00262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00262","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00262v2","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00262","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"JEJEGIJ2EN5Q","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JEJEGIJ2EN5QF2FM","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JEJEGIJ2","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:7df640174d4259bed6a3a6120a1df0565d929b7745f1cc69fe1732511c96d93a","target":"graph","created_at":"2026-05-18T00:01:06Z","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":"We focus on the optimal value for various information-theoretical tasks. There are several studies for the asymptotic expansion for these optimal values up to the order $\\sqrt{n}$ or $\\log n$. However, these expansions have errors of the order $o(\\sqrt{n})$ or $o(\\log n)$, which does not goes to zero asymptotically. To resolve this problem, we derive the asymptotic expansion up to the constant order for upper and lower bounds of these optimal values. While the expansions of upper and lower bonds do not match, they clarify the ranges of these optimal values, whose errors go to zero asymptotical","authors_text":"Masahito Hayashi","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T07:07:01Z","title":"Semi-Finite Length Analysis for Information Theoretic Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00262","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:b116cce9c145780843dda66d904ed86553e09dfcef1f537e42c13f19235398e4","target":"record","created_at":"2026-05-18T00:01:06Z","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":"2d1341f3cf55c9935bbf0ed34768d8e5c2cb948ca6b65c9d348988ea771b602a","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-01T07:07:01Z","title_canon_sha256":"547ad25c04d57514bc9ffad5ec40b1f71403536f5794b7b426102eac33546b18"},"schema_version":"1.0","source":{"id":"1811.00262","kind":"arxiv","version":2}},"canonical_sha256":"491243213a237b02e8ac2425124055465149b75df9685d107ab95c17d1b6c6cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"491243213a237b02e8ac2425124055465149b75df9685d107ab95c17d1b6c6cc","first_computed_at":"2026-05-18T00:01:06.548525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:06.548525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+rmgdew4zzbVcUXDS5mcbdV79PODCaRQj/isVAmrgwl9QHwnwEEkP4fMMISpeeRjyQ4K2I1Gd4KMHY/Vmat4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:06.548984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b116cce9c145780843dda66d904ed86553e09dfcef1f537e42c13f19235398e4","sha256:7df640174d4259bed6a3a6120a1df0565d929b7745f1cc69fe1732511c96d93a"],"state_sha256":"29cc80b00b9862f35bba71b9fe1270ec5a90ecead6001e4dedb671ee2c8b7187"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjGqL//KqSmBr2alrVmWFb3phSFXGB+UQ72iCl4yAKG4o1XGsEIYsDei0nQ7ZZl9SeNWuEHTvp4GXTR7PxW2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:44:22.286576Z","bundle_sha256":"a90ffb3b2057dc9a70bfce1dec985bfd459b7ea51d49e6f3635aa79bd1825084"}}