{"id":"W4386880161","doi":"10.1007/978-3-031-43587-4_12","title":"Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bounded function; Intersection (aeronautics); Exploit; Reciprocal; Graph; Query optimization; Upper and lower bounds; Mathematical optimization; Theoretical computer science; Data mining; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.001411905,0.001038534,0.001592336,0.0008626879,0.0007102956,0.001534136,0.002527166,0.001347883,0.003744792],"category_scores_gemma":[0.008082449,0.0004316136,0.0004701221,0.001599292,0.0006905991,0.002331473,0.001403678,0.0009623161,0.0005290953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001379159,"about_ca_system_score_gemma":0.001279494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003795069,"about_ca_topic_score_gemma":0.003461293,"domain_scores_codex":[0.9988965,0.0002147745,0.00004255252,0.0002299541,0.0002723635,0.0003438709],"domain_scores_gemma":[0.9976647,0.001461745,0.0001590916,0.0002006225,0.0003583564,0.0001554549],"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.0003824943,0.0001312756,0.0008245551,0.0002204013,0.00006529119,0.00008716278,0.0000841266,0.8887355,0.01592278,0.02427293,0.003654653,0.06561891],"study_design_scores_gemma":[0.000007673256,0.0000833739,0.000172701,0.000005223651,0.0000203787,0.00004575109,0.00002496056,0.9926643,0.001252286,0.00522476,0.0004922432,0.000006211456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06362455,0.0009233484,0.9278185,0.0003791032,0.0001131873,0.0001226906,0.0001183727,0.0005699105,0.006330329],"genre_scores_gemma":[0.9066007,0.0004925941,0.08723928,0.0001020742,0.0001595814,0.0001040494,0.0001191941,0.0001896079,0.004992825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003795069,"threshold_uncertainty_score":0.01252753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02069614641182013,"score_gpt":0.2513531505849658,"score_spread":0.2306570041731457,"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."}}