{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZWZWRC7H3P7VXUNQGSP5PXMI63","short_pith_number":"pith:ZWZWRC7H","schema_version":"1.0","canonical_sha256":"cdb3688be7dbff5bd1b0349fd7dd88f6d898af61aa42b8b5d9d52bc9431d8874","source":{"kind":"arxiv","id":"1103.1559","version":4},"attestation_state":"computed","paper":{"title":"Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Michael Helmling","submitted_at":"2011-03-08T15:26:21Z","abstract_excerpt":"In this work, we consider pseudocodewords of (relaxed) linear programming (LP) decoding of 3-dimensional turbo codes (3D-TCs). We present a relaxed LP decoder for 3D-TCs, adapting the relaxed LP decoder for conventional turbo codes proposed by Feldman in his thesis. We show that the 3D-TC polytope is proper and $C$-symmetric, and make a connection to finite graph covers of the 3D-TC factor graph. This connection is used to show that the support set of any pseudocodeword is a stopping set of iterative decoding of 3D-TCs using maximum a posteriori constituent decoders on the binary erasure chann"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1103.1559","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T15:26:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c53e1057409807e1881090679af710e821a00aa2ac4bd8b9a0c292ebf9d5aac","abstract_canon_sha256":"43d95e9a7f69aef20464e409f1294a76382c375e339f5a69c91389f89a5de5d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.588004Z","signature_b64":"6d7r3pZGC2VAmsTfoeoPXxhZi7+2t5zIlrMdAwPOBmPYM4LXNAPW/lp7HvVjECm1OxTPMAIOOIcPc/X0o8SDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdb3688be7dbff5bd1b0349fd7dd88f6d898af61aa42b8b5d9d52bc9431d8874","last_reissued_at":"2026-05-18T00:58:43.587487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.587487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Michael Helmling","submitted_at":"2011-03-08T15:26:21Z","abstract_excerpt":"In this work, we consider pseudocodewords of (relaxed) linear programming (LP) decoding of 3-dimensional turbo codes (3D-TCs). We present a relaxed LP decoder for 3D-TCs, adapting the relaxed LP decoder for conventional turbo codes proposed by Feldman in his thesis. We show that the 3D-TC polytope is proper and $C$-symmetric, and make a connection to finite graph covers of the 3D-TC factor graph. This connection is used to show that the support set of any pseudocodeword is a stopping set of iterative decoding of 3D-TCs using maximum a posteriori constituent decoders on the binary erasure chann"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1559","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.1559","created_at":"2026-05-18T00:58:43.587561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1559v4","created_at":"2026-05-18T00:58:43.587561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1559","created_at":"2026-05-18T00:58:43.587561+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWZWRC7H3P7V","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWZWRC7H3P7VXUNQ","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWZWRC7H","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63","json":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63.json","graph_json":"https://pith.science/api/pith-number/ZWZWRC7H3P7VXUNQGSP5PXMI63/graph.json","events_json":"https://pith.science/api/pith-number/ZWZWRC7H3P7VXUNQGSP5PXMI63/events.json","paper":"https://pith.science/paper/ZWZWRC7H"},"agent_actions":{"view_html":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63","download_json":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63.json","view_paper":"https://pith.science/paper/ZWZWRC7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1559&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWZWRC7H3P7VXUNQGSP5PXMI63/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWZWRC7H3P7VXUNQGSP5PXMI63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/action/storage_attestation","attest_author":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/action/author_attestation","sign_citation":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/action/citation_signature","submit_replication":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/action/replication_record"}},"created_at":"2026-05-18T00:58:43.587561+00:00","updated_at":"2026-05-18T00:58:43.587561+00:00"}