{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UKSAJGU6ROMKFWRK75JQ6DECAK","short_pith_number":"pith:UKSAJGU6","canonical_record":{"source":{"id":"1103.0801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c91b9bcffea59179ed7608b8f454cbf94c86a146013a79252b350c5bfb000012","abstract_canon_sha256":"f9a78921a97fc5e89b62e166f274f47e8bef22149014f5e74463e7a166fa904c"},"schema_version":"1.0"},"canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","source":{"kind":"arxiv","id":"1103.0801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0801","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0801v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0801","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"UKSAJGU6ROMK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UKSAJGU6ROMKFWRK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UKSAJGU6","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UKSAJGU6ROMKFWRK75JQ6DECAK","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c91b9bcffea59179ed7608b8f454cbf94c86a146013a79252b350c5bfb000012","abstract_canon_sha256":"f9a78921a97fc5e89b62e166f274f47e8bef22149014f5e74463e7a166fa904c"},"schema_version":"1.0"},"canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.595426Z","signature_b64":"ImCBfDgnvcrdLSsS+Kp5GZVOXHS+d215f8bx4HLU6FTSCghrQIfoicCosTQ+bCfC91gVDlwV/YWLl2qgFT0fBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","last_reissued_at":"2026-05-18T00:58:43.594800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.594800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0801","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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltO+/Y1clY+P0k8kBebZb4r129/kxktidXBj6Tr7tbN9VM/r2b2+qMqSYEy40FqETv7y215EeNBP3FdOYol7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:37:11.348993Z"},"content_sha256":"d5f37a04014d0380a6f15ce92fe2b444cd46e6e7a5e31f7333a48292d92cb366","schema_version":"1.0","event_id":"sha256:d5f37a04014d0380a6f15ce92fe2b444cd46e6e7a5e31f7333a48292d92cb366"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UKSAJGU6ROMKFWRK75JQ6DECAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Bit Bit Flipping Decoding of LDPC Codes","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","submitted_at":"2011-03-03T23:08:04Z","abstract_excerpt":"In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed algorithms employ one additional bit at a variable node to represent its \"strength.\" The introduction of this additional bit increases the guaranteed error correction capability by a factor of at least 2. An additional bit can also be employed at a check node to capture information which is beneficial to decoding. A framework for failure analysis of the proposed algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0801","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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZToABR+H6utn8gE0M0IfBi3UpFf3SnF0iRm/g2rEfXWMNNkx/OYEYd1p+9WXVlnn9/diqr5lquiDmsSUjjiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:37:11.349349Z"},"content_sha256":"359c4c9e0f676075775e0e50c4c8a70c8ebd979f5a2a35b7341f20032cc7839e","schema_version":"1.0","event_id":"sha256:359c4c9e0f676075775e0e50c4c8a70c8ebd979f5a2a35b7341f20032cc7839e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/bundle.json","state_url":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/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-26T02:37:11Z","links":{"resolver":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK","bundle":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/bundle.json","state":"https://pith.science/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKSAJGU6ROMKFWRK75JQ6DECAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UKSAJGU6ROMKFWRK75JQ6DECAK","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":"f9a78921a97fc5e89b62e166f274f47e8bef22149014f5e74463e7a166fa904c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","title_canon_sha256":"c91b9bcffea59179ed7608b8f454cbf94c86a146013a79252b350c5bfb000012"},"schema_version":"1.0","source":{"id":"1103.0801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0801","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0801v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0801","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"UKSAJGU6ROMK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UKSAJGU6ROMKFWRK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UKSAJGU6","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:359c4c9e0f676075775e0e50c4c8a70c8ebd979f5a2a35b7341f20032cc7839e","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"In this paper, we propose a new class of bit flipping algorithms for low-density parity-check (LDPC) codes over the binary symmetric channel (BSC). Compared to the regular (parallel or serial) bit flipping algorithms, the proposed algorithms employ one additional bit at a variable node to represent its \"strength.\" The introduction of this additional bit increases the guaranteed error correction capability by a factor of at least 2. An additional bit can also be employed at a check node to capture information which is beneficial to decoding. A framework for failure analysis of the proposed algo","authors_text":"Bane Vasic, Dung Viet Nguyen, Michael W. Marcellin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","title":"Two-Bit Bit Flipping Decoding of LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0801","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:d5f37a04014d0380a6f15ce92fe2b444cd46e6e7a5e31f7333a48292d92cb366","target":"record","created_at":"2026-05-18T00:58:43Z","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":"f9a78921a97fc5e89b62e166f274f47e8bef22149014f5e74463e7a166fa904c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-03T23:08:04Z","title_canon_sha256":"c91b9bcffea59179ed7608b8f454cbf94c86a146013a79252b350c5bfb000012"},"schema_version":"1.0","source":{"id":"1103.0801","kind":"arxiv","version":1}},"canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2a4049a9e8b98a2da2aff530f0c8202a59eb192f0676cae568fae1f195d6e94","first_computed_at":"2026-05-18T00:58:43.594800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.594800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ImCBfDgnvcrdLSsS+Kp5GZVOXHS+d215f8bx4HLU6FTSCghrQIfoicCosTQ+bCfC91gVDlwV/YWLl2qgFT0fBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.595426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5f37a04014d0380a6f15ce92fe2b444cd46e6e7a5e31f7333a48292d92cb366","sha256:359c4c9e0f676075775e0e50c4c8a70c8ebd979f5a2a35b7341f20032cc7839e"],"state_sha256":"3a70c2adc78fab8e2c8a6fe28f4e870dc3ef1682a4585ae313e37391a38b7387"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcxHClyhsqsjZA2skg5VOVUfgax+AztqB3ZfmCDciqo6xQae4o1lzk48sW2YAvNEKKyefoTHpv3kTM678i5xBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:37:11.351353Z","bundle_sha256":"447eca4fdc1dddf6ffd636fec8a291592688fb3e0f72aab271d12e6907f85099"}}