{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004726615,0.001987161,0.003105248,0.002495815,0.003561966,0.00681691,0.0059111,0.00433733,0.01951833],"category_scores_gemma":[0.04575837,0.00139983,0.003728464,0.004870409,0.005719181,0.02109109,0.005881699,0.01090089,0.002061784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006794776,"about_ca_system_score_gemma":0.004718922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001741423,"about_ca_topic_score_gemma":0.003639085,"domain_scores_codex":[0.9948395,0.001253854,0.0002805954,0.001175186,0.001149935,0.001301014],"domain_scores_gemma":[0.9473732,0.04100857,0.002200941,0.006203622,0.001116752,0.00209705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00284545,0.001031654,0.003576285,0.000970311,0.0002254063,0.0003378722,0.001438474,0.1120762,0.006357234,0.7612882,0.02934393,0.08050904],"study_design_scores_gemma":[0.0002694411,0.000110296,0.0007477332,0.00007744798,0.0001245835,0.0001904867,0.0002137602,0.1881023,0.003931776,0.8036875,0.002484458,0.00006020861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5436698,0.00380472,0.3436227,0.02814709,0.0006474069,0.0008018743,0.003864697,0.006650961,0.06879069],"genre_scores_gemma":[0.9125418,0.0009656089,0.0690238,0.001418105,0.0007964573,0.000633801,0.001943492,0.001232677,0.01144439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01951833,"threshold_uncertainty_score":0.0652954,"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."}}