{"id":"W2964263868","doi":"10.4086/toc.2017.v013a020","title":"","year":2017,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Approximation algorithm; Bottleneck; Omega; Cardinality (data modeling); Upper and lower bounds; Hardness of approximation; Discrete mathematics; Mathematical analysis; Physics; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003168917,0.0002124359,0.0004086012,0.000144634,0.002151103,0.0005187141,0.00702417,0.00005447683,0.00000275629],"category_scores_gemma":[0.0004634559,0.0002092444,0.0002045045,0.0001427191,0.0006863706,0.001145215,0.003063279,0.0002290576,0.000002509763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001325206,"about_ca_system_score_gemma":0.00004612744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004122144,"about_ca_topic_score_gemma":0.000003629274,"domain_scores_codex":[0.997852,0.0002662514,0.000496451,0.0004948903,0.0003969876,0.0004933674],"domain_scores_gemma":[0.9951771,0.000800454,0.0008143925,0.002920229,0.0001649987,0.0001227874],"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.00001116476,0.00005249522,0.002082599,0.00001742685,0.00002354897,0.00001037272,0.002300556,0.000262464,0.0006856754,0.7343217,0.000002784193,0.2602293],"study_design_scores_gemma":[0.0006015259,0.0001058591,0.1322011,0.0001206775,0.000006160836,0.00003222588,0.0001305875,0.1283424,0.01006451,0.7281151,0.00002854089,0.0002514354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4406852,0.00004423339,0.5569849,0.0003671082,0.0003880299,0.00007362053,5.414479e-7,0.0001393813,0.001316992],"genre_scores_gemma":[0.8365819,0.000002704348,0.1631582,0.0001222474,0.0001115842,8.760542e-7,2.391954e-7,0.000007136958,0.00001502464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3958968,"threshold_uncertainty_score":0.999148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0391460099351738,"score_gpt":0.2882293159106371,"score_spread":0.2490833059754633,"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."}}