{"id":"W31481056","doi":"10.1186/s12913-019-4391-8","title":"Computing Minimal Triangulations in Time","year":2005,"lang":"en","type":"article","venue":"BMC Health Services Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Canadian Institutes of Health Research; Ministry of Health, British Columbia","keywords":"Combinatorics; Time complexity; Upper and lower bounds; Triangulation; Vertex (graph theory); Graph; Mathematics; Matrix multiplication; Discrete mathematics; Running time; Computer science; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007674654,0.0001391874,0.0002686239,0.001085372,0.0005252592,0.0002503928,0.002433462,0.00008358664,0.00007797326],"category_scores_gemma":[0.00006205864,0.0001400114,0.00005346044,0.003236401,0.0001005568,0.0007492335,0.001068284,0.0006881806,0.001162934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000366096,"about_ca_system_score_gemma":0.0007191041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002203279,"about_ca_topic_score_gemma":0.0006442216,"domain_scores_codex":[0.9943479,0.001548791,0.0005606941,0.0006523107,0.001431791,0.001458467],"domain_scores_gemma":[0.9969211,0.001417137,0.00008523162,0.0008922588,0.0002654878,0.0004187707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005610899,0.001896225,0.1509726,0.002334276,0.00003521015,0.00007254099,0.04256237,0.01763387,0.001664907,0.1680269,0.0007163085,0.6135237],"study_design_scores_gemma":[0.001381344,0.0002412204,0.1345434,0.0002361544,3.376834e-7,0.00001258482,0.0004800498,0.8461156,0.0001859378,0.006701303,0.00986789,0.0002341329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8944434,0.00227999,0.08807847,0.006376139,0.0001412749,0.002562546,0.000009626641,0.0004879751,0.00562059],"genre_scores_gemma":[0.8760166,0.00003670795,0.1220426,0.0006643425,0.0002546904,0.0000429694,0.000009146642,0.00002450262,0.0009083771],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8284817,"threshold_uncertainty_score":0.9996148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06898875246700287,"score_gpt":0.4477635898356352,"score_spread":0.3787748373686324,"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."}}