{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003865001,0.0002204133,0.0002634245,0.0005214817,0.001013885,0.0005266921,0.003620368,0.00006044588,0.00001860489],"category_scores_gemma":[0.0004343317,0.0001921925,0.000130393,0.004325507,0.002579027,0.001089012,0.002184102,0.0002416634,0.0002118642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008843309,"about_ca_system_score_gemma":0.0001594449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002205107,"about_ca_topic_score_gemma":5.457466e-7,"domain_scores_codex":[0.9962273,0.0001513413,0.0002677739,0.001160657,0.0008713993,0.001321525],"domain_scores_gemma":[0.9963994,0.001619171,0.00005758779,0.001178026,0.000341945,0.0004038877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000048798,0.00002393843,0.00001646228,0.000006699178,0.000003243188,0.00000984557,0.0002361129,0.0001582419,0.000743811,0.7018895,0.00008834056,0.296819],"study_design_scores_gemma":[0.0001790716,0.0001303178,0.0002724894,0.000006905676,0.000001211151,0.000009815038,0.000007655462,0.5446559,0.004638514,0.4497266,0.0002177349,0.0001538144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01558806,0.00001176878,0.9812186,0.0007430707,0.0005543155,0.0004607202,0.000007459261,0.0008981565,0.000517869],"genre_scores_gemma":[0.6734811,0.00000292396,0.3260027,0.0002557501,0.0001475311,0.00006598221,0.000001997926,0.00001575088,0.00002619941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6578931,"threshold_uncertainty_score":0.9502531,"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."}}