{"id":"W4415368361","doi":"10.1109/tit.2025.3623202","title":"A Combinatorial Perspective on Random Access Efficiency for DNA Storage","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"European Research Council; Technion-Israel Institute of Technology; Università degli Studi di Trento; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Technische Universität München; Technische Universiteit Eindhoven; The Research Council; University College Dublin; Nanyang Technological University; European Commission; California Institute of Technology; University of Toronto; Division of Mathematical Sciences; Villum Fonden; National Science Foundation","keywords":"Generator matrix; Intersection (aeronautics); Random access; Generator (circuit theory); Matrix (chemical analysis); Construct (python library); Perspective (graphical); Code (set theory); Decoding methods","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.000324632,0.0001136232,0.0001056687,0.0001058629,0.0002519959,0.00006031547,0.0001859418,0.000124413,0.0000177545],"category_scores_gemma":[0.00006581227,0.00009182805,0.0001296714,0.0001278082,0.00005545737,0.00002014168,0.000003027415,0.0001023659,0.00001270633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004635668,"about_ca_system_score_gemma":0.00005683127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002273956,"about_ca_topic_score_gemma":7.756705e-7,"domain_scores_codex":[0.9993792,0.00007126666,0.0001935187,0.0001390174,0.00007559198,0.0001414152],"domain_scores_gemma":[0.999486,0.0001272528,0.00006384194,0.000155075,0.0001379585,0.000029842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.03473289,0.00190542,0.0000160346,0.0002577556,0.0007386239,0.000001168308,0.002185078,0.08892106,0.05419199,0.6173951,0.004838563,0.1948163],"study_design_scores_gemma":[0.01573757,0.003175793,0.0001590862,0.0001342319,0.0001224365,0.000003630183,0.002292805,0.005534505,0.8848283,0.05015535,0.03709739,0.000758931],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0770505,0.00002005779,0.9077438,0.0001249792,0.001272653,0.0004533984,0.00004264056,0.00003844645,0.01325354],"genre_scores_gemma":[0.998619,0.00001192181,0.00004751802,0.0009157856,0.00006147842,0.00007533962,0.00002275118,0.000003848944,0.0002423467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9215685,"threshold_uncertainty_score":0.3744639,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008284200055821738,"score_gpt":0.2803560336089018,"score_spread":0.2720718335530801,"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."}}