{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006659536,0.0005985292,0.0009460688,0.001358384,0.0009307598,0.003083288,0.001111875,0.0009425809,0.00940363],"category_scores_gemma":[0.002187538,0.0005659698,0.0007573182,0.001226333,0.001156678,0.002590824,0.001709514,0.001953574,0.001342545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009031206,"about_ca_system_score_gemma":0.0005454578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006286872,"about_ca_topic_score_gemma":0.001215673,"domain_scores_codex":[0.9994153,0.0001301111,0.00002963707,0.00008895783,0.000148986,0.000186943],"domain_scores_gemma":[0.9990478,0.0002801262,0.0001175689,0.0001739267,0.0001397498,0.0002408429],"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.0003440612,0.0001696911,0.0005300714,0.0001026468,0.00002246076,0.00008546362,0.0003296368,0.01333089,0.008110925,0.9350767,0.004828524,0.03706901],"study_design_scores_gemma":[0.00006116335,0.00005595904,0.0002461334,0.00002295505,0.00001745193,0.00007034402,0.0002557279,0.04322767,0.002061366,0.950853,0.003113338,0.0000148537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6336384,0.0006642521,0.3000344,0.0007975618,0.0001599213,0.0001379533,0.0008968016,0.0004692073,0.06320149],"genre_scores_gemma":[0.8974683,0.0005266877,0.08341492,0.0002131622,0.0001334561,0.0001379148,0.001226758,0.0002462596,0.01663253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00940363,"threshold_uncertainty_score":0.03145826,"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."}}