{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5EV2GXOOQCNY5ASKOYHJBZTLIO","short_pith_number":"pith:5EV2GXOO","canonical_record":{"source":{"id":"1403.4405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T11:05:17Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"92aa17dfe21de4ffa4c6530dcbda74a7cdb1a64f4e5cfb59c446f3f9d8e31770","abstract_canon_sha256":"339c4b3a0f2ecf2a590e7b7ac1af02685d1dc47da32ead13a2345aa68937a1ed"},"schema_version":"1.0"},"canonical_sha256":"e92ba35dce809b8e824a760e90e66b43b267ec37a1ae50ef441bc6d6d0771121","source":{"kind":"arxiv","id":"1403.4405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4405","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4405v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4405","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"5EV2GXOOQCNY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5EV2GXOOQCNY5ASK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5EV2GXOO","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5EV2GXOOQCNY5ASKOYHJBZTLIO","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T11:05:17Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"92aa17dfe21de4ffa4c6530dcbda74a7cdb1a64f4e5cfb59c446f3f9d8e31770","abstract_canon_sha256":"339c4b3a0f2ecf2a590e7b7ac1af02685d1dc47da32ead13a2345aa68937a1ed"},"schema_version":"1.0"},"canonical_sha256":"e92ba35dce809b8e824a760e90e66b43b267ec37a1ae50ef441bc6d6d0771121","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.807822Z","signature_b64":"yZjcCGvDsDkI/QcioM9n6l3qVmBcswDW0UxzHRI9WjO5nO9dm6kIGGWmLFHiORSS2/LgXnxo0ImK+Iz9yek2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e92ba35dce809b8e824a760e90e66b43b267ec37a1ae50ef441bc6d6d0771121","last_reissued_at":"2026-05-18T02:56:04.807347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.807347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4405","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-18T02:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPMvAWGRuWyFTb2k50YL62/DDgo2sEQkyTk7RUNoMQhKzxK4KOiTc9yChwg4lKIrmExi8TcNKGGy4NCgvpmyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:59:34.222835Z"},"content_sha256":"a8004bed7efbfe12e3654851ffc50c946b1857f9704ed2d745b78f2c5cd264e6","schema_version":"1.0","event_id":"sha256:a8004bed7efbfe12e3654851ffc50c946b1857f9704ed2d745b78f2c5cd264e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5EV2GXOOQCNY5ASKOYHJBZTLIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Absorbing Set Analysis and Design of LDPC Codes from Transversal Designs over the AWGN Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Gruner, Michael Huber","submitted_at":"2014-03-18T11:05:17Z","abstract_excerpt":"In this paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The constructed codes are based on transversal designs that arise from sets of mutually orthogonal Latin squares (MOLS) with cyclic structure. For lowering the error-floors, our approach is twofold: First, we give an exhaustive classification of so-called absorbing sets that may occur in the factor graphs of the given codes. These purely combinatorial substructures are known to be the main cause of decoding errors in the error-fl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4405","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-18T02:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BE1PCljmliL/HaYgM17wEFyUT8pkaDVg3thYvrQohMzEFoAzn/f311Io9+sfQkmV1N9c1pCdQV19mjBOWtuWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:59:34.223488Z"},"content_sha256":"707012a4282fc555ad2d25a8ce3e5f39e933dcf509de14d39c751a7b69df7cd1","schema_version":"1.0","event_id":"sha256:707012a4282fc555ad2d25a8ce3e5f39e933dcf509de14d39c751a7b69df7cd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EV2GXOOQCNY5ASKOYHJBZTLIO/bundle.json","state_url":"https://pith.science/pith/5EV2GXOOQCNY5ASKOYHJBZTLIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EV2GXOOQCNY5ASKOYHJBZTLIO/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-08T09:59:34Z","links":{"resolver":"https://pith.science/pith/5EV2GXOOQCNY5ASKOYHJBZTLIO","bundle":"https://pith.science/pith/5EV2GXOOQCNY5ASKOYHJBZTLIO/bundle.json","state":"https://pith.science/pith/5EV2GXOOQCNY5ASKOYHJBZTLIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EV2GXOOQCNY5ASKOYHJBZTLIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5EV2GXOOQCNY5ASKOYHJBZTLIO","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":"339c4b3a0f2ecf2a590e7b7ac1af02685d1dc47da32ead13a2345aa68937a1ed","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T11:05:17Z","title_canon_sha256":"92aa17dfe21de4ffa4c6530dcbda74a7cdb1a64f4e5cfb59c446f3f9d8e31770"},"schema_version":"1.0","source":{"id":"1403.4405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4405","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4405v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4405","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"5EV2GXOOQCNY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5EV2GXOOQCNY5ASK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5EV2GXOO","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:707012a4282fc555ad2d25a8ce3e5f39e933dcf509de14d39c751a7b69df7cd1","target":"graph","created_at":"2026-05-18T02:56:04Z","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 paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The constructed codes are based on transversal designs that arise from sets of mutually orthogonal Latin squares (MOLS) with cyclic structure. For lowering the error-floors, our approach is twofold: First, we give an exhaustive classification of so-called absorbing sets that may occur in the factor graphs of the given codes. These purely combinatorial substructures are known to be the main cause of decoding errors in the error-fl","authors_text":"Alexander Gruner, Michael Huber","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T11:05:17Z","title":"Absorbing Set Analysis and Design of LDPC Codes from Transversal Designs over the AWGN Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4405","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:a8004bed7efbfe12e3654851ffc50c946b1857f9704ed2d745b78f2c5cd264e6","target":"record","created_at":"2026-05-18T02:56:04Z","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":"339c4b3a0f2ecf2a590e7b7ac1af02685d1dc47da32ead13a2345aa68937a1ed","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-18T11:05:17Z","title_canon_sha256":"92aa17dfe21de4ffa4c6530dcbda74a7cdb1a64f4e5cfb59c446f3f9d8e31770"},"schema_version":"1.0","source":{"id":"1403.4405","kind":"arxiv","version":1}},"canonical_sha256":"e92ba35dce809b8e824a760e90e66b43b267ec37a1ae50ef441bc6d6d0771121","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e92ba35dce809b8e824a760e90e66b43b267ec37a1ae50ef441bc6d6d0771121","first_computed_at":"2026-05-18T02:56:04.807347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:04.807347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yZjcCGvDsDkI/QcioM9n6l3qVmBcswDW0UxzHRI9WjO5nO9dm6kIGGWmLFHiORSS2/LgXnxo0ImK+Iz9yek2Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:04.807822Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8004bed7efbfe12e3654851ffc50c946b1857f9704ed2d745b78f2c5cd264e6","sha256:707012a4282fc555ad2d25a8ce3e5f39e933dcf509de14d39c751a7b69df7cd1"],"state_sha256":"4dae8925d426ef6917aff19b9c2d3d7d6efa59ad5e3d9f116b1c8e2747c4476f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HwlPdN2AMb+5v9Uk9paAH8wt7ARe6vPNFM/TtzgSpvQTE36RG5TjjlOJFSnO9ERlBi6OQhn27BX1pmz27yNHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:59:34.226811Z","bundle_sha256":"4001d880a70d1a31ab956dcf4dab5271d754ea221b86a020351458fa567f9ddb"}}