{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:42HPAQMZU6MSYQNOWFCNO46O7I","short_pith_number":"pith:42HPAQMZ","canonical_record":{"source":{"id":"1210.3906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-15T05:57:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d94502ec40d5e13ca9e015394448089c1a2eb433dfd606dfa2664ea69157539b","abstract_canon_sha256":"994ffe6e32fa42c3477e87cef1d48dd1c683e9cf71d3f07b49776c4b4065ee3a"},"schema_version":"1.0"},"canonical_sha256":"e68ef04199a7992c41aeb144d773cefa20cf05d845b7854dce71d9732d7c3575","source":{"kind":"arxiv","id":"1210.3906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3906","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3906v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3906","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"42HPAQMZU6MS","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"42HPAQMZU6MSYQNO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"42HPAQMZ","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:42HPAQMZU6MSYQNOWFCNO46O7I","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-15T05:57:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d94502ec40d5e13ca9e015394448089c1a2eb433dfd606dfa2664ea69157539b","abstract_canon_sha256":"994ffe6e32fa42c3477e87cef1d48dd1c683e9cf71d3f07b49776c4b4065ee3a"},"schema_version":"1.0"},"canonical_sha256":"e68ef04199a7992c41aeb144d773cefa20cf05d845b7854dce71d9732d7c3575","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.825014Z","signature_b64":"VPSlMYV8ytOXJVsBBcGiSTJn0DSIcg8CYDF2vNxcw9HXnGiE0lgzMJA89L1PfTF3bUsfLKZek8coBOyjlYAyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e68ef04199a7992c41aeb144d773cefa20cf05d845b7854dce71d9732d7c3575","last_reissued_at":"2026-05-18T00:58:42.824589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.824589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3906","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:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kyfNDZnbisqu7MsdZSeonWpYad9BImL0G4oUmo18ThHCR2QLvUB9sOYZXY2SAjtSFkN37PktTK1/pOBtEh2gAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:48:18.046101Z"},"content_sha256":"eaf51af7cab87302c48f114e46a4b3e9257554de059afc0ffad70d6875f02f70","schema_version":"1.0","event_id":"sha256:eaf51af7cab87302c48f114e46a4b3e9257554de059afc0ffad70d6875f02f70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:42HPAQMZU6MSYQNOWFCNO46O7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong-Joon Shin, Hosung Park, Jong-Seon No, Seokbeom Hong","submitted_at":"2012-10-15T05:57:49Z","abstract_excerpt":"There have been lots of efforts on the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes with large girth. However, most of them are focused on protographs with single edges and little research has been done for the construction of QC LDPC codes lifted from protographs with multiple edges. Compared to single-edge protographs, multiple-edge protographs have benefits such that QC LDPC codes lifted from them can potentially have larger minimum Hamming distance. In this paper, all subgraph patterns of multiple-edge protographs, which prevent QC LDPC codes from having large gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3906","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:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bc2JcCkPguYHj5Hxlw2/KSI9nyxVyMnqOkKk37XUhYHQ4r3/unhYkSAfh5bf0Tv+C7cJQHxAkKLYdFp2doJcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:48:18.046478Z"},"content_sha256":"a1581fefdf6829f8006befb0613fab1b3e0258203aefea0f6e64fb7dc63025f1","schema_version":"1.0","event_id":"sha256:a1581fefdf6829f8006befb0613fab1b3e0258203aefea0f6e64fb7dc63025f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42HPAQMZU6MSYQNOWFCNO46O7I/bundle.json","state_url":"https://pith.science/pith/42HPAQMZU6MSYQNOWFCNO46O7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42HPAQMZU6MSYQNOWFCNO46O7I/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-29T22:48:18Z","links":{"resolver":"https://pith.science/pith/42HPAQMZU6MSYQNOWFCNO46O7I","bundle":"https://pith.science/pith/42HPAQMZU6MSYQNOWFCNO46O7I/bundle.json","state":"https://pith.science/pith/42HPAQMZU6MSYQNOWFCNO46O7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42HPAQMZU6MSYQNOWFCNO46O7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:42HPAQMZU6MSYQNOWFCNO46O7I","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":"994ffe6e32fa42c3477e87cef1d48dd1c683e9cf71d3f07b49776c4b4065ee3a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-15T05:57:49Z","title_canon_sha256":"d94502ec40d5e13ca9e015394448089c1a2eb433dfd606dfa2664ea69157539b"},"schema_version":"1.0","source":{"id":"1210.3906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3906","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3906v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3906","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"42HPAQMZU6MS","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"42HPAQMZU6MSYQNO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"42HPAQMZ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:a1581fefdf6829f8006befb0613fab1b3e0258203aefea0f6e64fb7dc63025f1","target":"graph","created_at":"2026-05-18T00:58:42Z","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":"There have been lots of efforts on the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes with large girth. However, most of them are focused on protographs with single edges and little research has been done for the construction of QC LDPC codes lifted from protographs with multiple edges. Compared to single-edge protographs, multiple-edge protographs have benefits such that QC LDPC codes lifted from them can potentially have larger minimum Hamming distance. In this paper, all subgraph patterns of multiple-edge protographs, which prevent QC LDPC codes from having large gi","authors_text":"Dong-Joon Shin, Hosung Park, Jong-Seon No, Seokbeom Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-15T05:57:49Z","title":"Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3906","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:eaf51af7cab87302c48f114e46a4b3e9257554de059afc0ffad70d6875f02f70","target":"record","created_at":"2026-05-18T00:58:42Z","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":"994ffe6e32fa42c3477e87cef1d48dd1c683e9cf71d3f07b49776c4b4065ee3a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-15T05:57:49Z","title_canon_sha256":"d94502ec40d5e13ca9e015394448089c1a2eb433dfd606dfa2664ea69157539b"},"schema_version":"1.0","source":{"id":"1210.3906","kind":"arxiv","version":1}},"canonical_sha256":"e68ef04199a7992c41aeb144d773cefa20cf05d845b7854dce71d9732d7c3575","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e68ef04199a7992c41aeb144d773cefa20cf05d845b7854dce71d9732d7c3575","first_computed_at":"2026-05-18T00:58:42.824589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.824589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VPSlMYV8ytOXJVsBBcGiSTJn0DSIcg8CYDF2vNxcw9HXnGiE0lgzMJA89L1PfTF3bUsfLKZek8coBOyjlYAyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.825014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaf51af7cab87302c48f114e46a4b3e9257554de059afc0ffad70d6875f02f70","sha256:a1581fefdf6829f8006befb0613fab1b3e0258203aefea0f6e64fb7dc63025f1"],"state_sha256":"8af77adfe532e5b19d0c4eb6ef224b3a782633390958deadf0154794304d40f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lhxu81lEYVurHlngByR3bRdYxHsu2MJByYT1KuO2la1u70FQKXOJ5Y0vis9o+p4Cp/ouogY+0xu5Wp4yB3deAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:48:18.048925Z","bundle_sha256":"e16e2984f38fec2c2cce9bcf216acc30e762087f30fcc7279af8367bb4c06bb5"}}