{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:OUPZDKQRYYDRSZRKG6ZIU5UYJC","short_pith_number":"pith:OUPZDKQR","canonical_record":{"source":{"id":"0711.3077","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-11-20T07:27:30Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"9f8ae43a35e10f3aa94caa74e0145e0661e8393c7a1fe17fb05507b632beae63","abstract_canon_sha256":"9ef2902be2ce32395c7778b7c89cd43b63c4aacc420fd9b1cb75d35a4306ec4c"},"schema_version":"1.0"},"canonical_sha256":"751f91aa11c60719662a37b28a769848aa8688140851b573c57ed51bb293972a","source":{"kind":"arxiv","id":"0711.3077","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.3077","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0711.3077v3","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.3077","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"OUPZDKQRYYDR","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"OUPZDKQRYYDRSZRK","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"OUPZDKQR","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:OUPZDKQRYYDRSZRKG6ZIU5UYJC","target":"record","payload":{"canonical_record":{"source":{"id":"0711.3077","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-11-20T07:27:30Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"9f8ae43a35e10f3aa94caa74e0145e0661e8393c7a1fe17fb05507b632beae63","abstract_canon_sha256":"9ef2902be2ce32395c7778b7c89cd43b63c4aacc420fd9b1cb75d35a4306ec4c"},"schema_version":"1.0"},"canonical_sha256":"751f91aa11c60719662a37b28a769848aa8688140851b573c57ed51bb293972a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.791293Z","signature_b64":"AdjJ5sKM7NepBREb7TRKR9ZoMzMQD/89pQaUdGQxR+Y9WyYwOF4MMm04DBOlz8ZYVdKemNFcRWO+lWwHkN8fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"751f91aa11c60719662a37b28a769848aa8688140851b573c57ed51bb293972a","last_reissued_at":"2026-05-18T00:58:48.790817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.790817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0711.3077","source_version":3,"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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtWehKF6mQidwDa6S+dq3/eE7nLeLwn0BVAh5MZh0lh6voQE2eNGW7qgtA41oRdjARiE9Lf5l6lBTXezBJ12AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:02:12.094917Z"},"content_sha256":"8271d9566b90a52083ad3d5209cc9f9223d768588e3ab61de0c95f1e0e94456e","schema_version":"1.0","event_id":"sha256:8271d9566b90a52083ad3d5209cc9f9223d768588e3ab61de0c95f1e0e94456e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:OUPZDKQRYYDRSZRKG6ZIU5UYJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Low Complexity Maximum Likelihood Decoding of Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo","submitted_at":"2007-11-20T07:27:30Z","abstract_excerpt":"This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path taken through a Markov graph. Integrated with the Viterbi algorithm (VA), complexity reduction methods such as the sphere decoder often use the sum log likelihood (SLL) of a Markov path as a bound to disprove the optimality of other Markov path sets and to consequently avoid exhaustive path search. In this paper, it is shown that SLL-based optimality tests are inefficient if one fixes the coding memory and takes the codeword length"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.3077","kind":"arxiv","version":3},"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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9J9t+MDXdOiTm62pG3qAeoZbe3YKruOo7RFYAI4fai+g7kHPZaPUSz41VPyhUWz5+tauLIaBL4Uh1+naWe1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:02:12.095575Z"},"content_sha256":"723d79f995416818ec8ac82926ccac685c4571ccfcf216210065d55010539b04","schema_version":"1.0","event_id":"sha256:723d79f995416818ec8ac82926ccac685c4571ccfcf216210065d55010539b04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUPZDKQRYYDRSZRKG6ZIU5UYJC/bundle.json","state_url":"https://pith.science/pith/OUPZDKQRYYDRSZRKG6ZIU5UYJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUPZDKQRYYDRSZRKG6ZIU5UYJC/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-05T01:02:12Z","links":{"resolver":"https://pith.science/pith/OUPZDKQRYYDRSZRKG6ZIU5UYJC","bundle":"https://pith.science/pith/OUPZDKQRYYDRSZRKG6ZIU5UYJC/bundle.json","state":"https://pith.science/pith/OUPZDKQRYYDRSZRKG6ZIU5UYJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUPZDKQRYYDRSZRKG6ZIU5UYJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:OUPZDKQRYYDRSZRKG6ZIU5UYJC","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":"9ef2902be2ce32395c7778b7c89cd43b63c4aacc420fd9b1cb75d35a4306ec4c","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-11-20T07:27:30Z","title_canon_sha256":"9f8ae43a35e10f3aa94caa74e0145e0661e8393c7a1fe17fb05507b632beae63"},"schema_version":"1.0","source":{"id":"0711.3077","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.3077","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0711.3077v3","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.3077","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"OUPZDKQRYYDR","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"OUPZDKQRYYDRSZRK","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"OUPZDKQR","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:723d79f995416818ec8ac82926ccac685c4571ccfcf216210065d55010539b04","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path taken through a Markov graph. Integrated with the Viterbi algorithm (VA), complexity reduction methods such as the sphere decoder often use the sum log likelihood (SLL) of a Markov path as a bound to disprove the optimality of other Markov path sets and to consequently avoid exhaustive path search. In this paper, it is shown that SLL-based optimality tests are inefficient if one fixes the coding memory and takes the codeword length","authors_text":"Jie Luo","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-11-20T07:27:30Z","title":"On Low Complexity Maximum Likelihood Decoding of Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.3077","kind":"arxiv","version":3},"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:8271d9566b90a52083ad3d5209cc9f9223d768588e3ab61de0c95f1e0e94456e","target":"record","created_at":"2026-05-18T00:58:48Z","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":"9ef2902be2ce32395c7778b7c89cd43b63c4aacc420fd9b1cb75d35a4306ec4c","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-11-20T07:27:30Z","title_canon_sha256":"9f8ae43a35e10f3aa94caa74e0145e0661e8393c7a1fe17fb05507b632beae63"},"schema_version":"1.0","source":{"id":"0711.3077","kind":"arxiv","version":3}},"canonical_sha256":"751f91aa11c60719662a37b28a769848aa8688140851b573c57ed51bb293972a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"751f91aa11c60719662a37b28a769848aa8688140851b573c57ed51bb293972a","first_computed_at":"2026-05-18T00:58:48.790817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.790817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AdjJ5sKM7NepBREb7TRKR9ZoMzMQD/89pQaUdGQxR+Y9WyYwOF4MMm04DBOlz8ZYVdKemNFcRWO+lWwHkN8fCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.791293Z","signed_message":"canonical_sha256_bytes"},"source_id":"0711.3077","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8271d9566b90a52083ad3d5209cc9f9223d768588e3ab61de0c95f1e0e94456e","sha256:723d79f995416818ec8ac82926ccac685c4571ccfcf216210065d55010539b04"],"state_sha256":"f11c1adc0c362e1a02da41e21dd74b7be833e899c57cf28be5b939e7ef6cae05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1f5ZbRKU9DFroTx+qJjG+ReogrfTrapqddakzTSXIUyhFwAJHZpdXBFzJeOz3zHVrB/xTxbcCFqGc/fWVWPeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:02:12.100692Z","bundle_sha256":"00ddfffe85ec669c010a7c6e168f10f5da8ed3b9219ced6dc44ce766a5998b8c"}}