{"id":"W2107854615","doi":"10.1109/wescan.1997.627163","title":"Design of a parallel genetic algorithm for the Internet","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Unix; Genetic algorithm; Asynchronous communication; Parallel computing; Parallel algorithm; Ideal (ethics); Population; The Internet; Fault tolerance; Distributed computing; Algorithm; Computer network; Operating system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":{"n_in":0,"stratum":"aff_core","weight":5595.2375,"opus":{"tier":"OUT","genre":"empirical","about_ca":false,"confidence":"high","reason":"Design of a parallel genetic algorithm; a computational tool for optimization, not a study of research practice."},"gpt":{"tier":"OUT","genre":"conceptual","about_ca":false,"confidence":"high","reason":"It develops a computational algorithm for optimization rather than studying research methods or practice."},"grok":{"tier":"OUT","genre":"empirical","about_ca":false,"confidence":"high","reason":"Computer science algorithm design for parallel genetic algorithms, not metaresearch on how research is done."}},"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005650519,0.0003813459,0.0005434844,0.0006055023,0.0006497242,0.0006530088,0.00099897,0.0007933737,0.002201106],"category_scores_gemma":[0.001011178,0.00028274,0.0003956206,0.0005113059,0.0005166031,0.0005697387,0.0004239353,0.0005813147,0.0005064573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007973771,"about_ca_system_score_gemma":0.001442802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003070096,"about_ca_topic_score_gemma":0.002635919,"domain_scores_codex":[0.9997632,0.00005462957,0.00001072648,0.00005214506,0.0000879185,0.00003133871],"domain_scores_gemma":[0.9997779,0.00006698786,0.00002139083,0.0000244985,0.00009384798,0.00001557182],"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.00009108072,0.0001022177,0.0009603134,0.00007226714,0.00004173405,0.0001206485,0.00007352933,0.8000587,0.01001749,0.03855575,0.00197079,0.1479355],"study_design_scores_gemma":[0.00003304821,0.00003033128,0.00007560389,0.000006320982,0.00001374947,0.00004176721,0.00001446146,0.9868934,0.001985539,0.006936176,0.003963188,0.000006408288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01223034,0.0001114359,0.9815881,0.0001638449,0.00005264489,0.00008166306,0.00001760264,0.000468496,0.00528595],"genre_scores_gemma":[0.1935002,0.0002377878,0.8022414,0.0001061644,0.00003684783,0.0002860546,0.00006253213,0.0001005875,0.003428473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003070096,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03952380449017121,"score_gpt":0.2441717524855651,"score_spread":0.2046479479953939,"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."}}