{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003230611,0.001135181,0.001963251,0.0009806808,0.0009946915,0.001826563,0.003101218,0.001728274,0.001653775],"category_scores_gemma":[0.01984547,0.0005725299,0.0005386051,0.001671069,0.001450553,0.004645414,0.002180152,0.001237673,0.0002410893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001817587,"about_ca_system_score_gemma":0.001575643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003275278,"about_ca_topic_score_gemma":0.002439855,"domain_scores_codex":[0.9968945,0.0008973683,0.0001669324,0.0006787264,0.0006802136,0.0006822367],"domain_scores_gemma":[0.9880679,0.008450327,0.001118113,0.0009758047,0.0008096462,0.0005780663],"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.0004265786,0.0001869496,0.002320028,0.00026274,0.00008955339,0.0001908409,0.0002090127,0.9277759,0.0159211,0.02149047,0.001420698,0.02970624],"study_design_scores_gemma":[0.00001833427,0.0002286475,0.0007798159,0.000009292045,0.00003864872,0.0001639507,0.0001329552,0.985488,0.002911817,0.009503927,0.0007084146,0.00001605818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2190927,0.0008401796,0.7747062,0.0008982323,0.00005658403,0.0002427093,0.000214044,0.0004867632,0.00346253],"genre_scores_gemma":[0.9286535,0.0003040723,0.0694521,0.00009164216,0.00006229299,0.000134044,0.0001356228,0.0001103612,0.001056303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003275278,"threshold_uncertainty_score":0.01708531,"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."}}