{"id":"W2095802649","doi":"10.1145/1251535.1251542","title":"Comparing call graphs","year":2007,"lang":"en","type":"article","venue":"","topic":"Software Engineering Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Call graph; Computer science; Spurious relationship; Graph; Theoretical computer science; Power graph analysis; Data mining; Machine learning","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003945396,0.001002483,0.0007280118,0.009844533,0.001100538,0.003231243,0.001581151,0.001141915,0.00661393],"category_scores_gemma":[0.04092423,0.0004210261,0.001356063,0.006131062,0.0009856387,0.004180326,0.001746993,0.001053701,0.001009417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001531865,"about_ca_system_score_gemma":0.001480719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004654593,"about_ca_topic_score_gemma":0.004171021,"domain_scores_codex":[0.9922194,0.002105399,0.0006151394,0.0009656819,0.003693751,0.0004005716],"domain_scores_gemma":[0.9583715,0.0285027,0.002312225,0.004369145,0.006074943,0.0003695402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001383637,0.00028653,0.05208634,0.002820067,0.0007727826,0.001076658,0.003401403,0.07686877,0.03751445,0.08266948,0.02089637,0.7202235],"study_design_scores_gemma":[0.0002341603,0.0009251271,0.09233014,0.0006889715,0.001344686,0.002349206,0.00546076,0.3476343,0.07883126,0.3355983,0.1340416,0.0005614549],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2591331,0.001638043,0.68018,0.001098918,0.0002309824,0.000669018,0.008071318,0.0194031,0.0295755],"genre_scores_gemma":[0.7139592,0.0008191079,0.265072,0.0003228706,0.00008559905,0.0004934078,0.01088355,0.004405617,0.00395867],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009844533,"threshold_uncertainty_score":0.02212584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03137187158833518,"score_gpt":0.2839632137052097,"score_spread":0.2525913421168745,"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."}}