{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G2HV4N7OUVVWW75SNX5RVMNZAE","short_pith_number":"pith:G2HV4N7O","canonical_record":{"source":{"id":"1701.05686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T04:30:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0f14cb06dc8d2a614eb057a69556c8ceb4180ede6e8a64d1218320270c07010f","abstract_canon_sha256":"a0a192306e616af9f039465616c208a8965909d20bdc837eb5868d69d46c4240"},"schema_version":"1.0"},"canonical_sha256":"368f5e37eea56b6b7fb26dfb1ab1b9012c3ff48ffd73c37806f78bee3c6f5de5","source":{"kind":"arxiv","id":"1701.05686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05686","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05686v1","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05686","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"G2HV4N7OUVVW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2HV4N7OUVVWW75S","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2HV4N7O","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G2HV4N7OUVVWW75SNX5RVMNZAE","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T04:30:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0f14cb06dc8d2a614eb057a69556c8ceb4180ede6e8a64d1218320270c07010f","abstract_canon_sha256":"a0a192306e616af9f039465616c208a8965909d20bdc837eb5868d69d46c4240"},"schema_version":"1.0"},"canonical_sha256":"368f5e37eea56b6b7fb26dfb1ab1b9012c3ff48ffd73c37806f78bee3c6f5de5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:28.797050Z","signature_b64":"u2ZDWiLvrITLNcKpBSQY+O5wJT7Tt8Vn2RbgQs0MGytDz7amnHEx3yeEddIMFhTzSq4dyT2HS7VGxNP3+K/wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368f5e37eea56b6b7fb26dfb1ab1b9012c3ff48ffd73c37806f78bee3c6f5de5","last_reissued_at":"2026-05-18T00:52:28.796538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:28.796538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05686","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:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LEUZhnd9DIYfshNljz5fX5rkB4BWmxNOA+ae1O+M+zAywsV8jyemTe9Ro+DYPHjKGC6fGa8stQk4ga0ad71ADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:41.241110Z"},"content_sha256":"7dea320b4b8a1987cafb53c4b34a455747140eab2c2e97413db8c0e4129c38dd","schema_version":"1.0","event_id":"sha256:7dea320b4b8a1987cafb53c4b34a455747140eab2c2e97413db8c0e4129c38dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G2HV4N7OUVVWW75SNX5RVMNZAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High Rate LDPC Codes from Difference Covering Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"A. Rao, D. Donovan, E. \\c{S}ule Yaz{\\i}c{\\i}","submitted_at":"2017-01-20T04:30:53Z","abstract_excerpt":"This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from difference covering arrays. While the original construction by Gallagher was by randomly allocating bits in a sparse parity-check matrix, over the past 20 years researchers have used a variety of more structured approaches to construct these codes, with the more recent constructions of well-structured LDPC coming from balanced incomplete block designs (BIBDs) and from Latin squares over finite fields. However these constructions have suffered from the limited orders for which these designs exist. Her"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05686","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:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25azp67SWTipyF7saTbKCLIb+K5CrEl5rSRTeF19ej0xpAC4wcI8fBl+CqEQpyKg/SqBU8GQBx/NvYhMweQ4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:41.241753Z"},"content_sha256":"03fd25bcd32fc7552c88d0b11c9b95f2e2d7625162ff52e81533f823f83c9a02","schema_version":"1.0","event_id":"sha256:03fd25bcd32fc7552c88d0b11c9b95f2e2d7625162ff52e81533f823f83c9a02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2HV4N7OUVVWW75SNX5RVMNZAE/bundle.json","state_url":"https://pith.science/pith/G2HV4N7OUVVWW75SNX5RVMNZAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2HV4N7OUVVWW75SNX5RVMNZAE/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-11T22:06:41Z","links":{"resolver":"https://pith.science/pith/G2HV4N7OUVVWW75SNX5RVMNZAE","bundle":"https://pith.science/pith/G2HV4N7OUVVWW75SNX5RVMNZAE/bundle.json","state":"https://pith.science/pith/G2HV4N7OUVVWW75SNX5RVMNZAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2HV4N7OUVVWW75SNX5RVMNZAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G2HV4N7OUVVWW75SNX5RVMNZAE","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":"a0a192306e616af9f039465616c208a8965909d20bdc837eb5868d69d46c4240","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T04:30:53Z","title_canon_sha256":"0f14cb06dc8d2a614eb057a69556c8ceb4180ede6e8a64d1218320270c07010f"},"schema_version":"1.0","source":{"id":"1701.05686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05686","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05686v1","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05686","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"G2HV4N7OUVVW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G2HV4N7OUVVWW75S","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G2HV4N7O","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:03fd25bcd32fc7552c88d0b11c9b95f2e2d7625162ff52e81533f823f83c9a02","target":"graph","created_at":"2026-05-18T00:52:28Z","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 presents a combinatorial construction of low-density parity-check (LDPC) codes from difference covering arrays. While the original construction by Gallagher was by randomly allocating bits in a sparse parity-check matrix, over the past 20 years researchers have used a variety of more structured approaches to construct these codes, with the more recent constructions of well-structured LDPC coming from balanced incomplete block designs (BIBDs) and from Latin squares over finite fields. However these constructions have suffered from the limited orders for which these designs exist. Her","authors_text":"A. Rao, D. Donovan, E. \\c{S}ule Yaz{\\i}c{\\i}","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T04:30:53Z","title":"High Rate LDPC Codes from Difference Covering Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05686","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:7dea320b4b8a1987cafb53c4b34a455747140eab2c2e97413db8c0e4129c38dd","target":"record","created_at":"2026-05-18T00:52:28Z","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":"a0a192306e616af9f039465616c208a8965909d20bdc837eb5868d69d46c4240","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-20T04:30:53Z","title_canon_sha256":"0f14cb06dc8d2a614eb057a69556c8ceb4180ede6e8a64d1218320270c07010f"},"schema_version":"1.0","source":{"id":"1701.05686","kind":"arxiv","version":1}},"canonical_sha256":"368f5e37eea56b6b7fb26dfb1ab1b9012c3ff48ffd73c37806f78bee3c6f5de5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"368f5e37eea56b6b7fb26dfb1ab1b9012c3ff48ffd73c37806f78bee3c6f5de5","first_computed_at":"2026-05-18T00:52:28.796538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:28.796538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u2ZDWiLvrITLNcKpBSQY+O5wJT7Tt8Vn2RbgQs0MGytDz7amnHEx3yeEddIMFhTzSq4dyT2HS7VGxNP3+K/wDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:28.797050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dea320b4b8a1987cafb53c4b34a455747140eab2c2e97413db8c0e4129c38dd","sha256:03fd25bcd32fc7552c88d0b11c9b95f2e2d7625162ff52e81533f823f83c9a02"],"state_sha256":"58fdd91203e2194e8b9a045013c5eae69179c442345e36237fe60f22016b7eea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5wBvegzqAACs1Ll7Ufq9O3g8Wn8HkERhMTp6G0MBS6KVsv6ujmQ5CpkBDNfam3mam1DNe3ox25JJzO8PqrPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:06:41.245179Z","bundle_sha256":"59d6417f38c1d931ce2dd1c85003d80eff935da948e55e47e8527a6d9f6571e4"}}