{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001883392,0.0009041043,0.0008425491,0.0006009457,0.001254154,0.002095855,0.001912328,0.001409557,0.009241736],"category_scores_gemma":[0.008018523,0.0004071712,0.001138192,0.001235594,0.001173472,0.004148416,0.001769622,0.002023789,0.001438769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001547001,"about_ca_system_score_gemma":0.001722197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001941609,"about_ca_topic_score_gemma":0.002348917,"domain_scores_codex":[0.9989001,0.000304109,0.00004961777,0.0003830414,0.0001678508,0.0001952506],"domain_scores_gemma":[0.9955778,0.002786733,0.0004035502,0.0005340382,0.0004056867,0.0002922852],"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.0002981617,0.0002837713,0.00166088,0.0006199569,0.0001134841,0.0003053762,0.0004107578,0.4920823,0.006071967,0.3442131,0.01688971,0.1370505],"study_design_scores_gemma":[0.00002261086,0.00009809804,0.0004626924,0.00003889015,0.00003420311,0.0002482373,0.0002593494,0.691061,0.005837542,0.2909517,0.01096812,0.00001765264],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.05679001,0.0004619364,0.9141019,0.001966084,0.0001192955,0.0002679721,0.0007088224,0.0005771394,0.0250068],"genre_scores_gemma":[0.6439959,0.001151514,0.3319261,0.00054207,0.0003031511,0.0003732087,0.001655524,0.0003101781,0.01974239],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9907582,"threshold_uncertainty_score":0,"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."}}