{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NJ6PCD5O6CQT3XRWVAJ33QTYXU","short_pith_number":"pith:NJ6PCD5O","schema_version":"1.0","canonical_sha256":"6a7cf10faef0a13dde36a813bdc278bd3390e036af65a9cf407a8b82461807d9","source":{"kind":"arxiv","id":"1407.5364","version":1},"attestation_state":"computed","paper":{"title":"Quasi-Cyclic LDPC Codes based on Pre-Lifted Protographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Roxana Smarandache","submitted_at":"2014-07-21T02:45:23Z","abstract_excerpt":"Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, w"},"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":"1407.5364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T02:45:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d46045e46502680584e6586fb6896ae4cb8087f5484b0d94723eb5d1ee8f253e","abstract_canon_sha256":"f38c4335ba3b715ffca4c2cb85ede551551b88a8fe416b6fcbc1b703efefb504"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:14.234100Z","signature_b64":"v/ny1TzRfIOhh/3W9QP52dwUu/HGt5EGEp6RSjOdSE1J8AQ6ifyLFUvxsvyzOcrUrUA5yQvXoXH51cEU2+1PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a7cf10faef0a13dde36a813bdc278bd3390e036af65a9cf407a8b82461807d9","last_reissued_at":"2026-05-18T02:47:14.233559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:14.233559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Cyclic LDPC Codes based on Pre-Lifted Protographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Roxana Smarandache","submitted_at":"2014-07-21T02:45:23Z","abstract_excerpt":"Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5364","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.5364","created_at":"2026-05-18T02:47:14.233662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5364v1","created_at":"2026-05-18T02:47:14.233662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5364","created_at":"2026-05-18T02:47:14.233662+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJ6PCD5O6CQT","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJ6PCD5O6CQT3XRW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJ6PCD5O","created_at":"2026-05-18T12:28:41.024544+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/NJ6PCD5O6CQT3XRWVAJ33QTYXU","json":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU.json","graph_json":"https://pith.science/api/pith-number/NJ6PCD5O6CQT3XRWVAJ33QTYXU/graph.json","events_json":"https://pith.science/api/pith-number/NJ6PCD5O6CQT3XRWVAJ33QTYXU/events.json","paper":"https://pith.science/paper/NJ6PCD5O"},"agent_actions":{"view_html":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU","download_json":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU.json","view_paper":"https://pith.science/paper/NJ6PCD5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5364&json=true","fetch_graph":"https://pith.science/api/pith-number/NJ6PCD5O6CQT3XRWVAJ33QTYXU/graph.json","fetch_events":"https://pith.science/api/pith-number/NJ6PCD5O6CQT3XRWVAJ33QTYXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/action/storage_attestation","attest_author":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/action/author_attestation","sign_citation":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/action/citation_signature","submit_replication":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/action/replication_record"}},"created_at":"2026-05-18T02:47:14.233662+00:00","updated_at":"2026-05-18T02:47:14.233662+00:00"}