{"id":"W7101471125","doi":"","title":"Complexity of Bilevel Linear Programming with a Single Upper-Level Variable","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Philosophy and Social Theory","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Institut de Valorisation des Données","keywords":"Bilevel optimization; Knapsack problem; Constraint (computer-aided design); Linear programming; Variable (mathematics); Bounded function; Optimization problem","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002241299,0.001027244,0.002139798,0.0006016467,0.0009987825,0.005202755,0.001716372,0.00190925,0.006409601],"category_scores_gemma":[0.01385016,0.0009179421,0.001731231,0.001610628,0.001978065,0.006022268,0.002871807,0.004812897,0.0007887483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002183491,"about_ca_system_score_gemma":0.002276544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004155263,"about_ca_topic_score_gemma":0.003417748,"domain_scores_codex":[0.9971206,0.001019967,0.0001460461,0.0006523128,0.0005913444,0.0004696276],"domain_scores_gemma":[0.9868765,0.01103597,0.0006923233,0.0006548509,0.0004590581,0.0002813489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004113592,0.0002956318,0.002684935,0.0007715212,0.0001841784,0.0004374489,0.0003556567,0.7135345,0.002336745,0.2202927,0.008720501,0.04997487],"study_design_scores_gemma":[0.00006025457,0.00004163646,0.0003601944,0.0000384276,0.0000282526,0.00009101344,0.0001077366,0.6051857,0.0006069759,0.3914528,0.002004698,0.00002230421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1873378,0.00208109,0.7643393,0.008858883,0.0001579486,0.0002285345,0.001860026,0.0008672371,0.03426915],"genre_scores_gemma":[0.7971304,0.001911691,0.1866909,0.0009958984,0.0003122573,0.0004879872,0.002268816,0.0004420402,0.009760047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006409601,"threshold_uncertainty_score":0.02144229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1733245238079391,"score_gpt":0.3312271192538156,"score_spread":0.1579025954458765,"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."}}