{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YBRWZAPWITDNZWPNTVFA3O6L5M","short_pith_number":"pith:YBRWZAPW","canonical_record":{"source":{"id":"1008.4177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-24T23:42:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e16703c6f1b046a1e83bf7dcb01e6a5ab96e79c3db1ade271239e55046083038","abstract_canon_sha256":"8623bacc297329d41945fd1e753448c9244899d791e362d1fd8ddd45dae87ffb"},"schema_version":"1.0"},"canonical_sha256":"c0636c81f644c6dcd9ed9d4a0dbbcbeb0ca502b0720364486d75974f7d406c11","source":{"kind":"arxiv","id":"1008.4177","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4177","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4177v2","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4177","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"YBRWZAPWITDN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YBRWZAPWITDNZWPN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YBRWZAPW","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YBRWZAPWITDNZWPNTVFA3O6L5M","target":"record","payload":{"canonical_record":{"source":{"id":"1008.4177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-24T23:42:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e16703c6f1b046a1e83bf7dcb01e6a5ab96e79c3db1ade271239e55046083038","abstract_canon_sha256":"8623bacc297329d41945fd1e753448c9244899d791e362d1fd8ddd45dae87ffb"},"schema_version":"1.0"},"canonical_sha256":"c0636c81f644c6dcd9ed9d4a0dbbcbeb0ca502b0720364486d75974f7d406c11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:55.191373Z","signature_b64":"wpeJPgJd2oKgj4sK86xVo9GAG7F2IzmxOHAzyeyeNIjZ68pcsOQ7JxT7cVbKdRFRv8mKdhVy0FB425pIEROpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0636c81f644c6dcd9ed9d4a0dbbcbeb0ca502b0720364486d75974f7d406c11","last_reissued_at":"2026-05-18T04:14:55.190854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:55.190854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.4177","source_version":2,"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-18T04:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIeRDg6pFQXF5L3fKqQLwJO7nnVTGeGQoLjpwwFizRYItrdfIePzumFNGYEgtoFF8IYglP9htNcAJG6b69O9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:58:38.425363Z"},"content_sha256":"fe3493d41c28bf32c54a9e2245a84335c5725415dae3c55313b261780955baf9","schema_version":"1.0","event_id":"sha256:fe3493d41c28bf32c54a9e2245a84335c5725415dae3c55313b261780955baf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YBRWZAPWITDNZWPNTVFA3O6L5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LDPC Codes from Latin Squares Free of Small Trapping Sets","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":"2010-08-24T23:42:09Z","abstract_excerpt":"This paper is concerned with the construction of low-density parity-check (LDPC) codes with low error floors. Two main contributions are made. First, a new class of structured LDPC codes is introduced. The parity check matrices of these codes are arrays of permutation matrices which are obtained from Latin squares and form a finite field under some matrix operations. Second, a method to construct LDPC codes with low error floors on the binary symmetric channel (BSC) is presented. Codes are constructed so that their Tanner graphs are free of certain small trapping sets. These trapping sets are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4177","kind":"arxiv","version":2},"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-18T04:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIy1KZDOODx9nmeJCwBEwzdBrTQyyrZfXjk9C9P3rf1Mpg3Qb3hAShmz/jv00hkdTWZeBY5D2HxpMePjxoPGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:58:38.425715Z"},"content_sha256":"6a09cdb3a69322c9db827116f87945a8dd59ecfbd4f15475059edb8b6143248c","schema_version":"1.0","event_id":"sha256:6a09cdb3a69322c9db827116f87945a8dd59ecfbd4f15475059edb8b6143248c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBRWZAPWITDNZWPNTVFA3O6L5M/bundle.json","state_url":"https://pith.science/pith/YBRWZAPWITDNZWPNTVFA3O6L5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBRWZAPWITDNZWPNTVFA3O6L5M/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-03T09:58:38Z","links":{"resolver":"https://pith.science/pith/YBRWZAPWITDNZWPNTVFA3O6L5M","bundle":"https://pith.science/pith/YBRWZAPWITDNZWPNTVFA3O6L5M/bundle.json","state":"https://pith.science/pith/YBRWZAPWITDNZWPNTVFA3O6L5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBRWZAPWITDNZWPNTVFA3O6L5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YBRWZAPWITDNZWPNTVFA3O6L5M","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":"8623bacc297329d41945fd1e753448c9244899d791e362d1fd8ddd45dae87ffb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-24T23:42:09Z","title_canon_sha256":"e16703c6f1b046a1e83bf7dcb01e6a5ab96e79c3db1ade271239e55046083038"},"schema_version":"1.0","source":{"id":"1008.4177","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4177","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4177v2","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4177","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"YBRWZAPWITDN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YBRWZAPWITDNZWPN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YBRWZAPW","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:6a09cdb3a69322c9db827116f87945a8dd59ecfbd4f15475059edb8b6143248c","target":"graph","created_at":"2026-05-18T04:14:55Z","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":"This paper is concerned with the construction of low-density parity-check (LDPC) codes with low error floors. Two main contributions are made. First, a new class of structured LDPC codes is introduced. The parity check matrices of these codes are arrays of permutation matrices which are obtained from Latin squares and form a finite field under some matrix operations. Second, a method to construct LDPC codes with low error floors on the binary symmetric channel (BSC) is presented. Codes are constructed so that their Tanner graphs are free of certain small trapping sets. These trapping sets are ","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":"2010-08-24T23:42:09Z","title":"LDPC Codes from Latin Squares Free of Small Trapping Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4177","kind":"arxiv","version":2},"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:fe3493d41c28bf32c54a9e2245a84335c5725415dae3c55313b261780955baf9","target":"record","created_at":"2026-05-18T04:14:55Z","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":"8623bacc297329d41945fd1e753448c9244899d791e362d1fd8ddd45dae87ffb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-24T23:42:09Z","title_canon_sha256":"e16703c6f1b046a1e83bf7dcb01e6a5ab96e79c3db1ade271239e55046083038"},"schema_version":"1.0","source":{"id":"1008.4177","kind":"arxiv","version":2}},"canonical_sha256":"c0636c81f644c6dcd9ed9d4a0dbbcbeb0ca502b0720364486d75974f7d406c11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0636c81f644c6dcd9ed9d4a0dbbcbeb0ca502b0720364486d75974f7d406c11","first_computed_at":"2026-05-18T04:14:55.190854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:55.190854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpeJPgJd2oKgj4sK86xVo9GAG7F2IzmxOHAzyeyeNIjZ68pcsOQ7JxT7cVbKdRFRv8mKdhVy0FB425pIEROpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:55.191373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4177","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe3493d41c28bf32c54a9e2245a84335c5725415dae3c55313b261780955baf9","sha256:6a09cdb3a69322c9db827116f87945a8dd59ecfbd4f15475059edb8b6143248c"],"state_sha256":"58b27908c14a5803c04fa1428481a4ab585cee067e685b74257cb93bcd7f07c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDSAekjRD3C3cgCa3Jo4H4ZcLplVtdZM34dhPup2PPHcCoweGI0o2P8Orh2eKwe04OXOFdqZgifJIPmyj7lrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:58:38.427674Z","bundle_sha256":"c805c83829aba7c4519288dd0f4ddb37f5bf75dddc0512c7950009f348979500"}}