{"id":"W4389274127","doi":"10.1016/j.orl.2023.11.010","title":"The complexity of geometric scaling","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Polytope; Combinatorics; Mathematics; Oracle; Scaling; Simplex; Upper and lower bounds; Integer (computer science); Simplex algorithm; Discrete mathematics; Linear programming; Mathematical optimization; Computer science; Geometry; 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.00176459,0.0007432473,0.001667875,0.00170627,0.002091234,0.005757142,0.002404904,0.00244782,0.01781642],"category_scores_gemma":[0.02275867,0.0007966289,0.00120511,0.002733603,0.005022722,0.01357118,0.004099437,0.004870111,0.001416797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002820421,"about_ca_system_score_gemma":0.001410121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001925673,"about_ca_topic_score_gemma":0.001121398,"domain_scores_codex":[0.9974737,0.0006817995,0.0001017716,0.0004131547,0.0009877899,0.0003418532],"domain_scores_gemma":[0.9835284,0.01153918,0.0009052736,0.002596668,0.0007870953,0.0006433877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004110715,0.00002714432,0.000381327,0.00005868935,0.00001112098,0.00004277093,0.0001059807,0.01054179,0.0002395214,0.9739817,0.005398954,0.009169945],"study_design_scores_gemma":[0.00001004685,0.000004299876,0.0001909402,0.000006447447,0.000004119037,0.00002962301,0.00003966587,0.02448676,0.0001066927,0.9735204,0.001594125,0.000006911891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4085727,0.005967658,0.2152631,0.03401834,0.001114621,0.0001703696,0.00161894,0.001098463,0.3321758],"genre_scores_gemma":[0.9550955,0.001929724,0.02289648,0.0008913133,0.001053678,0.0001744156,0.0006201206,0.0003599755,0.01697883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01781642,"threshold_uncertainty_score":0.0596019,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2065730904289901,"score_gpt":0.387549487468558,"score_spread":0.1809763970395679,"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."}}