{"id":"W2116448805","doi":"10.1109/icsm.2003.1235425","title":"On modeling software architecture recovery as graph matching","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph rewriting; Graph; Software system; Theoretical computer science; Wait-for graph; Software; Software architecture; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"}],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002467252,0.0001842876,0.0001625666,0.0001742685,0.0001065058,0.00008154767,0.0006866471,0.00007476157,0.000004042589],"category_scores_gemma":[0.0007023588,0.0001574087,0.00008933695,0.0002931882,0.00001548086,0.0003373609,0.0001943769,0.0003102096,0.000072312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006927274,"about_ca_system_score_gemma":0.00004601069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003141288,"about_ca_topic_score_gemma":0.000003800284,"domain_scores_codex":[0.9988375,0.00004052798,0.0001593044,0.000412966,0.0002331101,0.0003166204],"domain_scores_gemma":[0.9987754,0.0005173204,0.00003273593,0.0005701818,0.00003036735,0.00007397251],"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.000004861985,0.000009918507,7.706528e-8,0.000007096407,0.000006577061,0.00001638065,0.0002447309,0.9512005,0.0001089439,0.03653066,0.000006022844,0.01186427],"study_design_scores_gemma":[0.0001510538,0.00008776347,0.000001401939,0.0000471704,0.000001391175,0.00003194909,0.00001413508,0.000683518,0.0007599163,0.9980145,0.000002844578,0.0002043304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004254263,0.00007115863,0.9923608,0.0004793261,0.0004780166,0.00008946768,6.816181e-7,0.001895431,0.000370906],"genre_scores_gemma":[0.017546,0.00001180467,0.9815902,0.0006930892,0.00003549606,0.000009668137,0.000001186998,0.00001919449,0.00009338914],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9614839,"threshold_uncertainty_score":0.641894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02443804831094277,"score_gpt":0.2694955960182415,"score_spread":0.2450575477072988,"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."}}