{"id":"W2920974405","doi":"10.1007/s10878-019-00400-6","title":"A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Neighbourhood (mathematics); Vertex connectivity; Connectivity; Graph; Time complexity; Theory of computation; Discrete mathematics; Algorithm","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.0007808626,0.0001276728,0.0004213961,0.0002602296,0.00005998894,0.00009876192,0.0004589045,0.0001202445,0.00001930485],"category_scores_gemma":[0.0001167594,0.0001156787,0.0002027965,0.0003955412,0.00002308388,0.000866417,0.00006857924,0.0001783699,0.000003299486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007286706,"about_ca_system_score_gemma":0.0001303012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000110602,"about_ca_topic_score_gemma":2.000604e-7,"domain_scores_codex":[0.9983628,0.0002027996,0.0006950584,0.0001595608,0.0004129893,0.000166788],"domain_scores_gemma":[0.9979795,0.0001760431,0.0009566471,0.000255656,0.0005310294,0.0001011576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004077198,0.0008367748,0.005169816,0.0001041677,0.0004906152,0.00005543881,0.002330699,0.8507949,0.00635312,0.07274183,0.007911279,0.05280368],"study_design_scores_gemma":[0.002924831,0.001033713,0.0002980131,0.0001508155,0.0000235975,0.00013207,0.00005092671,0.98921,0.002507556,0.002807324,0.0006710297,0.0001901399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1104545,0.00006689922,0.8696492,0.00009284211,0.01907858,0.0001639057,9.021606e-7,0.00002266644,0.0004704919],"genre_scores_gemma":[0.9610576,0.00001277207,0.03855003,0.00003330247,0.0003064772,0.000001245529,7.593701e-7,0.00001084574,0.00002694507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8506032,"threshold_uncertainty_score":0.471724,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005635936552762238,"score_gpt":0.2127651921359911,"score_spread":0.2071292555832289,"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."}}