{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:TZYGZLSRJYUEJY6GZP6VPNEKN4","short_pith_number":"pith:TZYGZLSR","canonical_record":{"source":{"id":"0704.0361","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-03T10:24:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c3e5a86a9689c5c52a876ec0de6d3e8ab43154233b206f6dbfe102e7137b3350","abstract_canon_sha256":"7980d5a0a3bf7615ec013d03d12bf6fafc042b51acea9d148bd0d0e23a6ee2cb"},"schema_version":"1.0"},"canonical_sha256":"9e706cae514e2844e3c6cbfd57b48a6f0fc4c730c6752fe78345f66f102ff3d8","source":{"kind":"arxiv","id":"0704.0361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.0361","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"0704.0361v1","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.0361","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"TZYGZLSRJYUE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"TZYGZLSRJYUEJY6G","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"TZYGZLSR","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:TZYGZLSRJYUEJY6GZP6VPNEKN4","target":"record","payload":{"canonical_record":{"source":{"id":"0704.0361","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-03T10:24:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c3e5a86a9689c5c52a876ec0de6d3e8ab43154233b206f6dbfe102e7137b3350","abstract_canon_sha256":"7980d5a0a3bf7615ec013d03d12bf6fafc042b51acea9d148bd0d0e23a6ee2cb"},"schema_version":"1.0"},"canonical_sha256":"9e706cae514e2844e3c6cbfd57b48a6f0fc4c730c6752fe78345f66f102ff3d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:02.442756Z","signature_b64":"JyJup6ZWFn+xL/6pm/8hHr53PZm32+obY8kQ2M4ADjVO28l5RCJBTogNRwlQLjqtMnf0+i4SZkxGEqYrDqwTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e706cae514e2844e3c6cbfd57b48a6f0fc4c730c6752fe78345f66f102ff3d8","last_reissued_at":"2026-05-18T00:58:02.442156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:02.442156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0704.0361","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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7BLotKE+2MBdjlMs7VJH+FJFg7hsVXsG/qbOqiKCBAUNuV72x/53gJTht1X06UnSYx7AVKDYTb6unAksuh9gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:35:37.181962Z"},"content_sha256":"1bc95e306a2bc10e73f3fb7469b8129cf458a1d21c08b1d4947ca1d424fe586a","schema_version":"1.0","event_id":"sha256:1bc95e306a2bc10e73f3fb7469b8129cf458a1d21c08b1d4947ca1d424fe586a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:TZYGZLSRJYUEJY6GZP6VPNEKN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ian J. Wassell, Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Rolando Carrasco","submitted_at":"2007-04-03T10:24:38Z","abstract_excerpt":"It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be identified by means of an exhaustive search, whilst convergence towards low bit error probabilities can be problematic when the systematic output of a rate-1/2 partially systematic PCCC is heavily punctured. In this paper, we present and study a family of rate-1/2 partially systematic PCCCs, which we call pseudo-randomly punctured codes. We evaluate their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.0361","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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ip7LUMWo+UoMnB7DqHzZPfZB+VOUsxjQF9Fj0Pdz3wuYbnLKe5NRofgI4R7Cc2SWn5JPJxWZRPWuGfWZZ7/oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:35:37.182618Z"},"content_sha256":"d5d12cffd9e10045c6efc291c3c4b2900882323caae677ac7872e1fd48bdf38a","schema_version":"1.0","event_id":"sha256:d5d12cffd9e10045c6efc291c3c4b2900882323caae677ac7872e1fd48bdf38a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZYGZLSRJYUEJY6GZP6VPNEKN4/bundle.json","state_url":"https://pith.science/pith/TZYGZLSRJYUEJY6GZP6VPNEKN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZYGZLSRJYUEJY6GZP6VPNEKN4/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-28T13:35:37Z","links":{"resolver":"https://pith.science/pith/TZYGZLSRJYUEJY6GZP6VPNEKN4","bundle":"https://pith.science/pith/TZYGZLSRJYUEJY6GZP6VPNEKN4/bundle.json","state":"https://pith.science/pith/TZYGZLSRJYUEJY6GZP6VPNEKN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZYGZLSRJYUEJY6GZP6VPNEKN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:TZYGZLSRJYUEJY6GZP6VPNEKN4","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":"7980d5a0a3bf7615ec013d03d12bf6fafc042b51acea9d148bd0d0e23a6ee2cb","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-03T10:24:38Z","title_canon_sha256":"c3e5a86a9689c5c52a876ec0de6d3e8ab43154233b206f6dbfe102e7137b3350"},"schema_version":"1.0","source":{"id":"0704.0361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.0361","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"0704.0361v1","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.0361","created_at":"2026-05-18T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"TZYGZLSRJYUE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"TZYGZLSRJYUEJY6G","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"TZYGZLSR","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:d5d12cffd9e10045c6efc291c3c4b2900882323caae677ac7872e1fd48bdf38a","target":"graph","created_at":"2026-05-18T00:58:02Z","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":"It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be identified by means of an exhaustive search, whilst convergence towards low bit error probabilities can be problematic when the systematic output of a rate-1/2 partially systematic PCCC is heavily punctured. In this paper, we present and study a family of rate-1/2 partially systematic PCCCs, which we call pseudo-randomly punctured codes. We evaluate their ","authors_text":"Ian J. Wassell, Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Rolando Carrasco","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-04-03T10:24:38Z","title":"Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.0361","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:1bc95e306a2bc10e73f3fb7469b8129cf458a1d21c08b1d4947ca1d424fe586a","target":"record","created_at":"2026-05-18T00:58:02Z","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":"7980d5a0a3bf7615ec013d03d12bf6fafc042b51acea9d148bd0d0e23a6ee2cb","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-03T10:24:38Z","title_canon_sha256":"c3e5a86a9689c5c52a876ec0de6d3e8ab43154233b206f6dbfe102e7137b3350"},"schema_version":"1.0","source":{"id":"0704.0361","kind":"arxiv","version":1}},"canonical_sha256":"9e706cae514e2844e3c6cbfd57b48a6f0fc4c730c6752fe78345f66f102ff3d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e706cae514e2844e3c6cbfd57b48a6f0fc4c730c6752fe78345f66f102ff3d8","first_computed_at":"2026-05-18T00:58:02.442156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:02.442156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JyJup6ZWFn+xL/6pm/8hHr53PZm32+obY8kQ2M4ADjVO28l5RCJBTogNRwlQLjqtMnf0+i4SZkxGEqYrDqwTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:02.442756Z","signed_message":"canonical_sha256_bytes"},"source_id":"0704.0361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bc95e306a2bc10e73f3fb7469b8129cf458a1d21c08b1d4947ca1d424fe586a","sha256:d5d12cffd9e10045c6efc291c3c4b2900882323caae677ac7872e1fd48bdf38a"],"state_sha256":"5d3851dc58aa43fde84c3ec610d84e6f2a2cf79a4f0f7dca917b7be4193c16a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/m9f/gyjtUFFer1UM5tlD+eLlrqfywbFxIt+0GMJPAx3YKt33lg8gFRMH1G12jliI6F2pdDEr3JPnUMFBSReDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:35:37.185932Z","bundle_sha256":"cd8ed52d21a1cf0d7209abb0b80c3ed59d809d4623ade7cd17466200c7bee4d4"}}