{"id":"W2402131518","doi":"","title":"On the index of quasi-tree graphs with perfect matchings.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049812,0.0004490889,0.001042937,0.003183726,0.001892267,0.00416219,0.001635591,0.001396835,0.009959731],"category_scores_gemma":[0.007873376,0.0005026363,0.0005114002,0.002621885,0.001793029,0.008560948,0.002141174,0.001653481,0.001893098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001966661,"about_ca_system_score_gemma":0.0008318544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001226001,"about_ca_topic_score_gemma":0.001584291,"domain_scores_codex":[0.9992346,0.0001783068,0.00005240786,0.0001320165,0.000213754,0.0001889664],"domain_scores_gemma":[0.9943562,0.002844771,0.0009642929,0.0005419613,0.0005279487,0.0007647834],"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.0001761347,0.00004970454,0.0008229114,0.00009711744,0.00001389344,0.0001154668,0.0002812269,0.002102794,0.001794708,0.9751951,0.006304549,0.01304637],"study_design_scores_gemma":[0.00002832512,0.00003309912,0.0006290027,0.00005258585,0.0000212317,0.0002481315,0.0001625949,0.01308382,0.0009266486,0.9778101,0.006987103,0.00001729262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6209553,0.005009194,0.1653399,0.004068648,0.001138663,0.0001451205,0.002426467,0.0009764382,0.1999402],"genre_scores_gemma":[0.9379928,0.002257407,0.03052861,0.0007072919,0.0008201608,0.0001204322,0.001261569,0.0004321313,0.02587971],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009959731,"threshold_uncertainty_score":0.03331858,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02011468271068511,"score_gpt":0.2650000639831325,"score_spread":0.2448853812724474,"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."}}