{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003684055,0.001911102,0.001287688,0.003580661,0.001829927,0.003645601,0.004395939,0.003760875,0.005986337],"category_scores_gemma":[0.01100092,0.001187871,0.003864039,0.004954127,0.006434154,0.01204481,0.00387051,0.004252656,0.001679691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003239932,"about_ca_system_score_gemma":0.002894511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01172036,"about_ca_topic_score_gemma":0.01017551,"domain_scores_codex":[0.9961277,0.001544171,0.0002508892,0.0008429152,0.0009621593,0.0002721378],"domain_scores_gemma":[0.9947773,0.00313593,0.0004946096,0.00104445,0.0003996111,0.0001480296],"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.00004657815,0.00008334926,0.0003636393,0.0002719048,0.00006212224,0.0002315993,0.0003566902,0.2531986,0.0009981738,0.7054265,0.00234369,0.03661726],"study_design_scores_gemma":[0.00002329343,0.00003811562,0.00008595109,0.0000736439,0.00003518113,0.0001355532,0.0000848749,0.2526053,0.0005643314,0.7312449,0.01508039,0.0000285109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001351156,0.0002555171,0.9944187,0.0005681796,0.00003525101,0.000104396,0.00006475126,0.0002349741,0.002967125],"genre_scores_gemma":[0.05531078,0.001807063,0.9351417,0.0004864003,0.0001696876,0.0005135929,0.0005959671,0.0003394136,0.00563541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01172036,"threshold_uncertainty_score":0.02350742,"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."}}