{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TQ7QURXOFBYYEHJTUJM7YRF3YJ","short_pith_number":"pith:TQ7QURXO","canonical_record":{"source":{"id":"1808.05258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-15T19:12:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe799c3c46fe806c45e3829e713aadec45019223bedd054cab8e4a4bd37125d5","abstract_canon_sha256":"23c86170b6fc02a533feb25e0ee4c1c3cb429e504fe2be607cfde9efb34ea46b"},"schema_version":"1.0"},"canonical_sha256":"9c3f0a46ee2871821d33a259fc44bbc24d664bdcf91d43433c3f2b0a0243300c","source":{"kind":"arxiv","id":"1808.05258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05258","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05258v1","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05258","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"TQ7QURXOFBYY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TQ7QURXOFBYYEHJT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TQ7QURXO","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TQ7QURXOFBYYEHJTUJM7YRF3YJ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-15T19:12:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe799c3c46fe806c45e3829e713aadec45019223bedd054cab8e4a4bd37125d5","abstract_canon_sha256":"23c86170b6fc02a533feb25e0ee4c1c3cb429e504fe2be607cfde9efb34ea46b"},"schema_version":"1.0"},"canonical_sha256":"9c3f0a46ee2871821d33a259fc44bbc24d664bdcf91d43433c3f2b0a0243300c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:57.751915Z","signature_b64":"xyqH2bUMmexbPb1TGpUMXGiL51A/ltNNAdr9SU2SQXuiTX5OwJixFKiyVVfdt1QOuv6w3chDLmZxClfoeVv4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c3f0a46ee2871821d33a259fc44bbc24d664bdcf91d43433c3f2b0a0243300c","last_reissued_at":"2026-05-18T00:07:57.751235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:57.751235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05258","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:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sT2EA45vHVXdL8G/acFaYcSKXlNyR7G4N4LRtKLEjW5V1qqoP9YvNxxn0p+tI8V1EYSv+t9ZCMXw1O7sHn70Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:12:31.688442Z"},"content_sha256":"1b5b4e89e2c5967a12420dffbbf360fba3245096b565c502f4540f42a09c740c","schema_version":"1.0","event_id":"sha256:1b5b4e89e2c5967a12420dffbbf360fba3245096b565c502f4540f42a09c740c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TQ7QURXOFBYYEHJTUJM7YRF3YJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","submitted_at":"2018-08-15T19:12:07Z","abstract_excerpt":"One of the phenomena that causes high decoding failure rates is trapping sets. Characterization of $(a,b)$ elementary trapping sets (ETSs), their graphical properties and the lower bounds on their size in variable regular LDPC codes with column weights 3, 4, 5 and 6, where $a$ is the size of the ETS and $b$ is the number of degree-one check nodes, have been an interesting subject among researchers. Although progressive-edge-growth method (PEG) to construct LDPC codes free of an specific ETS has been proposed in the literature, it is mostly applied to LDPC codes with column weight 3. In this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05258","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:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fto5LTxGcyOkvUntzdgjdVfNxo4TF5/Gcvg9viZZD7TgWPk2NvlAvGjYWekzB1LKcRdh3vlMfTUYs9L++mWADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:12:31.689187Z"},"content_sha256":"ec5cfff509f2d826d40deeea8fa5bacc2639093a4fa5a3eea73343488f15c2a2","schema_version":"1.0","event_id":"sha256:ec5cfff509f2d826d40deeea8fa5bacc2639093a4fa5a3eea73343488f15c2a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQ7QURXOFBYYEHJTUJM7YRF3YJ/bundle.json","state_url":"https://pith.science/pith/TQ7QURXOFBYYEHJTUJM7YRF3YJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQ7QURXOFBYYEHJTUJM7YRF3YJ/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-31T05:12:31Z","links":{"resolver":"https://pith.science/pith/TQ7QURXOFBYYEHJTUJM7YRF3YJ","bundle":"https://pith.science/pith/TQ7QURXOFBYYEHJTUJM7YRF3YJ/bundle.json","state":"https://pith.science/pith/TQ7QURXOFBYYEHJTUJM7YRF3YJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQ7QURXOFBYYEHJTUJM7YRF3YJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TQ7QURXOFBYYEHJTUJM7YRF3YJ","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":"23c86170b6fc02a533feb25e0ee4c1c3cb429e504fe2be607cfde9efb34ea46b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-15T19:12:07Z","title_canon_sha256":"fe799c3c46fe806c45e3829e713aadec45019223bedd054cab8e4a4bd37125d5"},"schema_version":"1.0","source":{"id":"1808.05258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05258","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05258v1","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05258","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"TQ7QURXOFBYY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TQ7QURXOFBYYEHJT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TQ7QURXO","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:ec5cfff509f2d826d40deeea8fa5bacc2639093a4fa5a3eea73343488f15c2a2","target":"graph","created_at":"2026-05-18T00:07:57Z","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":"One of the phenomena that causes high decoding failure rates is trapping sets. Characterization of $(a,b)$ elementary trapping sets (ETSs), their graphical properties and the lower bounds on their size in variable regular LDPC codes with column weights 3, 4, 5 and 6, where $a$ is the size of the ETS and $b$ is the number of degree-one check nodes, have been an interesting subject among researchers. Although progressive-edge-growth method (PEG) to construct LDPC codes free of an specific ETS has been proposed in the literature, it is mostly applied to LDPC codes with column weight 3. In this pa","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-15T19:12:07Z","title":"Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05258","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:1b5b4e89e2c5967a12420dffbbf360fba3245096b565c502f4540f42a09c740c","target":"record","created_at":"2026-05-18T00:07:57Z","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":"23c86170b6fc02a533feb25e0ee4c1c3cb429e504fe2be607cfde9efb34ea46b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-15T19:12:07Z","title_canon_sha256":"fe799c3c46fe806c45e3829e713aadec45019223bedd054cab8e4a4bd37125d5"},"schema_version":"1.0","source":{"id":"1808.05258","kind":"arxiv","version":1}},"canonical_sha256":"9c3f0a46ee2871821d33a259fc44bbc24d664bdcf91d43433c3f2b0a0243300c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c3f0a46ee2871821d33a259fc44bbc24d664bdcf91d43433c3f2b0a0243300c","first_computed_at":"2026-05-18T00:07:57.751235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:57.751235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xyqH2bUMmexbPb1TGpUMXGiL51A/ltNNAdr9SU2SQXuiTX5OwJixFKiyVVfdt1QOuv6w3chDLmZxClfoeVv4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:57.751915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b5b4e89e2c5967a12420dffbbf360fba3245096b565c502f4540f42a09c740c","sha256:ec5cfff509f2d826d40deeea8fa5bacc2639093a4fa5a3eea73343488f15c2a2"],"state_sha256":"57a7468234541c5a39a85bd28c84e2e18a464902fa3c33719301ca6169eb42ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wc6ot64kVFb8MRfgo8qOp8VM0kkFi+tjznhtXPQKlfNbpqLDAf2KcQLM0ZKqN1j4x/YPSoTvpEhJ68YK7EaPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:12:31.693113Z","bundle_sha256":"449a70a3bcea1ff50d27817d5aa018b51dcad4014912de63a3852126b61a4cf6"}}