{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001108215,0.0004425964,0.0004720474,0.001088992,0.0005945814,0.001068849,0.002119931,0.0002848841,0.00006118702],"category_scores_gemma":[0.0002784907,0.0004491778,0.0001615861,0.0006216281,0.0003482508,0.0007278278,0.001557946,0.000388344,0.0002038242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004605188,"about_ca_system_score_gemma":0.0005621862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002731058,"about_ca_topic_score_gemma":0.00006254494,"domain_scores_codex":[0.9961849,0.00004830707,0.0005471611,0.001445439,0.0009504021,0.0008238024],"domain_scores_gemma":[0.9977183,0.0005400901,0.0002216154,0.0008244857,0.0004412296,0.0002542868],"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.0000319125,0.00004727994,0.00003504599,0.0002195515,0.00004783002,0.0001373261,0.002945813,0.8230391,0.004022761,0.03650086,0.001222467,0.1317501],"study_design_scores_gemma":[0.0003013741,0.0001896485,0.00004264802,0.0003811282,0.000007015161,0.00002576684,3.730597e-7,0.8977257,0.0006966328,0.09917514,0.0008255225,0.0006290733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000107651,0.0001117952,0.9933352,0.001904999,0.002237907,0.0009432368,0.00002779011,0.000353074,0.000978349],"genre_scores_gemma":[0.005599665,0.0000387748,0.9822529,0.001634729,0.000544757,0.00007497093,0.00005261441,0.00007462649,0.009726957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.131121,"threshold_uncertainty_score":0.9999681,"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."}}