{"id":"W2170132163","doi":"10.1145/1103963.1103969","title":"An <i>O</i> ( <i>VE</i> ) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matching (statistics); Algorithm; Partition (number theory); Combinatorics; Blossom algorithm; Factor-critical graph; Graph; Discrete mathematics; Line graph; Voltage graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004286301,0.0002679262,0.000309325,0.0004449536,0.0004800151,0.0001034376,0.001936737,0.0001206668,0.00004237272],"category_scores_gemma":[0.00001274792,0.0002766655,0.0003015319,0.0009231011,0.0001573144,0.001288134,0.00002412565,0.0003361463,0.00003973946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006746763,"about_ca_system_score_gemma":0.00008455679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002405724,"about_ca_topic_score_gemma":0.00001610427,"domain_scores_codex":[0.9977359,0.0001287436,0.0004425635,0.0006478977,0.0004948162,0.0005500855],"domain_scores_gemma":[0.9972052,0.0004735854,0.0001187108,0.001695032,0.0002494662,0.0002579892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000340953,0.0008474381,0.000001894031,0.00001259544,0.00007234116,0.000002930264,0.0005380173,0.007986192,0.006472526,0.009623135,0.00005391811,0.9743549],"study_design_scores_gemma":[0.003824236,0.002223794,0.0001639086,0.00008431721,0.00007710045,0.0001145074,0.0003500973,0.3994529,0.229351,0.3582453,0.005039954,0.001072932],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002286827,0.00006924444,0.9952482,0.000826163,0.0002673193,0.0005706355,0.0003011201,0.0002957582,0.000134726],"genre_scores_gemma":[0.1081215,0.00006442812,0.8909701,0.0003954887,0.00006317862,0.0001902915,0.00001667126,0.00003964052,0.0001386403],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.973282,"threshold_uncertainty_score":0.9999685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01833050890336663,"score_gpt":0.3081120926644815,"score_spread":0.2897815837611148,"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."}}