{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QXYCXJLF6OSZP434QQ76ZNXEUZ","short_pith_number":"pith:QXYCXJLF","schema_version":"1.0","canonical_sha256":"85f02ba565f3a597f37c843fecb6e4a6764030d4843d32c9d88082598e42115d","source":{"kind":"arxiv","id":"1405.6353","version":1},"attestation_state":"computed","paper":{"title":"A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Aravind Iyengar, Nima Noorshams","submitted_at":"2014-05-25T00:45:14Z","abstract_excerpt":"Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing messages between variable and check nodes of the factor graph. The sum-product algorithm is fully parallelizable, owing to the fact that all messages can be update concurrently. However, since it requires extensive number of highly interconnected wires, the fully-parallel implementation of the sum-product on chips is exceedingly challenging. Stochastic decodin"},"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":"1405.6353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-25T00:45:14Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"277bcacc3c5bbd84338e7d669e88d0316816949a285fd419340be8657cc5f57f","abstract_canon_sha256":"0ba44fdade2c45ade93fea7e7bc6e5f16dada4e9e5f7762605218795cb1acaad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:07.474113Z","signature_b64":"kl/uNNvvjwSBoVdHw5FiS4o73GskzWsjteciKR3lswkfjbzKkI4un/Kj4XrFtAIlezk30JgHPwW1DG+KYuKZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f02ba565f3a597f37c843fecb6e4a6764030d4843d32c9d88082598e42115d","last_reissued_at":"2026-05-18T02:51:07.473661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:07.473661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Aravind Iyengar, Nima Noorshams","submitted_at":"2014-05-25T00:45:14Z","abstract_excerpt":"Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing messages between variable and check nodes of the factor graph. The sum-product algorithm is fully parallelizable, owing to the fact that all messages can be update concurrently. However, since it requires extensive number of highly interconnected wires, the fully-parallel implementation of the sum-product on chips is exceedingly challenging. Stochastic decodin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6353","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":"1405.6353","created_at":"2026-05-18T02:51:07.473731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6353v1","created_at":"2026-05-18T02:51:07.473731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6353","created_at":"2026-05-18T02:51:07.473731+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXYCXJLF6OSZ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXYCXJLF6OSZP434","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXYCXJLF","created_at":"2026-05-18T12:28:46.137349+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/QXYCXJLF6OSZP434QQ76ZNXEUZ","json":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ.json","graph_json":"https://pith.science/api/pith-number/QXYCXJLF6OSZP434QQ76ZNXEUZ/graph.json","events_json":"https://pith.science/api/pith-number/QXYCXJLF6OSZP434QQ76ZNXEUZ/events.json","paper":"https://pith.science/paper/QXYCXJLF"},"agent_actions":{"view_html":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ","download_json":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ.json","view_paper":"https://pith.science/paper/QXYCXJLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6353&json=true","fetch_graph":"https://pith.science/api/pith-number/QXYCXJLF6OSZP434QQ76ZNXEUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/QXYCXJLF6OSZP434QQ76ZNXEUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/action/storage_attestation","attest_author":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/action/author_attestation","sign_citation":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/action/citation_signature","submit_replication":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/action/replication_record"}},"created_at":"2026-05-18T02:51:07.473731+00:00","updated_at":"2026-05-18T02:51:07.473731+00:00"}