{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728941,0.0001220537,0.0002327976,0.0001165281,0.00008643492,0.00005980004,0.000959488,0.00007684369,0.00002729898],"category_scores_gemma":[0.0000756173,0.0001158591,0.0001116103,0.0005819011,0.00004238414,0.0003304736,0.0002111437,0.0001154152,0.000024425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002859,"about_ca_system_score_gemma":0.00003023904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008994428,"about_ca_topic_score_gemma":0.00002177884,"domain_scores_codex":[0.9988473,0.0001016148,0.000281621,0.0002774522,0.0002476126,0.0002444192],"domain_scores_gemma":[0.9985686,0.0001510408,0.0001370464,0.0009051744,0.0001619288,0.00007618848],"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.000006201134,0.00009519602,0.00359588,0.0000108352,0.00002019064,0.00001546381,0.0001889314,0.00003071132,0.000231081,0.9882073,0.006324807,0.001273432],"study_design_scores_gemma":[0.001224892,0.0002538979,0.003809842,0.00007341943,0.000004865209,0.00007733473,0.00004532344,0.01303217,0.002066691,0.9736739,0.005484038,0.0002535589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9565359,0.0001728703,0.01535273,0.000447116,0.007682161,0.0001958657,0.000002065135,0.0002027553,0.01940852],"genre_scores_gemma":[0.9992532,0.00001740855,0.0002485203,0.0001017838,0.00001308258,0.00001122913,6.849808e-7,0.00000857034,0.0003455026],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0427173,"threshold_uncertainty_score":0.4724596,"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."}}