{"id":"W3205923723","doi":"10.1109/tnet.2021.3118006","title":"Bound Inference and Reinforcement Learning-Based Path Construction in Bandwidth Tomography","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Research Grants Council, University Grants Committee","keywords":"Bandwidth (computing); Computer science; Inference; Artificial intelligence; Path (computing); Inverse; Algorithm; Mathematics; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.0002563891,0.0002032386,0.0002228698,0.000205621,0.0003455342,0.0002539265,0.0002642946,0.0001086116,0.00003111058],"category_scores_gemma":[0.00001269727,0.0002215144,0.00009083904,0.000928782,0.0000849568,0.000252046,0.000009534995,0.0004854832,0.000005613037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005711329,"about_ca_system_score_gemma":0.0001534693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001763726,"about_ca_topic_score_gemma":0.0001321355,"domain_scores_codex":[0.9983604,0.0001672931,0.0003313497,0.0005009577,0.0002651511,0.0003748799],"domain_scores_gemma":[0.998883,0.0003716984,0.00009820396,0.0004438594,0.00008707431,0.0001161363],"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.00002148537,0.00004318521,0.001441984,0.000009045365,0.00002069665,0.00002662528,0.0001166179,0.5556775,0.00003537748,0.00074269,0.00001474513,0.4418501],"study_design_scores_gemma":[0.001473943,0.0001699886,0.0008716863,0.0002770486,0.00002567468,0.00003136245,0.00006229609,0.9907522,0.0004125561,0.001208708,0.004357457,0.0003571473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01437125,0.0004114298,0.9826254,0.0006175236,0.001285008,0.0001578255,6.733495e-7,0.0001968163,0.0003340614],"genre_scores_gemma":[0.9910159,0.0002626216,0.008027283,0.0004193887,0.0001230461,0.00004764643,0.000003551585,0.00001158394,0.00008902442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9766446,"threshold_uncertainty_score":0.9033093,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.012964939210907,"score_gpt":0.2284827704830011,"score_spread":0.2155178312720941,"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."}}