{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ECVKJ2SS4ITO27VJUP3F4H2GR5","short_pith_number":"pith:ECVKJ2SS","schema_version":"1.0","canonical_sha256":"20aaa4ea52e226ed7ea9a3f65e1f468f68153a36c27b3e4a438fecb2923b4333","source":{"kind":"arxiv","id":"1612.03279","version":1},"attestation_state":"computed","paper":{"title":"Graph based linear error correcting codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eustrat Zhupa, Monika Polak","submitted_at":"2016-12-10T11:25:30Z","abstract_excerpt":"In this article we present a construction of error correcting codes, that have representation as very sparse matrices and belong to the class of Low Density Parity Check Codes. LDPC codes are in the classical Hamming metric. They are very close to well known Shannon bound. The ability to use graphs for code construction was first discussed by Tanner in 1981 and has been used in a number of very effective implementations. We describe how to construct such codes by using special a family of graphs introduced by Ustimenko and Woldar. Graphs that we used are bipartite, bi-regular, very sparse and "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1612.03279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-10T11:25:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"327cfce0711ea22775407381a316e4980936347c8851cc89e8502496d73073f0","abstract_canon_sha256":"848c6e213d38bf80ba5883a619b1c1c27bf40d06a956dacc8f0f02b9df28a964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:19.740145Z","signature_b64":"jxQNl9tD8Gr/rmyletogxPNpehfKd+XMNnSE4VflVc4ZHayzwnu+ysSwTaRL0ykxABG4Ghx6BZOPPjnlZdxvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20aaa4ea52e226ed7ea9a3f65e1f468f68153a36c27b3e4a438fecb2923b4333","last_reissued_at":"2026-05-18T00:55:19.739440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:19.739440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph based linear error correcting codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eustrat Zhupa, Monika Polak","submitted_at":"2016-12-10T11:25:30Z","abstract_excerpt":"In this article we present a construction of error correcting codes, that have representation as very sparse matrices and belong to the class of Low Density Parity Check Codes. LDPC codes are in the classical Hamming metric. They are very close to well known Shannon bound. The ability to use graphs for code construction was first discussed by Tanner in 1981 and has been used in a number of very effective implementations. We describe how to construct such codes by using special a family of graphs introduced by Ustimenko and Woldar. Graphs that we used are bipartite, bi-regular, very sparse and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03279","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.03279","created_at":"2026-05-18T00:55:19.739553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.03279v1","created_at":"2026-05-18T00:55:19.739553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03279","created_at":"2026-05-18T00:55:19.739553+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECVKJ2SS4ITO","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECVKJ2SS4ITO27VJ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECVKJ2SS","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5","json":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5.json","graph_json":"https://pith.science/api/pith-number/ECVKJ2SS4ITO27VJUP3F4H2GR5/graph.json","events_json":"https://pith.science/api/pith-number/ECVKJ2SS4ITO27VJUP3F4H2GR5/events.json","paper":"https://pith.science/paper/ECVKJ2SS"},"agent_actions":{"view_html":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5","download_json":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5.json","view_paper":"https://pith.science/paper/ECVKJ2SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.03279&json=true","fetch_graph":"https://pith.science/api/pith-number/ECVKJ2SS4ITO27VJUP3F4H2GR5/graph.json","fetch_events":"https://pith.science/api/pith-number/ECVKJ2SS4ITO27VJUP3F4H2GR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5/action/storage_attestation","attest_author":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5/action/author_attestation","sign_citation":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5/action/citation_signature","submit_replication":"https://pith.science/pith/ECVKJ2SS4ITO27VJUP3F4H2GR5/action/replication_record"}},"created_at":"2026-05-18T00:55:19.739553+00:00","updated_at":"2026-05-18T00:55:19.739553+00:00"}