{"id":"W2375249178","doi":"","title":"A Delay-Constrained Anycast Routing Algorithm Based on Genetic Algorithm","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Anycast; Computer science; Unicast; Multicast; Computer network; Routing algorithm; Routing (electronic design automation); IPv6; Genetic algorithm; Distributed computing; Algorithm; Routing protocol; The Internet; Machine learning","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001487254,0.0003618428,0.0002826577,0.000149732,0.0002106668,0.0001260859,0.0003723508,0.0001708405,0.00004135171],"category_scores_gemma":[3.725774e-7,0.0004193862,0.0001465432,0.0004757244,0.00008688973,0.00007444567,0.00006550401,0.0003326769,0.0001594679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001919366,"about_ca_system_score_gemma":0.00003752562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006575919,"about_ca_topic_score_gemma":0.00002011936,"domain_scores_codex":[0.9981558,0.00003941629,0.0004952544,0.0005402066,0.0002024698,0.0005668343],"domain_scores_gemma":[0.9990386,0.0001113393,0.00006907276,0.0005782765,0.0000849418,0.0001177075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002606157,0.0002725856,0.0001580723,0.00004270812,0.00003477238,0.00001217423,0.00006793247,0.1341795,0.00103499,0.0002446232,0.002328056,0.8616219],"study_design_scores_gemma":[0.0007349455,0.0000256922,0.002075166,0.00002413499,0.00003338762,0.00003590133,0.000006549843,0.9372143,0.001195006,0.0005313081,0.05770433,0.0004193036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003332152,0.0002464587,0.9927788,0.00005891814,0.00009786875,0.001078747,0.0001325923,0.0008351117,0.001439385],"genre_scores_gemma":[0.2102745,0.000005940572,0.7872605,0.0002602445,0.001178818,0.0006612986,0.0002156417,0.0000917608,0.00005133106],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8612027,"threshold_uncertainty_score":0.9998258,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003554066126817722,"score_gpt":0.1874624484197212,"score_spread":0.1839083822929035,"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."}}