{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SZRWESBQFUHIMRDVUOK3RS7CVA","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":"a58a3bace94d946676450418b89d0691ab0ae2724e2da3dab2d9186239af8d5c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T08:58:06Z","title_canon_sha256":"36282984bb044e79f691c127036af29adf251e832ffc148e1e4ca7ec1f20254e"},"schema_version":"1.0","source":{"id":"1504.04975","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04975","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04975v2","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04975","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"SZRWESBQFUHI","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SZRWESBQFUHIMRDV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SZRWESBQ","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:3742cabb775f15d9cdaa5f46d221d703b82a84783e7006b774650384923b7319","target":"graph","created_at":"2026-05-18T00:58:10Z","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":"We consider the problem of constructing $(3,L)$ quasi-cyclic low-density parity-check (LDPC) codes from complete protographs. A complete protograph is a small bipartite graph with two disjoint vertex sets such that every vertex in the variable-node set is connected to every vertex in the check-node set by a unique edge. This paper analyzes the required lifting factor for achieving girths of six or eight in the resulting quasi-cyclic codes with constraints on lifting. The required lifting factors provide lower bounds on the block-length of such codes.","authors_text":"Dariush Divsalar, Richard D. Wesel, Sudarsan V. S. Ranganathan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T08:58:06Z","title":"On the Girth of (3,L) Quasi-Cyclic LDPC Codes based on Complete Protographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04975","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:5adb6d10c438a471642eb14dcc83bb2e986080537b341df0b53830897ce5eefa","target":"record","created_at":"2026-05-18T00:58:10Z","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":"a58a3bace94d946676450418b89d0691ab0ae2724e2da3dab2d9186239af8d5c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T08:58:06Z","title_canon_sha256":"36282984bb044e79f691c127036af29adf251e832ffc148e1e4ca7ec1f20254e"},"schema_version":"1.0","source":{"id":"1504.04975","kind":"arxiv","version":2}},"canonical_sha256":"96636248302d0e864475a395b8cbe2a830e40bc3f80936cb5dbe245ed222053d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96636248302d0e864475a395b8cbe2a830e40bc3f80936cb5dbe245ed222053d","first_computed_at":"2026-05-18T00:58:10.860555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:10.860555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ppuWkM1Y1A1WywuMzJW2Ayw8a0JLlKvHRf79Z6CgpNYAAQD1mh9PPR/cuEyaSRyaKPQbAs6rnXFCW5tZ728lAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:10.861129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04975","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5adb6d10c438a471642eb14dcc83bb2e986080537b341df0b53830897ce5eefa","sha256:3742cabb775f15d9cdaa5f46d221d703b82a84783e7006b774650384923b7319"],"state_sha256":"3080377cbe980ad8fb4fc7a73c7fb8892fa91a28c68412bd1f2d63fcae205a53"}