{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5YPJZY6CJBCIUJ3NJNMAALRDM2","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":"2adf0f34d2aee8d9f474e13b68e360b6b216a0fc9539c33768d5d92d47722980","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-11T13:04:05Z","title_canon_sha256":"884f45a40e6d930acf8b46825ae14945540070da51619bb8b3e89477750cd391"},"schema_version":"1.0","source":{"id":"2506.09689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09689","created_at":"2026-07-05T11:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09689v1","created_at":"2026-07-05T11:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09689","created_at":"2026-07-05T11:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"5YPJZY6CJBCI","created_at":"2026-07-05T11:19:55Z"},{"alias_kind":"pith_short_16","alias_value":"5YPJZY6CJBCIUJ3N","created_at":"2026-07-05T11:19:55Z"},{"alias_kind":"pith_short_8","alias_value":"5YPJZY6C","created_at":"2026-07-05T11:19:55Z"}],"graph_snapshots":[{"event_id":"sha256:5d1e0d2527a7fba7d743cb1ed2ab0016cc0c6ce14c3ecce0efae10aaf5d32b60","target":"graph","created_at":"2026-07-05T11:19:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.09689/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alessio Baldelli, Franco Chiaraluce, Marco Baldi, Paolo Santini","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-11T13:04:05Z","title":"BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09689","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:c6f22d1ef53d3bd510cc152fe7cf2a99e62bbaf85a022e326b56bc2e49dded89","target":"record","created_at":"2026-07-05T11:19:55Z","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":"2adf0f34d2aee8d9f474e13b68e360b6b216a0fc9539c33768d5d92d47722980","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-11T13:04:05Z","title_canon_sha256":"884f45a40e6d930acf8b46825ae14945540070da51619bb8b3e89477750cd391"},"schema_version":"1.0","source":{"id":"2506.09689","kind":"arxiv","version":1}},"canonical_sha256":"ee1e9ce3c248448a276d4b58002e2366b97c6189eb29c27f6b82d0b841bb8686","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee1e9ce3c248448a276d4b58002e2366b97c6189eb29c27f6b82d0b841bb8686","first_computed_at":"2026-07-05T11:19:55.327808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:55.327808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Ph3aeAzsqxFycTljvDc/aVVW4A6wKxZN4wyGWcxniHQByH9cjbdlKpjVoNjVO1NlwbPyRaiyLTlZ8jKFjOXBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:55.328342Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.09689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6f22d1ef53d3bd510cc152fe7cf2a99e62bbaf85a022e326b56bc2e49dded89","sha256:5d1e0d2527a7fba7d743cb1ed2ab0016cc0c6ce14c3ecce0efae10aaf5d32b60"],"state_sha256":"8a813ae0687536ff4ba847116fb65e06546ec309a99c397995883533207c4592"}