{"id":"W2101380104","doi":"10.7771/1932-6246.1142","title":"Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover","year":2012,"lang":"en","type":"article","venue":"The Journal of Problem Solving","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex cover; Edge cover; Vertex (graph theory); Euclidean geometry; Computer science; Graph; Cover (algebra); Combinatorics; Covering problems; Independent set; Set (abstract data type); Mathematics; Mathematical optimization; Theoretical computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005226709,0.0009177156,0.0006460207,0.0008475431,0.0005842694,0.002765022,0.0009258448,0.001111374,0.00316575],"category_scores_gemma":[0.05115392,0.0002112282,0.0004034188,0.001093066,0.001012522,0.002035697,0.001067849,0.0005679723,0.001055756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004030289,"about_ca_system_score_gemma":0.0005579537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002476887,"about_ca_topic_score_gemma":0.001916975,"domain_scores_codex":[0.9947712,0.003116105,0.000266439,0.0007667328,0.0007878895,0.0002915831],"domain_scores_gemma":[0.9570186,0.03236283,0.003514009,0.003356588,0.002336928,0.001411009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.003692271,0.002551381,0.2005649,0.002031691,0.0008012682,0.0006175044,0.02630688,0.09023029,0.03819991,0.01228184,0.01369596,0.6090263],"study_design_scores_gemma":[0.0006143439,0.01273099,0.2362463,0.0009218833,0.000429231,0.002606112,0.04753868,0.5329987,0.04131987,0.0711655,0.05269238,0.0007359503],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9642616,0.0004156972,0.02302844,0.0004249809,0.00003305053,0.0001059729,0.0002304292,0.000355891,0.01114394],"genre_scores_gemma":[0.9824385,0.0002960043,0.01564304,0.0000800944,0.00001492183,0.0000638924,0.0003208806,0.00006534515,0.00107732],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005226709,"threshold_uncertainty_score":0.02764183,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0199978733259338,"score_gpt":0.2397387067056269,"score_spread":0.2197408333796931,"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."}}