{"id":"W135324672","doi":"","title":"{K (1, 3) , Z 2 }-Free Graphs of Low Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","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.0001941778,0.0003500481,0.0003556217,0.001045357,0.001308212,0.001506564,0.0007712513,0.0007307686,0.01447978],"category_scores_gemma":[0.001870852,0.0003421765,0.0002774225,0.0007672394,0.0007747355,0.001731196,0.001037943,0.001044821,0.001533193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006939337,"about_ca_system_score_gemma":0.0004713044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001443,"about_ca_topic_score_gemma":0.003417488,"domain_scores_codex":[0.9997557,0.0000535446,0.00001210812,0.00005015756,0.00004223017,0.00008628275],"domain_scores_gemma":[0.9986092,0.0006063097,0.0002857282,0.000150697,0.0001294024,0.0002186588],"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.0005456603,0.00009218825,0.002258434,0.000378679,0.00006675296,0.0007528238,0.0003845937,0.007971494,0.01513297,0.9097896,0.03078948,0.03183728],"study_design_scores_gemma":[0.00009486451,0.00005956523,0.003130117,0.00007350485,0.00005635903,0.0006899431,0.0002593028,0.01516597,0.00589788,0.9511111,0.02342125,0.00004010646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7501452,0.001008104,0.08992382,0.002846486,0.000238354,0.0001063471,0.003218795,0.001227574,0.1512854],"genre_scores_gemma":[0.9569563,0.0003109569,0.0145958,0.0004061607,0.00004552988,0.00007632029,0.001721486,0.0001151444,0.02577231],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01447978,"threshold_uncertainty_score":0.04843968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01082684045308116,"score_gpt":0.2226737044150931,"score_spread":0.2118468639620119,"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."}}