{"id":"W4413895517","doi":"10.4086/toc.2025.v021a004","title":"","year":2025,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Vetenskapsrådet; Kungliga Tekniska Högskolan; University of Toronto; European Commission","keywords":"Computer science; Mathematics","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005443566,0.0008115171,0.001226711,0.002709455,0.00121257,0.004844235,0.002355044,0.001865287,0.0265795],"category_scores_gemma":[0.02707345,0.000894273,0.001162341,0.003597147,0.004069604,0.01171113,0.003709838,0.004473643,0.009776991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005372879,"about_ca_system_score_gemma":0.002078925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001427964,"about_ca_topic_score_gemma":0.001271777,"domain_scores_codex":[0.9928411,0.001374128,0.0004595594,0.002833353,0.002220921,0.0002708661],"domain_scores_gemma":[0.9632211,0.02468542,0.001611788,0.004704538,0.00474272,0.001034419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001690181,0.00004819585,0.0009704491,0.001167803,0.00005338422,0.00006073544,0.0002369836,0.0024206,0.001205907,0.7507728,0.03564925,0.2072447],"study_design_scores_gemma":[0.00002223388,0.00006489613,0.00103014,0.0004146945,0.00004037282,0.0004763465,0.0001565503,0.006644723,0.00184829,0.4965838,0.4926761,0.0000419112],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01666987,0.220516,0.5050302,0.05247817,0.006223456,0.0001645166,0.002421878,0.001838881,0.1946571],"genre_scores_gemma":[0.3095758,0.1952838,0.3371334,0.02013297,0.01550121,0.0004489161,0.006293248,0.002071158,0.1135594],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9734205,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01453444679849714,"score_gpt":0.2638553625563085,"score_spread":0.2493209157578114,"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."}}