{"id":"W1964864950","doi":"10.1006/jctb.2001.2090","title":"Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matching (statistics); Cubic graph; Lattice (music); Graph; Discrete mathematics; Line graph; Voltage graph; Physics","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.001802055,0.0001442378,0.0003080318,0.000169602,0.0004277405,0.0001635604,0.0008938811,0.00005157642,0.00002858386],"category_scores_gemma":[0.0002733106,0.0001043324,0.0001783708,0.0003057372,0.0002765884,0.001288169,0.0002074816,0.0003017709,9.631632e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000235448,"about_ca_system_score_gemma":0.00003628093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000224865,"about_ca_topic_score_gemma":3.030234e-7,"domain_scores_codex":[0.9984114,0.0003334765,0.0004667367,0.0001473495,0.0003873652,0.0002537435],"domain_scores_gemma":[0.9955452,0.003268686,0.0004195806,0.000326743,0.000335391,0.0001043881],"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.0003875871,0.00008845371,0.00001984598,0.00002763176,0.0001004506,0.000009494668,0.001854824,0.0008747147,0.002153929,0.9928899,0.0001077026,0.001485402],"study_design_scores_gemma":[0.001077287,0.0005578676,0.00008014814,0.00006899659,0.00003609037,0.0001925481,0.0008433894,0.0007266192,0.00380165,0.9914727,0.00102613,0.0001165243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4929926,0.001637874,0.5004136,0.001434763,0.002637873,0.0003861655,0.0000222028,0.00004094771,0.0004339301],"genre_scores_gemma":[0.9576998,0.0002471024,0.04173618,0.00007817602,0.0001299283,0.00000714035,3.346666e-7,0.00001673564,0.00008464024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4647071,"threshold_uncertainty_score":0.4254553,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01904510044783211,"score_gpt":0.2777941096068416,"score_spread":0.2587490091590095,"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."}}