{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LJFPMV5YJ54S3GRVXAP4NHJSLT","short_pith_number":"pith:LJFPMV5Y","canonical_record":{"source":{"id":"1312.1024","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-04T05:19:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13595c6ef894f86f6607563f2d4430adc8d70c9b00d99780720875fc53995cb5","abstract_canon_sha256":"d7966c56beaaa4e0a87ac01becc283f3145f499279d33ce4e87f22c166b20081"},"schema_version":"1.0"},"canonical_sha256":"5a4af657b84f792d9a35b81fc69d325cdee3b30bd9028e2ddabbaaf9a9f7525f","source":{"kind":"arxiv","id":"1312.1024","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1024","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1024v2","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1024","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"LJFPMV5YJ54S","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LJFPMV5YJ54S3GRV","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LJFPMV5Y","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LJFPMV5YJ54S3GRVXAP4NHJSLT","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1024","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-04T05:19:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13595c6ef894f86f6607563f2d4430adc8d70c9b00d99780720875fc53995cb5","abstract_canon_sha256":"d7966c56beaaa4e0a87ac01becc283f3145f499279d33ce4e87f22c166b20081"},"schema_version":"1.0"},"canonical_sha256":"5a4af657b84f792d9a35b81fc69d325cdee3b30bd9028e2ddabbaaf9a9f7525f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.481518Z","signature_b64":"0375AAPlT/AwD0b1/WuBAVzmeYlKIqwWdWwqewsVmTwoS5nTRC0o/jFV/Kahv+tcLCTwkTIRqCPJmOqKq48pAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a4af657b84f792d9a35b81fc69d325cdee3b30bd9028e2ddabbaaf9a9f7525f","last_reissued_at":"2026-05-18T00:57:52.480821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.480821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1024","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:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KiQkTVg3FKBd4eqkClehqdIoXxfX7Wpr7PBnc15QnbBLmGO6L80xa9h8YNhtRcJg4IcLbl0G0ANktFy5uBxHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:21.003250Z"},"content_sha256":"3988aac59bd23e4b2d2d04bd1e2e263405c89c26f0229d97fbd1600fd33ecbff","schema_version":"1.0","event_id":"sha256:3988aac59bd23e4b2d2d04bd1e2e263405c89c26f0229d97fbd1600fd33ecbff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LJFPMV5YJ54S3GRVXAP4NHJSLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliability-output Decoding of Tail-biting Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adam R. Williamson, Matthew J. Marshall, Richard D. Wesel","submitted_at":"2013-12-04T05:19:01Z","abstract_excerpt":"We present extensions to Raghavan and Baum's reliability-output Viterbi algorithm (ROVA) to accommodate tail-biting convolutional codes. These tail-biting reliability-output algorithms compute the exact word-error probability of the decoded codeword after first calculating the posterior probability of the decoded tail-biting codeword's starting state. One approach employs a state-estimation algorithm that selects the maximum a posteriori state based on the posterior distribution of the starting states. Another approach is an approximation to the exact tail-biting ROVA that estimates the word-e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1024","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:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rg07ZzBaMzyuZJSZT9bhS7NTsD2KBNGkL6TkI6y8WencA8rgpJ1woiITRuA8Ial+szWBBvrCF7GsNKtXsaJeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:21.003890Z"},"content_sha256":"598cd3c649694a4b351529b19dbfd8977d79911709ca536be07a04b42717bd08","schema_version":"1.0","event_id":"sha256:598cd3c649694a4b351529b19dbfd8977d79911709ca536be07a04b42717bd08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJFPMV5YJ54S3GRVXAP4NHJSLT/bundle.json","state_url":"https://pith.science/pith/LJFPMV5YJ54S3GRVXAP4NHJSLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJFPMV5YJ54S3GRVXAP4NHJSLT/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-26T06:51:21Z","links":{"resolver":"https://pith.science/pith/LJFPMV5YJ54S3GRVXAP4NHJSLT","bundle":"https://pith.science/pith/LJFPMV5YJ54S3GRVXAP4NHJSLT/bundle.json","state":"https://pith.science/pith/LJFPMV5YJ54S3GRVXAP4NHJSLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJFPMV5YJ54S3GRVXAP4NHJSLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LJFPMV5YJ54S3GRVXAP4NHJSLT","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":"d7966c56beaaa4e0a87ac01becc283f3145f499279d33ce4e87f22c166b20081","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-04T05:19:01Z","title_canon_sha256":"13595c6ef894f86f6607563f2d4430adc8d70c9b00d99780720875fc53995cb5"},"schema_version":"1.0","source":{"id":"1312.1024","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1024","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1024v2","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1024","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"LJFPMV5YJ54S","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LJFPMV5YJ54S3GRV","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LJFPMV5Y","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:598cd3c649694a4b351529b19dbfd8977d79911709ca536be07a04b42717bd08","target":"graph","created_at":"2026-05-18T00:57:52Z","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 present extensions to Raghavan and Baum's reliability-output Viterbi algorithm (ROVA) to accommodate tail-biting convolutional codes. These tail-biting reliability-output algorithms compute the exact word-error probability of the decoded codeword after first calculating the posterior probability of the decoded tail-biting codeword's starting state. One approach employs a state-estimation algorithm that selects the maximum a posteriori state based on the posterior distribution of the starting states. Another approach is an approximation to the exact tail-biting ROVA that estimates the word-e","authors_text":"Adam R. Williamson, Matthew J. Marshall, Richard D. Wesel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-04T05:19:01Z","title":"Reliability-output Decoding of Tail-biting Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1024","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:3988aac59bd23e4b2d2d04bd1e2e263405c89c26f0229d97fbd1600fd33ecbff","target":"record","created_at":"2026-05-18T00:57:52Z","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":"d7966c56beaaa4e0a87ac01becc283f3145f499279d33ce4e87f22c166b20081","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-04T05:19:01Z","title_canon_sha256":"13595c6ef894f86f6607563f2d4430adc8d70c9b00d99780720875fc53995cb5"},"schema_version":"1.0","source":{"id":"1312.1024","kind":"arxiv","version":2}},"canonical_sha256":"5a4af657b84f792d9a35b81fc69d325cdee3b30bd9028e2ddabbaaf9a9f7525f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a4af657b84f792d9a35b81fc69d325cdee3b30bd9028e2ddabbaaf9a9f7525f","first_computed_at":"2026-05-18T00:57:52.480821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:52.480821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0375AAPlT/AwD0b1/WuBAVzmeYlKIqwWdWwqewsVmTwoS5nTRC0o/jFV/Kahv+tcLCTwkTIRqCPJmOqKq48pAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:52.481518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1024","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3988aac59bd23e4b2d2d04bd1e2e263405c89c26f0229d97fbd1600fd33ecbff","sha256:598cd3c649694a4b351529b19dbfd8977d79911709ca536be07a04b42717bd08"],"state_sha256":"f6c53ebf298793516b8673afe4567de1fdb6cce361c4643d418879d9e1a603f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAEqcUPp1rAUI2vQU47FHCGwl5Xi5Eur8dzCV3r/217dn5QFFs5MdzgvhHwbSIjvdVqGHcJjXsoxf9UGL2pZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:51:21.006777Z","bundle_sha256":"b5de53c4bc977b0a31a8e63cc320d4c13d1a4ee27dfd880e19a5dee14553fcdb"}}