{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NN3AFVYVKHBKKBKFDYDK3L3FBE","short_pith_number":"pith:NN3AFVYV","schema_version":"1.0","canonical_sha256":"6b7602d71551c2a505451e06adaf65093f9792f1dac995621e150326ddb2a968","source":{"kind":"arxiv","id":"1510.00347","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.00347","created_at":"2026-05-18T00:18:27.157322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00347v2","created_at":"2026-05-18T00:18:27.157322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00347","created_at":"2026-05-18T00:18:27.157322+00:00"},{"alias_kind":"pith_short_12","alias_value":"NN3AFVYVKHBK","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NN3AFVYVKHBKKBKF","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NN3AFVYV","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE","json":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE.json","graph_json":"https://pith.science/api/pith-number/NN3AFVYVKHBKKBKFDYDK3L3FBE/graph.json","events_json":"https://pith.science/api/pith-number/NN3AFVYVKHBKKBKFDYDK3L3FBE/events.json","paper":"https://pith.science/paper/NN3AFVYV"},"agent_actions":{"view_html":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE","download_json":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE.json","view_paper":"https://pith.science/paper/NN3AFVYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00347&json=true","fetch_graph":"https://pith.science/api/pith-number/NN3AFVYVKHBKKBKFDYDK3L3FBE/graph.json","fetch_events":"https://pith.science/api/pith-number/NN3AFVYVKHBKKBKFDYDK3L3FBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/action/storage_attestation","attest_author":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/action/author_attestation","sign_citation":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/action/citation_signature","submit_replication":"https://pith.science/pith/NN3AFVYVKHBKKBKFDYDK3L3FBE/action/replication_record"}},"created_at":"2026-05-18T00:18:27.157322+00:00","updated_at":"2026-05-18T00:18:27.157322+00:00"}