{"id":"W2811461449","doi":"10.4230/lipics.fun.2018.27","title":"The complexity of speedrunning video games","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Treewidth; Parameterized complexity; Boosting (machine learning); Bounded function; Computer science; Routing (electronic design automation); Time complexity; Exponential time hypothesis; Knapsack problem; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics; Mathematical optimization; Artificial intelligence; Pathwidth; Graph; Algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588874,0.001617074,0.001995275,0.0007330903,0.001448415,0.005302313,0.00314714,0.002805043,0.01710105],"category_scores_gemma":[0.01620525,0.001048442,0.002002074,0.001317209,0.001840491,0.007643057,0.003120228,0.004043002,0.001664484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003389372,"about_ca_system_score_gemma":0.002656647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01167692,"about_ca_topic_score_gemma":0.007962277,"domain_scores_codex":[0.996973,0.0008341197,0.0001698862,0.0006667299,0.000561573,0.0007947537],"domain_scores_gemma":[0.9874965,0.009958595,0.0006982255,0.0007689496,0.0003939842,0.0006837901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001997158,0.0007565076,0.006750026,0.001332055,0.0003538333,0.0008047623,0.001029051,0.6930922,0.008356074,0.1612313,0.0335672,0.09072985],"study_design_scores_gemma":[0.0002711608,0.0001225952,0.001408027,0.00006885451,0.0001062923,0.0002229778,0.0002776814,0.7496882,0.001653579,0.2420833,0.004054283,0.00004293268],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6872758,0.001868871,0.2119611,0.01605625,0.0003058567,0.0007276375,0.006907774,0.002853582,0.07204314],"genre_scores_gemma":[0.9099886,0.0012271,0.06618581,0.001067762,0.0002128593,0.0004670656,0.004057404,0.0007788927,0.01601444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01710105,"threshold_uncertainty_score":0.05720872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05888925186306259,"score_gpt":0.3089636948358681,"score_spread":0.2500744429728055,"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."}}