{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SZRWESBQFUHIMRDVUOK3RS7CVA","short_pith_number":"pith:SZRWESBQ","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"},"canonical_sha256":"96636248302d0e864475a395b8cbe2a830e40bc3f80936cb5dbe245ed222053d","source":{"kind":"arxiv","id":"1504.04975","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SZRWESBQFUHIMRDVUOK3RS7CVA","target":"record","payload":{"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"},"canonical_sha256":"96636248302d0e864475a395b8cbe2a830e40bc3f80936cb5dbe245ed222053d","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"},"source_kind":"arxiv","source_id":"1504.04975","source_version":2,"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-18T00:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6BwioiMZugauCW7AaKf/aoZcyZs8eLrtncN85O58k+RZsW7UMGqvxg6WYrQMfefzITqDaKZLst1XScJ+XhwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:18:08.950415Z"},"content_sha256":"5adb6d10c438a471642eb14dcc83bb2e986080537b341df0b53830897ce5eefa","schema_version":"1.0","event_id":"sha256:5adb6d10c438a471642eb14dcc83bb2e986080537b341df0b53830897ce5eefa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SZRWESBQFUHIMRDVUOK3RS7CVA","target":"graph","payload":{"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"},"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-18T00:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m161/LwEv18/pjf2sXH0trKry/aoJi4BjYds9MluwlkuvnoTMkU9yoo1qsBbrWdoF6hLYyveUb660/2fQ9PlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:18:08.950815Z"},"content_sha256":"3742cabb775f15d9cdaa5f46d221d703b82a84783e7006b774650384923b7319","schema_version":"1.0","event_id":"sha256:3742cabb775f15d9cdaa5f46d221d703b82a84783e7006b774650384923b7319"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/bundle.json","state_url":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/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-26T03:18:08Z","links":{"resolver":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA","bundle":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/bundle.json","state":"https://pith.science/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZRWESBQFUHIMRDVUOK3RS7CVA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GA7IYPnLhr3CeUghTZohZtrcZUte5HPfGopyaisYCvRapJUNBosLzvNxo277whxV12AbqlvdK/ezVCLJpBiLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:18:08.953434Z","bundle_sha256":"95dc8bb39312d60f40d94470cbdd82881f4545469c451ed33dae19f06ea36e06"}}