{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2BVT5FHKC634P6QA6VUYF7VO46","short_pith_number":"pith:2BVT5FHK","canonical_record":{"source":{"id":"1512.02520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-08T16:14:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc6f81a2173033d5cac2e29a770adf76b2aced3c87ab6ea0b8459e11c5949b7e","abstract_canon_sha256":"587cd2203497c09818614955fec62838c9dcfb9e056ff311d60e7f9c1191dd45"},"schema_version":"1.0"},"canonical_sha256":"d06b3e94ea17b7c7fa00f56982feaee7a8736d9e106d4ced85a321fe99d17263","source":{"kind":"arxiv","id":"1512.02520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02520","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02520v1","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02520","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"2BVT5FHKC634","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2BVT5FHKC634P6QA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2BVT5FHK","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2BVT5FHKC634P6QA6VUYF7VO46","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-08T16:14:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc6f81a2173033d5cac2e29a770adf76b2aced3c87ab6ea0b8459e11c5949b7e","abstract_canon_sha256":"587cd2203497c09818614955fec62838c9dcfb9e056ff311d60e7f9c1191dd45"},"schema_version":"1.0"},"canonical_sha256":"d06b3e94ea17b7c7fa00f56982feaee7a8736d9e106d4ced85a321fe99d17263","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:44.512806Z","signature_b64":"upNMYSs/3Vy3YArSSX/er8Vy8rCqHSMJIY3tf4O0l75S74lQrEAwfClaaCzVlulaExEDrfZUyBoGRpQjOSB6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d06b3e94ea17b7c7fa00f56982feaee7a8736d9e106d4ced85a321fe99d17263","last_reissued_at":"2026-05-18T01:24:44.512280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:44.512280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02520","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-18T01:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G00YsP9on2DBPUBv83RKHsdIc0o189urArfcRrSK7GCTrPeuEpWz2mNb9WgUKXvgi17cS06YsacM7cRzmAKaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:48:28.866669Z"},"content_sha256":"c9d1f468b044597841625e354359a457b44df89b6a991f746ff4ef99156451fc","schema_version":"1.0","event_id":"sha256:c9d1f468b044597841625e354359a457b44df89b6a991f746ff4ef99156451fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2BVT5FHKC634P6QA6VUYF7VO46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. G. D. Uchoa, C. T. Healy, R. C. de Lamare","submitted_at":"2015-12-08T16:14:26Z","abstract_excerpt":"In this work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping Root-LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-LDPC codes are both suitable for channels under $F = 2, 3$ and $4$ independent fading per codeword. The performance of the proposed codes is investigated in terms of Frame Error Rate (FER). The proposed Root-LDPC codes are capable of ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02520","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-18T01:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ax0adpvqjXUmtRi5pbnnaTwRvWLpHvkw5REWwlTCAIDl3IMFJUz5ulpvGcqWoEBJ/Kaw1e3Y4LyKoG3Hsc1jDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:48:28.867018Z"},"content_sha256":"83bfa12773a1988cfd9441f482aebb733807bbb3f66e04bfc5d803c4bec612cc","schema_version":"1.0","event_id":"sha256:83bfa12773a1988cfd9441f482aebb733807bbb3f66e04bfc5d803c4bec612cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/bundle.json","state_url":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BVT5FHKC634P6QA6VUYF7VO46/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-20T08:48:28Z","links":{"resolver":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46","bundle":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/bundle.json","state":"https://pith.science/pith/2BVT5FHKC634P6QA6VUYF7VO46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BVT5FHKC634P6QA6VUYF7VO46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2BVT5FHKC634P6QA6VUYF7VO46","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":"587cd2203497c09818614955fec62838c9dcfb9e056ff311d60e7f9c1191dd45","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-08T16:14:26Z","title_canon_sha256":"bc6f81a2173033d5cac2e29a770adf76b2aced3c87ab6ea0b8459e11c5949b7e"},"schema_version":"1.0","source":{"id":"1512.02520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02520","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02520v1","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02520","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"2BVT5FHKC634","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2BVT5FHKC634P6QA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2BVT5FHK","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:83bfa12773a1988cfd9441f482aebb733807bbb3f66e04bfc5d803c4bec612cc","target":"graph","created_at":"2026-05-18T01:24:44Z","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 work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping Root-LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-LDPC codes are both suitable for channels under $F = 2, 3$ and $4$ independent fading per codeword. The performance of the proposed codes is investigated in terms of Frame Error Rate (FER). The proposed Root-LDPC codes are capable of ach","authors_text":"A. G. D. Uchoa, C. T. Healy, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-08T16:14:26Z","title":"Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02520","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:c9d1f468b044597841625e354359a457b44df89b6a991f746ff4ef99156451fc","target":"record","created_at":"2026-05-18T01:24:44Z","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":"587cd2203497c09818614955fec62838c9dcfb9e056ff311d60e7f9c1191dd45","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-08T16:14:26Z","title_canon_sha256":"bc6f81a2173033d5cac2e29a770adf76b2aced3c87ab6ea0b8459e11c5949b7e"},"schema_version":"1.0","source":{"id":"1512.02520","kind":"arxiv","version":1}},"canonical_sha256":"d06b3e94ea17b7c7fa00f56982feaee7a8736d9e106d4ced85a321fe99d17263","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d06b3e94ea17b7c7fa00f56982feaee7a8736d9e106d4ced85a321fe99d17263","first_computed_at":"2026-05-18T01:24:44.512280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:44.512280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"upNMYSs/3Vy3YArSSX/er8Vy8rCqHSMJIY3tf4O0l75S74lQrEAwfClaaCzVlulaExEDrfZUyBoGRpQjOSB6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:44.512806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9d1f468b044597841625e354359a457b44df89b6a991f746ff4ef99156451fc","sha256:83bfa12773a1988cfd9441f482aebb733807bbb3f66e04bfc5d803c4bec612cc"],"state_sha256":"8579746d55f8de0578d6de5314414c181fcc79bc9cbed604e56e958ed2899f20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgNovF7ghc5OfsmDOLzBZZlS5sHGMArXPB6t7BUA7Q3wEdMUxyjw6ADAXFK1aDH7j9fRv0Qs2dJrLSewByzDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T08:48:28.869059Z","bundle_sha256":"98ee43dceeaf22e29652e5733fd2abef31f6b89d0674b06a5a57bb922654b590"}}