{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:R25OTXYDGSUP3MQVAG7RXU6TW6","short_pith_number":"pith:R25OTXYD","schema_version":"1.0","canonical_sha256":"8ebae9df0334a8fdb21501bf1bd3d3b786de2d1ab853adcc297ee370aabe964c","source":{"kind":"arxiv","id":"1202.1348","version":2},"attestation_state":"computed","paper":{"title":"Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction","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":"2012-02-07T04:32:48Z","abstract_excerpt":"A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that"},"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":"1202.1348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T04:32:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7c3ab08afb25f3f47734f8c2939b0b5409d0af187df2b6b9888a68cd2c26f6fd","abstract_canon_sha256":"0ff55b8dc5dde2869504472f1eca571b7c7c05cc869a553eb9d5f005d0d42a80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:13.925642Z","signature_b64":"Gb92LJ7AG20whBr5ya37aj5oNzR4O8eUVM3yMInzAo19Y1QfLXr/x/ZgwDP6R/DYO7yNI1AXWM8hCnHbROx/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ebae9df0334a8fdb21501bf1bd3d3b786de2d1ab853adcc297ee370aabe964c","last_reissued_at":"2026-05-18T03:55:13.925150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:13.925150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction","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":"2012-02-07T04:32:48Z","abstract_excerpt":"A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1348","kind":"arxiv","version":2},"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":"1202.1348","created_at":"2026-05-18T03:55:13.925232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1348v2","created_at":"2026-05-18T03:55:13.925232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1348","created_at":"2026-05-18T03:55:13.925232+00:00"},{"alias_kind":"pith_short_12","alias_value":"R25OTXYDGSUP","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"R25OTXYDGSUP3MQV","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"R25OTXYD","created_at":"2026-05-18T12:27:20.899486+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/R25OTXYDGSUP3MQVAG7RXU6TW6","json":"https://pith.science/pith/R25OTXYDGSUP3MQVAG7RXU6TW6.json","graph_json":"https://pith.science/api/pith-number/R25OTXYDGSUP3MQVAG7RXU6TW6/graph.json","events_json":"https://pith.science/api/pith-number/R25OTXYDGSUP3MQVAG7RXU6TW6/events.json","paper":"https://pith.science/paper/R25OTXYD"},"agent_actions":{"view_html":"https://pith.science/pith/R25OTXYDGSUP3MQVAG7RXU6TW6","download_json":"https://pith.science/pith/R25OTXYDGSUP3MQVAG7RXU6TW6.json","view_paper":"https://pith.science/paper/R25OTXYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1348&json=true","fetch_graph":"https://pith.science/api/pith-number/R25OTXYDGSUP3MQVAG7RXU6TW6/graph.json","fetch_events":"https://pith.science/api/pith-number/R25OTXYDGSUP3MQVAG7RXU6TW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R25OTXYDGSUP3MQVAG7RXU6TW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R25OTXYDGSUP3MQVAG7RXU6TW6/action/storage_attestation","attest_author":"https://pith.science/pith/R25OTXYDGSUP3MQVAG7RXU6TW6/action/author_attestation","sign_citation":"https://pith.science/pith/R25OTXYDGSUP3MQVAG7RXU6TW6/action/citation_signature","submit_replication":"https://pith.science/pith/R25OTXYDGSUP3MQVAG7RXU6TW6/action/replication_record"}},"created_at":"2026-05-18T03:55:13.925232+00:00","updated_at":"2026-05-18T03:55:13.925232+00:00"}