{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GW5GML4TJSKFT5ME2KENOMPZPJ","short_pith_number":"pith:GW5GML4T","schema_version":"1.0","canonical_sha256":"35ba662f934c9459f584d288d731f97a43a971ab4dd1f049ac9846352ee02394","source":{"kind":"arxiv","id":"2304.05306","version":3},"attestation_state":"computed","paper":{"title":"Optimizing Linear Correctors: A Tight Output Min-Entropy Bound and Selection Technique","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ingrid Verbauwhede, Milo\\v{s} Gruji\\'c","submitted_at":"2023-04-11T16:00:41Z","abstract_excerpt":"Post-processing of the raw bits produced by a true random number generator (TRNG) is always necessary when the entropy per bit is insufficient for security applications. In this paper, we derive a tight bound on the output min-entropy of the algorithmic post-processing module based on linear codes, known as linear correctors. Our bound is based on the codes' weight distributions, and we prove that it holds even for the real-world noise sources that produce independent but not identically distributed bits. Additionally, we present a method for identifying the optimal linear corrector for a give"},"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":"2304.05306","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-04-11T16:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"1957d7574ab1857e8a644625f6e1c32b8befac26d9a4e986cf228032ff4a3e10","abstract_canon_sha256":"68ce120c68d5cd1f3df42984053aadd4176f48a534e062365b64308d5daba90e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:34.734735Z","signature_b64":"d0SVyRszaikZ5O2u9xfIgoaU5p3I5MbDKaEmkpY5X8S9pwPYMKaQBvnCwCB0Jdyy/FTAYgc3dzHWEHJkDtS/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35ba662f934c9459f584d288d731f97a43a971ab4dd1f049ac9846352ee02394","last_reissued_at":"2026-07-05T08:35:34.734371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:34.734371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Linear Correctors: A Tight Output Min-Entropy Bound and Selection Technique","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ingrid Verbauwhede, Milo\\v{s} Gruji\\'c","submitted_at":"2023-04-11T16:00:41Z","abstract_excerpt":"Post-processing of the raw bits produced by a true random number generator (TRNG) is always necessary when the entropy per bit is insufficient for security applications. In this paper, we derive a tight bound on the output min-entropy of the algorithmic post-processing module based on linear codes, known as linear correctors. Our bound is based on the codes' weight distributions, and we prove that it holds even for the real-world noise sources that produce independent but not identically distributed bits. Additionally, we present a method for identifying the optimal linear corrector for a give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.05306","kind":"arxiv","version":3},"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/2304.05306/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":"2304.05306","created_at":"2026-07-05T08:35:34.734430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.05306v3","created_at":"2026-07-05T08:35:34.734430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.05306","created_at":"2026-07-05T08:35:34.734430+00:00"},{"alias_kind":"pith_short_12","alias_value":"GW5GML4TJSKF","created_at":"2026-07-05T08:35:34.734430+00:00"},{"alias_kind":"pith_short_16","alias_value":"GW5GML4TJSKFT5ME","created_at":"2026-07-05T08:35:34.734430+00:00"},{"alias_kind":"pith_short_8","alias_value":"GW5GML4T","created_at":"2026-07-05T08:35:34.734430+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/GW5GML4TJSKFT5ME2KENOMPZPJ","json":"https://pith.science/pith/GW5GML4TJSKFT5ME2KENOMPZPJ.json","graph_json":"https://pith.science/api/pith-number/GW5GML4TJSKFT5ME2KENOMPZPJ/graph.json","events_json":"https://pith.science/api/pith-number/GW5GML4TJSKFT5ME2KENOMPZPJ/events.json","paper":"https://pith.science/paper/GW5GML4T"},"agent_actions":{"view_html":"https://pith.science/pith/GW5GML4TJSKFT5ME2KENOMPZPJ","download_json":"https://pith.science/pith/GW5GML4TJSKFT5ME2KENOMPZPJ.json","view_paper":"https://pith.science/paper/GW5GML4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.05306&json=true","fetch_graph":"https://pith.science/api/pith-number/GW5GML4TJSKFT5ME2KENOMPZPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GW5GML4TJSKFT5ME2KENOMPZPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GW5GML4TJSKFT5ME2KENOMPZPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GW5GML4TJSKFT5ME2KENOMPZPJ/action/storage_attestation","attest_author":"https://pith.science/pith/GW5GML4TJSKFT5ME2KENOMPZPJ/action/author_attestation","sign_citation":"https://pith.science/pith/GW5GML4TJSKFT5ME2KENOMPZPJ/action/citation_signature","submit_replication":"https://pith.science/pith/GW5GML4TJSKFT5ME2KENOMPZPJ/action/replication_record"}},"created_at":"2026-07-05T08:35:34.734430+00:00","updated_at":"2026-07-05T08:35:34.734430+00:00"}