{"id":"W4286796610","doi":"10.1016/j.tcs.2023.113760","title":"A simple certifying algorithm for 3-edge-connectivity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Edge contraction; Algorithm; Connectivity; Graph; Mathematics; Computer science; Time complexity; Combinatorics; Line graph; Graph power","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.00162927,0.001540128,0.002028196,0.001349515,0.001631863,0.002256311,0.00374081,0.002402849,0.01589987],"category_scores_gemma":[0.009280649,0.0008224749,0.00194121,0.002177954,0.001731702,0.007033429,0.007432998,0.005144865,0.003938618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105972,"about_ca_system_score_gemma":0.00231667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000911997,"about_ca_topic_score_gemma":0.001189674,"domain_scores_codex":[0.9977297,0.0003159468,0.0001831256,0.0006811699,0.0007250674,0.0003650041],"domain_scores_gemma":[0.9911175,0.003570463,0.0004162473,0.003580348,0.000885595,0.000429903],"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.0009871636,0.0007289412,0.002258711,0.0009931669,0.0001701196,0.0004570437,0.0005293782,0.03814986,0.02727543,0.1676491,0.05239599,0.708405],"study_design_scores_gemma":[0.0007068033,0.0004874704,0.001430644,0.0001010519,0.0002637868,0.0009656195,0.0002993092,0.2671196,0.02474736,0.6777827,0.02593433,0.000161402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04537516,0.0003779555,0.9262146,0.00125893,0.0004773418,0.0003777976,0.0008101519,0.01028214,0.01482598],"genre_scores_gemma":[0.4032703,0.0003522668,0.5813476,0.0008846279,0.000359148,0.0005509778,0.003110183,0.001585327,0.008539439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01589987,"threshold_uncertainty_score":0.05319035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03944434011499499,"score_gpt":0.3386094380291295,"score_spread":0.2991650979141345,"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."}}