{"id":"W2129423489","doi":"10.1109/wcre.2009.49","title":"Approximate Graph Matching in Software Engineering","year":2009,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Matching (statistics); Software; Software engineering; Programming language; Mathematics","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.0001821126,0.00007552983,0.00007730245,0.0001404237,0.0000299783,0.0000666113,0.0003746971,0.0000240482,0.000005290695],"category_scores_gemma":[0.000011347,0.00006706233,0.00003402607,0.0003827231,0.000004472698,0.0003439437,0.00004214,0.00009057004,0.00001028072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006273232,"about_ca_system_score_gemma":0.00000465433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003665407,"about_ca_topic_score_gemma":6.7462e-7,"domain_scores_codex":[0.9994406,0.0000115638,0.0001015264,0.0001691199,0.00008042125,0.0001967336],"domain_scores_gemma":[0.9997056,0.0000293572,0.00001344363,0.0002046202,0.000007267901,0.00003968377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000125703,0.00004893954,0.000263165,0.000008037812,0.000002852092,0.00004044112,0.0007670818,0.007134171,0.0008679107,0.9426499,0.00002086601,0.0481954],"study_design_scores_gemma":[0.0003654785,0.0000596552,0.01284576,0.00005170659,0.000001263952,0.00003248262,0.00003869241,0.09593913,0.003407219,0.8867936,0.00009036093,0.0003747204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05041754,0.0000341402,0.9484483,0.0001341971,0.00009453025,0.00004237612,1.527809e-7,0.0003085635,0.000520204],"genre_scores_gemma":[0.6905979,0.000002186168,0.3090815,0.0002564759,0.00001192597,0.000002060481,3.218124e-7,0.000002586829,0.00004504966],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6401803,"threshold_uncertainty_score":0.2734723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005741452150948093,"score_gpt":0.1976688734706863,"score_spread":0.1919274213197382,"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."}}