{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028623,0.001665532,0.00180045,0.001430003,0.000802976,0.001897724,0.002985787,0.001401538,0.003405319],"category_scores_gemma":[0.006979912,0.001373704,0.001569761,0.002521534,0.001037207,0.001663464,0.001133852,0.002072115,0.0003184382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002377782,"about_ca_system_score_gemma":0.004015807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02235607,"about_ca_topic_score_gemma":0.01725686,"domain_scores_codex":[0.9982235,0.0007486346,0.00007910011,0.0002824589,0.0004139889,0.0002522649],"domain_scores_gemma":[0.9953555,0.003394559,0.0004007978,0.0001390945,0.0005211306,0.00018898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003582334,0.00005285176,0.0002341619,0.00008442973,0.00003362007,0.00006172895,0.00005253131,0.9726937,0.0006410643,0.01244684,0.0007867995,0.0128765],"study_design_scores_gemma":[0.00001350181,0.00001323501,0.00005285601,0.000008047294,0.000009388916,0.0000078902,0.00001323963,0.9951836,0.000219867,0.004029945,0.0004427365,0.000005749162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0106041,0.0003093521,0.9845889,0.0003781513,0.0000466124,0.0001679724,0.0001511086,0.0001556538,0.003598158],"genre_scores_gemma":[0.2034102,0.0007274849,0.7911946,0.0002288548,0.00008116427,0.0006340768,0.0004128428,0.0002170044,0.00309375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02235607,"threshold_uncertainty_score":0.04445189,"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."}}