{"id":"W1984034523","doi":"10.1007/s00373-013-1310-3","title":"A Note on Cyclic Connectivity and Matching Properties of Regular Graphs","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Discrete mathematics; Indifference graph; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003151343,0.0001571311,0.0002303732,0.0001988565,0.0002007785,0.0001124589,0.0003559563,0.00006465623,0.000001372547],"category_scores_gemma":[0.00004779032,0.0001264022,0.00005184967,0.0004830175,0.000230362,0.0004627613,0.000269018,0.0002031874,0.000002682535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001081216,"about_ca_system_score_gemma":0.00001508562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001026968,"about_ca_topic_score_gemma":0.000002546336,"domain_scores_codex":[0.9987733,0.0001112025,0.0001737177,0.0003641395,0.0002954665,0.000282115],"domain_scores_gemma":[0.9991004,0.0001379669,0.00008136658,0.0004531123,0.000121226,0.0001059031],"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.000009997256,0.00007905271,0.001583693,0.00005653308,0.00001315778,0.000002624964,0.0005496973,0.000003378073,0.01109329,0.9765654,0.00002180705,0.01002132],"study_design_scores_gemma":[0.0003801297,0.0002505815,0.009964539,0.00005406647,0.000003514817,0.000009124306,0.00006118073,0.0009587897,0.0108959,0.9772111,0.00005098771,0.000160098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9932129,0.001054704,0.004736521,0.0002690407,0.0001110858,0.0002785735,9.841243e-7,0.00007564318,0.0002604942],"genre_scores_gemma":[0.9987742,0.0002903266,0.0007736844,0.00006326447,0.00000241987,0.00003405211,2.313898e-7,0.00001040484,0.00005141711],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009861224,"threshold_uncertainty_score":0.5154532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01688209207769032,"score_gpt":0.240260867243601,"score_spread":0.2233787751659107,"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."}}