{"id":"W4414056840","doi":"10.1016/j.ic.2025.105355","title":"Polynomial Turing compressions for some graph problems parameterized by modular-width","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"China Scholarship Council","keywords":"Parameterized complexity; Turing machine; Oracle; Time complexity; Polynomial; Set (abstract data type); Turing; Kernelization","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.0002227079,0.00009722135,0.0001159447,0.0002760838,0.0002714194,0.0002938352,0.0002337358,0.00004052998,7.919805e-7],"category_scores_gemma":[0.00003951131,0.00009240663,0.00004142664,0.0003026708,0.00004510559,0.00227702,0.0001167105,0.00008397593,0.00000427177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002328738,"about_ca_system_score_gemma":0.00003594159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005921233,"about_ca_topic_score_gemma":4.169807e-7,"domain_scores_codex":[0.9991905,0.00004367686,0.0002947242,0.0001399938,0.0001483955,0.0001827077],"domain_scores_gemma":[0.9994346,0.0001594266,0.0001076096,0.0001414315,0.0001006971,0.00005623934],"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.0001355206,0.00008671315,0.0001435642,0.0002961603,0.00006452578,3.296603e-7,0.001738134,0.05471307,0.005434761,0.1312685,0.01005998,0.7960587],"study_design_scores_gemma":[0.001454457,0.0000679173,0.000547263,0.00004654945,0.00000404624,0.000002317289,0.00004564786,0.8817888,0.002140286,0.1038557,0.009903645,0.0001433616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03739016,0.00009093558,0.9607361,0.0006562769,0.0001862204,0.000544511,0.00001221742,0.0001404767,0.0002431053],"genre_scores_gemma":[0.9518858,0.00002619675,0.04707015,0.0006886129,0.0000123372,0.0001455242,0.00009617987,0.000003927836,0.00007126527],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9144956,"threshold_uncertainty_score":0.3768233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519223347303815,"score_gpt":0.2912174323092757,"score_spread":0.2760251988362376,"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."}}