{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EVLM5VJBNMFNGFDCBPFWRCPUZR","short_pith_number":"pith:EVLM5VJB","schema_version":"1.0","canonical_sha256":"2556ced5216b0ad314620bcb6889f4cc63e824597cad3e02ad105f7153c897e8","source":{"kind":"arxiv","id":"2004.05340","version":1},"attestation_state":"computed","paper":{"title":"DNN-aided Read-voltage Threshold Optimization for MLC Flash Memory with Finite Block Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Wang, Jun Li, Kang Wei, Kui Cai, Lingjun Kong, Long Shi, Zhen Mei","submitted_at":"2020-04-11T09:03:50Z","abstract_excerpt":"The error correcting performance of multi-level-cell (MLC) NAND flash memory is closely related to the block length of error correcting codes (ECCs) and log-likelihood-ratios (LLRs) of the read-voltage thresholds. Driven by this issue, this paper optimizes the read-voltage thresholds for MLC flash memory to improve the decoding performance of ECCs with finite block length. First, through the analysis of channel coding rate (CCR) and decoding error probability under finite block length, we formulate the optimization problem of read-voltage thresholds to minimize the maximum decoding error proba"},"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":"2004.05340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-04-11T09:03:50Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"41b2ee2c6299bce0281a772c5f884dc913135d4e0b99fe6270014e330a6092dc","abstract_canon_sha256":"daed32c67d5817a7a441e782a8d2257f9ab3ea5b6b91c5e6cdbad66b863c925b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:36.229534Z","signature_b64":"kKzU2euhjVzFmSe17H85lFhNr1QRPBN90xSUKHy4815dAsgyrp0g2ziqGtY28lXebKx6GTQtKWdhNXVMXHsdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2556ced5216b0ad314620bcb6889f4cc63e824597cad3e02ad105f7153c897e8","last_reissued_at":"2026-07-05T00:54:36.229094Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:36.229094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DNN-aided Read-voltage Threshold Optimization for MLC Flash Memory with Finite Block Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Wang, Jun Li, Kang Wei, Kui Cai, Lingjun Kong, Long Shi, Zhen Mei","submitted_at":"2020-04-11T09:03:50Z","abstract_excerpt":"The error correcting performance of multi-level-cell (MLC) NAND flash memory is closely related to the block length of error correcting codes (ECCs) and log-likelihood-ratios (LLRs) of the read-voltage thresholds. Driven by this issue, this paper optimizes the read-voltage thresholds for MLC flash memory to improve the decoding performance of ECCs with finite block length. First, through the analysis of channel coding rate (CCR) and decoding error probability under finite block length, we formulate the optimization problem of read-voltage thresholds to minimize the maximum decoding error proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05340","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/2004.05340/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":"2004.05340","created_at":"2026-07-05T00:54:36.229148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.05340v1","created_at":"2026-07-05T00:54:36.229148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05340","created_at":"2026-07-05T00:54:36.229148+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVLM5VJBNMFN","created_at":"2026-07-05T00:54:36.229148+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVLM5VJBNMFNGFDC","created_at":"2026-07-05T00:54:36.229148+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVLM5VJB","created_at":"2026-07-05T00:54:36.229148+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/EVLM5VJBNMFNGFDCBPFWRCPUZR","json":"https://pith.science/pith/EVLM5VJBNMFNGFDCBPFWRCPUZR.json","graph_json":"https://pith.science/api/pith-number/EVLM5VJBNMFNGFDCBPFWRCPUZR/graph.json","events_json":"https://pith.science/api/pith-number/EVLM5VJBNMFNGFDCBPFWRCPUZR/events.json","paper":"https://pith.science/paper/EVLM5VJB"},"agent_actions":{"view_html":"https://pith.science/pith/EVLM5VJBNMFNGFDCBPFWRCPUZR","download_json":"https://pith.science/pith/EVLM5VJBNMFNGFDCBPFWRCPUZR.json","view_paper":"https://pith.science/paper/EVLM5VJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.05340&json=true","fetch_graph":"https://pith.science/api/pith-number/EVLM5VJBNMFNGFDCBPFWRCPUZR/graph.json","fetch_events":"https://pith.science/api/pith-number/EVLM5VJBNMFNGFDCBPFWRCPUZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVLM5VJBNMFNGFDCBPFWRCPUZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVLM5VJBNMFNGFDCBPFWRCPUZR/action/storage_attestation","attest_author":"https://pith.science/pith/EVLM5VJBNMFNGFDCBPFWRCPUZR/action/author_attestation","sign_citation":"https://pith.science/pith/EVLM5VJBNMFNGFDCBPFWRCPUZR/action/citation_signature","submit_replication":"https://pith.science/pith/EVLM5VJBNMFNGFDCBPFWRCPUZR/action/replication_record"}},"created_at":"2026-07-05T00:54:36.229148+00:00","updated_at":"2026-07-05T00:54:36.229148+00:00"}