{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5YPJZY6CJBCIUJ3NJNMAALRDM2","short_pith_number":"pith:5YPJZY6C","schema_version":"1.0","canonical_sha256":"ee1e9ce3c248448a276d4b58002e2366b97c6189eb29c27f6b82d0b841bb8686","source":{"kind":"arxiv","id":"2506.09689","version":1},"attestation_state":"computed","paper":{"title":"BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Alessio Baldelli, Franco Chiaraluce, Marco Baldi, Paolo Santini","submitted_at":"2025-06-11T13:04:05Z","abstract_excerpt":"The Bit-Flipping (BF) decoder, thanks to its very low computational complexity, is widely employed in post-quantum cryptographic schemes based on Moderate Density Parity Check codes in which, ultimately, decryption boils down to syndrome decoding. In such a setting, for security concerns, one must guarantee that the Decoding Failure Rate (DFR) is negligible. Such a condition, however, is very difficult to guarantee, because simulations are of little help and the decoder performance is difficult to model theoretically. In this paper, we introduce a new version of the BF decoder, that we call BF"},"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":"2506.09689","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-11T13:04:05Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"884f45a40e6d930acf8b46825ae14945540070da51619bb8b3e89477750cd391","abstract_canon_sha256":"2adf0f34d2aee8d9f474e13b68e360b6b216a0fc9539c33768d5d92d47722980"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:55.328342Z","signature_b64":"8Ph3aeAzsqxFycTljvDc/aVVW4A6wKxZN4wyGWcxniHQByH9cjbdlKpjVoNjVO1NlwbPyRaiyLTlZ8jKFjOXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee1e9ce3c248448a276d4b58002e2366b97c6189eb29c27f6b82d0b841bb8686","last_reissued_at":"2026-07-05T11:19:55.327808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:55.327808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Alessio Baldelli, Franco Chiaraluce, Marco Baldi, Paolo Santini","submitted_at":"2025-06-11T13:04:05Z","abstract_excerpt":"The Bit-Flipping (BF) decoder, thanks to its very low computational complexity, is widely employed in post-quantum cryptographic schemes based on Moderate Density Parity Check codes in which, ultimately, decryption boils down to syndrome decoding. In such a setting, for security concerns, one must guarantee that the Decoding Failure Rate (DFR) is negligible. Such a condition, however, is very difficult to guarantee, because simulations are of little help and the decoder performance is difficult to model theoretically. In this paper, we introduce a new version of the BF decoder, that we call BF"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09689","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.09689/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.09689","created_at":"2026-07-05T11:19:55.327880+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.09689v1","created_at":"2026-07-05T11:19:55.327880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09689","created_at":"2026-07-05T11:19:55.327880+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YPJZY6CJBCI","created_at":"2026-07-05T11:19:55.327880+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YPJZY6CJBCIUJ3N","created_at":"2026-07-05T11:19:55.327880+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YPJZY6C","created_at":"2026-07-05T11:19:55.327880+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/5YPJZY6CJBCIUJ3NJNMAALRDM2","json":"https://pith.science/pith/5YPJZY6CJBCIUJ3NJNMAALRDM2.json","graph_json":"https://pith.science/api/pith-number/5YPJZY6CJBCIUJ3NJNMAALRDM2/graph.json","events_json":"https://pith.science/api/pith-number/5YPJZY6CJBCIUJ3NJNMAALRDM2/events.json","paper":"https://pith.science/paper/5YPJZY6C"},"agent_actions":{"view_html":"https://pith.science/pith/5YPJZY6CJBCIUJ3NJNMAALRDM2","download_json":"https://pith.science/pith/5YPJZY6CJBCIUJ3NJNMAALRDM2.json","view_paper":"https://pith.science/paper/5YPJZY6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.09689&json=true","fetch_graph":"https://pith.science/api/pith-number/5YPJZY6CJBCIUJ3NJNMAALRDM2/graph.json","fetch_events":"https://pith.science/api/pith-number/5YPJZY6CJBCIUJ3NJNMAALRDM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YPJZY6CJBCIUJ3NJNMAALRDM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YPJZY6CJBCIUJ3NJNMAALRDM2/action/storage_attestation","attest_author":"https://pith.science/pith/5YPJZY6CJBCIUJ3NJNMAALRDM2/action/author_attestation","sign_citation":"https://pith.science/pith/5YPJZY6CJBCIUJ3NJNMAALRDM2/action/citation_signature","submit_replication":"https://pith.science/pith/5YPJZY6CJBCIUJ3NJNMAALRDM2/action/replication_record"}},"created_at":"2026-07-05T11:19:55.327880+00:00","updated_at":"2026-07-05T11:19:55.327880+00:00"}