{"id":"W4409158217","doi":"10.1016/j.dam.2025.03.023","title":"Preprocessing complexity for some graph problems parameterized by structural parameters","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Preprocessor; Graph; Computational complexity theory; Combinatorics; Algorithm; Theoretical computer science; Computer science; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.006447372,0.003136168,0.003912452,0.002429404,0.003854905,0.008715647,0.008539691,0.007039609,0.02383925],"category_scores_gemma":[0.053962,0.002257667,0.005275598,0.00622702,0.004260581,0.02242397,0.003826314,0.01191243,0.002774668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007836864,"about_ca_system_score_gemma":0.007100787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005933696,"about_ca_topic_score_gemma":0.008964879,"domain_scores_codex":[0.9914644,0.002357754,0.0004856577,0.00266282,0.001377122,0.001652161],"domain_scores_gemma":[0.8968291,0.08436543,0.004388505,0.01038152,0.002054201,0.001981275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.007891729,0.003578623,0.008142054,0.002995897,0.0006371033,0.00100436,0.001576894,0.4732165,0.02138816,0.2441169,0.08449445,0.1509574],"study_design_scores_gemma":[0.0009137736,0.0002590925,0.002063296,0.00008396772,0.0003141161,0.0003920858,0.0004504211,0.5225942,0.005570835,0.4637833,0.003488835,0.0000861418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3991144,0.003013166,0.4970326,0.03235016,0.0007124257,0.001340974,0.01035634,0.008874683,0.04720519],"genre_scores_gemma":[0.6935228,0.001506882,0.2690016,0.002574613,0.001096067,0.00125459,0.01187892,0.004035668,0.0151289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02383925,"threshold_uncertainty_score":0.07975018,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04015370730956459,"score_gpt":0.3206287237698435,"score_spread":0.2804750164602789,"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."}}