{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00184562,0.0004818244,0.0007368235,0.0005428024,0.0003353458,0.0001515748,0.002998399,0.0002068975,0.00009826275],"category_scores_gemma":[0.0007203853,0.0004953869,0.0003195396,0.002029225,0.0009582222,0.0005406028,0.0008942558,0.000748314,0.0006190468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009518508,"about_ca_system_score_gemma":0.0001310736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002401687,"about_ca_topic_score_gemma":0.000003792632,"domain_scores_codex":[0.9945698,0.001017144,0.0007706974,0.001100977,0.001411128,0.0011302],"domain_scores_gemma":[0.9941817,0.001892957,0.0004590002,0.002529145,0.0005019846,0.0004352505],"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.0001079374,0.0003553593,0.001081325,0.0001304093,0.00005766989,0.00001475954,0.0003172054,0.0001955403,0.003289036,0.9879027,0.001174564,0.005373477],"study_design_scores_gemma":[0.001490604,0.001744308,0.002257588,0.0003058579,0.00001954895,0.000006870117,0.00001819127,0.01968687,0.005160116,0.9651467,0.003684811,0.0004784989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.953809,0.000732669,0.01289728,0.001289088,0.008551433,0.0009863678,0.0000602901,0.0002910979,0.02138272],"genre_scores_gemma":[0.9980098,0.00009796168,0.001031171,0.0003105164,0.0000147893,0.00002417543,0.000004992278,0.00004933625,0.0004572783],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04420073,"threshold_uncertainty_score":0.9997498,"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."}}