{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:MXJT63LTBOONZHAQL6NXFYEUQJ","short_pith_number":"pith:MXJT63LT","canonical_record":{"source":{"id":"0805.2427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-16T00:50:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25cb5517494464f761a6dec17d0da5777c10656621793925279f41577d84c357","abstract_canon_sha256":"34e6c56d535c09225528a2270db59b8a11a820b44eb1914bbc31150cb24904a5"},"schema_version":"1.0"},"canonical_sha256":"65d33f6d730b9cdc9c105f9b72e09482617bfd4af6a74bd8cb8160e64f6de880","source":{"kind":"arxiv","id":"0805.2427","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.2427","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0805.2427v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.2427","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"MXJT63LTBOON","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MXJT63LTBOONZHAQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MXJT63LT","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:MXJT63LTBOONZHAQL6NXFYEUQJ","target":"record","payload":{"canonical_record":{"source":{"id":"0805.2427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-16T00:50:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25cb5517494464f761a6dec17d0da5777c10656621793925279f41577d84c357","abstract_canon_sha256":"34e6c56d535c09225528a2270db59b8a11a820b44eb1914bbc31150cb24904a5"},"schema_version":"1.0"},"canonical_sha256":"65d33f6d730b9cdc9c105f9b72e09482617bfd4af6a74bd8cb8160e64f6de880","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.613675Z","signature_b64":"KwM6Jhbkuk29OonXI7lh2Xs1CabHpGHQDC0YgCULhcBehfq6G5hPlc4ueuMimlDSHtZK960d8Ocow5bmnV8IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65d33f6d730b9cdc9c105f9b72e09482617bfd4af6a74bd8cb8160e64f6de880","last_reissued_at":"2026-05-18T00:58:25.613079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.613079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0805.2427","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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8IlYPR6KTnRFCu17yTzmV7PtNfiLpulDlqA3dKkc3FGn2YVrq0/M4AG7Q4fvZVuBEdtJa1SS+H3pwoKP76bvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:15:46.431345Z"},"content_sha256":"811148571144afdc48ca34a6325e57cb36a6ab00d1e7be25083e177621942cc1","schema_version":"1.0","event_id":"sha256:811148571144afdc48ca34a6325e57cb36a6ab00d1e7be25083e177621942cc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:MXJT63LTBOONZHAQL6NXFYEUQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, Dung Viet Nguyen, Michael W. Marcellin, Shashi Kiran Chilappagari","submitted_at":"2008-05-16T00:50:19Z","abstract_excerpt":"The relation between the girth and the guaranteed error correction capability of $\\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least $3 \\gamma/4$ is found based on the Moore bound. An upper bound on the guaranteed error correction capability is established by studying the sizes of smallest possible trapping sets. The results are extended to generalized LDPC codes. It is shown that generalized LDPC codes can correct a linear fraction of errors u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.2427","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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"in7E53fZt7+H9zj7CzjW+0r0Xb7STLl0+ExfW/Gdz4+HVPeFiRf/u6QeI7JpaqQTeffqWvBvNO/01ulmY4lcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:15:46.431808Z"},"content_sha256":"925eeaf4a789cb778c86b27b3ac6bc4b0708ca93917748e7aa787ae3137c4c5e","schema_version":"1.0","event_id":"sha256:925eeaf4a789cb778c86b27b3ac6bc4b0708ca93917748e7aa787ae3137c4c5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXJT63LTBOONZHAQL6NXFYEUQJ/bundle.json","state_url":"https://pith.science/pith/MXJT63LTBOONZHAQL6NXFYEUQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXJT63LTBOONZHAQL6NXFYEUQJ/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-02T22:15:46Z","links":{"resolver":"https://pith.science/pith/MXJT63LTBOONZHAQL6NXFYEUQJ","bundle":"https://pith.science/pith/MXJT63LTBOONZHAQL6NXFYEUQJ/bundle.json","state":"https://pith.science/pith/MXJT63LTBOONZHAQL6NXFYEUQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXJT63LTBOONZHAQL6NXFYEUQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:MXJT63LTBOONZHAQL6NXFYEUQJ","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":"34e6c56d535c09225528a2270db59b8a11a820b44eb1914bbc31150cb24904a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-16T00:50:19Z","title_canon_sha256":"25cb5517494464f761a6dec17d0da5777c10656621793925279f41577d84c357"},"schema_version":"1.0","source":{"id":"0805.2427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.2427","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0805.2427v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.2427","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"MXJT63LTBOON","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MXJT63LTBOONZHAQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MXJT63LT","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:925eeaf4a789cb778c86b27b3ac6bc4b0708ca93917748e7aa787ae3137c4c5e","target":"graph","created_at":"2026-05-18T00:58:25Z","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":"The relation between the girth and the guaranteed error correction capability of $\\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least $3 \\gamma/4$ is found based on the Moore bound. An upper bound on the guaranteed error correction capability is established by studying the sizes of smallest possible trapping sets. The results are extended to generalized LDPC codes. It is shown that generalized LDPC codes can correct a linear fraction of errors u","authors_text":"Bane Vasic, Dung Viet Nguyen, Michael W. Marcellin, Shashi Kiran Chilappagari","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-16T00:50:19Z","title":"On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.2427","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:811148571144afdc48ca34a6325e57cb36a6ab00d1e7be25083e177621942cc1","target":"record","created_at":"2026-05-18T00:58:25Z","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":"34e6c56d535c09225528a2270db59b8a11a820b44eb1914bbc31150cb24904a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-16T00:50:19Z","title_canon_sha256":"25cb5517494464f761a6dec17d0da5777c10656621793925279f41577d84c357"},"schema_version":"1.0","source":{"id":"0805.2427","kind":"arxiv","version":1}},"canonical_sha256":"65d33f6d730b9cdc9c105f9b72e09482617bfd4af6a74bd8cb8160e64f6de880","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65d33f6d730b9cdc9c105f9b72e09482617bfd4af6a74bd8cb8160e64f6de880","first_computed_at":"2026-05-18T00:58:25.613079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.613079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KwM6Jhbkuk29OonXI7lh2Xs1CabHpGHQDC0YgCULhcBehfq6G5hPlc4ueuMimlDSHtZK960d8Ocow5bmnV8IAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.613675Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.2427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:811148571144afdc48ca34a6325e57cb36a6ab00d1e7be25083e177621942cc1","sha256:925eeaf4a789cb778c86b27b3ac6bc4b0708ca93917748e7aa787ae3137c4c5e"],"state_sha256":"5a5dd4adf711acfc028639e0e90d43ec3b88f398e9924d82884a7aff4b987600"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OtYM54rK9J8E5melrVJtDVplrF7RAEZUqVKEAsJL3hm/Ru52PVpr2PLjuu2+jdbh344u8NjWXtSDz1W8OP1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:15:46.433856Z","bundle_sha256":"8dac4b7926682b5c73df74c0b52108fab99090df1de7e45ce7ac6234a924abc5"}}