{"id":"W2039582686","doi":"10.1007/s004530010019","title":"Linear-Time Algorithms for Partial \\boldmath k -Tree Complements","year":2000,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Time complexity; Combinatorics; Complement (music); Discrete mathematics; Algorithm; Graph; Vertex (graph theory); Theory of computation","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005170719,0.0002528765,0.0003012091,0.0001285796,0.0003226608,0.0001240649,0.001605246,0.00008187683,0.0006398069],"category_scores_gemma":[0.00004272908,0.0002435479,0.0001669512,0.000518753,0.0001321927,0.000550454,0.0002448832,0.0001960655,0.00127201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005214662,"about_ca_system_score_gemma":0.00007613057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001149495,"about_ca_topic_score_gemma":0.000001528795,"domain_scores_codex":[0.9974036,0.000109179,0.0003745821,0.0007149137,0.0005191416,0.0008785975],"domain_scores_gemma":[0.9983305,0.0002846679,0.00006901863,0.0009167385,0.0001433351,0.0002557335],"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.00004616837,0.0001731476,0.00001581501,0.000009974664,0.00005666868,0.00002093612,0.0001595323,0.0001182469,0.0007384688,0.0150978,0.003184596,0.9803786],"study_design_scores_gemma":[0.001743328,0.0004302706,0.0001354159,0.00001758403,0.0000123798,0.00003059072,0.000009642985,0.7399095,0.009585808,0.05010469,0.1975296,0.000491126],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003547445,0.00008649629,0.9899368,0.001204212,0.0002615579,0.0009088326,0.00009579717,0.000469273,0.003489635],"genre_scores_gemma":[0.01821372,0.00003022912,0.9688437,0.0007058817,0.0007709526,0.0003508519,0.00008652091,0.00007398185,0.01092414],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9798875,"threshold_uncertainty_score":0.9995056,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03424946569837089,"score_gpt":0.3275318350476837,"score_spread":0.2932823693493128,"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."}}