{"id":"W2804416848","doi":"10.1007/s00453-018-0456-z","title":"The Fast Search Number of a Complete k-Partite Graph","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Theory of computation; Mathematics; Fleischer; Discrete mathematics; Complete bipartite graph; Upper and lower bounds; Graph; Computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0007215883,0.0001158263,0.0001462125,0.00007752852,0.0004163967,0.00009469502,0.001770823,0.00003781918,0.00004903755],"category_scores_gemma":[0.00005594918,0.00008173972,0.00008771933,0.0009624424,0.0009851881,0.0002468162,0.0006063263,0.0002037078,0.0005081758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001745477,"about_ca_system_score_gemma":0.00005886531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002434624,"about_ca_topic_score_gemma":0.0000100652,"domain_scores_codex":[0.9981752,0.0001968797,0.0002303334,0.0003305478,0.0005365158,0.0005305001],"domain_scores_gemma":[0.9980208,0.0004177409,0.00006079685,0.001017222,0.000364505,0.0001189354],"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.00004610487,0.0000814736,0.001027354,0.00001222793,0.00007729384,0.00001328784,0.0009890439,0.00000871913,0.00470757,0.7153283,0.001609947,0.2760987],"study_design_scores_gemma":[0.001452655,0.0007612407,0.007351054,0.00007307724,0.00001393303,0.0001638193,0.0003294297,0.1132809,0.08411996,0.6969337,0.09475105,0.0007691902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03884322,0.0001197518,0.9461254,0.001830358,0.0004318903,0.0003558302,0.00001884951,0.0001582724,0.01211636],"genre_scores_gemma":[0.9156116,0.00003420687,0.08287491,0.0001508433,0.0002131051,0.00002754009,0.000001824677,0.00002117125,0.001064801],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8767684,"threshold_uncertainty_score":0.6531742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02728497382287947,"score_gpt":0.3210748051033055,"score_spread":0.2937898312804261,"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."}}