{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CSPS6XM44VBYDZ2GYNC62MCJJS","short_pith_number":"pith:CSPS6XM4","canonical_record":{"source":{"id":"1111.3820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T14:38:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a9fc5ab35875d5c59bbd91743a8fad404a2fcea0b1289589ea7ca99ce3a249ad","abstract_canon_sha256":"af9c3531b1f9545c21e8a01ccdf56e377fe67e7129638e8e85a16ec126f6f9d6"},"schema_version":"1.0"},"canonical_sha256":"149f2f5d9ce54381e746c345ed30494ca333a2b10e91285bcfcabb2c1cfae1ac","source":{"kind":"arxiv","id":"1111.3820","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3820","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3820v2","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3820","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"CSPS6XM44VBY","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CSPS6XM44VBYDZ2G","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CSPS6XM4","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CSPS6XM44VBYDZ2GYNC62MCJJS","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T14:38:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a9fc5ab35875d5c59bbd91743a8fad404a2fcea0b1289589ea7ca99ce3a249ad","abstract_canon_sha256":"af9c3531b1f9545c21e8a01ccdf56e377fe67e7129638e8e85a16ec126f6f9d6"},"schema_version":"1.0"},"canonical_sha256":"149f2f5d9ce54381e746c345ed30494ca333a2b10e91285bcfcabb2c1cfae1ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:34.492251Z","signature_b64":"gRF0KClNfVux38lXy927KgkvZGzO8g7+xV9vUZUdzJaME6uJmzZ3R7ztrA+Y7GJD2Oo45ynrxQhOujdAZV/tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"149f2f5d9ce54381e746c345ed30494ca333a2b10e91285bcfcabb2c1cfae1ac","last_reissued_at":"2026-05-18T02:21:34.491735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:34.491735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3820","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:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXTqYj3FKT9GwJMfTalnY5wcijgyZt7JlRxTgvQQLBhzMvODOHZJ3Dx6qLduRTC5CW+3rbf24uaerV4Qt8BWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:45:20.750052Z"},"content_sha256":"b3271bd287e5ad5b78125e2f13d5187fde45ad7903402a2dac783113306c0ded","schema_version":"1.0","event_id":"sha256:b3271bd287e5ad5b78125e2f13d5187fde45ad7903402a2dac783113306c0ded"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CSPS6XM44VBYDZ2GYNC62MCJJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boris D. Kudryashov, Florian Hug, Irina E. Bocharova, Rolf Johannesson","submitted_at":"2011-11-16T14:38:21Z","abstract_excerpt":"In 1995, Best et al. published a formula for the exact bit error probability for Viterbi decoding of the rate R=1/2, memory m=1 (2-state) convolutional encoder with generator matrix G(D)=(1 1+D) when used to communicate over the binary symmetric channel. Their formula was later extended to the rate R=1/2, memory m=2 (4-state) convolutional encoder with generator matrix G(D)=(1+D^2 1+D+D^2) by Lentmaier et al.\n  In this paper, a different approach to derive the exact bit error probability is described. A general recurrent matrix equation, connecting the average information weight at the current"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3820","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:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zf3zjrTsPkXyB9Wj1v2Kp9LtFI9Q0T87x/8E0/JH0tJEPD5osN7CudLE4RNxLuz/V/2sBF0l/5hS9CGhwCMADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:45:20.750408Z"},"content_sha256":"b2b86f8054c4eab425200f0e858670eb7728a1d2fe64cf70787176d720e82a55","schema_version":"1.0","event_id":"sha256:b2b86f8054c4eab425200f0e858670eb7728a1d2fe64cf70787176d720e82a55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/bundle.json","state_url":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/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-02T06:45:20Z","links":{"resolver":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS","bundle":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/bundle.json","state":"https://pith.science/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSPS6XM44VBYDZ2GYNC62MCJJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CSPS6XM44VBYDZ2GYNC62MCJJS","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":"af9c3531b1f9545c21e8a01ccdf56e377fe67e7129638e8e85a16ec126f6f9d6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T14:38:21Z","title_canon_sha256":"a9fc5ab35875d5c59bbd91743a8fad404a2fcea0b1289589ea7ca99ce3a249ad"},"schema_version":"1.0","source":{"id":"1111.3820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3820","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3820v2","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3820","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"CSPS6XM44VBY","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CSPS6XM44VBYDZ2G","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CSPS6XM4","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:b2b86f8054c4eab425200f0e858670eb7728a1d2fe64cf70787176d720e82a55","target":"graph","created_at":"2026-05-18T02:21:34Z","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 1995, Best et al. published a formula for the exact bit error probability for Viterbi decoding of the rate R=1/2, memory m=1 (2-state) convolutional encoder with generator matrix G(D)=(1 1+D) when used to communicate over the binary symmetric channel. Their formula was later extended to the rate R=1/2, memory m=2 (4-state) convolutional encoder with generator matrix G(D)=(1+D^2 1+D+D^2) by Lentmaier et al.\n  In this paper, a different approach to derive the exact bit error probability is described. A general recurrent matrix equation, connecting the average information weight at the current","authors_text":"Boris D. Kudryashov, Florian Hug, Irina E. Bocharova, Rolf Johannesson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T14:38:21Z","title":"A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3820","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:b3271bd287e5ad5b78125e2f13d5187fde45ad7903402a2dac783113306c0ded","target":"record","created_at":"2026-05-18T02:21:34Z","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":"af9c3531b1f9545c21e8a01ccdf56e377fe67e7129638e8e85a16ec126f6f9d6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T14:38:21Z","title_canon_sha256":"a9fc5ab35875d5c59bbd91743a8fad404a2fcea0b1289589ea7ca99ce3a249ad"},"schema_version":"1.0","source":{"id":"1111.3820","kind":"arxiv","version":2}},"canonical_sha256":"149f2f5d9ce54381e746c345ed30494ca333a2b10e91285bcfcabb2c1cfae1ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"149f2f5d9ce54381e746c345ed30494ca333a2b10e91285bcfcabb2c1cfae1ac","first_computed_at":"2026-05-18T02:21:34.491735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:34.491735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gRF0KClNfVux38lXy927KgkvZGzO8g7+xV9vUZUdzJaME6uJmzZ3R7ztrA+Y7GJD2Oo45ynrxQhOujdAZV/tCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:34.492251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3271bd287e5ad5b78125e2f13d5187fde45ad7903402a2dac783113306c0ded","sha256:b2b86f8054c4eab425200f0e858670eb7728a1d2fe64cf70787176d720e82a55"],"state_sha256":"7199ce77134f4f6dda9322bf85106235f681de29f4d94da35c13abc978f90a42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNc4VJfDJYnzOJtNu1vYNqRamev/MBUJnZ1zHCbCUmaYXmPttBvPSapjb22vxMAOIc4Kb+Rw+XeoexQ6NIq8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:45:20.752545Z","bundle_sha256":"5a671b4a330a26d280a193db824263c5094e5cd6211db06bf3a18288e73877da"}}