{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:RD6O6X3N5KCBVUJIF57GQCSBTV","short_pith_number":"pith:RD6O6X3N","canonical_record":{"source":{"id":"cs/0701006","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-12-30T23:39:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4aa83236a9ed67eef345f363eaef86a89cb3b5b992bb020d83eefd24c7e6c654","abstract_canon_sha256":"dddc55c8b81771c219ba2fa0aa57b489dd88e7cfc56a267793e060f6a3bed737"},"schema_version":"1.0"},"canonical_sha256":"88fcef5f6dea841ad1282f7e680a419d5499e37f1746e1cc61e1a4278aac94c5","source":{"kind":"arxiv","id":"cs/0701006","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701006","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701006v3","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701006","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"RD6O6X3N5KCB","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"RD6O6X3N5KCBVUJI","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"RD6O6X3N","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:RD6O6X3N5KCBVUJIF57GQCSBTV","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0701006","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-12-30T23:39:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4aa83236a9ed67eef345f363eaef86a89cb3b5b992bb020d83eefd24c7e6c654","abstract_canon_sha256":"dddc55c8b81771c219ba2fa0aa57b489dd88e7cfc56a267793e060f6a3bed737"},"schema_version":"1.0"},"canonical_sha256":"88fcef5f6dea841ad1282f7e680a419d5499e37f1746e1cc61e1a4278aac94c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.580915Z","signature_b64":"OsGhoTpS7ztAITvuv6An5kgmYENNE9HiVaeBoqJFOxlSLCOZxKXO0hRXAjsjm8HMK7wM5XssxJo0O0gZ0kXIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88fcef5f6dea841ad1282f7e680a419d5499e37f1746e1cc61e1a4278aac94c5","last_reissued_at":"2026-05-18T00:58:26.580226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.580226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0701006","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFSZoaKvCxsuqzCaXQGX7exsoxTxbSDaPSpHQCw2vTMJCOnF7PQzA7KaaLrvCUT0GMZxAxy5TjBMRnNwxcPIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:10:08.408215Z"},"content_sha256":"31ea5630d2468a5832b9f21eb5068a91714c66a89023d3c30fce479e7109c363","schema_version":"1.0","event_id":"sha256:31ea5630d2468a5832b9f21eb5068a91714c66a89023d3c30fce479e7109c363"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:RD6O6X3N5KCBVUJIF57GQCSBTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Trapping Redundancy of Linear Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johannes B. Huber, Olgica Milenkovic, Stefan Laendner, Thorsten Hehn","submitted_at":"2006-12-30T23:39:23Z","abstract_excerpt":"We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of its smallest trapping set. Trapping sets with certain parameter sizes are known to cause error-floors in the performance curves of iterative belief propagation decoders, and it is therefore important to identify decoding matrices that avoid such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701006","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzD6BnBijisk5GySoVMwe6Va8cBPb9J8uFkB+wqBpDe2kXXnJnFnGFh4qrPGJKpGfn1n17rzA0T00Mtp+bRoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:10:08.408580Z"},"content_sha256":"b1f96cfdadfabddefff0ebffff2c07b8d75d1eaf8752188cb66023e4774e97e0","schema_version":"1.0","event_id":"sha256:b1f96cfdadfabddefff0ebffff2c07b8d75d1eaf8752188cb66023e4774e97e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RD6O6X3N5KCBVUJIF57GQCSBTV/bundle.json","state_url":"https://pith.science/pith/RD6O6X3N5KCBVUJIF57GQCSBTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RD6O6X3N5KCBVUJIF57GQCSBTV/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-25T12:10:08Z","links":{"resolver":"https://pith.science/pith/RD6O6X3N5KCBVUJIF57GQCSBTV","bundle":"https://pith.science/pith/RD6O6X3N5KCBVUJIF57GQCSBTV/bundle.json","state":"https://pith.science/pith/RD6O6X3N5KCBVUJIF57GQCSBTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RD6O6X3N5KCBVUJIF57GQCSBTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:RD6O6X3N5KCBVUJIF57GQCSBTV","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":"dddc55c8b81771c219ba2fa0aa57b489dd88e7cfc56a267793e060f6a3bed737","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-12-30T23:39:23Z","title_canon_sha256":"4aa83236a9ed67eef345f363eaef86a89cb3b5b992bb020d83eefd24c7e6c654"},"schema_version":"1.0","source":{"id":"cs/0701006","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701006","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701006v3","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701006","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"RD6O6X3N5KCB","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"RD6O6X3N5KCBVUJI","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"RD6O6X3N","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:b1f96cfdadfabddefff0ebffff2c07b8d75d1eaf8752188cb66023e4774e97e0","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":"We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of its smallest trapping set. Trapping sets with certain parameter sizes are known to cause error-floors in the performance curves of iterative belief propagation decoders, and it is therefore important to identify decoding matrices that avoid such","authors_text":"Johannes B. Huber, Olgica Milenkovic, Stefan Laendner, Thorsten Hehn","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-12-30T23:39:23Z","title":"The Trapping Redundancy of Linear Block Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701006","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:31ea5630d2468a5832b9f21eb5068a91714c66a89023d3c30fce479e7109c363","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":"dddc55c8b81771c219ba2fa0aa57b489dd88e7cfc56a267793e060f6a3bed737","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2006-12-30T23:39:23Z","title_canon_sha256":"4aa83236a9ed67eef345f363eaef86a89cb3b5b992bb020d83eefd24c7e6c654"},"schema_version":"1.0","source":{"id":"cs/0701006","kind":"arxiv","version":3}},"canonical_sha256":"88fcef5f6dea841ad1282f7e680a419d5499e37f1746e1cc61e1a4278aac94c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88fcef5f6dea841ad1282f7e680a419d5499e37f1746e1cc61e1a4278aac94c5","first_computed_at":"2026-05-18T00:58:26.580226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.580226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OsGhoTpS7ztAITvuv6An5kgmYENNE9HiVaeBoqJFOxlSLCOZxKXO0hRXAjsjm8HMK7wM5XssxJo0O0gZ0kXIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.580915Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0701006","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31ea5630d2468a5832b9f21eb5068a91714c66a89023d3c30fce479e7109c363","sha256:b1f96cfdadfabddefff0ebffff2c07b8d75d1eaf8752188cb66023e4774e97e0"],"state_sha256":"b0c854038ca2bd92f3e808ec9cec818f402e548b02773739123ce62591fa1f41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9lMD+LozHi5MlZyvjE9I4YzoQsaBrGwaTdh3Izi1+jV5JdJAz6ijFWvtopIadlMbCUPIUyHv9gQzlSyldlwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:10:08.410509Z","bundle_sha256":"1bdcf3006b6d8aa238a67889fc91476c16af108537cdc561eb18891145f31b3f"}}