{"id":"W2038655901","doi":"10.1016/j.dam.2011.10.027","title":"Strong and weak edges of a graph and linkages with the vertex cover problem","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Edge cover; Vertex cover; Mathematics; Combinatorics; Vertex (graph theory); Neighbourhood (mathematics); Feedback vertex set; Time complexity; Graph; Discrete mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001972783,0.0001046144,0.0001453751,0.00004115542,0.00008189749,0.00006762815,0.0002648385,0.00003136468,0.000009899071],"category_scores_gemma":[0.000004707315,0.0000590309,0.00001443917,0.0001458345,0.0001866095,0.0001213976,0.0001714797,0.00008055421,0.000002836344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002571235,"about_ca_system_score_gemma":0.00001844172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003297809,"about_ca_topic_score_gemma":0.000002235299,"domain_scores_codex":[0.999363,0.00001186421,0.0001440022,0.0001643966,0.0001720541,0.0001446912],"domain_scores_gemma":[0.9994457,0.00007649216,0.0000980257,0.0002866445,0.00003889854,0.00005417689],"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.000004829119,0.00004970365,0.00009937735,0.0001980826,0.00003948267,6.055616e-7,0.01140102,0.00004791418,0.0003687274,0.984564,0.0002144331,0.003011789],"study_design_scores_gemma":[0.005814305,0.00155503,0.0065559,0.0007581681,0.0002894633,0.000104374,0.01644022,0.2668865,0.02629793,0.6710773,0.002227359,0.001993494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007622915,0.00008547292,0.9501754,0.0002414863,0.000009120017,0.0004997577,0.000002983332,0.0000521775,0.04131066],"genre_scores_gemma":[0.642782,0.0000839748,0.3568511,0.0000538964,0.000004471015,0.0000413832,0.00000119007,0.00001227348,0.0001696492],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6351591,"threshold_uncertainty_score":0.240721,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02310828477900529,"score_gpt":0.2223761160504441,"score_spread":0.1992678312714388,"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."}}