{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:O45IMBFJTRVZYV4VHL4BBIBX2B","short_pith_number":"pith:O45IMBFJ","canonical_record":{"source":{"id":"1402.1614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T12:20:31Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"e9a39ec1adb02e0e0066ea9ad3340cdcf8b2cf334d2f55324c174c7128287310","abstract_canon_sha256":"6afbda721342ee972c9b83b347f73ad78def75450aefbbe2223b44c2f3427b4a"},"schema_version":"1.0"},"canonical_sha256":"773a8604a99c6b9c57953af810a037d05e6a13dd38eca1968684ecd9d7e88853","source":{"kind":"arxiv","id":"1402.1614","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1614","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1614v3","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1614","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"O45IMBFJTRVZ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O45IMBFJTRVZYV4V","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O45IMBFJ","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:O45IMBFJTRVZYV4VHL4BBIBX2B","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T12:20:31Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"e9a39ec1adb02e0e0066ea9ad3340cdcf8b2cf334d2f55324c174c7128287310","abstract_canon_sha256":"6afbda721342ee972c9b83b347f73ad78def75450aefbbe2223b44c2f3427b4a"},"schema_version":"1.0"},"canonical_sha256":"773a8604a99c6b9c57953af810a037d05e6a13dd38eca1968684ecd9d7e88853","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:59.399110Z","signature_b64":"8w5vUn8odgYZKakHXQzE95s89j+wzC4fuCXLmIwLjkoe2H3ggg0ZwvMzMjNNYPsDvW7gD8y0b57ppGr8t2bhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"773a8604a99c6b9c57953af810a037d05e6a13dd38eca1968684ecd9d7e88853","last_reissued_at":"2026-05-18T00:56:59.398609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:59.398609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1614","source_version":3,"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:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pU4jJzH6d3pJ9VMTTGRwFo6VYyM90VA6jRcvWr/j7AoucJeOvrG6q3bX3NpWBM7qG1mFNOUkmhmH0ocGaShwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:36:06.054647Z"},"content_sha256":"149e88217c6b55d48ca24bb049bb813a64d15c163fdb86340a2c4d08576ebe0d","schema_version":"1.0","event_id":"sha256:149e88217c6b55d48ca24bb049bb813a64d15c163fdb86340a2c4d08576ebe0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:O45IMBFJTRVZYV4VHL4BBIBX2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New LDPC Codes Using Permutation Matrices with Higher Girth than QC-LDPC Codes Constructed by Fossorier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Mehdi Samadieh, Mohammad Gholami","submitted_at":"2014-02-07T12:20:31Z","abstract_excerpt":"In the literatures, it is well-known that Fossorier code has the girth among LDPC codes. In this paper, we introduce a new class of low-density parity-check (LDPC) codes, with higher girth than other previous constructed codes. Especially we proposed a new method to construct LDPC codes using non fixed shift permutation matrices and full based matrices with higher girth than codes constructed by Fossorier."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1614","kind":"arxiv","version":3},"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:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXtmqwJfirpkQAhD+lpHynSM2SHb0NV9hbczTPqT+BSHTy7iwZVvjB/N+VLmMusbiKU7J2+IEJRLNU7grNs7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:36:06.055003Z"},"content_sha256":"f4e2925ee5dfc8f64781f0072036969d949c9e336abb1a3c6ca577748f318fd4","schema_version":"1.0","event_id":"sha256:f4e2925ee5dfc8f64781f0072036969d949c9e336abb1a3c6ca577748f318fd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O45IMBFJTRVZYV4VHL4BBIBX2B/bundle.json","state_url":"https://pith.science/pith/O45IMBFJTRVZYV4VHL4BBIBX2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O45IMBFJTRVZYV4VHL4BBIBX2B/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-06-02T10:36:06Z","links":{"resolver":"https://pith.science/pith/O45IMBFJTRVZYV4VHL4BBIBX2B","bundle":"https://pith.science/pith/O45IMBFJTRVZYV4VHL4BBIBX2B/bundle.json","state":"https://pith.science/pith/O45IMBFJTRVZYV4VHL4BBIBX2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O45IMBFJTRVZYV4VHL4BBIBX2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:O45IMBFJTRVZYV4VHL4BBIBX2B","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":"6afbda721342ee972c9b83b347f73ad78def75450aefbbe2223b44c2f3427b4a","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T12:20:31Z","title_canon_sha256":"e9a39ec1adb02e0e0066ea9ad3340cdcf8b2cf334d2f55324c174c7128287310"},"schema_version":"1.0","source":{"id":"1402.1614","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1614","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1614v3","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1614","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"O45IMBFJTRVZ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O45IMBFJTRVZYV4V","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O45IMBFJ","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:f4e2925ee5dfc8f64781f0072036969d949c9e336abb1a3c6ca577748f318fd4","target":"graph","created_at":"2026-05-18T00:56:59Z","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 the literatures, it is well-known that Fossorier code has the girth among LDPC codes. In this paper, we introduce a new class of low-density parity-check (LDPC) codes, with higher girth than other previous constructed codes. Especially we proposed a new method to construct LDPC codes using non fixed shift permutation matrices and full based matrices with higher girth than codes constructed by Fossorier.","authors_text":"Mehdi Samadieh, Mohammad Gholami","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T12:20:31Z","title":"New LDPC Codes Using Permutation Matrices with Higher Girth than QC-LDPC Codes Constructed by Fossorier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1614","kind":"arxiv","version":3},"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:149e88217c6b55d48ca24bb049bb813a64d15c163fdb86340a2c4d08576ebe0d","target":"record","created_at":"2026-05-18T00:56:59Z","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":"6afbda721342ee972c9b83b347f73ad78def75450aefbbe2223b44c2f3427b4a","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-07T12:20:31Z","title_canon_sha256":"e9a39ec1adb02e0e0066ea9ad3340cdcf8b2cf334d2f55324c174c7128287310"},"schema_version":"1.0","source":{"id":"1402.1614","kind":"arxiv","version":3}},"canonical_sha256":"773a8604a99c6b9c57953af810a037d05e6a13dd38eca1968684ecd9d7e88853","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"773a8604a99c6b9c57953af810a037d05e6a13dd38eca1968684ecd9d7e88853","first_computed_at":"2026-05-18T00:56:59.398609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:59.398609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8w5vUn8odgYZKakHXQzE95s89j+wzC4fuCXLmIwLjkoe2H3ggg0ZwvMzMjNNYPsDvW7gD8y0b57ppGr8t2bhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:59.399110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1614","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:149e88217c6b55d48ca24bb049bb813a64d15c163fdb86340a2c4d08576ebe0d","sha256:f4e2925ee5dfc8f64781f0072036969d949c9e336abb1a3c6ca577748f318fd4"],"state_sha256":"6c3025e2d969df78e4dc178f76850954272b2ef6eef8839c86a95b2a5da40361"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xryXpWHP6UXEIhY19i7XmsrzH9ivo2u+nCAsfbY86PPncqLOjx/A82W+ksVKC+Eqo7Q+dOua0/t2RCI4RjI5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:36:06.056949Z","bundle_sha256":"8f551a991c9f4ecaeb09e3790a5d44f62172b630c5099fc1e199268ac306460c"}}