{"id":"W4386124507","doi":"10.1109/tcomm.2023.3308153","title":"Efficient Constrained Codes That Enable Page Separation in Modern Flash Memories","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of California, San Diego; University of Oxford; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; University of Warwick; California Institute of Technology; York University; Massachusetts Institute of Technology; Princeton University; National Science Foundation","keywords":"Computer science; Decoding methods; Coding (social sciences); Flash memory; Variable-length code; Flash file system; Theoretical computer science; Algorithm; Computer engineering; Computer hardware; Mathematics; Computer memory","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003045741,0.0001734949,0.0001906829,0.0005193763,0.0005366023,0.0001123982,0.002055223,0.0001036015,0.000008510987],"category_scores_gemma":[0.00002776803,0.0001843042,0.00006390348,0.001617729,0.0003306137,0.000412954,0.00004933593,0.0004091349,0.0002105992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001452398,"about_ca_system_score_gemma":0.00008664644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002928616,"about_ca_topic_score_gemma":0.0005532131,"domain_scores_codex":[0.9986656,0.0001276427,0.0002861747,0.0003544496,0.0002477525,0.0003183784],"domain_scores_gemma":[0.9962726,0.0005568976,0.00008658958,0.002966611,0.00006771395,0.00004964276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001771016,0.0006467726,0.00003133546,0.00002561112,0.00005179515,0.00001780412,0.004103422,0.8343007,0.01296416,0.03973624,0.0008197568,0.1072847],"study_design_scores_gemma":[0.0003801712,0.00004564371,0.00007559693,0.00004038327,0.00000883671,0.000008903702,0.0007175468,0.9587722,0.02482592,0.0135909,0.001283473,0.0002504522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008849537,0.00009502559,0.9838514,0.003086466,0.0002157559,0.0003612494,0.00009557568,0.001772325,0.00167271],"genre_scores_gemma":[0.9423625,0.0003486963,0.05647066,0.00006937102,0.000003901389,0.0002838963,0.00002693825,0.00001418665,0.0004198214],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.933513,"threshold_uncertainty_score":0.7515708,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05558620222615646,"score_gpt":0.3139526668022967,"score_spread":0.2583664645761402,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}