{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:IW5Z47RMKSUZ4HE2BFXH4RGFNZ","short_pith_number":"pith:IW5Z47RM","canonical_record":{"source":{"id":"cs/0701065","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-09T16:32:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e66e37938c6649dc6f45f48889c5cc4e2c5ed0ba6375d740a36e22e0c56683c5","abstract_canon_sha256":"146c21e9730ed69226f8c293f5e2474c95c8bb26deca98b4b10ea19962a89604"},"schema_version":"1.0"},"canonical_sha256":"45bb9e7e2c54a99e1c9a096e7e44c56e44fd3f15dfe92ace4f02b00469fdbe10","source":{"kind":"arxiv","id":"cs/0701065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701065","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701065v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701065","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"IW5Z47RMKSUZ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"IW5Z47RMKSUZ4HE2","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"IW5Z47RM","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:IW5Z47RMKSUZ4HE2BFXH4RGFNZ","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0701065","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-09T16:32:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e66e37938c6649dc6f45f48889c5cc4e2c5ed0ba6375d740a36e22e0c56683c5","abstract_canon_sha256":"146c21e9730ed69226f8c293f5e2474c95c8bb26deca98b4b10ea19962a89604"},"schema_version":"1.0"},"canonical_sha256":"45bb9e7e2c54a99e1c9a096e7e44c56e44fd3f15dfe92ace4f02b00469fdbe10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.556787Z","signature_b64":"ZS6L/PhEfSaN+g6bMgri3WfSnYVzgwzly4Vz2gXTu68hR2uYTppxS1SN5RF5TVsRX/12/FWsHh0tpRk6cDiZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45bb9e7e2c54a99e1c9a096e7e44c56e44fd3f15dfe92ace4f02b00469fdbe10","last_reissued_at":"2026-05-18T00:58:26.556088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.556088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0701065","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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJxwP0yNpoCsDruEh1kZMDtJ6swBFElDpBp/Tn8FW7D0LZ+CTea4Xa7EpsJwU7QMsYjlAhiChKfx3sk1li7UBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:18:03.930079Z"},"content_sha256":"8cc406fcb8a5ea91b27d911dd6414db9a1757b3490c9748f687f5d35b087ad44","schema_version":"1.0","event_id":"sha256:8cc406fcb8a5ea91b27d911dd6414db9a1757b3490c9748f687f5d35b087ad44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:IW5Z47RMKSUZ4HE2BFXH4RGFNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"I. Chatzigeorgiou, I. J. Wassell, M. R. D. Rodrigues, R. Carrasco","submitted_at":"2007-01-09T16:32:59Z","abstract_excerpt":"In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding over an additive white Gaussian channel, we demonstrate that a rate-1/2 non-systematic child code can exhibit a lower error floor than that of its rate-1/3 parent code, if a particular condition is met. However, assuming iterative decoding, convergence of the non-systematic code towards low bit-error rates is problematic. To alleviate this problem, we propose rate-1/2 partially-systematic codes that can still achieve a lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701065","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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+EqSVnIiXBp32KChm/ybYEynngUEw4Qui3t9EbqOMpZkDr6IVKys95kLISw5TXKrGemEKWMXWK9IAHLtwXQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:18:03.930471Z"},"content_sha256":"6d24c75d1ee39a07a1035009955c706273909808bdc944897e9a6846ced854fc","schema_version":"1.0","event_id":"sha256:6d24c75d1ee39a07a1035009955c706273909808bdc944897e9a6846ced854fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IW5Z47RMKSUZ4HE2BFXH4RGFNZ/bundle.json","state_url":"https://pith.science/pith/IW5Z47RMKSUZ4HE2BFXH4RGFNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IW5Z47RMKSUZ4HE2BFXH4RGFNZ/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-06T13:18:03Z","links":{"resolver":"https://pith.science/pith/IW5Z47RMKSUZ4HE2BFXH4RGFNZ","bundle":"https://pith.science/pith/IW5Z47RMKSUZ4HE2BFXH4RGFNZ/bundle.json","state":"https://pith.science/pith/IW5Z47RMKSUZ4HE2BFXH4RGFNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IW5Z47RMKSUZ4HE2BFXH4RGFNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:IW5Z47RMKSUZ4HE2BFXH4RGFNZ","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":"146c21e9730ed69226f8c293f5e2474c95c8bb26deca98b4b10ea19962a89604","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-09T16:32:59Z","title_canon_sha256":"e66e37938c6649dc6f45f48889c5cc4e2c5ed0ba6375d740a36e22e0c56683c5"},"schema_version":"1.0","source":{"id":"cs/0701065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701065","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701065v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701065","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"IW5Z47RMKSUZ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"IW5Z47RMKSUZ4HE2","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"IW5Z47RM","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:6d24c75d1ee39a07a1035009955c706273909808bdc944897e9a6846ced854fc","target":"graph","created_at":"2026-05-18T00:58:26Z","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 this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding over an additive white Gaussian channel, we demonstrate that a rate-1/2 non-systematic child code can exhibit a lower error floor than that of its rate-1/3 parent code, if a particular condition is met. However, assuming iterative decoding, convergence of the non-systematic code towards low bit-error rates is problematic. To alleviate this problem, we propose rate-1/2 partially-systematic codes that can still achieve a lowe","authors_text":"I. Chatzigeorgiou, I. J. Wassell, M. R. D. Rodrigues, R. Carrasco","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-01-09T16:32:59Z","title":"Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701065","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:8cc406fcb8a5ea91b27d911dd6414db9a1757b3490c9748f687f5d35b087ad44","target":"record","created_at":"2026-05-18T00:58:26Z","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":"146c21e9730ed69226f8c293f5e2474c95c8bb26deca98b4b10ea19962a89604","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-09T16:32:59Z","title_canon_sha256":"e66e37938c6649dc6f45f48889c5cc4e2c5ed0ba6375d740a36e22e0c56683c5"},"schema_version":"1.0","source":{"id":"cs/0701065","kind":"arxiv","version":1}},"canonical_sha256":"45bb9e7e2c54a99e1c9a096e7e44c56e44fd3f15dfe92ace4f02b00469fdbe10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45bb9e7e2c54a99e1c9a096e7e44c56e44fd3f15dfe92ace4f02b00469fdbe10","first_computed_at":"2026-05-18T00:58:26.556088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.556088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZS6L/PhEfSaN+g6bMgri3WfSnYVzgwzly4Vz2gXTu68hR2uYTppxS1SN5RF5TVsRX/12/FWsHh0tpRk6cDiZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.556787Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0701065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cc406fcb8a5ea91b27d911dd6414db9a1757b3490c9748f687f5d35b087ad44","sha256:6d24c75d1ee39a07a1035009955c706273909808bdc944897e9a6846ced854fc"],"state_sha256":"ff4550f49270daf771d56eeef666516a439036b08374e59782f39fd4da05a4f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXlDn38YPga28Ssy/74iOej9Pb82sGtgYkp8bxKZbf6U/BaRcJdEg6W7JgPp7KDDmLSWUe8Vxw7eVCMVCtTIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:18:03.934296Z","bundle_sha256":"3372cdb44ae53519cbb4531d871d8dd75182bbf66bbdca75faf51c228cf012fd"}}