{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001682632,0.000212548,0.0002642434,0.0002359976,0.0002838651,0.0001370807,0.0009685722,0.00008966709,0.000009806693],"category_scores_gemma":[0.0002888847,0.0001865989,0.0001336485,0.0005974653,0.0001973769,0.00007511926,0.0002878213,0.0001914299,0.00004852197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004658796,"about_ca_system_score_gemma":0.00002971788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.830392e-7,"about_ca_topic_score_gemma":7.108424e-7,"domain_scores_codex":[0.9977652,0.0000108881,0.0004217073,0.0004582113,0.0005242995,0.0008196369],"domain_scores_gemma":[0.9970579,0.001779036,0.0000864793,0.0007507794,0.0001095248,0.0002162814],"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.00001168119,0.00009035086,0.000002457921,0.0001122973,0.00001223835,0.000006350013,0.0008826642,0.0001419951,0.004275533,0.9879292,0.00004746634,0.006487829],"study_design_scores_gemma":[0.0005143178,0.00007688793,0.00002884822,0.00003798382,0.00001428384,0.00001646975,0.0006554765,0.1913006,0.02186608,0.7846609,0.000438442,0.0003897312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005479184,0.00004103556,0.9855627,0.0001470579,0.0001423189,0.0006392038,0.000009254691,0.000220708,0.00775857],"genre_scores_gemma":[0.324348,0.000001374364,0.675373,0.00006516717,0.00005114637,0.00008055218,0.000003164941,0.00002630763,0.00005123939],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3188688,"threshold_uncertainty_score":0.7609283,"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."}}