{"id":"W2034904496","doi":"10.1016/j.dam.2006.07.019","title":"Efficient algorithms for finding critical subgraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Algorithm; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009973975,0.00183425,0.001563946,0.00384298,0.001762347,0.002359949,0.003369719,0.001646488,0.009637757],"category_scores_gemma":[0.008211685,0.001126863,0.001365673,0.003501229,0.001308338,0.004683338,0.003062475,0.001969518,0.001861994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002042685,"about_ca_system_score_gemma":0.002248726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003560384,"about_ca_topic_score_gemma":0.007312667,"domain_scores_codex":[0.9988472,0.0002241537,0.0000818949,0.0003457938,0.0003069986,0.000193881],"domain_scores_gemma":[0.9935045,0.004206555,0.0004506915,0.0008948057,0.0006835168,0.0002599564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001131814,0.0006047138,0.003839922,0.001228,0.0001691211,0.0003223569,0.0008450105,0.07897896,0.02017067,0.1144936,0.03607278,0.7421432],"study_design_scores_gemma":[0.0005994813,0.000209024,0.001520349,0.0001295286,0.0002335313,0.0004698524,0.0005785859,0.4772247,0.015504,0.4901829,0.01329231,0.00005573059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07060701,0.001077934,0.9138986,0.0008165407,0.00009965171,0.0005922348,0.001065806,0.003065878,0.008776224],"genre_scores_gemma":[0.2415262,0.0006111863,0.7467948,0.0001893428,0.0001004274,0.0005103308,0.00350741,0.0005406095,0.006219734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009637757,"threshold_uncertainty_score":0.03224146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04092502635496184,"score_gpt":0.3561048761321663,"score_spread":0.3151798497772045,"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."}}