{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4N33W3CRMWL6VOZHT3SUSSRRBO","short_pith_number":"pith:4N33W3CR","canonical_record":{"source":{"id":"1605.07273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T02:54:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1f2eabf422bed758a3fcd4bc229c9454b29dd12c027d95f2cce399010c640e79","abstract_canon_sha256":"41effb19e22efc10a1a3092486201211ea22ed966462d15a5bfb6544f6e4dc2d"},"schema_version":"1.0"},"canonical_sha256":"e377bb6c516597eabb279ee5494a310b8dcb93ad990ee65ddbe8aeaaf04aa342","source":{"kind":"arxiv","id":"1605.07273","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07273","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07273v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07273","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"4N33W3CRMWL6","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4N33W3CRMWL6VOZH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4N33W3CR","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4N33W3CRMWL6VOZHT3SUSSRRBO","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T02:54:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1f2eabf422bed758a3fcd4bc229c9454b29dd12c027d95f2cce399010c640e79","abstract_canon_sha256":"41effb19e22efc10a1a3092486201211ea22ed966462d15a5bfb6544f6e4dc2d"},"schema_version":"1.0"},"canonical_sha256":"e377bb6c516597eabb279ee5494a310b8dcb93ad990ee65ddbe8aeaaf04aa342","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:39.395754Z","signature_b64":"WZDUFm6Qm1o71nS+ZbJl7igIBGjImKkyWbjkaCmUeCoR9zvg9/BqHYYFBhln8vjQkWyxR5o2JCCpjlv33MqkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e377bb6c516597eabb279ee5494a310b8dcb93ad990ee65ddbe8aeaaf04aa342","last_reissued_at":"2026-05-18T01:13:39.395039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:39.395039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07273","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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7i86XJUMSfi7q/PS+245Rf4pqe6CyWlw27JZ8w4zyt9LDht+t6ADodmP2Y9oIjrHe5T8pFYkdbS1/cbOhSbPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:03:58.116854Z"},"content_sha256":"e7108c80194b800600107ac118ea14bbfc6d226cd28271d95f12f0f3c9988a3d","schema_version":"1.0","event_id":"sha256:e7108c80194b800600107ac118ea14bbfc6d226cd28271d95f12f0f3c9988a3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4N33W3CRMWL6VOZHT3SUSSRRBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LDPC Codes Based on the Space of Symmetric Matrices over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Changli Ma, Meng Zhao, Qi Wang","submitted_at":"2016-05-24T02:54:48Z","abstract_excerpt":"In this paper, we present a new method for explicitly constructing regular low-density parity-check (LDPC) codes based on $\\mathbb{S}_{n}(\\mathbb{F}_{q})$, the space of $n\\times n$ symmetric matrices over $\\mathbb{F}_{q}$. Using this method, we obtain two classes of binary LDPC codes, $\\cal{C}(n,q)$ and $\\cal{C}^{T}(n,q)$, both of which have grith $8$. Then both the minimum distance and the stopping distance of each class are investigated. It is shown that the minimum distance and the stopping distance of $\\cal{C}^{T}(n,q)$ are both $2q$. As for $\\cal{C}(n,q)$, we determine the minimum distanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07273","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-18T01:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjjumCCYtwRbYhjw/bRLj9do8y8/eojZzrKxLwr/hdMCqUiN79DqHh6GlpiTRouHNRZut2uzKJAN5BagG9xRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:03:58.117637Z"},"content_sha256":"464f7d12eb2e8f43c856b18ada75cf842d20f1d4ba9b54a437ccca78928b60c9","schema_version":"1.0","event_id":"sha256:464f7d12eb2e8f43c856b18ada75cf842d20f1d4ba9b54a437ccca78928b60c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4N33W3CRMWL6VOZHT3SUSSRRBO/bundle.json","state_url":"https://pith.science/pith/4N33W3CRMWL6VOZHT3SUSSRRBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4N33W3CRMWL6VOZHT3SUSSRRBO/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-25T17:03:58Z","links":{"resolver":"https://pith.science/pith/4N33W3CRMWL6VOZHT3SUSSRRBO","bundle":"https://pith.science/pith/4N33W3CRMWL6VOZHT3SUSSRRBO/bundle.json","state":"https://pith.science/pith/4N33W3CRMWL6VOZHT3SUSSRRBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4N33W3CRMWL6VOZHT3SUSSRRBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4N33W3CRMWL6VOZHT3SUSSRRBO","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":"41effb19e22efc10a1a3092486201211ea22ed966462d15a5bfb6544f6e4dc2d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T02:54:48Z","title_canon_sha256":"1f2eabf422bed758a3fcd4bc229c9454b29dd12c027d95f2cce399010c640e79"},"schema_version":"1.0","source":{"id":"1605.07273","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07273","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07273v2","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07273","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"4N33W3CRMWL6","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4N33W3CRMWL6VOZH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4N33W3CR","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:464f7d12eb2e8f43c856b18ada75cf842d20f1d4ba9b54a437ccca78928b60c9","target":"graph","created_at":"2026-05-18T01:13:39Z","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 present a new method for explicitly constructing regular low-density parity-check (LDPC) codes based on $\\mathbb{S}_{n}(\\mathbb{F}_{q})$, the space of $n\\times n$ symmetric matrices over $\\mathbb{F}_{q}$. Using this method, we obtain two classes of binary LDPC codes, $\\cal{C}(n,q)$ and $\\cal{C}^{T}(n,q)$, both of which have grith $8$. Then both the minimum distance and the stopping distance of each class are investigated. It is shown that the minimum distance and the stopping distance of $\\cal{C}^{T}(n,q)$ are both $2q$. As for $\\cal{C}(n,q)$, we determine the minimum distanc","authors_text":"Changli Ma, Meng Zhao, Qi Wang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T02:54:48Z","title":"LDPC Codes Based on the Space of Symmetric Matrices over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07273","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:e7108c80194b800600107ac118ea14bbfc6d226cd28271d95f12f0f3c9988a3d","target":"record","created_at":"2026-05-18T01:13:39Z","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":"41effb19e22efc10a1a3092486201211ea22ed966462d15a5bfb6544f6e4dc2d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T02:54:48Z","title_canon_sha256":"1f2eabf422bed758a3fcd4bc229c9454b29dd12c027d95f2cce399010c640e79"},"schema_version":"1.0","source":{"id":"1605.07273","kind":"arxiv","version":2}},"canonical_sha256":"e377bb6c516597eabb279ee5494a310b8dcb93ad990ee65ddbe8aeaaf04aa342","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e377bb6c516597eabb279ee5494a310b8dcb93ad990ee65ddbe8aeaaf04aa342","first_computed_at":"2026-05-18T01:13:39.395039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:39.395039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WZDUFm6Qm1o71nS+ZbJl7igIBGjImKkyWbjkaCmUeCoR9zvg9/BqHYYFBhln8vjQkWyxR5o2JCCpjlv33MqkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:39.395754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07273","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7108c80194b800600107ac118ea14bbfc6d226cd28271d95f12f0f3c9988a3d","sha256:464f7d12eb2e8f43c856b18ada75cf842d20f1d4ba9b54a437ccca78928b60c9"],"state_sha256":"894e1a28e638c31b39ee031b30b8aa23f014e5412d324391a71f5ecf139ae753"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFr205KntXx7lUXneAVL5iq8UKqpCBHBQMlzfsd8UsXBfBLm/T+mkpbJsM65FHhc2qPsDCSxqehaYz1ZCaq1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:03:58.121928Z","bundle_sha256":"0245c9ae3f21be78376be48016c521a989c419c19248083a6ea12b487cd3d045"}}