{"id":"W2017660874","doi":"10.1155/2012/178651","title":"A Compromise Programming Model for Highway Maintenance Resources Allocation Problem","year":2012,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Transport Canada","funders":"Natural Science Foundation of Beijing Municipality","keywords":"Compromise; Bridge (graph theory); Computer science; Mathematical optimization; Resource allocation; Resource (disambiguation); Programming paradigm; Optimal maintenance; Operations research; Engineering; 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"],"consensus_categories":[],"category_scores_codex":[0.000471113,0.0002749639,0.0003085595,0.0001395495,0.000043184,0.00004869253,0.0001842048,0.0001275311,0.000004064178],"category_scores_gemma":[0.00007735501,0.0002526879,0.00007384077,0.0001846797,0.00002369415,0.0002971986,0.00003929029,0.0002640004,0.000008233248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001785101,"about_ca_system_score_gemma":0.000006241168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001543731,"about_ca_topic_score_gemma":0.000001287951,"domain_scores_codex":[0.9983205,0.000006015114,0.0004699391,0.0001854169,0.000164467,0.0008536734],"domain_scores_gemma":[0.9994966,0.00008420998,0.00003964592,0.0002163311,0.0000362098,0.0001270461],"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.000003375595,0.00003911078,0.0001034688,0.001972551,0.00001876512,4.618884e-7,0.002529074,0.9800494,0.00508668,0.007772334,0.0001144494,0.00231036],"study_design_scores_gemma":[0.0003824021,0.00001462732,0.00004120171,0.0005916764,0.00001278604,0.000009414341,0.00005710535,0.9915327,0.001076215,0.004160005,0.001799368,0.0003224322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02449622,0.0002476169,0.9727857,0.00002700889,0.0002328484,0.0009848282,0.000003434561,0.0005862244,0.0006361714],"genre_scores_gemma":[0.8130435,0.00000752648,0.1858768,0.000007148479,0.0001740306,0.0007309737,0.000004573685,0.00008097993,0.00007439914],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7885473,"threshold_uncertainty_score":0.9999925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01274814095388648,"score_gpt":0.2162638041078384,"score_spread":0.2035156631539519,"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."}}