{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NJ6PCD5O6CQT3XRWVAJ33QTYXU","short_pith_number":"pith:NJ6PCD5O","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"},"canonical_sha256":"6a7cf10faef0a13dde36a813bdc278bd3390e036af65a9cf407a8b82461807d9","source":{"kind":"arxiv","id":"1407.5364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5364","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5364v1","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5364","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"NJ6PCD5O6CQT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NJ6PCD5O6CQT3XRW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NJ6PCD5O","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NJ6PCD5O6CQT3XRWVAJ33QTYXU","target":"record","payload":{"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"},"canonical_sha256":"6a7cf10faef0a13dde36a813bdc278bd3390e036af65a9cf407a8b82461807d9","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"},"source_kind":"arxiv","source_id":"1407.5364","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-18T02:47:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4sqNpai9BSm2BE5624MGf63I8fdhALxFwHBgS/1fZ4+D9+Xc7XoFMIFaKkc0s9iAVWTwli4IPZYZAmNUU+GVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:44:36.252296Z"},"content_sha256":"2adc9e40d424cf740ff5ad0160f30fa7432089580ef7433523522cec1c9675dd","schema_version":"1.0","event_id":"sha256:2adc9e40d424cf740ff5ad0160f30fa7432089580ef7433523522cec1c9675dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NJ6PCD5O6CQT3XRWVAJ33QTYXU","target":"graph","payload":{"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"},"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-18T02:47:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kE013c+Q70uttVZzDrSbI0xXhm2z/9EzKqgd36ThG3W50XoS2v4IDioHq5iVuSPK1DpKJ38ZCG+f4CFvIP7kAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:44:36.252989Z"},"content_sha256":"862dda8b6d70f00f54aab378f157a921d154ebb780502859b60b51b36608f0ce","schema_version":"1.0","event_id":"sha256:862dda8b6d70f00f54aab378f157a921d154ebb780502859b60b51b36608f0ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/bundle.json","state_url":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/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-25T17:44:36Z","links":{"resolver":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU","bundle":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/bundle.json","state":"https://pith.science/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJ6PCD5O6CQT3XRWVAJ33QTYXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NJ6PCD5O6CQT3XRWVAJ33QTYXU","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":"f38c4335ba3b715ffca4c2cb85ede551551b88a8fe416b6fcbc1b703efefb504","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T02:45:23Z","title_canon_sha256":"d46045e46502680584e6586fb6896ae4cb8087f5484b0d94723eb5d1ee8f253e"},"schema_version":"1.0","source":{"id":"1407.5364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5364","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5364v1","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5364","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"NJ6PCD5O6CQT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NJ6PCD5O6CQT3XRW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NJ6PCD5O","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:862dda8b6d70f00f54aab378f157a921d154ebb780502859b60b51b36608f0ce","target":"graph","created_at":"2026-05-18T02:47:14Z","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":"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","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Roxana Smarandache","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T02:45:23Z","title":"Quasi-Cyclic LDPC Codes based on Pre-Lifted Protographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5364","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:2adc9e40d424cf740ff5ad0160f30fa7432089580ef7433523522cec1c9675dd","target":"record","created_at":"2026-05-18T02:47:14Z","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":"f38c4335ba3b715ffca4c2cb85ede551551b88a8fe416b6fcbc1b703efefb504","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T02:45:23Z","title_canon_sha256":"d46045e46502680584e6586fb6896ae4cb8087f5484b0d94723eb5d1ee8f253e"},"schema_version":"1.0","source":{"id":"1407.5364","kind":"arxiv","version":1}},"canonical_sha256":"6a7cf10faef0a13dde36a813bdc278bd3390e036af65a9cf407a8b82461807d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a7cf10faef0a13dde36a813bdc278bd3390e036af65a9cf407a8b82461807d9","first_computed_at":"2026-05-18T02:47:14.233559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:14.233559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v/ny1TzRfIOhh/3W9QP52dwUu/HGt5EGEp6RSjOdSE1J8AQ6ifyLFUvxsvyzOcrUrUA5yQvXoXH51cEU2+1PAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:14.234100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2adc9e40d424cf740ff5ad0160f30fa7432089580ef7433523522cec1c9675dd","sha256:862dda8b6d70f00f54aab378f157a921d154ebb780502859b60b51b36608f0ce"],"state_sha256":"980e7a7f4f166d48d94159cd4637f0b8627c679576c960f80f36c6b5892e5818"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqXpMY1iXWpqOL20hZEzNEq2S1J9MN/J4cgJWr1mzMvKgKL403FzNczxJzkTMv8BbuFOIG1cozgAEKk1q3GCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:44:36.256623Z","bundle_sha256":"8740e4dd31d1061ede6831bc791287a2e72f78842205987b0210f8f538540a36"}}