{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001729545,0.000708592,0.0006420008,0.002084773,0.0005684551,0.0006585955,0.006531635,0.0002655494,0.00004849732],"category_scores_gemma":[0.0001703019,0.0005544763,0.0002350338,0.001024471,0.001859369,0.0008830245,0.002623867,0.001538553,0.000430091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003566781,"about_ca_system_score_gemma":0.0004272661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004593209,"about_ca_topic_score_gemma":0.00002471304,"domain_scores_codex":[0.9933601,0.0001315074,0.0005579738,0.002367266,0.002132679,0.001450501],"domain_scores_gemma":[0.9947708,0.001599173,0.0002593112,0.00265522,0.0003052802,0.0004102056],"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.00001468188,0.00001845641,0.00002833597,0.00001875958,0.00001023326,0.0001174188,0.0002354422,0.00546387,0.0005778585,0.435601,0.00001129702,0.5579027],"study_design_scores_gemma":[0.0003582553,0.00036128,0.00008928115,0.0007210146,0.000002651823,0.00005667664,8.789533e-8,0.07507271,0.001361753,0.9185855,0.002609797,0.0007810357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009482793,0.0001676792,0.9804228,0.001297361,0.00115152,0.0005052711,0.00002005051,0.0002645018,0.01607597],"genre_scores_gemma":[0.3333836,0.0002116973,0.653785,0.005859104,0.001372683,0.00006639374,0.0000117048,0.0002592712,0.005050462],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5571216,"threshold_uncertainty_score":0.9996907,"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."}}