{"id":"W2055000959","doi":"10.1145/1435375.1435381","title":"Distributed weighted vertex cover via maximal matchings","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex cover; Combinatorics; Mathematics; Vertex (graph theory); Feedback vertex set; Edge cover; Binary logarithm; Upper and lower bounds; Undirected graph; Matching (statistics); Minimum weight; Cover (algebra); Graph; Discrete mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001472877,0.0003326706,0.0003181133,0.0002564699,0.0009002616,0.0001122274,0.001731161,0.0001460989,0.0003409023],"category_scores_gemma":[0.00001538961,0.0003281615,0.0002679155,0.001110322,0.0001997862,0.0007366644,0.00005232705,0.0005424341,0.0006204811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001027206,"about_ca_system_score_gemma":0.00008286488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001297425,"about_ca_topic_score_gemma":0.000006039008,"domain_scores_codex":[0.9977171,0.0000800014,0.0003711237,0.0006818339,0.0005995317,0.0005503765],"domain_scores_gemma":[0.9979452,0.0002254885,0.00008542585,0.001389707,0.0001160756,0.0002380755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009304035,0.001917619,0.00009450402,0.000031307,0.0003239709,0.0005481427,0.001676093,0.001306188,0.0005420797,0.006694146,0.003678489,0.9830944],"study_design_scores_gemma":[0.004279176,0.001003135,0.01235068,0.0000979109,0.00008803074,0.002208646,0.0000700989,0.7986009,0.01360113,0.1128526,0.05265109,0.002196664],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004994719,0.00005186304,0.9906172,0.001826601,0.001141843,0.0002087154,0.000112749,0.000656626,0.0003897126],"genre_scores_gemma":[0.5516784,0.0001539908,0.4459345,0.00108665,0.0001080617,0.00007235014,0.00004486348,0.00004413622,0.0008771453],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9808978,"threshold_uncertainty_score":0.999917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02367927571191205,"score_gpt":0.2385259495041349,"score_spread":0.2148466737922228,"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."}}