{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YT33MEQNYL6CZOUO2DNC6QQUXA","short_pith_number":"pith:YT33MEQN","canonical_record":{"source":{"id":"1903.01120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T08:17:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"890cad74f4425f50092d7850bf21f7d9fa5deec446659fae3cfc635740e69aef","abstract_canon_sha256":"7fe374cf38ecd18993f3f109f5675b081d086087570a28ef321fa7c5c78ce7af"},"schema_version":"1.0"},"canonical_sha256":"c4f7b6120dc2fc2cba8ed0da2f4214b83252ff447500b0660f0e403ed11b211c","source":{"kind":"arxiv","id":"1903.01120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01120","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01120v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01120","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"YT33MEQNYL6C","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YT33MEQNYL6CZOUO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YT33MEQN","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YT33MEQNYL6CZOUO2DNC6QQUXA","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T08:17:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"890cad74f4425f50092d7850bf21f7d9fa5deec446659fae3cfc635740e69aef","abstract_canon_sha256":"7fe374cf38ecd18993f3f109f5675b081d086087570a28ef321fa7c5c78ce7af"},"schema_version":"1.0"},"canonical_sha256":"c4f7b6120dc2fc2cba8ed0da2f4214b83252ff447500b0660f0e403ed11b211c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:12.257288Z","signature_b64":"RBbJixWpYp4WgCRzNbFRa6i02mQlK+K6OGbcWROGIScG69jnu3BPgw/Uma+jF8PLYn3DBXKXJBu68ExAEP00BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4f7b6120dc2fc2cba8ed0da2f4214b83252ff447500b0660f0e403ed11b211c","last_reissued_at":"2026-05-17T23:52:12.256610Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:12.256610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01120","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-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQVorHDFtSxdNz4qpTFgsQqKJEiYiz+FDZgxOQdrHDyY1rUeMhaOT7HPznxBbELwNQCXH0hLqJjALE5XRMmCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:23:53.461507Z"},"content_sha256":"119935eeeeec831d61aacc1bebdd2d39ce1c64637b72e214b63fbd5fc72e932d","schema_version":"1.0","event_id":"sha256:119935eeeeec831d61aacc1bebdd2d39ce1c64637b72e214b63fbd5fc72e932d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YT33MEQNYL6CZOUO2DNC6QQUXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Exponents of Typical Random Trellis Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2019-03-04T08:17:53Z","abstract_excerpt":"In continuation to an earlier work, where error exponents of typical random codes were studied in the context of general block coding, with no underlying structure, here we carry out a parallel study on typical random, time-varying trellis codes for general discrete memoryless channels, focusing on a certain range of low rates. By analyzing an upper bound to the error probability of the typical random trellis code, using the method of types, we first derive a Csiszar-style error exponent formula (with respect to the constraint length), which allows to easily identify and characterize propertie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01120","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-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMMcn30lYXCk34+xAHjwFf/qR8djcRjY7oT6ZkHGCx0fWlXlVoGdyt9tTJKR/TZ5joIM3eF56xsfwW82h+s9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:23:53.462166Z"},"content_sha256":"16de729597b128ac9b4a37f28577b7a17afbd90a96393d262784ccfe87f3b500","schema_version":"1.0","event_id":"sha256:16de729597b128ac9b4a37f28577b7a17afbd90a96393d262784ccfe87f3b500"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YT33MEQNYL6CZOUO2DNC6QQUXA/bundle.json","state_url":"https://pith.science/pith/YT33MEQNYL6CZOUO2DNC6QQUXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YT33MEQNYL6CZOUO2DNC6QQUXA/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-27T18:23:53Z","links":{"resolver":"https://pith.science/pith/YT33MEQNYL6CZOUO2DNC6QQUXA","bundle":"https://pith.science/pith/YT33MEQNYL6CZOUO2DNC6QQUXA/bundle.json","state":"https://pith.science/pith/YT33MEQNYL6CZOUO2DNC6QQUXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YT33MEQNYL6CZOUO2DNC6QQUXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YT33MEQNYL6CZOUO2DNC6QQUXA","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":"7fe374cf38ecd18993f3f109f5675b081d086087570a28ef321fa7c5c78ce7af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T08:17:53Z","title_canon_sha256":"890cad74f4425f50092d7850bf21f7d9fa5deec446659fae3cfc635740e69aef"},"schema_version":"1.0","source":{"id":"1903.01120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01120","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01120v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01120","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"YT33MEQNYL6C","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YT33MEQNYL6CZOUO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YT33MEQN","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:16de729597b128ac9b4a37f28577b7a17afbd90a96393d262784ccfe87f3b500","target":"graph","created_at":"2026-05-17T23:52:12Z","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":"In continuation to an earlier work, where error exponents of typical random codes were studied in the context of general block coding, with no underlying structure, here we carry out a parallel study on typical random, time-varying trellis codes for general discrete memoryless channels, focusing on a certain range of low rates. By analyzing an upper bound to the error probability of the typical random trellis code, using the method of types, we first derive a Csiszar-style error exponent formula (with respect to the constraint length), which allows to easily identify and characterize propertie","authors_text":"Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T08:17:53Z","title":"Error Exponents of Typical Random Trellis Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01120","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:119935eeeeec831d61aacc1bebdd2d39ce1c64637b72e214b63fbd5fc72e932d","target":"record","created_at":"2026-05-17T23:52:12Z","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":"7fe374cf38ecd18993f3f109f5675b081d086087570a28ef321fa7c5c78ce7af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-04T08:17:53Z","title_canon_sha256":"890cad74f4425f50092d7850bf21f7d9fa5deec446659fae3cfc635740e69aef"},"schema_version":"1.0","source":{"id":"1903.01120","kind":"arxiv","version":1}},"canonical_sha256":"c4f7b6120dc2fc2cba8ed0da2f4214b83252ff447500b0660f0e403ed11b211c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4f7b6120dc2fc2cba8ed0da2f4214b83252ff447500b0660f0e403ed11b211c","first_computed_at":"2026-05-17T23:52:12.256610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:12.256610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RBbJixWpYp4WgCRzNbFRa6i02mQlK+K6OGbcWROGIScG69jnu3BPgw/Uma+jF8PLYn3DBXKXJBu68ExAEP00BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:12.257288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:119935eeeeec831d61aacc1bebdd2d39ce1c64637b72e214b63fbd5fc72e932d","sha256:16de729597b128ac9b4a37f28577b7a17afbd90a96393d262784ccfe87f3b500"],"state_sha256":"92016fef4752005323bd63086ca15092f53e9a3860e8ba5b0cabdddc083195e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gX3RQb20CV7WcVwWws3qy5tR2vIeOpLwYyKlPoUmAylvXEPsRpuopQvSLFZpq99nz4YEv8vSR7nERCazljHPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:23:53.465944Z","bundle_sha256":"b172660f619538bd036a02e3c51340e6e489379d3a518df5be7d93aaed1d1178"}}