{"id":"W4389482197","doi":"10.1007/978-3-031-49190-0_9","title":"Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Oracle; Turing machine; Combinatorics; Time complexity; Computer science; Discrete mathematics; Polynomial; Mathematics; Algorithm","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.001446804,0.0007859545,0.0008825185,0.001524196,0.0006945746,0.0007884537,0.006036965,0.0003737637,0.000006954984],"category_scores_gemma":[0.0002319577,0.0007182911,0.0003542415,0.001101479,0.001277699,0.00112514,0.002718589,0.001208595,0.0000383491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002416128,"about_ca_system_score_gemma":0.000399013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001557229,"about_ca_topic_score_gemma":0.00001705227,"domain_scores_codex":[0.9936836,0.000086222,0.000763662,0.002536488,0.001384269,0.001545739],"domain_scores_gemma":[0.995085,0.001792505,0.0003731767,0.002108983,0.000247811,0.0003925196],"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.0001136584,0.0001725489,0.00003307531,0.0003817676,0.0001230479,0.0001480116,0.001080258,0.1948994,0.02492917,0.05814401,0.001124067,0.718851],"study_design_scores_gemma":[0.000772488,0.0002772988,0.00001515354,0.0004685903,0.000008386694,0.00002589727,1.411568e-7,0.3667222,0.005426951,0.6230531,0.002338221,0.0008915589],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002225567,0.0004942227,0.9938446,0.0008053223,0.002185796,0.001633543,0.0000780021,0.0005360885,0.0001998484],"genre_scores_gemma":[0.07591718,0.0002831412,0.9167799,0.001672283,0.001066602,0.0004914307,0.00008880656,0.000318477,0.003382131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7179595,"threshold_uncertainty_score":0.9995268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03352942307653942,"score_gpt":0.2866377093803505,"score_spread":0.2531082863038111,"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."}}