{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U6Z5FQLZXYESA4BNFVYMD2H2LC","short_pith_number":"pith:U6Z5FQLZ","canonical_record":{"source":{"id":"1403.6090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T19:15:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1088f03afb2066dc90e64505f3c88f7474983862161c404b6aadda1ce6766bed","abstract_canon_sha256":"c0eaf1f16968a4fb507e722350918e66e063d0f8556bebb3241d822593bb9722"},"schema_version":"1.0"},"canonical_sha256":"a7b3d2c179be0920702d2d70c1e8fa58ac7fb2ea63db7a1efe8a85fb07656b94","source":{"kind":"arxiv","id":"1403.6090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6090","created_at":"2026-05-18T02:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6090v1","created_at":"2026-05-18T02:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6090","created_at":"2026-05-18T02:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"U6Z5FQLZXYES","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U6Z5FQLZXYESA4BN","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U6Z5FQLZ","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U6Z5FQLZXYESA4BNFVYMD2H2LC","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T19:15:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1088f03afb2066dc90e64505f3c88f7474983862161c404b6aadda1ce6766bed","abstract_canon_sha256":"c0eaf1f16968a4fb507e722350918e66e063d0f8556bebb3241d822593bb9722"},"schema_version":"1.0"},"canonical_sha256":"a7b3d2c179be0920702d2d70c1e8fa58ac7fb2ea63db7a1efe8a85fb07656b94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:46.923740Z","signature_b64":"2ib3kNCoYuIvDEiTPKNDMclimLEhz1oxM7mqwFK7XumdqOpyfobjPKalxKnWLtO6pvtllBVXWsjgkXqpL2ZdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7b3d2c179be0920702d2d70c1e8fa58ac7fb2ea63db7a1efe8a85fb07656b94","last_reissued_at":"2026-05-18T02:55:46.922833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:46.922833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6090","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:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNvQv3XWmzcH1joIt3alqWLaBYVo553DUql63rMmbq4nWEF7kA81S8RDfUB4ifiberewJzw0JCkFldPWBMdfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:47:45.880403Z"},"content_sha256":"c63c9bbf67e0e54bd987c6e36d3e26b33fbed409f076a4ca7d6b03208659e518","schema_version":"1.0","event_id":"sha256:c63c9bbf67e0e54bd987c6e36d3e26b33fbed409f076a4ca7d6b03208659e518"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U6Z5FQLZXYESA4BNFVYMD2H2LC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Column Weight Two and Three LDPC Codes with High Rates and Large Girths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghaffar Raeisi, Mohammad Gholami","submitted_at":"2014-03-24T19:15:45Z","abstract_excerpt":"In this paper, the concept of the {\\it broken diagonal pair} in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. The structure of the proposed parity-check matrices significantly reduces the complexity of encoding and decoding. Interestingly, the constructed regular cycle codes with row-weights $t$, $3\\leq t \\leq 20$, $t\\neq 7, 15, 16$, have the best lengths among the known regular girth-12 cycle codes. In addition, the proposed cycle codes can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6090","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:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTKhHMgx9DiKKgKLnVo9Y2XETo5rgyJO2aBnqDfWtpwGp0LkHWb8qT8Bd/H8eF+LKZnZsPLYUq+KXPwz1zA1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:47:45.881089Z"},"content_sha256":"f7c1cc20eb45b98a4f5f8566120f8b12ea284f15e542132b28eeb51a553baf0b","schema_version":"1.0","event_id":"sha256:f7c1cc20eb45b98a4f5f8566120f8b12ea284f15e542132b28eeb51a553baf0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/bundle.json","state_url":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/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-27T05:47:45Z","links":{"resolver":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC","bundle":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/bundle.json","state":"https://pith.science/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6Z5FQLZXYESA4BNFVYMD2H2LC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U6Z5FQLZXYESA4BNFVYMD2H2LC","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":"c0eaf1f16968a4fb507e722350918e66e063d0f8556bebb3241d822593bb9722","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T19:15:45Z","title_canon_sha256":"1088f03afb2066dc90e64505f3c88f7474983862161c404b6aadda1ce6766bed"},"schema_version":"1.0","source":{"id":"1403.6090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6090","created_at":"2026-05-18T02:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6090v1","created_at":"2026-05-18T02:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6090","created_at":"2026-05-18T02:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"U6Z5FQLZXYES","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U6Z5FQLZXYESA4BN","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U6Z5FQLZ","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:f7c1cc20eb45b98a4f5f8566120f8b12ea284f15e542132b28eeb51a553baf0b","target":"graph","created_at":"2026-05-18T02:55:46Z","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, the concept of the {\\it broken diagonal pair} in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. The structure of the proposed parity-check matrices significantly reduces the complexity of encoding and decoding. Interestingly, the constructed regular cycle codes with row-weights $t$, $3\\leq t \\leq 20$, $t\\neq 7, 15, 16$, have the best lengths among the known regular girth-12 cycle codes. In addition, the proposed cycle codes can be","authors_text":"Ghaffar Raeisi, Mohammad Gholami","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T19:15:45Z","title":"Column Weight Two and Three LDPC Codes with High Rates and Large Girths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6090","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:c63c9bbf67e0e54bd987c6e36d3e26b33fbed409f076a4ca7d6b03208659e518","target":"record","created_at":"2026-05-18T02:55:46Z","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":"c0eaf1f16968a4fb507e722350918e66e063d0f8556bebb3241d822593bb9722","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-24T19:15:45Z","title_canon_sha256":"1088f03afb2066dc90e64505f3c88f7474983862161c404b6aadda1ce6766bed"},"schema_version":"1.0","source":{"id":"1403.6090","kind":"arxiv","version":1}},"canonical_sha256":"a7b3d2c179be0920702d2d70c1e8fa58ac7fb2ea63db7a1efe8a85fb07656b94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7b3d2c179be0920702d2d70c1e8fa58ac7fb2ea63db7a1efe8a85fb07656b94","first_computed_at":"2026-05-18T02:55:46.922833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:46.922833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ib3kNCoYuIvDEiTPKNDMclimLEhz1oxM7mqwFK7XumdqOpyfobjPKalxKnWLtO6pvtllBVXWsjgkXqpL2ZdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:46.923740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c63c9bbf67e0e54bd987c6e36d3e26b33fbed409f076a4ca7d6b03208659e518","sha256:f7c1cc20eb45b98a4f5f8566120f8b12ea284f15e542132b28eeb51a553baf0b"],"state_sha256":"e7571794cdadcdb03c656a00b4b10c6b26d8117486b3203eb89f302c9f6b2ca3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//S6UkAD83jesX52qiA+2gr4g3ygm3PIBgefNIs7Dnyra3ImPQiJdyM8zTK8q7hj1TYgb3uGL5JWf6jNqj8DAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:47:45.884531Z","bundle_sha256":"d314d7a43c94ef6efec2e2a84aa132140ca22e4067f6b65eceb20401edae7cc0"}}