{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VQAOYZC7ASQB2OZOG5TJCTHCZH","short_pith_number":"pith:VQAOYZC7","schema_version":"1.0","canonical_sha256":"ac00ec645f04a01d3b2e3766914ce2c9fc23f20a5318856d8bde051b4a7f5ee5","source":{"kind":"arxiv","id":"1402.2773","version":3},"attestation_state":"computed","paper":{"title":"Noisy Gradient Descent Bit-Flip Decoding for LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chris Winstead, Emmanuel Boutillon, Gopalakrishnan Sundararajan","submitted_at":"2014-02-12T09:57:27Z","abstract_excerpt":"A modified Gradient Descent Bit Flipping (GDBF) algorithm is proposed for decoding Low Density Parity Check (LDPC) codes on the binary-input additive white Gaussian noise channel. The new algorithm, called Noisy GDBF (NGDBF), introduces a random perturbation into each symbol metric at each iteration. The noise perturbation allows the algorithm to escape from undesirable local maxima, resulting in improved performance. A combination of heuristic improvements to the algorithm are proposed and evaluated. When the proposed heuristics are applied, NGDBF performs better than any previously reported "},"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":"1402.2773","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-12T09:57:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"39fbb68f4c83a30381c870b8c6948ffb90a2c229bb09aecc7688f03934fb98ba","abstract_canon_sha256":"af4ec6608c1c37eff88ee79a0f9a2d944fc520c3cc26968ffe5e1fb1fc473a02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:46.260780Z","signature_b64":"VzT7rDyIuFUSimY0JQpIVVCApsKXlLYavRoyrNBht1BgD3lDsYYa+WTbilFjbiXnhJT1j37YEVcTPco/9tyIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac00ec645f04a01d3b2e3766914ce2c9fc23f20a5318856d8bde051b4a7f5ee5","last_reissued_at":"2026-05-18T02:32:46.260263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:46.260263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Gradient Descent Bit-Flip Decoding for LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chris Winstead, Emmanuel Boutillon, Gopalakrishnan Sundararajan","submitted_at":"2014-02-12T09:57:27Z","abstract_excerpt":"A modified Gradient Descent Bit Flipping (GDBF) algorithm is proposed for decoding Low Density Parity Check (LDPC) codes on the binary-input additive white Gaussian noise channel. The new algorithm, called Noisy GDBF (NGDBF), introduces a random perturbation into each symbol metric at each iteration. The noise perturbation allows the algorithm to escape from undesirable local maxima, resulting in improved performance. A combination of heuristic improvements to the algorithm are proposed and evaluated. When the proposed heuristics are applied, NGDBF performs better than any previously reported "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2773","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.2773","created_at":"2026-05-18T02:32:46.260362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2773v3","created_at":"2026-05-18T02:32:46.260362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2773","created_at":"2026-05-18T02:32:46.260362+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQAOYZC7ASQB","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQAOYZC7ASQB2OZO","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQAOYZC7","created_at":"2026-05-18T12:28:54.890064+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/VQAOYZC7ASQB2OZOG5TJCTHCZH","json":"https://pith.science/pith/VQAOYZC7ASQB2OZOG5TJCTHCZH.json","graph_json":"https://pith.science/api/pith-number/VQAOYZC7ASQB2OZOG5TJCTHCZH/graph.json","events_json":"https://pith.science/api/pith-number/VQAOYZC7ASQB2OZOG5TJCTHCZH/events.json","paper":"https://pith.science/paper/VQAOYZC7"},"agent_actions":{"view_html":"https://pith.science/pith/VQAOYZC7ASQB2OZOG5TJCTHCZH","download_json":"https://pith.science/pith/VQAOYZC7ASQB2OZOG5TJCTHCZH.json","view_paper":"https://pith.science/paper/VQAOYZC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2773&json=true","fetch_graph":"https://pith.science/api/pith-number/VQAOYZC7ASQB2OZOG5TJCTHCZH/graph.json","fetch_events":"https://pith.science/api/pith-number/VQAOYZC7ASQB2OZOG5TJCTHCZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQAOYZC7ASQB2OZOG5TJCTHCZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQAOYZC7ASQB2OZOG5TJCTHCZH/action/storage_attestation","attest_author":"https://pith.science/pith/VQAOYZC7ASQB2OZOG5TJCTHCZH/action/author_attestation","sign_citation":"https://pith.science/pith/VQAOYZC7ASQB2OZOG5TJCTHCZH/action/citation_signature","submit_replication":"https://pith.science/pith/VQAOYZC7ASQB2OZOG5TJCTHCZH/action/replication_record"}},"created_at":"2026-05-18T02:32:46.260362+00:00","updated_at":"2026-05-18T02:32:46.260362+00:00"}