{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SZRWESBQFUHIMRDVUOK3RS7CVA","short_pith_number":"pith:SZRWESBQ","schema_version":"1.0","canonical_sha256":"96636248302d0e864475a395b8cbe2a830e40bc3f80936cb5dbe245ed222053d","source":{"kind":"arxiv","id":"1504.04975","version":2},"attestation_state":"computed","paper":{"title":"On the Girth of (3,L) Quasi-Cyclic LDPC Codes based on Complete Protographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dariush Divsalar, Richard D. Wesel, Sudarsan V. S. Ranganathan","submitted_at":"2015-04-20T08:58:06Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.04975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-20T08:58:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36282984bb044e79f691c127036af29adf251e832ffc148e1e4ca7ec1f20254e","abstract_canon_sha256":"a58a3bace94d946676450418b89d0691ab0ae2724e2da3dab2d9186239af8d5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:10.861129Z","signature_b64":"ppuWkM1Y1A1WywuMzJW2Ayw8a0JLlKvHRf79Z6CgpNYAAQD1mh9PPR/cuEyaSRyaKPQbAs6rnXFCW5tZ728lAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96636248302d0e864475a395b8cbe2a830e40bc3f80936cb5dbe245ed222053d","last_reissued_at":"2026-05-18T00:58:10.860555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:10.860555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Girth of (3,L) Quasi-Cyclic LDPC Codes based on Complete Protographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dariush Divsalar, Richard D. Wesel, Sudarsan V. S. Ranganathan","submitted_at":"2015-04-20T08:58:06Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04975","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.04975","created_at":"2026-05-18T00:58:10.860633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04975v2","created_at":"2026-05-18T00:58:10.860633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04975","created_at":"2026-05-18T00:58:10.860633+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZRWESBQFUHI","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZRWESBQFUHIMRDV","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZRWESBQ","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA","json":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA.json","graph_json":"https://pith.science/api/pith-number/SZRWESBQFUHIMRDVUOK3RS7CVA/graph.json","events_json":"https://pith.science/api/pith-number/SZRWESBQFUHIMRDVUOK3RS7CVA/events.json","paper":"https://pith.science/paper/SZRWESBQ"},"agent_actions":{"view_html":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA","download_json":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA.json","view_paper":"https://pith.science/paper/SZRWESBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04975&json=true","fetch_graph":"https://pith.science/api/pith-number/SZRWESBQFUHIMRDVUOK3RS7CVA/graph.json","fetch_events":"https://pith.science/api/pith-number/SZRWESBQFUHIMRDVUOK3RS7CVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/action/storage_attestation","attest_author":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/action/author_attestation","sign_citation":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/action/citation_signature","submit_replication":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/action/replication_record"}},"created_at":"2026-05-18T00:58:10.860633+00:00","updated_at":"2026-05-18T00:58:10.860633+00:00"}