{"id":"W2135672482","doi":"10.1109/icpc.2011.45","title":"Conflict-Aware Optimal Scheduling of Code Clone Refactoring: A Constraint Programming Approach","year":2011,"lang":"en","type":"article","venue":"","topic":"Software Engineering Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code refactoring; Computer science; Maintainability; Constraint programming; Programming language; Schedule; Code (set theory); Scheduling (production processes); Software engineering; Set (abstract data type); Software; Engineering; Operating system","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":[],"consensus_categories":[],"category_scores_codex":[0.0004942293,0.0001552899,0.0002215865,0.000159722,0.00005191337,0.00006155131,0.0009289954,0.00008914375,0.00003271511],"category_scores_gemma":[0.0002365089,0.000141496,0.00007031611,0.0004089701,0.0001330473,0.0002606395,0.0003555538,0.0002656107,0.00001343297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004083662,"about_ca_system_score_gemma":0.0001150556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007219223,"about_ca_topic_score_gemma":5.490717e-7,"domain_scores_codex":[0.9984259,0.00003073319,0.0002871139,0.0004047141,0.0003974465,0.000454095],"domain_scores_gemma":[0.9987908,0.0001862811,0.00006767931,0.0005995529,0.0001782309,0.0001774698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001571919,0.002831905,0.1620603,0.001689502,0.000907629,0.0003473422,0.05189585,0.01464311,0.02072617,0.5066618,0.0002711802,0.237808],"study_design_scores_gemma":[0.003104883,0.001239872,0.03354279,0.0003252409,0.00003737104,0.0003709407,0.002442135,0.7328665,0.2186794,0.0002030726,0.005148065,0.002039827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09795853,0.00005510928,0.8996112,0.0000176155,0.0001059101,0.0002262038,0.000001532113,0.0005159784,0.001507906],"genre_scores_gemma":[0.5430264,0.000001943292,0.456861,0.000005341071,0.00001547072,0.00001767677,9.416406e-7,0.000009330532,0.00006181462],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7182233,"threshold_uncertainty_score":0.577004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09139369379814016,"score_gpt":0.2899794458955976,"score_spread":0.1985857520974574,"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."}}