{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZWZWRC7H3P7VXUNQGSP5PXMI63","short_pith_number":"pith:ZWZWRC7H","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"},"canonical_sha256":"cdb3688be7dbff5bd1b0349fd7dd88f6d898af61aa42b8b5d9d52bc9431d8874","source":{"kind":"arxiv","id":"1103.1559","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1559","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1559v4","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1559","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZWZWRC7H3P7V","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZWZWRC7H3P7VXUNQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZWZWRC7H","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZWZWRC7H3P7VXUNQGSP5PXMI63","target":"record","payload":{"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"},"canonical_sha256":"cdb3688be7dbff5bd1b0349fd7dd88f6d898af61aa42b8b5d9d52bc9431d8874","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"},"source_kind":"arxiv","source_id":"1103.1559","source_version":4,"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lv/W7cgsKaS0nuCAdO+Wr2ANm49oJ67GjAbKk9A86/QynfgfxsAOU6RHcQfVCmUEFu3YzUL2qh7Y4TnfuIR0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:11:06.135036Z"},"content_sha256":"d6be58ac9196adc050af7489973bf6ddce5163f51d255eca41f2ac9a7c975403","schema_version":"1.0","event_id":"sha256:d6be58ac9196adc050af7489973bf6ddce5163f51d255eca41f2ac9a7c975403"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZWZWRC7H3P7VXUNQGSP5PXMI63","target":"graph","payload":{"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"},"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jj9LkIBl6yFPFjgWAB4Pq2sdF08BQBxXEJuk/XfkYCeaPIZj2awJ94e16mgNRYHYAE1v1PuWSCrMue5AScbdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:11:06.135635Z"},"content_sha256":"747ed2ca96b7cd1bb69a81694cdc296344e702b89417dd70b99b3e23f2c94f42","schema_version":"1.0","event_id":"sha256:747ed2ca96b7cd1bb69a81694cdc296344e702b89417dd70b99b3e23f2c94f42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/bundle.json","state_url":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/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-28T04:11:06Z","links":{"resolver":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63","bundle":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/bundle.json","state":"https://pith.science/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWZWRC7H3P7VXUNQGSP5PXMI63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZWZWRC7H3P7VXUNQGSP5PXMI63","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":"43d95e9a7f69aef20464e409f1294a76382c375e339f5a69c91389f89a5de5d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T15:26:21Z","title_canon_sha256":"7c53e1057409807e1881090679af710e821a00aa2ac4bd8b9a0c292ebf9d5aac"},"schema_version":"1.0","source":{"id":"1103.1559","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1559","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1559v4","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1559","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZWZWRC7H3P7V","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZWZWRC7H3P7VXUNQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZWZWRC7H","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:747ed2ca96b7cd1bb69a81694cdc296344e702b89417dd70b99b3e23f2c94f42","target":"graph","created_at":"2026-05-18T00:58:43Z","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 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","authors_text":"Alexandre Graell i Amat, Eirik Rosnes, Michael Helmling","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T15:26:21Z","title":"Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1559","kind":"arxiv","version":4},"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:d6be58ac9196adc050af7489973bf6ddce5163f51d255eca41f2ac9a7c975403","target":"record","created_at":"2026-05-18T00:58:43Z","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":"43d95e9a7f69aef20464e409f1294a76382c375e339f5a69c91389f89a5de5d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T15:26:21Z","title_canon_sha256":"7c53e1057409807e1881090679af710e821a00aa2ac4bd8b9a0c292ebf9d5aac"},"schema_version":"1.0","source":{"id":"1103.1559","kind":"arxiv","version":4}},"canonical_sha256":"cdb3688be7dbff5bd1b0349fd7dd88f6d898af61aa42b8b5d9d52bc9431d8874","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdb3688be7dbff5bd1b0349fd7dd88f6d898af61aa42b8b5d9d52bc9431d8874","first_computed_at":"2026-05-18T00:58:43.587487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.587487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6d7r3pZGC2VAmsTfoeoPXxhZi7+2t5zIlrMdAwPOBmPYM4LXNAPW/lp7HvVjECm1OxTPMAIOOIcPc/X0o8SDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.588004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1559","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6be58ac9196adc050af7489973bf6ddce5163f51d255eca41f2ac9a7c975403","sha256:747ed2ca96b7cd1bb69a81694cdc296344e702b89417dd70b99b3e23f2c94f42"],"state_sha256":"d2e18490aaf1f7c35171c4581343ac93739b0fd26a375ea1c28d2754212afef3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/wh3lQePO/66dP/8LDGbf0gdadJs9AIu5K2eaKOquiLp5I11ZOFgV3hXq9YsAlXprbmtBfRpN5nCw7c/To6fDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:11:06.138530Z","bundle_sha256":"8bde964a2d9ab377f17d4e6a68205fee3744135cab9a13e7ea09542c564cdeca"}}