{"id":"W1973873776","doi":"10.1016/j.ic.2004.03.005","title":"Computing the vertex separation of unicyclic graphs","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Computer science; Vertex (graph theory); Mathematics; Discrete mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006317198,0.0008694507,0.001385781,0.001974783,0.00120497,0.002802317,0.001743317,0.001353937,0.006573049],"category_scores_gemma":[0.008386495,0.0006414852,0.0005803339,0.002719546,0.001258221,0.004015801,0.002196601,0.002299926,0.0011443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443925,"about_ca_system_score_gemma":0.001641667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002820321,"about_ca_topic_score_gemma":0.006677039,"domain_scores_codex":[0.9992005,0.0001459372,0.00004670036,0.0002229674,0.0001643528,0.0002195493],"domain_scores_gemma":[0.9949799,0.002620815,0.0005090692,0.0008218202,0.0005185528,0.0005497822],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004644831,0.0008295171,0.01599234,0.001146797,0.0003153173,0.000588462,0.001145136,0.2538597,0.02897558,0.2418365,0.03864683,0.412019],"study_design_scores_gemma":[0.0001803503,0.0001881541,0.001914854,0.0000550465,0.0000918046,0.0001867905,0.0004369817,0.5166153,0.01276374,0.4630421,0.004488142,0.00003670155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8089803,0.0007203073,0.1700904,0.001473884,0.0001502482,0.00007971523,0.00171852,0.002262319,0.01452424],"genre_scores_gemma":[0.9075339,0.0001808202,0.08534321,0.0001579912,0.00006138829,0.00004034907,0.002453087,0.0002359573,0.003993398],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006573049,"threshold_uncertainty_score":0.02198905,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0162835703785676,"score_gpt":0.3142700028112472,"score_spread":0.2979864324326796,"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."}}