{"id":"W2913919914","doi":"10.1007/3-540-36478-1_5","title":"Connected Matchings","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Combinatorics; Chordal graph; Matching (statistics); Conjecture; Strong perfect graph theorem; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Mathematics; 1-planar graph; Artificial intelligence","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001394058,0.0006208141,0.0006022928,0.001317573,0.000353446,0.0006032265,0.005383205,0.0003506108,0.00006649008],"category_scores_gemma":[0.0002442403,0.0005795294,0.0001608172,0.001215049,0.001183698,0.0008627123,0.001652626,0.001420993,0.0001524256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003447843,"about_ca_system_score_gemma":0.0004875608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007847268,"about_ca_topic_score_gemma":0.00002227725,"domain_scores_codex":[0.9948354,0.00008317207,0.0005236324,0.00202224,0.00144805,0.001087444],"domain_scores_gemma":[0.9960533,0.0008456066,0.0002517045,0.002187769,0.0003648435,0.0002967288],"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.000009341768,0.00003381321,0.00003106301,0.00004093163,0.00001655919,0.0002692782,0.0005801709,0.008905089,0.0004334283,0.5047911,0.00007243248,0.4848168],"study_design_scores_gemma":[0.0002798782,0.0001406895,0.0000251084,0.0002032943,0.0000033269,0.0001475569,9.487751e-8,0.07097317,0.001966945,0.9201951,0.005313026,0.0007518049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006060901,0.0004609036,0.9860639,0.001031678,0.001338189,0.0004396189,0.000004078117,0.0002729636,0.01032806],"genre_scores_gemma":[0.04075748,0.0000940363,0.9504874,0.005703736,0.0003434285,0.0000228365,0.000006190576,0.000107834,0.002477065],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.484065,"threshold_uncertainty_score":0.9999982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01842646608059936,"score_gpt":0.2718294186126292,"score_spread":0.2534029525320299,"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."}}