{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F4JJ5C5FGBRLWNWRBBSXP6ZIPN","short_pith_number":"pith:F4JJ5C5F","canonical_record":{"source":{"id":"1709.00825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T06:26:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f7c48a95c226c1ad628348b12c262844945caa1981a82cf63afd7c5397ac70bd","abstract_canon_sha256":"a8b5bf5a61a57ff4cd3ba59f90f3fff6db430e39a6ba328f226dadf93a6079c9"},"schema_version":"1.0"},"canonical_sha256":"2f129e8ba53062bb36d1086577fb287b79c576ac9a0c412dfaa48ad9231c471f","source":{"kind":"arxiv","id":"1709.00825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00825","created_at":"2026-05-18T00:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00825v1","created_at":"2026-05-18T00:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00825","created_at":"2026-05-18T00:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"F4JJ5C5FGBRL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F4JJ5C5FGBRLWNWR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F4JJ5C5F","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F4JJ5C5FGBRLWNWRBBSXP6ZIPN","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T06:26:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f7c48a95c226c1ad628348b12c262844945caa1981a82cf63afd7c5397ac70bd","abstract_canon_sha256":"a8b5bf5a61a57ff4cd3ba59f90f3fff6db430e39a6ba328f226dadf93a6079c9"},"schema_version":"1.0"},"canonical_sha256":"2f129e8ba53062bb36d1086577fb287b79c576ac9a0c412dfaa48ad9231c471f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:05.019731Z","signature_b64":"SlXP8bHdexFDZGGYZQH6qj8OCDG9l0R55K69XjC80mmqaGV9Sspzob2rPKWPCHI1FCJcFRT2ATTn3Gvh5S52BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f129e8ba53062bb36d1086577fb287b79c576ac9a0c412dfaa48ad9231c471f","last_reissued_at":"2026-05-18T00:36:05.019075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:05.019075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00825","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-18T00:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sqITXYx9jf9ISRSLGyghJEI6rmlcUMF2Nn3Z8suVtOuiyPY+1OebeeGyIrPYoqp4squK2XuFqqkt5RVISKsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:14:09.928746Z"},"content_sha256":"06783bbf20331cb6ad885dd7a258d257b24bb13f29692d3d8558683c3c137b8b","schema_version":"1.0","event_id":"sha256:06783bbf20331cb6ad885dd7a258d257b24bb13f29692d3d8558683c3c137b8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F4JJ5C5FGBRLWNWRBBSXP6ZIPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","submitted_at":"2017-09-04T06:26:28Z","abstract_excerpt":"In this paper, we define two matrices named as \"difference matrices\", denoted by $D$ and $DD$ which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and irregular multiple-edge QC-LDPC codes.\n  Making use of these matrices, we obtain necessary and sufficient conditions to have single-edge $(m,n)$-regular QC-LDPC codes with girth 6, 10 and 12. Additionally, for girth 6, we achieve all non-isomorphic codes with the minimum lifting degree, $N$, for $m=4$ and $5\\leq n\\leq 11$, and present an exponent matrix for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00825","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-18T00:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Km8q7YFvsYzR6U6I97D/0H2CdgYwHWonDetZo7r0x5G5pqFJeWwomInSeSg/gDNnz6Q2iQd0ehh3s3utMPaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:14:09.929297Z"},"content_sha256":"25d2721146a3a39af669fea14bd93f554f56a23daa8fd0883d9b1fed51523cf5","schema_version":"1.0","event_id":"sha256:25d2721146a3a39af669fea14bd93f554f56a23daa8fd0883d9b1fed51523cf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4JJ5C5FGBRLWNWRBBSXP6ZIPN/bundle.json","state_url":"https://pith.science/pith/F4JJ5C5FGBRLWNWRBBSXP6ZIPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4JJ5C5FGBRLWNWRBBSXP6ZIPN/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-31T12:14:09Z","links":{"resolver":"https://pith.science/pith/F4JJ5C5FGBRLWNWRBBSXP6ZIPN","bundle":"https://pith.science/pith/F4JJ5C5FGBRLWNWRBBSXP6ZIPN/bundle.json","state":"https://pith.science/pith/F4JJ5C5FGBRLWNWRBBSXP6ZIPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4JJ5C5FGBRLWNWRBBSXP6ZIPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F4JJ5C5FGBRLWNWRBBSXP6ZIPN","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":"a8b5bf5a61a57ff4cd3ba59f90f3fff6db430e39a6ba328f226dadf93a6079c9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T06:26:28Z","title_canon_sha256":"f7c48a95c226c1ad628348b12c262844945caa1981a82cf63afd7c5397ac70bd"},"schema_version":"1.0","source":{"id":"1709.00825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00825","created_at":"2026-05-18T00:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00825v1","created_at":"2026-05-18T00:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00825","created_at":"2026-05-18T00:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"F4JJ5C5FGBRL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F4JJ5C5FGBRLWNWR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F4JJ5C5F","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:25d2721146a3a39af669fea14bd93f554f56a23daa8fd0883d9b1fed51523cf5","target":"graph","created_at":"2026-05-18T00:36:05Z","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":"In this paper, we define two matrices named as \"difference matrices\", denoted by $D$ and $DD$ which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and irregular multiple-edge QC-LDPC codes.\n  Making use of these matrices, we obtain necessary and sufficient conditions to have single-edge $(m,n)$-regular QC-LDPC codes with girth 6, 10 and 12. Additionally, for girth 6, we achieve all non-isomorphic codes with the minimum lifting degree, $N$, for $m=4$ and $5\\leq n\\leq 11$, and present an exponent matrix for ","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T06:26:28Z","title":"Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00825","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:06783bbf20331cb6ad885dd7a258d257b24bb13f29692d3d8558683c3c137b8b","target":"record","created_at":"2026-05-18T00:36:05Z","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":"a8b5bf5a61a57ff4cd3ba59f90f3fff6db430e39a6ba328f226dadf93a6079c9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T06:26:28Z","title_canon_sha256":"f7c48a95c226c1ad628348b12c262844945caa1981a82cf63afd7c5397ac70bd"},"schema_version":"1.0","source":{"id":"1709.00825","kind":"arxiv","version":1}},"canonical_sha256":"2f129e8ba53062bb36d1086577fb287b79c576ac9a0c412dfaa48ad9231c471f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f129e8ba53062bb36d1086577fb287b79c576ac9a0c412dfaa48ad9231c471f","first_computed_at":"2026-05-18T00:36:05.019075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:05.019075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SlXP8bHdexFDZGGYZQH6qj8OCDG9l0R55K69XjC80mmqaGV9Sspzob2rPKWPCHI1FCJcFRT2ATTn3Gvh5S52BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:05.019731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06783bbf20331cb6ad885dd7a258d257b24bb13f29692d3d8558683c3c137b8b","sha256:25d2721146a3a39af669fea14bd93f554f56a23daa8fd0883d9b1fed51523cf5"],"state_sha256":"163afda2e51ee1ef481b780d4d0a0fe0f757482f31cbae2f2e00717fbf5b5dc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtEPEHm/hINSHxX3B5g0Jc1i5oXfs34VzglzKIN5GRXEzFUvQj11FJzn6epih5ZJccSoTUGDRtD+0RJY7gnwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:14:09.932288Z","bundle_sha256":"761cb4cff8f569806d021982b86cdff31a3542742931aa8a4222cb33706e5550"}}