{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Y4Y64SWAZEEWPA5DQ3XZ566YFB","short_pith_number":"pith:Y4Y64SWA","canonical_record":{"source":{"id":"1404.5507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-22T14:10:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a31c27c4e5055e19898c0ea55b3c3d312c625fac56e3c7bfb42f696b9021b5d6","abstract_canon_sha256":"87ef915ac2b377b1a3ef4ecfa907857f73197eedf5fab957c37f6129f91b286b"},"schema_version":"1.0"},"canonical_sha256":"c731ee4ac0c9096783a386ef9efbd8284f1cacc920b9193b1ec164f5a8ed838d","source":{"kind":"arxiv","id":"1404.5507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5507","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5507v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5507","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"Y4Y64SWAZEEW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y4Y64SWAZEEWPA5D","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y4Y64SWA","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Y4Y64SWAZEEWPA5DQ3XZ566YFB","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-22T14:10:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a31c27c4e5055e19898c0ea55b3c3d312c625fac56e3c7bfb42f696b9021b5d6","abstract_canon_sha256":"87ef915ac2b377b1a3ef4ecfa907857f73197eedf5fab957c37f6129f91b286b"},"schema_version":"1.0"},"canonical_sha256":"c731ee4ac0c9096783a386ef9efbd8284f1cacc920b9193b1ec164f5a8ed838d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:31.186860Z","signature_b64":"4PXX2obzMwW0Gy7Qe/l0v0aMZWsOWvp6rpoH7+0uNDekOQdgdEFhRYWrlwXr5284tP8+CaawR41xQudNSDGvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c731ee4ac0c9096783a386ef9efbd8284f1cacc920b9193b1ec164f5a8ed838d","last_reissued_at":"2026-05-18T02:53:31.185999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:31.185999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5507","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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LF3w8MMx/y0oWLLDYnVf4DL1Y6MtmglMc8F3Mac9s+0WRvHpKSvMLdrtE0eqrTP2dI5FZPm32lB0xKvjWUNaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:46:45.909792Z"},"content_sha256":"9d738a98300d3e795af14ce3fb5873b56d96d25fc5dbe54e52e71f9142d2bcbd","schema_version":"1.0","event_id":"sha256:9d738a98300d3e795af14ce3fb5873b56d96d25fc5dbe54e52e71f9142d2bcbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Y4Y64SWAZEEWPA5DQ3XZ566YFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Converse and Second-Order Asymptotics of Channel Resolvability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masahito Hayashi, Shun Watanabe","submitted_at":"2014-04-22T14:10:34Z","abstract_excerpt":"We study the problem of channel resolvability for fixed i.i.d. input distributions and discrete memoryless channels (DMCs), and derive the strong converse theorem for any DMCs that are not necessarily full rank. We also derive the optimal second-order rate under a condition. Furthermore, under the condition that a DMC has the unique capacity achieving input distribution, we derive the optimal second-order rate of channel resolvability for the worst input distribution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5507","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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8tFnxohBoux1agOhhFvJudqnvk4acPwyRFR7Q7b0TbsUdEm+v4uemd4JFrTW1p/1iU6phLzTOhQALR2qLPJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:46:45.910387Z"},"content_sha256":"a4169e3a4a89dc82e54732421846f9d17d84a3ff39aaf301d089956bdd604780","schema_version":"1.0","event_id":"sha256:a4169e3a4a89dc82e54732421846f9d17d84a3ff39aaf301d089956bdd604780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4Y64SWAZEEWPA5DQ3XZ566YFB/bundle.json","state_url":"https://pith.science/pith/Y4Y64SWAZEEWPA5DQ3XZ566YFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4Y64SWAZEEWPA5DQ3XZ566YFB/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-28T02:46:45Z","links":{"resolver":"https://pith.science/pith/Y4Y64SWAZEEWPA5DQ3XZ566YFB","bundle":"https://pith.science/pith/Y4Y64SWAZEEWPA5DQ3XZ566YFB/bundle.json","state":"https://pith.science/pith/Y4Y64SWAZEEWPA5DQ3XZ566YFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4Y64SWAZEEWPA5DQ3XZ566YFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Y4Y64SWAZEEWPA5DQ3XZ566YFB","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":"87ef915ac2b377b1a3ef4ecfa907857f73197eedf5fab957c37f6129f91b286b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-22T14:10:34Z","title_canon_sha256":"a31c27c4e5055e19898c0ea55b3c3d312c625fac56e3c7bfb42f696b9021b5d6"},"schema_version":"1.0","source":{"id":"1404.5507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5507","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5507v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5507","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"Y4Y64SWAZEEW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y4Y64SWAZEEWPA5D","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y4Y64SWA","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:a4169e3a4a89dc82e54732421846f9d17d84a3ff39aaf301d089956bdd604780","target":"graph","created_at":"2026-05-18T02:53:31Z","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 study the problem of channel resolvability for fixed i.i.d. input distributions and discrete memoryless channels (DMCs), and derive the strong converse theorem for any DMCs that are not necessarily full rank. We also derive the optimal second-order rate under a condition. Furthermore, under the condition that a DMC has the unique capacity achieving input distribution, we derive the optimal second-order rate of channel resolvability for the worst input distribution.","authors_text":"Masahito Hayashi, Shun Watanabe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-22T14:10:34Z","title":"Strong Converse and Second-Order Asymptotics of Channel Resolvability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5507","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:9d738a98300d3e795af14ce3fb5873b56d96d25fc5dbe54e52e71f9142d2bcbd","target":"record","created_at":"2026-05-18T02:53:31Z","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":"87ef915ac2b377b1a3ef4ecfa907857f73197eedf5fab957c37f6129f91b286b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-22T14:10:34Z","title_canon_sha256":"a31c27c4e5055e19898c0ea55b3c3d312c625fac56e3c7bfb42f696b9021b5d6"},"schema_version":"1.0","source":{"id":"1404.5507","kind":"arxiv","version":1}},"canonical_sha256":"c731ee4ac0c9096783a386ef9efbd8284f1cacc920b9193b1ec164f5a8ed838d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c731ee4ac0c9096783a386ef9efbd8284f1cacc920b9193b1ec164f5a8ed838d","first_computed_at":"2026-05-18T02:53:31.185999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:31.185999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4PXX2obzMwW0Gy7Qe/l0v0aMZWsOWvp6rpoH7+0uNDekOQdgdEFhRYWrlwXr5284tP8+CaawR41xQudNSDGvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:31.186860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d738a98300d3e795af14ce3fb5873b56d96d25fc5dbe54e52e71f9142d2bcbd","sha256:a4169e3a4a89dc82e54732421846f9d17d84a3ff39aaf301d089956bdd604780"],"state_sha256":"8a4d7ed7044547026e8dcc46d210cd2d0c5363c672d6c0865b68acbd92dc2a99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99nRJmXcx2YpD0eptrLHhLaBMp+5QXSi2CPzBWo2TPdpwjZ8gTl00iqf+ZalOVBCfA+92U2FC0ltNwfScgz3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:46:45.913082Z","bundle_sha256":"4ae4d4320148267020a1a7d3b4f6d9f40d705e4f47567e756754edebcc1c3804"}}