{"id":"W1794091211","doi":"","title":"A comparison of evolutionary algorithms for finding optimal error-correcting codes","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University; Simon Fraser University","funders":"","keywords":"Upper and lower bounds; Algorithm; Simulated annealing; Evolutionary algorithm; Mathematics; Hill climbing; Combinatorics; Coding (social sciences); Mathematical optimization; Computer science; Discrete mathematics; Statistics","routes":{"ca_aff":true,"ca_fund":false,"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.0005857817,0.0001572223,0.0002484372,0.0001948578,0.0002752897,0.00004870715,0.0007831282,0.00007056534,0.00001826436],"category_scores_gemma":[0.0001764809,0.0001573662,0.0001039005,0.0004463698,0.00009376313,0.0004621812,0.0002933594,0.0001446108,0.00001380856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006889078,"about_ca_system_score_gemma":0.0001049613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002182634,"about_ca_topic_score_gemma":0.000002422498,"domain_scores_codex":[0.9981598,0.00002964166,0.0006623243,0.0004127148,0.0004179181,0.000317645],"domain_scores_gemma":[0.9974328,0.00145873,0.0003169815,0.0002442752,0.0004513249,0.00009586081],"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.00004636739,0.0002606798,0.0024582,0.00004982309,0.00003159111,0.000004792742,0.001522192,0.7044297,0.0001648723,0.05598568,0.001629918,0.2334162],"study_design_scores_gemma":[0.00008695997,0.0001438308,0.003233389,0.00007145864,0.000005128103,0.00002058327,0.0003410083,0.9785797,0.006031372,0.0105494,0.0007570047,0.0001801918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008285223,0.0003766968,0.9899333,0.00006419216,0.0007913525,0.0002249443,0.0000256515,0.00009608454,0.0002025926],"genre_scores_gemma":[0.4964353,0.00000129833,0.5033786,0.00002140549,0.00007664957,0.000006974063,0.00003774072,0.000005811813,0.00003622923],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4881501,"threshold_uncertainty_score":0.6417205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1125179554015422,"score_gpt":0.413086665582463,"score_spread":0.3005687101809208,"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."}}