{"id":"W2594779357","doi":"","title":"On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities.","year":2015,"lang":"en","type":"article","venue":"BICT","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Modular programming; Computer science; Software; Mathematical proof; Heuristic; Simulated annealing; Theoretical computer science; Software engineering; Programming complexity; Software construction; Software system; Programming language; Algorithm; Mathematics; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002982611,0.00005744246,0.00006729452,0.00006910408,0.00007288522,0.00006137369,0.0002987377,0.00002240617,0.00001418735],"category_scores_gemma":[0.0006747894,0.00004431148,0.00001282934,0.0002408896,0.0001265183,0.0001371237,0.0001210362,0.00007226583,0.000008706093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002188123,"about_ca_system_score_gemma":0.0001665009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009063236,"about_ca_topic_score_gemma":0.000001620709,"domain_scores_codex":[0.999282,0.00005433379,0.0001052361,0.0001201737,0.0003459495,0.00009232733],"domain_scores_gemma":[0.9987292,0.0006488654,0.00003237076,0.0002569739,0.0002581339,0.00007443966],"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.000002994203,0.00003864254,0.001782939,0.00001014888,0.00001377406,0.000004221302,0.0006955873,0.01605103,0.000006958644,0.9713593,0.007411133,0.002623331],"study_design_scores_gemma":[0.0009497194,0.0003926682,0.1283183,0.00006944138,0.000008458944,0.00002450187,0.0001975449,0.5948119,0.0003543444,0.2680137,0.006468783,0.0003906675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02994107,0.00007518575,0.9654245,0.003929267,0.0001019661,0.0001143614,0.00001587411,0.0001178715,0.0002798533],"genre_scores_gemma":[0.9602999,0.000003183765,0.03934437,0.0002367582,0.00002109665,0.000009268891,0.00001459148,0.000005302652,0.00006554263],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9303588,"threshold_uncertainty_score":0.180697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.177722961830586,"score_gpt":0.2992789429028447,"score_spread":0.1215559810722587,"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."}}