{"id":"W3210535977","doi":"10.1145/3614094","title":"Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i>","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Combinatorics; Graph; Mathematics; Time complexity; Degree (music); Tree (set theory); Function (biology); Discrete mathematics; Constant (computer programming); Computer science; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.0007700645,0.000208619,0.0002483406,0.0007159714,0.0002828209,0.0001017665,0.001236482,0.0001074186,0.00003945432],"category_scores_gemma":[0.0001208035,0.0002185584,0.0001612203,0.002149085,0.0001214888,0.0005112478,0.00003656354,0.0003654542,0.0005113854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001115866,"about_ca_system_score_gemma":0.0001218666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001573119,"about_ca_topic_score_gemma":0.00001593508,"domain_scores_codex":[0.9978662,0.000103028,0.0003307904,0.0006401014,0.0003428828,0.0007170506],"domain_scores_gemma":[0.9977031,0.001064745,0.00005375466,0.0009345594,0.00008634401,0.0001575391],"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.0001813131,0.0002211837,0.00001581109,0.00002404614,0.00005695878,0.00006896644,0.0006341488,0.003268823,0.006965646,0.00173992,0.002354085,0.9844691],"study_design_scores_gemma":[0.01552422,0.002726623,0.0005245074,0.0004365857,0.00006335868,0.0001870608,0.001459729,0.5891849,0.1138931,0.1799318,0.0927119,0.003356084],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002142722,0.00003814336,0.9914097,0.003082716,0.0007407068,0.0007321821,0.0001003205,0.0006350375,0.001118484],"genre_scores_gemma":[0.2284168,0.0004716455,0.7579224,0.002383292,0.0002586187,0.001358132,0.00005368585,0.0002187616,0.008916706],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.981113,"threshold_uncertainty_score":0.8912551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03153899798910897,"score_gpt":0.303262989034617,"score_spread":0.271723991045508,"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."}}