{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NN3AFVYVKHBKKBKFDYDK3L3FBE","short_pith_number":"pith:NN3AFVYV","canonical_record":{"source":{"id":"1510.00347","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T18:07:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac1554a8b652a9afb2a9fde072cb14b95823d5f2c7a75b55e851097cee0f850a","abstract_canon_sha256":"5eae53e988fbb0e9458c448def29a202154c6196298ad55580a654a8b685c6d4"},"schema_version":"1.0"},"canonical_sha256":"6b7602d71551c2a505451e06adaf65093f9792f1dac995621e150326ddb2a968","source":{"kind":"arxiv","id":"1510.00347","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00347","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00347v2","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00347","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"NN3AFVYVKHBK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NN3AFVYVKHBKKBKF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NN3AFVYV","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NN3AFVYVKHBKKBKFDYDK3L3FBE","target":"record","payload":{"canonical_record":{"source":{"id":"1510.00347","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T18:07:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac1554a8b652a9afb2a9fde072cb14b95823d5f2c7a75b55e851097cee0f850a","abstract_canon_sha256":"5eae53e988fbb0e9458c448def29a202154c6196298ad55580a654a8b685c6d4"},"schema_version":"1.0"},"canonical_sha256":"6b7602d71551c2a505451e06adaf65093f9792f1dac995621e150326ddb2a968","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:27.157799Z","signature_b64":"AuymjC/2q/AmBBf/ueiZGsQ3Iy3hNvA5hEME3xRVgiXlLstJeA7fl2lIyF5UKu/Ss1yBGTYTsZ8iCR4NOr2qDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b7602d71551c2a505451e06adaf65093f9792f1dac995621e150326ddb2a968","last_reissued_at":"2026-05-18T00:18:27.157224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:27.157224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.00347","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:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCMy1il8H8Xfq/U9YJr8GR15YMezQNykwWEo8RrAkeWy4CN+u2JdG0rvgGjV2ETk74MhkjyFHVagrP3Ne8ybCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:10:38.213032Z"},"content_sha256":"d360b7fd8d3ef2cedea3b62d7cc392cb9f2c2647a21ec8fb65156b4c33ad2e19","schema_version":"1.0","event_id":"sha256:d360b7fd8d3ef2cedea3b62d7cc392cb9f2c2647a21ec8fb65156b4c33ad2e19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NN3AFVYVKHBKKBKFDYDK3L3FBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding Theorem and Converse for Abstract Channels with Time Structure and Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eduard A. Jorswieck, Martin Mittelbach","submitted_at":"2015-10-01T18:07:04Z","abstract_excerpt":"A coding theorem and converse are proved for a large class of abstract stationary channels with time structure including the result by Kadota and Wyner (1972) on continuous-time real-valued channels as special cases. As main contribution the coding theorem is proved for a significantly weaker condition on the channel output memory - called total ergodicity w.r.t. finite alphabet block-memoryless input sources - and under a crucial relaxation of the measurability requirement for the channel. These improvements are achieved by introducing a suitable characterization of information rate capacity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00347","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:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yALbhwt2dRZc5BXRjoLeLru8TG8T+m/RcVTpf7E9pZYawgeUYxqFAE0bs7K893txzXdLqyE2vymAfxIkYitcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:10:38.214037Z"},"content_sha256":"3878d743204e647253c4a53ff62169fb6a38f907542c5f72439cc5b31dbdd320","schema_version":"1.0","event_id":"sha256:3878d743204e647253c4a53ff62169fb6a38f907542c5f72439cc5b31dbdd320"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/bundle.json","state_url":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/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-30T17:10:38Z","links":{"resolver":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE","bundle":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/bundle.json","state":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NN3AFVYVKHBKKBKFDYDK3L3FBE","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":"5eae53e988fbb0e9458c448def29a202154c6196298ad55580a654a8b685c6d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T18:07:04Z","title_canon_sha256":"ac1554a8b652a9afb2a9fde072cb14b95823d5f2c7a75b55e851097cee0f850a"},"schema_version":"1.0","source":{"id":"1510.00347","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00347","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00347v2","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00347","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"NN3AFVYVKHBK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NN3AFVYVKHBKKBKF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NN3AFVYV","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:3878d743204e647253c4a53ff62169fb6a38f907542c5f72439cc5b31dbdd320","target":"graph","created_at":"2026-05-18T00:18:27Z","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":"A coding theorem and converse are proved for a large class of abstract stationary channels with time structure including the result by Kadota and Wyner (1972) on continuous-time real-valued channels as special cases. As main contribution the coding theorem is proved for a significantly weaker condition on the channel output memory - called total ergodicity w.r.t. finite alphabet block-memoryless input sources - and under a crucial relaxation of the measurability requirement for the channel. These improvements are achieved by introducing a suitable characterization of information rate capacity.","authors_text":"Eduard A. Jorswieck, Martin Mittelbach","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T18:07:04Z","title":"Coding Theorem and Converse for Abstract Channels with Time Structure and Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00347","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:d360b7fd8d3ef2cedea3b62d7cc392cb9f2c2647a21ec8fb65156b4c33ad2e19","target":"record","created_at":"2026-05-18T00:18:27Z","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":"5eae53e988fbb0e9458c448def29a202154c6196298ad55580a654a8b685c6d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T18:07:04Z","title_canon_sha256":"ac1554a8b652a9afb2a9fde072cb14b95823d5f2c7a75b55e851097cee0f850a"},"schema_version":"1.0","source":{"id":"1510.00347","kind":"arxiv","version":2}},"canonical_sha256":"6b7602d71551c2a505451e06adaf65093f9792f1dac995621e150326ddb2a968","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b7602d71551c2a505451e06adaf65093f9792f1dac995621e150326ddb2a968","first_computed_at":"2026-05-18T00:18:27.157224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:27.157224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AuymjC/2q/AmBBf/ueiZGsQ3Iy3hNvA5hEME3xRVgiXlLstJeA7fl2lIyF5UKu/Ss1yBGTYTsZ8iCR4NOr2qDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:27.157799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00347","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d360b7fd8d3ef2cedea3b62d7cc392cb9f2c2647a21ec8fb65156b4c33ad2e19","sha256:3878d743204e647253c4a53ff62169fb6a38f907542c5f72439cc5b31dbdd320"],"state_sha256":"4e93183611f4eb96372f5ee8da18be114c97db9e94b07c1fbf33111024346acc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDc6HwglKV9kCSUCmKhYxA1riotpM0sBjBw/ZRrpGfpAVKRo8NBvkTu4QDdIfFKGooXEIvEBU2dNAf/3FcxEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:10:38.223337Z","bundle_sha256":"41408ea45ecada945410878d2595d18c0ba1bf92afe6b14837876c5158436f2c"}}