{"id":"W2594669407","doi":"10.1109/acssc.2016.7869036","title":"Construction of minimal sets for capacity-approaching variable-length constrained sequence codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Alberta Innovates - Technology Futures","keywords":"Sequence (biology); Construct (python library); Computer science; Set (abstract data type); State (computer science); Encoder; Variable (mathematics); Code (set theory); Process (computing); Algorithm; Theoretical computer science; Mathematics; Programming language","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003607949,0.0001132579,0.0001788025,0.00006036161,0.0001086577,0.00004654702,0.0004539829,0.00006349588,0.00002796452],"category_scores_gemma":[0.0001059689,0.00007100432,0.00004266574,0.000119191,0.0001854262,0.0007291911,0.0001466085,0.00004752467,0.000002936293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002299455,"about_ca_system_score_gemma":0.00009751759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005277396,"about_ca_topic_score_gemma":0.00000211183,"domain_scores_codex":[0.9989824,0.00004655074,0.0002566483,0.0003301393,0.0001696178,0.0002146948],"domain_scores_gemma":[0.9989498,0.0003432987,0.0001372633,0.0003709234,0.0001282293,0.00007051846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001541731,0.00003659604,0.0002076332,0.00003328563,0.00001887262,7.853591e-7,0.0001064802,0.000009295837,0.06386167,0.7860035,0.0003070286,0.1493994],"study_design_scores_gemma":[0.00455341,0.0007077781,0.00060202,0.0005306774,0.00004194846,0.0003781281,0.000290042,0.6594607,0.1672071,0.1558331,0.009373105,0.001021996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01685228,0.000007820697,0.9802863,0.0002502394,0.0002441305,0.0001881623,0.0001491165,0.0001000641,0.001921913],"genre_scores_gemma":[0.3091523,0.000003711963,0.6907172,0.00003745305,0.0000217708,0.00001112314,0.000004730567,0.000003658275,0.00004810126],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6594514,"threshold_uncertainty_score":0.2895472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04693708630503195,"score_gpt":0.2682079106029702,"score_spread":0.2212708242979382,"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."}}