{"id":"W2291690114","doi":"10.1145/2824234","title":"Type-Based Call Graph Construction Algorithms for Scala","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scala; Computer science; Bytecode; Programming language; Compiler; Call graph; Java bytecode; Graph; Algorithm; Java; Theoretical computer science; Java applet; Java annotation","routes":{"ca_aff":true,"ca_fund":true,"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.0007199561,0.000138277,0.0002128141,0.0001750792,0.00008581991,0.00003893467,0.0002401439,0.0001441323,0.000001454489],"category_scores_gemma":[0.000548845,0.0001272513,0.00006703504,0.0002503416,0.00004627763,0.00009555217,0.00000702014,0.0001452423,0.000004325643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000276479,"about_ca_system_score_gemma":0.00006073213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003647819,"about_ca_topic_score_gemma":0.000003863037,"domain_scores_codex":[0.9990947,0.0001120554,0.0001633931,0.0003011876,0.00009483102,0.0002338123],"domain_scores_gemma":[0.9984884,0.0008523319,0.00003911954,0.0003549338,0.000122922,0.0001422769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009475581,0.0001141796,0.0003486568,0.0001697066,0.0001551076,0.00001175646,0.000934471,0.05089597,0.0003877541,0.03746438,0.0002658081,0.9091575],"study_design_scores_gemma":[0.01553383,0.009010972,0.001840313,0.0001152194,0.0005612161,0.00196507,0.0006591983,0.3992483,0.04546076,0.1812951,0.3401308,0.004179286],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005806069,0.0002008272,0.9961671,0.0001471096,0.002268869,0.0001826612,0.000002667917,0.0004429822,0.000007201908],"genre_scores_gemma":[0.06806958,0.00001039512,0.9316314,0.00007490145,0.00006362174,0.0000614364,0.000003675615,0.00001364968,0.00007136356],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9049782,"threshold_uncertainty_score":0.5189158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1232372336727384,"score_gpt":0.3188342743765967,"score_spread":0.1955970407038584,"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."}}