{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:HVG47OVC336XZ6KF7KDQFKYCKY","short_pith_number":"pith:HVG47OVC","schema_version":"1.0","canonical_sha256":"3d4dcfbaa2defd7cf945fa8702ab02560ee616ca7f17ba439b3b7e8b116a2065","source":{"kind":"arxiv","id":"0807.3582","version":1},"attestation_state":"computed","paper":{"title":"Error Correction Capability of Column-Weight-Three LDPC Codes: Part II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, Dung Viet Nguyen, Michael W. Marcellin, Shashi Kiran Chilappagari","submitted_at":"2008-07-23T01:04:27Z","abstract_excerpt":"The relation between the girth and the error correction capability of column-weight-three LDPC codes is investigated. Specifically, it is shown that the Gallager A algorithm can correct $g/2-1$ errors in $g/2$ iterations on a Tanner graph of girth $g \\geq 10$."},"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":"0807.3582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-07-23T01:04:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63d202f689ac018a82c8efe19d6dd4581480f818539099863bafb6a625588132","abstract_canon_sha256":"819285dc6ceff678983700b9c0f8bbe616ac817bc31e61b00fd67ef9d3898a92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.699308Z","signature_b64":"4oibdTdEYZGTxQCkaTtnJo+I/D7G/JOHFOR8wyQVl55TF7wQhEdhKyVJSJpGUGkE1NYunIrfRvJt2dPfsGqDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d4dcfbaa2defd7cf945fa8702ab02560ee616ca7f17ba439b3b7e8b116a2065","last_reissued_at":"2026-05-18T00:59:11.698671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.698671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Correction Capability of Column-Weight-Three LDPC Codes: Part II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bane Vasic, Dung Viet Nguyen, Michael W. Marcellin, Shashi Kiran Chilappagari","submitted_at":"2008-07-23T01:04:27Z","abstract_excerpt":"The relation between the girth and the error correction capability of column-weight-three LDPC codes is investigated. Specifically, it is shown that the Gallager A algorithm can correct $g/2-1$ errors in $g/2$ iterations on a Tanner graph of girth $g \\geq 10$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.3582","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":"0807.3582","created_at":"2026-05-18T00:59:11.698777+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.3582v1","created_at":"2026-05-18T00:59:11.698777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.3582","created_at":"2026-05-18T00:59:11.698777+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVG47OVC336X","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVG47OVC336XZ6KF","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVG47OVC","created_at":"2026-05-18T12:25:57.157939+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/HVG47OVC336XZ6KF7KDQFKYCKY","json":"https://pith.science/pith/HVG47OVC336XZ6KF7KDQFKYCKY.json","graph_json":"https://pith.science/api/pith-number/HVG47OVC336XZ6KF7KDQFKYCKY/graph.json","events_json":"https://pith.science/api/pith-number/HVG47OVC336XZ6KF7KDQFKYCKY/events.json","paper":"https://pith.science/paper/HVG47OVC"},"agent_actions":{"view_html":"https://pith.science/pith/HVG47OVC336XZ6KF7KDQFKYCKY","download_json":"https://pith.science/pith/HVG47OVC336XZ6KF7KDQFKYCKY.json","view_paper":"https://pith.science/paper/HVG47OVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.3582&json=true","fetch_graph":"https://pith.science/api/pith-number/HVG47OVC336XZ6KF7KDQFKYCKY/graph.json","fetch_events":"https://pith.science/api/pith-number/HVG47OVC336XZ6KF7KDQFKYCKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVG47OVC336XZ6KF7KDQFKYCKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVG47OVC336XZ6KF7KDQFKYCKY/action/storage_attestation","attest_author":"https://pith.science/pith/HVG47OVC336XZ6KF7KDQFKYCKY/action/author_attestation","sign_citation":"https://pith.science/pith/HVG47OVC336XZ6KF7KDQFKYCKY/action/citation_signature","submit_replication":"https://pith.science/pith/HVG47OVC336XZ6KF7KDQFKYCKY/action/replication_record"}},"created_at":"2026-05-18T00:59:11.698777+00:00","updated_at":"2026-05-18T00:59:11.698777+00:00"}