{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MFFR2F7LRQZXJUBM7ZM2ZMP6BN","short_pith_number":"pith:MFFR2F7L","canonical_record":{"source":{"id":"1305.6789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-29T13:19:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6c61abe2074268325b7b682c69348d298c0524af35394bf8124a42d8bbba9d8","abstract_canon_sha256":"b5f3e1e757241209a8667e10dcb1367c88d614295be50937710de61f07ae7f9f"},"schema_version":"1.0"},"canonical_sha256":"614b1d17eb8c3374d02cfe59acb1fe0b5d3c2b237aedcd7c0509e1e497dfb6f9","source":{"kind":"arxiv","id":"1305.6789","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6789","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6789v2","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6789","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"MFFR2F7LRQZX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MFFR2F7LRQZXJUBM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MFFR2F7L","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MFFR2F7LRQZXJUBM7ZM2ZMP6BN","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-29T13:19:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a6c61abe2074268325b7b682c69348d298c0524af35394bf8124a42d8bbba9d8","abstract_canon_sha256":"b5f3e1e757241209a8667e10dcb1367c88d614295be50937710de61f07ae7f9f"},"schema_version":"1.0"},"canonical_sha256":"614b1d17eb8c3374d02cfe59acb1fe0b5d3c2b237aedcd7c0509e1e497dfb6f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:41.201352Z","signature_b64":"Dnfvf6TaceG9Pbj7gVq1bRsVtLCWbuz5ivoqZtMTa23GK/DEh/IO2IWy4UiKSlQVujDOMVeu61lqt+RBYQTlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"614b1d17eb8c3374d02cfe59acb1fe0b5d3c2b237aedcd7c0509e1e497dfb6f9","last_reissued_at":"2026-05-18T02:47:41.200430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:41.200430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6789","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-18T02:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBqXk6ZLSuf2XS/VbEmOEa5r6uu+owkHfbvQ1nWq80ZrVTLteI5pHerFwnxAIRGNdzyrEqn/9Tj35TjSEDmBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:27:38.060252Z"},"content_sha256":"9afc12df525b71d5d521c19595ba5bf917e331088c86bd3f2fe8fe7a73061277","schema_version":"1.0","event_id":"sha256:9afc12df525b71d5d521c19595ba5bf917e331088c86bd3f2fe8fe7a73061277"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MFFR2F7LRQZXJUBM7ZM2ZMP6BN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second-Order Coding Rates for Channels with State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Tomamichel, Vincent Y. F. Tan","submitted_at":"2013-05-29T13:19:40Z","abstract_excerpt":"We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capacity as well as necessary and sufficient conditions for the strong converse property for such channels when the sequence of channel states is not necessarily stationary, memoryless or ergodic. We then seek a finer characterization of these capacities in terms of second-order coding rates. The general results are supplemented by several examples including i.i.d. and Markov states and mixed channels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6789","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-18T02:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Am/Zxdg+BAtWKP8jA+H1P4UA4AtiB9wRTmEiPUNaY9UxIxYa9Mic4K8jG2QFsEFz2HRyj+viTf8XStR+7AvwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:27:38.060629Z"},"content_sha256":"72accb3997651fb0efe588ed070285e87b8d19074e85994048009ba9d6f0278e","schema_version":"1.0","event_id":"sha256:72accb3997651fb0efe588ed070285e87b8d19074e85994048009ba9d6f0278e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFFR2F7LRQZXJUBM7ZM2ZMP6BN/bundle.json","state_url":"https://pith.science/pith/MFFR2F7LRQZXJUBM7ZM2ZMP6BN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFFR2F7LRQZXJUBM7ZM2ZMP6BN/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-02T05:27:38Z","links":{"resolver":"https://pith.science/pith/MFFR2F7LRQZXJUBM7ZM2ZMP6BN","bundle":"https://pith.science/pith/MFFR2F7LRQZXJUBM7ZM2ZMP6BN/bundle.json","state":"https://pith.science/pith/MFFR2F7LRQZXJUBM7ZM2ZMP6BN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFFR2F7LRQZXJUBM7ZM2ZMP6BN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MFFR2F7LRQZXJUBM7ZM2ZMP6BN","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":"b5f3e1e757241209a8667e10dcb1367c88d614295be50937710de61f07ae7f9f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-29T13:19:40Z","title_canon_sha256":"a6c61abe2074268325b7b682c69348d298c0524af35394bf8124a42d8bbba9d8"},"schema_version":"1.0","source":{"id":"1305.6789","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6789","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6789v2","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6789","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"MFFR2F7LRQZX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MFFR2F7LRQZXJUBM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MFFR2F7L","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:72accb3997651fb0efe588ed070285e87b8d19074e85994048009ba9d6f0278e","target":"graph","created_at":"2026-05-18T02:47:41Z","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 performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capacity as well as necessary and sufficient conditions for the strong converse property for such channels when the sequence of channel states is not necessarily stationary, memoryless or ergodic. We then seek a finer characterization of these capacities in terms of second-order coding rates. The general results are supplemented by several examples including i.i.d. and Markov states and mixed channels.","authors_text":"Marco Tomamichel, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-29T13:19:40Z","title":"Second-Order Coding Rates for Channels with State"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6789","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:9afc12df525b71d5d521c19595ba5bf917e331088c86bd3f2fe8fe7a73061277","target":"record","created_at":"2026-05-18T02:47:41Z","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":"b5f3e1e757241209a8667e10dcb1367c88d614295be50937710de61f07ae7f9f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-29T13:19:40Z","title_canon_sha256":"a6c61abe2074268325b7b682c69348d298c0524af35394bf8124a42d8bbba9d8"},"schema_version":"1.0","source":{"id":"1305.6789","kind":"arxiv","version":2}},"canonical_sha256":"614b1d17eb8c3374d02cfe59acb1fe0b5d3c2b237aedcd7c0509e1e497dfb6f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"614b1d17eb8c3374d02cfe59acb1fe0b5d3c2b237aedcd7c0509e1e497dfb6f9","first_computed_at":"2026-05-18T02:47:41.200430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:41.200430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dnfvf6TaceG9Pbj7gVq1bRsVtLCWbuz5ivoqZtMTa23GK/DEh/IO2IWy4UiKSlQVujDOMVeu61lqt+RBYQTlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:41.201352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6789","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9afc12df525b71d5d521c19595ba5bf917e331088c86bd3f2fe8fe7a73061277","sha256:72accb3997651fb0efe588ed070285e87b8d19074e85994048009ba9d6f0278e"],"state_sha256":"81364fcb655fd80507d83920ecadb6a837b08f7b398dc684f20a12f1cc87c85b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6g38N1SgeNpfhceUr97a3CLsPVqJHKqzt/u7KLMJRt4/C1aP7ONcXtHpUVqw3nDxH401wWEeGdsDkk7RgBp8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:27:38.062919Z","bundle_sha256":"07d16af43c4b476a5b12a05ce98615b3d2088773c8006b50233dfe32d8e34f25"}}