{"id":"W3082438618","doi":"10.4230/lipics.esa.2020.69","title":"On the Computational Complexity of Linear Discrepancy","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Matrix (chemical analysis); Computational complexity theory; Exponential function; Constant (computer programming); Row and column spaces; Bounded function; Linear system; Discrete mathematics; Approximation algorithm; Linear programming; Algorithm; Combinatorics; Applied mathematics; Row; Computer science; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004662939,0.0002691442,0.0004450233,0.00006610472,0.000236035,0.00007382116,0.0004420962,0.0001132996,0.0004984316],"category_scores_gemma":[0.001320548,0.0001705185,0.0002667521,0.0002251018,0.0002436964,0.0003060012,0.0001073428,0.0003215782,0.0001618015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003767413,"about_ca_system_score_gemma":0.00004258986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002511019,"about_ca_topic_score_gemma":0.0000026587,"domain_scores_codex":[0.9976684,0.00005600892,0.001246965,0.0001542055,0.0005922233,0.0002821683],"domain_scores_gemma":[0.9976815,0.0009156938,0.0005758673,0.0003561687,0.0003318234,0.0001389574],"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.00009363189,0.0002738695,0.00004123266,0.0007095022,0.00007139244,2.076099e-7,0.006505723,0.00005562163,0.00001137144,0.9821233,0.009832443,0.0002816944],"study_design_scores_gemma":[0.001089892,0.0002785095,0.00005150506,0.0001404321,0.0000343459,0.00000435376,0.001417827,0.4046609,0.0008960348,0.587601,0.003608672,0.0002164606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2631467,0.000006090891,0.6956405,0.01057465,0.0001987044,0.00256893,0.001069485,0.0002452319,0.02654967],"genre_scores_gemma":[0.8033956,0.000002941429,0.191487,0.004148074,0.0001357661,0.0001235751,0.0004850246,0.00005059829,0.0001714982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5402488,"threshold_uncertainty_score":0.6953545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1430395375713346,"score_gpt":0.3338956725879022,"score_spread":0.1908561350165676,"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."}}