{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ADFGNNUOUMKPXOTQAYGQVZIOD3","short_pith_number":"pith:ADFGNNUO","canonical_record":{"source":{"id":"2208.13022","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-27T14:13:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"91f968944e213e25df5cdd295adafd125b182ef902713fe3d827f9738676f89b","abstract_canon_sha256":"9be8becc906f448603ea916b60fa97ec89390cb70669e5241373864c39645114"},"schema_version":"1.0"},"canonical_sha256":"00ca66b68ea314fbba70060d0ae50e1ec7d0a5b23cf9c75b2efe99847f5ced32","source":{"kind":"arxiv","id":"2208.13022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.13022","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"arxiv_version","alias_value":"2208.13022v1","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13022","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"pith_short_12","alias_value":"ADFGNNUOUMKP","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"pith_short_16","alias_value":"ADFGNNUOUMKPXOTQ","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"pith_short_8","alias_value":"ADFGNNUO","created_at":"2026-07-05T04:52:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ADFGNNUOUMKPXOTQAYGQVZIOD3","target":"record","payload":{"canonical_record":{"source":{"id":"2208.13022","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-27T14:13:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"91f968944e213e25df5cdd295adafd125b182ef902713fe3d827f9738676f89b","abstract_canon_sha256":"9be8becc906f448603ea916b60fa97ec89390cb70669e5241373864c39645114"},"schema_version":"1.0"},"canonical_sha256":"00ca66b68ea314fbba70060d0ae50e1ec7d0a5b23cf9c75b2efe99847f5ced32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:52:02.557181Z","signature_b64":"4hzEMyBZPuEdC+aLhK1YswnXZzrz50TCY7LAlTQXlbLKN5VnRmjkLESSJLLNTQOtQoxL+aAeH0CVmKD6fArIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00ca66b68ea314fbba70060d0ae50e1ec7d0a5b23cf9c75b2efe99847f5ced32","last_reissued_at":"2026-07-05T04:52:02.556752Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:52:02.556752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.13022","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-07-05T04:52:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXcly0/x+cQCUoValVyKTzgaWn40Wm6+8MZOu5CukDHhbM19ug8NtLZki3Reuv+U4Y8iK/k1mh1gqizj2dAiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:34:51.320844Z"},"content_sha256":"8a92d8b05346bd6c25379ac6ecb5522bf1134f4db35762f5c00744625e8c4307","schema_version":"1.0","event_id":"sha256:8a92d8b05346bd6c25379ac6ecb5522bf1134f4db35762f5c00744625e8c4307"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ADFGNNUOUMKPXOTQAYGQVZIOD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiongyue Xing, Peng Kang, Teng Lu, Xiaohu Tang, Xuan He","submitted_at":"2022-08-27T14:13:32Z","abstract_excerpt":"In this paper, we consider how to partition the parity-check matrices (PCMs) to reduce the hardware complexity and computation delay for the row layered decoding of quasi-cyclic low-density parity-check (QC-LDPC) codes. First, we formulate the PCM partitioning as an optimization problem, which targets to minimize the maximum column weight of each layer while maintaining a block cyclic shift property among different layers. As a result, we derive all the feasible solutions for the problem and propose a tight lower bound $\\omega_{LB}$ on the minimum possible maximum column weight to evaluate a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13022","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.13022/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:52:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgAN/4bdw4A5/MXloKv1XmjNFlapnbJ36bc7i/wd07x3TZv8hhFj3SojdS+QehrZM2DxO2+8mCjJgivURxp2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:34:51.321227Z"},"content_sha256":"e082c4ace7180478968c66c17b56a2f97ff7f204e94d828530dc33a02b017d44","schema_version":"1.0","event_id":"sha256:e082c4ace7180478968c66c17b56a2f97ff7f204e94d828530dc33a02b017d44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADFGNNUOUMKPXOTQAYGQVZIOD3/bundle.json","state_url":"https://pith.science/pith/ADFGNNUOUMKPXOTQAYGQVZIOD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADFGNNUOUMKPXOTQAYGQVZIOD3/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-07-07T13:34:51Z","links":{"resolver":"https://pith.science/pith/ADFGNNUOUMKPXOTQAYGQVZIOD3","bundle":"https://pith.science/pith/ADFGNNUOUMKPXOTQAYGQVZIOD3/bundle.json","state":"https://pith.science/pith/ADFGNNUOUMKPXOTQAYGQVZIOD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADFGNNUOUMKPXOTQAYGQVZIOD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ADFGNNUOUMKPXOTQAYGQVZIOD3","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":"9be8becc906f448603ea916b60fa97ec89390cb70669e5241373864c39645114","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-27T14:13:32Z","title_canon_sha256":"91f968944e213e25df5cdd295adafd125b182ef902713fe3d827f9738676f89b"},"schema_version":"1.0","source":{"id":"2208.13022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.13022","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"arxiv_version","alias_value":"2208.13022v1","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13022","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"pith_short_12","alias_value":"ADFGNNUOUMKP","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"pith_short_16","alias_value":"ADFGNNUOUMKPXOTQ","created_at":"2026-07-05T04:52:02Z"},{"alias_kind":"pith_short_8","alias_value":"ADFGNNUO","created_at":"2026-07-05T04:52:02Z"}],"graph_snapshots":[{"event_id":"sha256:e082c4ace7180478968c66c17b56a2f97ff7f204e94d828530dc33a02b017d44","target":"graph","created_at":"2026-07-05T04:52:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.13022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider how to partition the parity-check matrices (PCMs) to reduce the hardware complexity and computation delay for the row layered decoding of quasi-cyclic low-density parity-check (QC-LDPC) codes. First, we formulate the PCM partitioning as an optimization problem, which targets to minimize the maximum column weight of each layer while maintaining a block cyclic shift property among different layers. As a result, we derive all the feasible solutions for the problem and propose a tight lower bound $\\omega_{LB}$ on the minimum possible maximum column weight to evaluate a s","authors_text":"Jiongyue Xing, Peng Kang, Teng Lu, Xiaohu Tang, Xuan He","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-27T14:13:32Z","title":"Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13022","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:8a92d8b05346bd6c25379ac6ecb5522bf1134f4db35762f5c00744625e8c4307","target":"record","created_at":"2026-07-05T04:52:02Z","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":"9be8becc906f448603ea916b60fa97ec89390cb70669e5241373864c39645114","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-08-27T14:13:32Z","title_canon_sha256":"91f968944e213e25df5cdd295adafd125b182ef902713fe3d827f9738676f89b"},"schema_version":"1.0","source":{"id":"2208.13022","kind":"arxiv","version":1}},"canonical_sha256":"00ca66b68ea314fbba70060d0ae50e1ec7d0a5b23cf9c75b2efe99847f5ced32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00ca66b68ea314fbba70060d0ae50e1ec7d0a5b23cf9c75b2efe99847f5ced32","first_computed_at":"2026-07-05T04:52:02.556752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:52:02.556752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4hzEMyBZPuEdC+aLhK1YswnXZzrz50TCY7LAlTQXlbLKN5VnRmjkLESSJLLNTQOtQoxL+aAeH0CVmKD6fArIBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:52:02.557181Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.13022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a92d8b05346bd6c25379ac6ecb5522bf1134f4db35762f5c00744625e8c4307","sha256:e082c4ace7180478968c66c17b56a2f97ff7f204e94d828530dc33a02b017d44"],"state_sha256":"cdaf0d6ebed7ff9a1979b592e217b1762a64849daff1a1f7e398b1c514de7e6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z1kkSBEWjVlrfvzpMPcvA4CXNzHpSNU9aROxYYf+k31C64w8iH/344E7wUmT8JQ/ggPZ33Wl+B1FB/HDutI1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:34:51.323176Z","bundle_sha256":"b44e45d39ccf273bc0ba14f19a4a737fbfc3cdb058a0df0e89b634fc1f278b44"}}