{"id":"W2365767656","doi":"","title":"An Optimizing Routing Algorithm for Multiple Targets","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Emulation; Routing (electronic design automation); Key (lock); Task (project management); Path (computing); Process (computing); Quality of service; Transmission (telecommunications); Network performance; Computer network; Distributed computing; Computer security; Telecommunications","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":[],"consensus_categories":[],"category_scores_codex":[0.000236879,0.0001956903,0.0001597748,0.0001146632,0.0004015029,0.0003287833,0.001212122,0.00005217867,0.000003698373],"category_scores_gemma":[2.439197e-7,0.0002158976,0.00009877911,0.0003693758,0.00002481562,0.0003540293,0.0002677886,0.00008306442,0.00004515819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001057722,"about_ca_system_score_gemma":0.0000317398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006540029,"about_ca_topic_score_gemma":0.00001309392,"domain_scores_codex":[0.9983202,0.00003340179,0.0003427469,0.0007150737,0.0001383182,0.0004502357],"domain_scores_gemma":[0.9987972,0.0001078923,0.0001334432,0.0007697522,0.0001013258,0.00009033414],"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":[7.913426e-7,0.0002127121,0.00006782231,0.00001191672,0.00001638445,0.000001596014,0.00007432166,0.03058905,0.002668541,0.01846366,0.007851626,0.9400416],"study_design_scores_gemma":[0.0003502058,0.00002482631,0.0001728065,0.000005098687,0.000007161974,0.000003209619,0.000005334245,0.7430964,0.002924935,0.001269998,0.2519349,0.0002051451],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001308135,0.0001029323,0.996967,0.0002477816,0.00004758859,0.001732537,0.00001357744,0.0005209026,0.0002368728],"genre_scores_gemma":[0.01871667,0.000002800724,0.9780106,0.0005137725,0.0005653737,0.001934313,0.0001284042,0.00002571509,0.0001023752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9398364,"threshold_uncertainty_score":0.8804049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008138024362284793,"score_gpt":0.2329194602657839,"score_spread":0.2247814359034991,"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."}}