{"id":"W4399386969","doi":"10.3390/a17060246","title":"Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Upper and lower bounds; Mathematical optimization; Mathematics; Mathematical analysis","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000430774,0.000222257,0.0002116396,0.0002766127,0.00028479,0.00121465,0.000756114,0.00006855038,0.0001088478],"category_scores_gemma":[0.00005020105,0.0002223121,0.0001322564,0.0003918065,0.00004060943,0.001528065,0.0005997147,0.00009770984,0.0006177448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001321228,"about_ca_system_score_gemma":0.00006078395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006573423,"about_ca_topic_score_gemma":0.000006140728,"domain_scores_codex":[0.9981604,0.00003764142,0.0002894741,0.0006866921,0.0003383213,0.0004874815],"domain_scores_gemma":[0.9991837,0.0001161465,0.00004908341,0.0004489423,0.00007365595,0.0001284599],"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.00003878524,0.0002088799,0.00006592564,0.0006320672,0.0005956518,0.001012578,0.003010714,0.001469998,0.02129479,0.05010512,0.2581688,0.6633967],"study_design_scores_gemma":[0.0003709749,0.0001656932,0.0001683374,0.0001576694,0.00005105479,0.00004066388,0.00006270251,0.9262614,0.001315919,0.008534106,0.06230871,0.0005627425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005755265,0.0009331431,0.9855203,0.002113199,0.003359024,0.0005883314,0.0001348301,0.0006717152,0.0009241662],"genre_scores_gemma":[0.01631927,0.00005983356,0.9502992,0.0008126678,0.001401232,0.0002757845,0.0003701263,0.00006894366,0.03039294],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9247914,"threshold_uncertainty_score":0.9998222,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01189267939863822,"score_gpt":0.2431746464266255,"score_spread":0.2312819670279872,"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."}}