{"id":"W1592012372","doi":"10.1109/reldis.2002.1180207","title":"A search for routing strategies in a peer-to-peer network using genetic programming","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Protocol (science); Routing protocol; Distributed computing; Peer-to-peer; Routing (electronic design automation); Genetic programming; Resource (disambiguation); Computer network; Enhanced Interior Gateway Routing Protocol; Wireless Routing Protocol; Artificial intelligence","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.0005877956,0.00008166629,0.00008544619,0.00005902069,0.0002068631,0.0002444127,0.0002819248,0.00003265678,0.000004580275],"category_scores_gemma":[0.0000270203,0.00007898875,0.00003259656,0.0007324145,0.00001560454,0.0002127242,0.00007309304,0.00007396708,0.000006491726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004912661,"about_ca_system_score_gemma":0.0001756846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001039339,"about_ca_topic_score_gemma":0.00003321483,"domain_scores_codex":[0.9988473,0.00003356475,0.0001783573,0.0002927356,0.0002342845,0.0004137789],"domain_scores_gemma":[0.9994181,0.00007250192,0.00002245911,0.0002243724,0.0001915504,0.00007095943],"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.000001292468,0.00007136767,0.003140518,0.000009197449,0.000005875181,0.000002525093,0.0007291486,0.2488226,0.0001888028,0.7213968,0.0002709312,0.0253609],"study_design_scores_gemma":[0.0002169732,0.00005418148,0.003406236,0.00001970555,0.000002450264,0.00001729074,0.0006059033,0.9728632,0.0001620383,0.01029747,0.01216704,0.0001874938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03405587,0.00004127418,0.9634131,0.0008962972,0.00005498874,0.0004925384,5.274118e-7,0.0000657437,0.000979654],"genre_scores_gemma":[0.3443027,3.653348e-7,0.6552221,0.00005834578,0.00005173372,0.00007721015,7.89845e-7,0.000004910179,0.0002819506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7240406,"threshold_uncertainty_score":0.3221067,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04379099847058156,"score_gpt":0.3189134581869949,"score_spread":0.2751224597164134,"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."}}