{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QXYCXJLF6OSZP434QQ76ZNXEUZ","short_pith_number":"pith:QXYCXJLF","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"},"canonical_sha256":"85f02ba565f3a597f37c843fecb6e4a6764030d4843d32c9d88082598e42115d","source":{"kind":"arxiv","id":"1405.6353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6353","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6353v1","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6353","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"QXYCXJLF6OSZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QXYCXJLF6OSZP434","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QXYCXJLF","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QXYCXJLF6OSZP434QQ76ZNXEUZ","target":"record","payload":{"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"},"canonical_sha256":"85f02ba565f3a597f37c843fecb6e4a6764030d4843d32c9d88082598e42115d","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"},"source_kind":"arxiv","source_id":"1405.6353","source_version":1,"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-18T02:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yG+rRHGMCCCtdQG943sF1tsB/EuZy9ZS+lX0B3mYo660tEePhw2O4PHRgS0WU/XiMriVZ8CXrZvQMg2FZMzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:40:59.695169Z"},"content_sha256":"37e3fe2037445d7d42da5b287ade6dd4fdedb32f18623cd9e4c60a630b24ea86","schema_version":"1.0","event_id":"sha256:37e3fe2037445d7d42da5b287ade6dd4fdedb32f18623cd9e4c60a630b24ea86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QXYCXJLF6OSZP434QQ76ZNXEUZ","target":"graph","payload":{"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"},"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-18T02:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbA1FKSZ4EaQfRIlufh5GlXHGBa3smRjxs0la3Q6mr9YbWzgpKpynoJ4z/rZCgA38JMMbKxU6/ZrOXR3FOoADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:40:59.695527Z"},"content_sha256":"52e560004e9f22f03350fdc1054cdde997167762d941978ed2436a6a8f0ecffb","schema_version":"1.0","event_id":"sha256:52e560004e9f22f03350fdc1054cdde997167762d941978ed2436a6a8f0ecffb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/bundle.json","state_url":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/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-06-30T23:40:59Z","links":{"resolver":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ","bundle":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/bundle.json","state":"https://pith.science/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXYCXJLF6OSZP434QQ76ZNXEUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QXYCXJLF6OSZP434QQ76ZNXEUZ","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":"0ba44fdade2c45ade93fea7e7bc6e5f16dada4e9e5f7762605218795cb1acaad","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-25T00:45:14Z","title_canon_sha256":"277bcacc3c5bbd84338e7d669e88d0316816949a285fd419340be8657cc5f57f"},"schema_version":"1.0","source":{"id":"1405.6353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6353","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6353v1","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6353","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"QXYCXJLF6OSZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QXYCXJLF6OSZP434","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QXYCXJLF","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:52e560004e9f22f03350fdc1054cdde997167762d941978ed2436a6a8f0ecffb","target":"graph","created_at":"2026-05-18T02:51:07Z","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":"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","authors_text":"Aravind Iyengar, Nima Noorshams","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-25T00:45:14Z","title":"A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6353","kind":"arxiv","version":1},"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:37e3fe2037445d7d42da5b287ade6dd4fdedb32f18623cd9e4c60a630b24ea86","target":"record","created_at":"2026-05-18T02:51:07Z","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":"0ba44fdade2c45ade93fea7e7bc6e5f16dada4e9e5f7762605218795cb1acaad","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-25T00:45:14Z","title_canon_sha256":"277bcacc3c5bbd84338e7d669e88d0316816949a285fd419340be8657cc5f57f"},"schema_version":"1.0","source":{"id":"1405.6353","kind":"arxiv","version":1}},"canonical_sha256":"85f02ba565f3a597f37c843fecb6e4a6764030d4843d32c9d88082598e42115d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85f02ba565f3a597f37c843fecb6e4a6764030d4843d32c9d88082598e42115d","first_computed_at":"2026-05-18T02:51:07.473661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:07.473661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kl/uNNvvjwSBoVdHw5FiS4o73GskzWsjteciKR3lswkfjbzKkI4un/Kj4XrFtAIlezk30JgHPwW1DG+KYuKZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:07.474113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37e3fe2037445d7d42da5b287ade6dd4fdedb32f18623cd9e4c60a630b24ea86","sha256:52e560004e9f22f03350fdc1054cdde997167762d941978ed2436a6a8f0ecffb"],"state_sha256":"bfc7f5e4d121f0b98f3f6ed8c66c4ce9d85ffa243fbe3974adf3eb335a48359c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVllzqqjFFpLJG1tPVdWD//s5YK/fFiof8hGtVvQ1vFLEb2PATM5ALUF+E6n82MhKiXt0Qg9H/Wj8J8L+yoNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:40:59.697534Z","bundle_sha256":"3dce085f34f906305d068796e9d8f5109c2eb106418709c6c0e88cccedf688c4"}}