{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"0fbf3d8f5d3e","filters":{"venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications"}},"results":[{"id":"W3163215105","doi":"","title":"IDEal: Efficient and Precise Alias-Aware Dataflow Analysis","year":2017,"lang":"en","type":"article","venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Alias; Computer science; Dataflow; Aliasing; Ideal (ethics); Programming language; Static analysis; Theoretical computer science; Parallel computing; Algorithm; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0240224567873954,"gpt":0.3197320523337395,"spread":0.2957095955463441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004758179,0.0002372721,0.0003569426,0.0002450131,0.001024407,0.001346138,0.0008361457,0.000105924,0.000002977638],"category_scores_gemma":[0.00007833764,0.0002152246,0.00006001531,0.0004002775,0.0001632826,0.0001763484,0.0003454669,0.000163366,0.000008528542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000310451,"about_ca_system_score_gemma":0.00005903725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000408318,"about_ca_topic_score_gemma":0.00003426455,"domain_scores_codex":[0.9981658,0.00009999327,0.0003569784,0.0007746525,0.0002747948,0.0003277186],"domain_scores_gemma":[0.9975379,0.00009140076,0.0003865667,0.001527871,0.0002587568,0.0001975013],"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.00002153846,0.0005471139,0.003149081,0.0002559742,0.0003738669,0.0000179538,0.002217941,0.001579138,0.0001011937,0.4784851,0.0009101851,0.5123409],"study_design_scores_gemma":[0.001314279,0.0003157302,0.002955447,0.0003078659,0.0003255937,0.00003539553,0.001328563,0.9180661,0.0003035592,0.0003223661,0.0737349,0.000990167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003674134,0.0009461702,0.9917127,0.0002273469,0.00008543207,0.0009747788,0.00004731608,0.0005959371,0.00173617],"genre_scores_gemma":[0.9769032,0.0001704391,0.02174821,0.00003164504,0.00008228955,0.0005202667,0.0001206427,0.00001389018,0.0004094105],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9732291,"threshold_uncertainty_score":0.9996905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3161581138","doi":"","title":"A Model for Reasoning about JavaScript Promises","year":2017,"lang":"en","type":"article","venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; JavaScript; Debugging; Correctness; Programming language; Asynchrony (computer programming); Web application; Asynchronous communication; Unobtrusive JavaScript; Callback; Graph; Theoretical computer science; Event (particle physics); Software engineering; World Wide Web; Rich Internet application","retraction":null,"screen_n_in":null,"score":{"opus":0.04423248080763079,"gpt":0.3153875209816481,"spread":0.2711550401740173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000665019,0.0003391878,0.0004326755,0.0001221551,0.001608333,0.001967393,0.001167153,0.0001770196,0.000001648046],"category_scores_gemma":[0.0002140211,0.0002936701,0.0001099927,0.0001495814,0.0001936777,0.0004250999,0.000212414,0.000197888,0.00002152614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006076561,"about_ca_system_score_gemma":0.0001939774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003977985,"about_ca_topic_score_gemma":0.0001093792,"domain_scores_codex":[0.9976009,0.00007057965,0.0004646896,0.0009215177,0.000322678,0.0006196956],"domain_scores_gemma":[0.9970342,0.00008706883,0.0005581381,0.001622441,0.0004456023,0.00025258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009800092,0.0001036466,0.0003841677,0.0002109503,0.00003988866,0.000003174471,0.0014094,0.00001633625,0.0001066085,0.87506,0.0002836123,0.1223724],"study_design_scores_gemma":[0.003049298,0.0006707985,0.000640965,0.0004540256,0.0001540908,0.0001122206,0.004741133,0.4742286,0.0004292658,0.01270563,0.5010115,0.001802504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006739153,0.001885138,0.9850495,0.000207649,0.0003351909,0.003457472,0.00002247063,0.0005502888,0.007818344],"genre_scores_gemma":[0.9747979,0.00007001522,0.01541169,0.00004978702,0.0003282112,0.005398398,0.00005969658,0.00003274268,0.003851567],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.974124,"threshold_uncertainty_score":0.9999515,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3163223842","doi":"","title":"The VM Already Knew That: Leveraging Compile-Time Knowledge to Optimize Gradual Typing","year":2017,"lang":"en","type":"article","venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compile time; Programmer; Programming language; JavaScript; Compiler; Code (set theory); Just-in-time compilation; Object (grammar); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04608562986757483,"gpt":0.3130508497861182,"spread":0.2669652199185434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001045506,0.0003974932,0.0004582192,0.0001353628,0.003039827,0.003091343,0.001809579,0.0001430199,0.0000037705],"category_scores_gemma":[0.000144894,0.0002990204,0.00009890403,0.0002977532,0.0002519689,0.0003166355,0.0005230454,0.0003129002,0.0002816068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009137074,"about_ca_system_score_gemma":0.0001648998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007025042,"about_ca_topic_score_gemma":0.0001321927,"domain_scores_codex":[0.9972387,0.0002154943,0.0004926221,0.0009302295,0.0003547101,0.0007682705],"domain_scores_gemma":[0.9965916,0.0002480774,0.0004759444,0.001954927,0.000373323,0.0003560976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001150324,0.0001247178,0.0005286255,0.00009431421,0.0000711933,0.000007861871,0.00286559,0.00001274676,0.00008838973,0.7190359,0.0007162518,0.2764429],"study_design_scores_gemma":[0.001297381,0.000385053,0.001385412,0.0003413649,0.00007701573,0.0001258709,0.006427451,0.0126393,0.000275105,0.001980999,0.9738095,0.001255485],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002169762,0.006042534,0.9465004,0.001646055,0.001440656,0.005247058,0.00001811925,0.001223722,0.03571166],"genre_scores_gemma":[0.9917359,0.0000702714,0.002278477,0.0000688773,0.0004402328,0.001554261,0.00003246897,0.00003394215,0.003785506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9895662,"threshold_uncertainty_score":0.9999462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}