{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005206102,0.00031746,0.0004810557,0.0001874193,0.0003703207,0.0003816317,0.001450872,0.00008316286,0.000003851791],"category_scores_gemma":[0.0001204699,0.0002713135,0.0001561016,0.0006512096,0.0003760819,0.0004376353,0.0004205629,0.0002183541,0.00000638856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005137298,"about_ca_system_score_gemma":0.00005913189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002506442,"about_ca_topic_score_gemma":0.00000104031,"domain_scores_codex":[0.9977267,0.00003422422,0.0005396134,0.0006895305,0.0003653873,0.0006445836],"domain_scores_gemma":[0.9979568,0.0005686521,0.0002378928,0.001039477,0.0000796867,0.0001174997],"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.00003402635,0.00004992656,0.000006923905,0.0007318341,0.00007517327,5.452214e-7,0.0006338074,0.0002180328,0.01911113,0.9732063,0.0002543319,0.005677926],"study_design_scores_gemma":[0.000734645,0.00003779753,0.000007756029,0.0000700193,0.00001897618,0.000002257606,0.0001339104,0.06618437,0.02108871,0.9112921,0.0001505091,0.0002789934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04696868,0.0001324411,0.9494027,0.0002779594,0.00009928153,0.001615234,0.00003892283,0.0003122066,0.001152583],"genre_scores_gemma":[0.28989,0.000008293496,0.7090061,0.0002310131,0.00001012966,0.0006258675,0.00003452673,0.00002908867,0.0001650556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2429213,"threshold_uncertainty_score":0.9999739,"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."}}