{"id":"W2402766034","doi":"","title":"On D -equivalence class of complete bipartite graphs","year":2014,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Vertex (graph theory); Conjecture; Graph; Discrete mathematics; Complete bipartite graph; Dominating set","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.001033246,0.0006486093,0.00112726,0.002969849,0.002284717,0.003029443,0.001112369,0.001002699,0.006646608],"category_scores_gemma":[0.005744157,0.0004533188,0.0009495228,0.00201638,0.002413312,0.003764644,0.002124382,0.00211114,0.0005767934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003074513,"about_ca_system_score_gemma":0.0007387717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002607201,"about_ca_topic_score_gemma":0.001196865,"domain_scores_codex":[0.998349,0.000264752,0.00006121926,0.0005013025,0.0003728728,0.0004510228],"domain_scores_gemma":[0.9952958,0.002690703,0.0006502304,0.0003064774,0.0002436316,0.0008131664],"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.0004837983,0.0002101569,0.004362229,0.0001239871,0.00003135047,0.0003401746,0.0008811651,0.0090171,0.003590853,0.9561707,0.003918854,0.02086967],"study_design_scores_gemma":[0.0000998012,0.00005562921,0.003186127,0.00002849533,0.00001292655,0.0003448154,0.0001525848,0.04244537,0.001161555,0.9473794,0.005106231,0.00002709996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8837032,0.0007078789,0.06121185,0.00149837,0.00007914545,0.0001034176,0.001579828,0.0002692736,0.05084711],"genre_scores_gemma":[0.9855741,0.0004553121,0.00687131,0.000239448,0.0002193783,0.0001164066,0.001714957,0.00006581504,0.004743411],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006646608,"threshold_uncertainty_score":0.02230728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02770719562700326,"score_gpt":0.2902353918045636,"score_spread":0.2625281961775604,"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."}}