{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960376,0.0006716055,0.001040544,0.001864739,0.001486817,0.002613455,0.001828876,0.001782418,0.009811623],"category_scores_gemma":[0.0138265,0.0006673288,0.0008430404,0.001937513,0.001371591,0.005565318,0.001202054,0.001466548,0.001270288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001558209,"about_ca_system_score_gemma":0.001976531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002379259,"about_ca_topic_score_gemma":0.004079792,"domain_scores_codex":[0.9989948,0.0002642306,0.00003725029,0.0002660817,0.0002465314,0.0001911735],"domain_scores_gemma":[0.9883177,0.008988741,0.0005543348,0.0009497665,0.0006223858,0.0005671326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003489549,0.0003123426,0.01227804,0.002070455,0.000293728,0.0005530793,0.001032772,0.4180391,0.04214265,0.3050006,0.05966023,0.1551275],"study_design_scores_gemma":[0.000197022,0.000195968,0.003530437,0.00008567399,0.0001430003,0.00043383,0.0002346652,0.693579,0.00968038,0.2864246,0.005440325,0.00005512139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7582271,0.001706063,0.1924926,0.003939415,0.0002288828,0.0001378439,0.004502709,0.0016635,0.03710181],"genre_scores_gemma":[0.9049739,0.0005660516,0.08006571,0.0003234416,0.0001501777,0.0001642141,0.002540685,0.0006037075,0.0106121],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009811623,"threshold_uncertainty_score":0.03282309,"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."}}