{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007644687,0.001633387,0.002310033,0.002341843,0.001471199,0.008289195,0.005841558,0.003255293,0.01696623],"category_scores_gemma":[0.04761663,0.001161643,0.001738573,0.003614945,0.004773699,0.01799559,0.00432865,0.004614484,0.002231947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005093242,"about_ca_system_score_gemma":0.002207969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001145883,"about_ca_topic_score_gemma":0.000625872,"domain_scores_codex":[0.991288,0.004114007,0.0003552099,0.00142012,0.00169994,0.001122836],"domain_scores_gemma":[0.943281,0.04590601,0.00258122,0.005090307,0.001889654,0.001251793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002240914,0.0001320669,0.0005221085,0.0003089817,0.00005228586,0.0001354096,0.0001556931,0.0823712,0.001903052,0.8867414,0.005345977,0.02210777],"study_design_scores_gemma":[0.00004853639,0.0001057219,0.0002380641,0.00007540763,0.00003233492,0.0002125481,0.00008581758,0.3268718,0.001909934,0.6641736,0.006202872,0.00004333953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0728909,0.005257454,0.8557718,0.008716663,0.0003549318,0.0002322305,0.0009338545,0.0007140196,0.05512816],"genre_scores_gemma":[0.7510819,0.008012196,0.2031631,0.002411677,0.001903068,0.001075824,0.00113191,0.001290726,0.02992963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01696623,"threshold_uncertainty_score":0.05675769,"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."}}