{"id":"W2544933647","doi":"10.1007/978-3-319-48749-6_12","title":"Fast Searching on Complete k-partite Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Bipartite graph; Combinatorics; Computer science; Complete bipartite graph; Upper and lower bounds; Discrete mathematics; Graph; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.0004360936,0.0009401293,0.001419269,0.001632731,0.001354034,0.00217397,0.002015754,0.001294167,0.01710363],"category_scores_gemma":[0.003904447,0.0008671675,0.0009916754,0.004190873,0.000821946,0.00584568,0.002324853,0.001203088,0.004023596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009833974,"about_ca_system_score_gemma":0.0008632907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002418767,"about_ca_topic_score_gemma":0.004144002,"domain_scores_codex":[0.9993327,0.000131756,0.0000355366,0.0001441332,0.0002096095,0.0001462439],"domain_scores_gemma":[0.9969908,0.001853186,0.0001364016,0.0006549348,0.0002369485,0.000127574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00107759,0.000221143,0.001273735,0.002318138,0.0001500555,0.0003705055,0.0008265034,0.132181,0.02327609,0.2090912,0.09639577,0.5328184],"study_design_scores_gemma":[0.000174068,0.0001553572,0.000868308,0.0001240867,0.00008449035,0.0005000316,0.0003289031,0.4045818,0.009127565,0.5650855,0.01891378,0.00005608868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3067438,0.00327926,0.5547258,0.001647661,0.0003180873,0.0003515976,0.00333814,0.008439176,0.1211565],"genre_scores_gemma":[0.5246114,0.002456401,0.4047762,0.0003279922,0.0002311835,0.0002771694,0.005353233,0.001917543,0.06004875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01710363,"threshold_uncertainty_score":0.0572173,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03263267048262919,"score_gpt":0.2923520620477815,"score_spread":0.2597193915651523,"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."}}