{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":928,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":928,"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":"03928a3e2db6","filters":{"topic":"Logic, programming, and type systems"}},"results":[{"id":"W1536098516","doi":"10.1007/3-540-36579-6_12","title":"Scaling Java Points-to Analysis Using Spark","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":430,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"SPARK (programming language); Computer science; Java; Modular design; Implementation; Scala; Graph; Scaling; Theoretical computer science; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03014260705133876,"gpt":0.2649328401996686,"spread":0.2347902331483298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001744777,0.0006217601,0.000896553,0.001990235,0.0003844564,0.001100853,0.003355919,0.0003601987,0.00002719333],"category_scores_gemma":[0.0001453771,0.0005545649,0.0003432955,0.002903091,0.0003492665,0.000456344,0.001110136,0.0006069553,0.00009575773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004338988,"about_ca_system_score_gemma":0.0003602218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001117904,"about_ca_topic_score_gemma":0.0001201956,"domain_scores_codex":[0.9949007,0.00007976334,0.0007142611,0.00207371,0.001264548,0.000967031],"domain_scores_gemma":[0.9967799,0.0002914699,0.0003703411,0.001867408,0.0003329272,0.0003579578],"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.000007317416,0.00007194019,0.0009187893,0.0000857287,0.0002761165,0.0003235148,0.002725834,0.2650454,0.0001831139,0.1809361,0.00006157113,0.5493646],"study_design_scores_gemma":[0.000265599,0.0001652009,0.0001071975,0.0001126206,0.0001450607,0.0001337146,6.799011e-7,0.7984814,0.000875486,0.1864893,0.01164396,0.001579776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009767619,0.0004016214,0.9925731,0.0003342584,0.002278323,0.0004250502,0.00000133379,0.0001669372,0.00372166],"genre_scores_gemma":[0.3408728,0.00001186076,0.6550238,0.003024228,0.0005521364,0.000007402212,0.000003950441,0.00004642027,0.0004573687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5477848,"threshold_uncertainty_score":0.9999361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128466029","doi":"10.1016/j.scico.2006.04.002","title":"The TXL source transformation language","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":358,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"University of Toronto","keywords":"Computer science; Rewriting; Programming language; Parsing; Functional programming; Context (archaeology)","retraction":null,"screen_n_in":null,"score":{"opus":0.00920624451607326,"gpt":0.2357112333274883,"spread":0.226504988811415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648056,0.000135844,0.0001471051,0.0001357674,0.0006523464,0.0008450183,0.001800987,0.00003891752,8.736106e-7],"category_scores_gemma":[0.00001459632,0.00008980274,0.00008929693,0.001134269,0.0005110795,0.0009013581,0.0002060339,0.0001055397,0.0000176748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003892652,"about_ca_system_score_gemma":0.000146282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002372451,"about_ca_topic_score_gemma":0.00003158332,"domain_scores_codex":[0.9979745,0.00005402845,0.0003831666,0.0003379284,0.000706226,0.0005442181],"domain_scores_gemma":[0.9989299,0.00007891519,0.0001980073,0.0005418024,0.0001776579,0.00007378492],"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.000001083661,0.00003001933,0.0001307178,0.00001333738,0.000002554323,0.000001402359,0.00144801,0.0001744848,0.0005466165,0.3272022,0.00004594934,0.6704036],"study_design_scores_gemma":[0.001536342,0.0009675812,0.005981501,0.00005620133,0.00002538275,0.0002136674,0.00160948,0.5317492,0.04438754,0.04844864,0.363745,0.001279471],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01484155,0.0002765544,0.9809171,0.0003135802,0.0006539194,0.0003298302,1.009942e-7,0.000237765,0.002429578],"genre_scores_gemma":[0.9590313,0.000002084271,0.0406231,0.00002467803,0.0001710972,0.00001719777,0.000001074187,0.000005640585,0.0001238314],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9441897,"threshold_uncertainty_score":0.8148531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000050212","doi":"10.1145/857076.857077","title":"A brief history of just-in-time","year":2003,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":333,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Just-in-time compilation; Scheme (mathematics); Dynamic compilation; Programming language; Software engineering; Compiler","retraction":null,"screen_n_in":null,"score":{"opus":0.08761154784216878,"gpt":0.3076226983662516,"spread":0.2200111505240828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007142481,0.0004726512,0.002075716,0.000359715,0.0000442742,0.00007881247,0.003645407,0.0003529175,0.0000189893],"category_scores_gemma":[0.0004801509,0.0004199884,0.0004694236,0.0007685369,0.00009296738,0.0001131734,0.0009701785,0.000462956,0.0002198572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005477516,"about_ca_system_score_gemma":0.0008688805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004610286,"about_ca_topic_score_gemma":0.00001747664,"domain_scores_codex":[0.9936952,0.003219061,0.001175942,0.0008586408,0.0004775748,0.0005735912],"domain_scores_gemma":[0.9957492,0.001088353,0.0009488018,0.001982748,0.0001226934,0.0001082085],"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":[1.815015e-7,0.00008367318,0.0001107956,0.003874826,0.00005159269,0.00004288501,0.0002426851,0.000002616889,8.65948e-8,0.005463977,0.00351315,0.9866135],"study_design_scores_gemma":[0.0001541883,0.00005097805,0.00005289848,0.0008480335,0.00003886643,0.00006048317,0.000001457464,0.0002226348,1.438403e-7,0.000336562,0.9978066,0.0004271443],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000001636654,0.9323068,0.05889704,0.000003899984,0.002339405,0.0004703366,0.000001152695,0.0001645655,0.005815124],"genre_scores_gemma":[0.0005222706,0.9818652,0.009682001,0.00008111626,0.0003144873,0.00002255085,0.00004432765,0.00010159,0.007366405],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9942935,"threshold_uncertainty_score":0.9998252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101225843","doi":"10.1017/s0956796809990074","title":"Revised <sup>6</sup> Report on the Algorithmic Language Scheme","year":2009,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":325,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Emergent BioSolutions (Canada)","funders":"Office of Naval Research; Advanced Research Projects Agency; University of Cambridge; U.S. Department of Defense; National Science Foundation","keywords":"Computer science; Programming language; Lisp; Scheme (mathematics); Syntax; Feature (linguistics); Exception handling; Block (permutation group theory); Class (philosophy); Operator (biology); Functional programming; Theoretical computer science; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02597092254800683,"gpt":0.2593297195254717,"spread":0.2333587969774649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002013039,0.0001818711,0.0002600952,0.0001514498,0.0002511518,0.0003530495,0.0006237822,0.00008045177,0.00003053673],"category_scores_gemma":[0.0003631462,0.0001098064,0.0002780715,0.0004418335,0.00004429033,0.0004163755,0.00005083686,0.0004773018,0.0000495446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008976037,"about_ca_system_score_gemma":0.0001473232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006220072,"about_ca_topic_score_gemma":3.429886e-7,"domain_scores_codex":[0.9977589,0.0001204613,0.0006597238,0.0002581365,0.0008726073,0.0003301836],"domain_scores_gemma":[0.9982834,0.0001653725,0.0006438927,0.0004369143,0.0003350724,0.0001353274],"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.00008900904,0.000520653,0.0009616005,0.00003101,0.0002033781,0.002100775,0.001388213,0.0007340653,0.0006936446,0.2003748,0.01114281,0.78176],"study_design_scores_gemma":[0.002835986,0.004302111,0.006187722,0.0002123264,0.0001145211,0.02058835,0.001804343,0.03159837,0.001225782,0.02831101,0.9017103,0.001109143],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0288642,0.001751639,0.9511772,0.0105777,0.001696352,0.0006974945,4.337362e-7,0.0002420986,0.004992931],"genre_scores_gemma":[0.9767061,0.000009597526,0.0198946,0.0007854222,0.001681004,0.000008994631,0.000002760817,0.00001095628,0.0009004854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.947842,"threshold_uncertainty_score":0.4477775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974608873","doi":"10.1145/353171.353189","title":"Practical virtual method call resolution for Java","year":2000,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":290,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Bytecode; Computer science; Call graph; Java; Program analysis; Static analysis; Benchmark (surveying); Variable (mathematics); Class hierarchy; Hierarchy; Dependence analysis; Theoretical computer science; Call stack; Class (philosophy); Computer engineering; Programming language; Algorithm; Object-oriented programming; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05645485521653251,"gpt":0.3459434729546231,"spread":0.2894886177380906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006842387,0.00008089536,0.0001111162,0.00002845508,0.0001012908,0.0001261006,0.0002625684,0.00007692769,0.0001029637],"category_scores_gemma":[0.00007546492,0.00006089703,0.00006378609,0.0001258514,0.00001891957,0.0003107784,0.00004268133,0.00006878132,0.0003029095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002545481,"about_ca_system_score_gemma":0.00005466182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001279649,"about_ca_topic_score_gemma":0.00002894757,"domain_scores_codex":[0.9990119,0.0001049374,0.0001686832,0.0002931982,0.000167324,0.0002539569],"domain_scores_gemma":[0.9993216,0.0002052134,0.00003531072,0.0003007749,0.00005505985,0.00008205733],"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.000009562797,0.0000428923,0.000009073152,0.000003470671,0.00000719634,0.000003581408,0.0001462469,0.00002004329,0.00003888835,0.8090742,0.01742341,0.1732215],"study_design_scores_gemma":[0.0004030795,0.0003974784,0.000077392,0.000001012005,0.000007513139,0.00007187949,0.00002886322,0.167671,0.0005775548,0.01963628,0.8109555,0.0001724623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005357573,0.00001915637,0.9596552,0.001409611,0.0002546337,0.0002344092,2.681308e-7,0.0002005275,0.0381726],"genre_scores_gemma":[0.2275869,0.000004637139,0.7421839,0.0005562625,0.0002412125,0.00004967806,0.000002890286,0.000007690804,0.02936683],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7935321,"threshold_uncertainty_score":0.389339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123092976","doi":"10.1017/s0956796809007205","title":"Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages","year":2009,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":270,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language; Haskell; Combinatory logic; Interpreter; Functional programming; Abstract syntax; Data type; Compiler; Abstract syntax tree; Parsing; Semantics (computer science)","retraction":null,"screen_n_in":null,"score":{"opus":0.03776732997830856,"gpt":0.3030129315606968,"spread":0.2652456015823882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00154524,0.0002165466,0.0003555914,0.0001964916,0.0001971642,0.00041584,0.0006193086,0.0001103681,0.0000252434],"category_scores_gemma":[0.0002808339,0.0001690231,0.0003103611,0.0002854553,0.00004315898,0.0006693386,0.00005759873,0.0002939894,0.00001333389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029899,"about_ca_system_score_gemma":0.0002636466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008636566,"about_ca_topic_score_gemma":0.00001152271,"domain_scores_codex":[0.9977777,0.0001256447,0.0006982621,0.000289311,0.0006717914,0.0004372606],"domain_scores_gemma":[0.9980435,0.000197337,0.0006417328,0.0002601475,0.0006840042,0.0001733176],"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.0005250766,0.0004654087,0.001523154,0.00008929225,0.0003174806,0.0001383478,0.001317294,0.001743323,0.003465832,0.06337377,0.007068411,0.9199726],"study_design_scores_gemma":[0.01325878,0.01791824,0.02018745,0.0003564567,0.0006600106,0.002532571,0.003083935,0.04013664,0.005516376,0.08567335,0.8077644,0.002911857],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01051659,0.0006469626,0.9852105,0.001313145,0.001411938,0.0004303831,0.000001501311,0.0001093481,0.000359603],"genre_scores_gemma":[0.9757182,0.00000757158,0.02270438,0.0004408449,0.0007340693,0.00001826811,0.000008290845,0.00001441698,0.0003539848],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9652016,"threshold_uncertainty_score":0.6892563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990204174","doi":"10.1145/1352582.1352591","title":"Contextual modal type theory","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":263,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Sketch; Normal modal logic; Type theory; Accessibility relation; Modal logic; Modal; Multimodal logic; Categorical variable; Modal operator; Computer science; Logical framework; Algebra over a field; Mathematics; Type (biology); Calculus (dental); Theoretical computer science; Artificial intelligence; Algorithm; Programming language; Pure mathematics; Description logic","retraction":null,"screen_n_in":null,"score":{"opus":0.04999189289866275,"gpt":0.2705926195485807,"spread":0.220600726649918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002084537,0.000154315,0.0001596823,0.0001237707,0.0004291153,0.00005761619,0.0006951315,0.00007966332,0.0001034979],"category_scores_gemma":[0.00003965271,0.000131261,0.0001019263,0.000380958,0.0001122281,0.0002428383,0.00001567663,0.0001855402,0.0006577737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004584133,"about_ca_system_score_gemma":0.0001260635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001728657,"about_ca_topic_score_gemma":0.000003475266,"domain_scores_codex":[0.9987087,0.0001376935,0.0002267074,0.0003543781,0.0003438649,0.0002286885],"domain_scores_gemma":[0.9987921,0.0004549267,0.0000658557,0.0004160035,0.0001801144,0.0000909993],"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.00003538072,0.0002550634,0.00006482354,0.000006078685,0.00005404316,0.00004880347,0.0006115446,0.05617321,0.00001824202,0.9045391,0.0003096155,0.03788407],"study_design_scores_gemma":[0.0007530865,0.0005756296,0.002582512,0.000003259287,0.00001190902,0.0004162274,0.00006599242,0.03176073,0.0001187071,0.9586357,0.004730043,0.0003462233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002404774,0.000100287,0.9928627,0.0005885998,0.0007173269,0.0001674133,0.00000233091,0.0003106981,0.002845863],"genre_scores_gemma":[0.9658999,0.000009607248,0.03224863,0.0007813912,0.00006448173,0.00001898672,0.000009850484,0.000009015786,0.0009581641],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9634951,"threshold_uncertainty_score":0.845457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390940921","doi":"10.1038/s41586-023-06747-5","title":"Solving olympiad geometry without human demonstrations","year":2024,"lang":"en","type":"article","venue":"Nature","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":254,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University","keywords":"Olympiad; Mathematical proof; Automated theorem proving; Computer science; Gas meter prover; Euclidean geometry; Artificial intelligence; Calculus (dental); Mathematics; Theoretical computer science; Geometry; Mathematics education","retraction":null,"screen_n_in":null,"score":{"opus":0.01459979506797145,"gpt":0.2838805558926104,"spread":0.2692807608246389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002312246,0.0001039243,0.00009943466,0.0001327759,0.00019626,0.0005610998,0.0004741386,0.0004913813,0.0000191901],"category_scores_gemma":[0.00002612993,0.00008088522,0.00006950884,0.0005357136,0.00002697366,0.0003484463,0.00009167685,0.0009825807,0.0001300769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003149737,"about_ca_system_score_gemma":0.00006650977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001670456,"about_ca_topic_score_gemma":0.00002555983,"domain_scores_codex":[0.9990836,0.00002760186,0.0001279922,0.0003170052,0.0002316211,0.000212221],"domain_scores_gemma":[0.9995047,0.00003740826,0.00002713114,0.0003236587,0.00004574639,0.00006128619],"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":[2.224459e-7,0.00001539509,0.001823208,0.00003892221,0.00002188379,0.00003693488,0.0003537682,0.0000027376,0.001406488,0.9744241,0.005174527,0.01670185],"study_design_scores_gemma":[0.000577328,0.0002654659,0.01564497,0.000129446,0.00006778544,0.0004907674,0.0002092629,0.02973609,0.005257107,0.1943667,0.7519661,0.001288942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02199508,0.02153715,0.8532638,0.002555575,0.006656917,0.0004629371,0.000003068038,0.002441572,0.09108393],"genre_scores_gemma":[0.9935038,0.000005077546,0.003223286,0.000228702,0.0003575417,0.000009567597,0.000004801123,0.000008913003,0.0026583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9715087,"threshold_uncertainty_score":0.5410698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1505627668","doi":"10.1023/a:1027357912519","title":"Theorem Proving Modulo","year":2003,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Modulo; Sequent calculus; Sequent; Cut-elimination theorem; Mathematics; Mathematical proof; Axiom; Congruence (geometry); Natural deduction; Calculus (dental); Automated theorem proving; Proof theory; Completeness (order theory); Algebra over a field; Resolution (logic); Proof complexity; Discrete mathematics; Algorithm; Computer science; Pure mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01164531881062052,"gpt":0.2442941495148121,"spread":0.2326488307041916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398059,0.000123345,0.0002380304,0.0001426676,0.0001351252,0.000274373,0.0005267984,0.0000741501,0.000009496168],"category_scores_gemma":[0.000395844,0.00008737286,0.0001182279,0.0003460719,0.000026046,0.0005554072,0.00004692918,0.0002192731,0.00002019551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000624724,"about_ca_system_score_gemma":0.0001651253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007423188,"about_ca_topic_score_gemma":7.773012e-7,"domain_scores_codex":[0.9986008,0.0001928074,0.0004209013,0.0001500547,0.0003490954,0.0002862742],"domain_scores_gemma":[0.9988013,0.00007325828,0.0005421542,0.0002459397,0.0002157427,0.0001215922],"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.000007081995,0.000100066,0.002703099,0.00003678269,0.0001078579,0.0003513916,0.002028567,0.0008229424,0.002302304,0.968645,0.001379579,0.02151527],"study_design_scores_gemma":[0.004540056,0.001861174,0.008858267,0.0005742827,0.0001405322,0.0194336,0.001670404,0.7402167,0.03824214,0.1046151,0.07814989,0.001697861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07068948,0.001692957,0.8962251,0.0002076541,0.002432436,0.0001953217,1.276975e-7,0.000868206,0.02768873],"genre_scores_gemma":[0.9656692,0.00001052433,0.03401944,0.0000438474,0.00009597849,0.00000117467,1.171161e-7,0.00001063515,0.0001491005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8949797,"threshold_uncertainty_score":0.3562962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139555094","doi":"10.1007/11804192_16","title":"Beyond Assertions: Advanced Specification and Verification with JML and ESC/Java2","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Programming language; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01348485921094149,"gpt":0.2272539903716622,"spread":0.2137691311607207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004862288,0.000329797,0.00031037,0.0003607199,0.0002647991,0.000623958,0.0007842576,0.0001868129,0.00000221502],"category_scores_gemma":[0.00002407719,0.0002667323,0.00003000891,0.0003669165,0.000528023,0.0006511782,0.0002547577,0.0003093349,0.000009058685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001109913,"about_ca_system_score_gemma":0.0001512478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003343512,"about_ca_topic_score_gemma":0.00009944765,"domain_scores_codex":[0.9975819,0.00002692951,0.0003450121,0.001198816,0.000511007,0.0003363378],"domain_scores_gemma":[0.9984585,0.0001456177,0.000280559,0.0008155549,0.0001941713,0.0001055912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008093888,0.00002637508,0.0004033078,0.00004957729,0.000007452486,0.00001656958,0.0004817384,0.00155038,0.0003099433,0.234911,0.00001974737,0.7622159],"study_design_scores_gemma":[0.001374255,0.001009449,0.0112655,0.0002632601,0.00003704123,0.00039589,0.000002672503,0.2278748,0.002551102,0.7332091,0.02002635,0.001990586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003117113,0.001203517,0.9921678,0.0003930189,0.0004524392,0.0004835498,0.000001001093,0.0001233706,0.004863613],"genre_scores_gemma":[0.7936429,0.0001098129,0.2051355,0.0002268891,0.0002530061,0.00002504532,0.00001296552,0.00002434086,0.0005696194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7933311,"threshold_uncertainty_score":0.9999785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W177306140","doi":"","title":"A.: Why3: Shepherd your herd of provers","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":186,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Programming language; Task (project management); Automated theorem proving; Proof assistant; Set (abstract data type); Software; Theoretical computer science; Algorithm; Mathematics; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.05597261288262851,"gpt":0.2632629811409697,"spread":0.2072903682583412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004046651,0.0002697821,0.0004395067,0.00009683589,0.00003882133,0.0001398723,0.001974296,0.0003126978,0.0001028818],"category_scores_gemma":[0.00002477563,0.0002090521,0.0002250577,0.0001448815,0.00006404759,0.0001625053,0.001758954,0.0003144057,0.0001619777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000419156,"about_ca_system_score_gemma":0.0002192779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001619128,"about_ca_topic_score_gemma":0.00006932332,"domain_scores_codex":[0.9981509,0.00007633866,0.0004350513,0.0006657279,0.0003479712,0.000324027],"domain_scores_gemma":[0.9979558,0.00002253364,0.0003679207,0.001375428,0.0001680129,0.0001102997],"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.000007586799,0.0001814955,0.001991704,0.0004801031,0.0001428331,0.00002242519,0.003051544,0.0000251853,0.00007872071,0.9421287,0.005629761,0.04625999],"study_design_scores_gemma":[0.00140148,0.0008857205,0.003289103,0.0001417563,0.0001217272,0.00006098657,0.0005674039,0.008707706,0.01389174,0.8059061,0.1623182,0.002708092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001173552,0.0003587954,0.6967741,0.0001161203,0.002752422,0.0006637288,0.000001143618,0.0004078667,0.2977522],"genre_scores_gemma":[0.9652566,0.00002487729,0.02493745,0.00009433429,0.0001640193,0.00005140823,0.0000044369,0.00001836871,0.009448525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.964083,"threshold_uncertainty_score":0.8524898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166894669","doi":"10.1109/tools.1998.711009","title":"SableCC, an object-oriented compiler framework","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Compiler; Scripting language; Debugging; Object-oriented programming; Abstract syntax tree; Interpreter; Java; Syntax; Inheritance (genetic algorithm); Parsing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03097884525152502,"gpt":0.2527770998612841,"spread":0.2217982546097591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001776933,0.0001346317,0.0001590989,0.00006044996,0.0001491968,0.0002257697,0.0006840258,0.0001075771,0.0006315979],"category_scores_gemma":[0.00002844914,0.0001039615,0.00005510342,0.0004376919,0.00003991634,0.000423884,0.000124777,0.0001560422,0.001347816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002314238,"about_ca_system_score_gemma":0.00001004795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008586765,"about_ca_topic_score_gemma":0.00002357725,"domain_scores_codex":[0.9987104,0.00007593483,0.0001963937,0.0003928036,0.0002661381,0.0003583105],"domain_scores_gemma":[0.9989061,0.00005335999,0.00005685907,0.0007513426,0.00007383524,0.0001584632],"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":[8.912093e-7,0.0001388927,0.001667323,0.000005807834,0.00001009427,0.00001266723,0.001159055,0.000007419027,0.00002298828,0.9673814,0.007079859,0.02251367],"study_design_scores_gemma":[0.0007405296,0.000747246,0.00240176,0.00001156026,0.00001139753,0.00008533456,0.0002960188,0.153858,0.0009066004,0.09758984,0.7424353,0.0009164163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001327785,0.0001739465,0.8970812,0.0002464312,0.000970429,0.0001554519,1.893052e-7,0.0005938102,0.09945075],"genre_scores_gemma":[0.9536643,0.000007706695,0.04024562,0.0007242815,0.0001911702,0.00001241087,0.000001756637,0.000008874852,0.005143851],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9523365,"threshold_uncertainty_score":0.9994298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068047345","doi":"10.1145/1183278.1183285","title":"Kleene algebra with domain","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Kleene algebra; Kleene's recursion theorem; Axiom; Algebra over a field; Term algebra; Domain (mathematical analysis); Extension (predicate logic); Mathematics; Propositional calculus; Simple (philosophy); Equational logic; Process calculus; Two-element Boolean algebra; Computer science; Programming language; Pure mathematics; Algebra representation; Discrete mathematics; Rewriting","retraction":null,"screen_n_in":null,"score":{"opus":0.01697811803986092,"gpt":0.2344277660564453,"spread":0.2174496480165843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001536714,0.0001731913,0.0001554478,0.0001423873,0.0003047281,0.0001555097,0.0006100812,0.00006540378,0.00004615456],"category_scores_gemma":[0.00000358026,0.0001334551,0.00007937898,0.0004754264,0.0000700004,0.000251021,0.00001049579,0.0001475896,0.0002291849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005443747,"about_ca_system_score_gemma":0.00007463914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009270226,"about_ca_topic_score_gemma":0.00004688706,"domain_scores_codex":[0.9986343,0.0000723826,0.0002291832,0.0004018635,0.0004060007,0.00025625],"domain_scores_gemma":[0.9991013,0.00020628,0.00008245512,0.0004284436,0.0001161033,0.00006540705],"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.00001522283,0.0002771095,0.0001412129,0.000009263604,0.00003238414,0.00003528607,0.00008880124,0.1331554,0.00001959479,0.8507817,0.000201692,0.01524228],"study_design_scores_gemma":[0.0007149432,0.0003820632,0.004256314,0.000004421207,0.00001039745,0.0001393407,0.00002497928,0.009138945,0.0001391284,0.980692,0.004216864,0.0002805671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002371987,0.00005190804,0.9915575,0.001696796,0.0002329901,0.00020392,0.000002569906,0.0003325564,0.003549712],"genre_scores_gemma":[0.8196185,0.000001024447,0.1795568,0.0003516888,0.00006317463,0.00003751463,0.00001593935,0.000009168408,0.0003461479],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8172466,"threshold_uncertainty_score":0.544214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969599528","doi":"10.1145/1925844.1926390","title":"Pick your contexts well","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":167,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Context (archaeology); Object (grammar); Sensitivity (control systems); Abstraction; Implementation; Quality (philosophy); Theoretical computer science; Allocator; Method; Programming language; Object-oriented programming; Artificial intelligence; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.06018896433042852,"gpt":0.262159894383952,"spread":0.2019709300535235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002538961,0.000142261,0.000169901,0.00005899163,0.0001050054,0.0001462494,0.001721127,0.00007637167,0.0001166116],"category_scores_gemma":[0.00008476935,0.0001106907,0.00005652992,0.0001464642,0.00004711075,0.0004060004,0.0003071516,0.0001018933,0.001735957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001169258,"about_ca_system_score_gemma":0.0000291361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005090481,"about_ca_topic_score_gemma":0.0001229323,"domain_scores_codex":[0.9988696,0.00006259669,0.0002014759,0.0003401788,0.0002030153,0.0003231202],"domain_scores_gemma":[0.9987252,0.0001000059,0.0001315542,0.0008751256,0.00005528975,0.0001128042],"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.00002802057,0.0002900161,0.06445945,0.000100036,0.000107997,0.0002672448,0.01723467,0.000004375299,0.0002790508,0.8318488,0.008711943,0.07666837],"study_design_scores_gemma":[0.002668291,0.001687017,0.1191533,0.00004338583,0.0001053097,0.0001819336,0.001314781,0.002636718,0.01358401,0.2039375,0.6524619,0.002225817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1394454,0.002846049,0.2212838,0.001109623,0.008092388,0.001159614,0.000004365095,0.00203849,0.6240202],"genre_scores_gemma":[0.9911226,0.000005325855,0.006703849,0.0003011027,0.0001573669,0.000009270137,0.000002139931,0.000008640995,0.001689681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8516772,"threshold_uncertainty_score":0.9990413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996228525","doi":"10.1016/j.jlap.2003.07.006","title":"The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JML","year":2003,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Programming language; Computer science; Java Modeling Language; Java; Java annotation; Generics in Java; Java applet; Java API for XML-based RPC; Mathematical proof; Semantics (computer science); Real time Java; Proof assistant; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03373960461384942,"gpt":0.2609795963231573,"spread":0.2272399917093079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004695318,0.0001875558,0.0002843172,0.00008161558,0.0004628125,0.0004835768,0.0008696632,0.00008045962,0.000001090105],"category_scores_gemma":[0.0003309576,0.00009325821,0.0001327576,0.0004825707,0.0002048941,0.0003400522,0.00007460338,0.0002748033,0.000003320098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004171602,"about_ca_system_score_gemma":0.0001076599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001318366,"about_ca_topic_score_gemma":0.00001872706,"domain_scores_codex":[0.9978895,0.0003651469,0.0007290572,0.0002091105,0.0003073462,0.0004999006],"domain_scores_gemma":[0.9982465,0.0004720845,0.0005792309,0.0003655829,0.0002456154,0.00009101653],"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.00004061763,0.0001212431,0.002416243,0.00003120828,0.00005621203,0.000009822442,0.001547426,0.00001123326,0.0001067251,0.3851786,0.0001967927,0.6102839],"study_design_scores_gemma":[0.003211908,0.002689189,0.004153909,0.0000862315,0.0001267163,0.001530312,0.003529005,0.002387081,0.0008801055,0.4454326,0.5352241,0.0007488718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1255812,0.02279453,0.8356205,0.008777697,0.001819285,0.004095886,7.490834e-7,0.0002156172,0.001094634],"genre_scores_gemma":[0.9910818,0.0001998826,0.008265569,0.0001222011,0.00009273435,0.00006359004,9.034815e-7,0.00001122015,0.0001621089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8655006,"threshold_uncertainty_score":0.4663142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128992690","doi":"10.2168/lmcs-1(2:1)2005","title":"General Recursion via Coinductive Types","year":2005,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Coinduction; Monad (category theory); Finitary; Domain theory; Type theory; Recursion (computer science); Partial function; Type (biology); Computer science; μ operator; Simple (philosophy); Domain (mathematical analysis); Partial evaluation; Theoretical computer science; Computability theory; Algebra over a field; Functional programming; Element (criminal law); Representation (politics); Primitive recursive function; Mathematics; Discrete mathematics; Programming language; Algorithm; Pure mathematics; Recursive functions; Functor","retraction":null,"screen_n_in":null,"score":{"opus":0.0759905153646028,"gpt":0.3791849483817478,"spread":0.303194433017145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00381099,0.0002039211,0.0003021927,0.0002445958,0.0002344737,0.0003216676,0.002231746,0.0001165641,0.00001857904],"category_scores_gemma":[0.0001481662,0.0001482757,0.00007585841,0.001723486,0.0004521677,0.0009018916,0.0009622258,0.0002986709,0.00009149892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001543199,"about_ca_system_score_gemma":0.00009640722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000419581,"about_ca_topic_score_gemma":0.000007384283,"domain_scores_codex":[0.9969155,0.0005384841,0.0003836439,0.00100116,0.0005141429,0.000647035],"domain_scores_gemma":[0.9985383,0.0002847807,0.0001269521,0.0006954113,0.000145754,0.0002088362],"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.000002567398,0.00008448264,0.0003062436,0.000003280362,0.000001995196,0.00001473497,0.0003758827,0.0007381233,0.001805091,0.197736,0.00003798257,0.7988936],"study_design_scores_gemma":[0.0003307905,0.0003771603,0.006666037,0.00000782354,0.000002444183,0.0001395629,0.000004688738,0.7771939,0.009116394,0.1935229,0.01220351,0.0004347464],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003528548,0.0001485954,0.9906104,0.0006919832,0.001816593,0.0002210179,1.113961e-7,0.0001922935,0.002790446],"genre_scores_gemma":[0.2838193,0.000005282096,0.7151808,0.0005298143,0.0003719177,0.00001155776,1.949933e-7,0.00000398835,0.00007713479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7984589,"threshold_uncertainty_score":0.6046507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2990094262","doi":"10.1145/3335741.3335750","title":"The knowledge complexity of interactive proof-systems","year":2019,"lang":"en","type":"book-chapter","venue":"Association for Computing Machinery eBooks","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"","keywords":"Citation; Computer science; Cryptography; World Wide Web; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.0388709443907372,"gpt":0.2749463209911082,"spread":0.236075376600371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001918018,0.0003851139,0.0007011788,0.0001326319,0.0004472495,0.000371641,0.001186036,0.0003437875,0.0000011894],"category_scores_gemma":[0.0001641197,0.0002908819,0.0004179786,0.0000371,0.00008875674,0.00008638929,0.0004857297,0.0004739429,0.00005283757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004631814,"about_ca_system_score_gemma":0.0002669698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007590539,"about_ca_topic_score_gemma":0.00007720093,"domain_scores_codex":[0.9975103,0.0001698182,0.0008757318,0.0005487722,0.0004803969,0.0004149394],"domain_scores_gemma":[0.9942016,0.001782395,0.002477681,0.0006867492,0.0007878664,0.00006370866],"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.00000979855,0.00001861766,0.0001308657,0.0001417582,0.0003070619,5.231807e-7,0.0008542875,0.00003219685,0.000005121813,0.975808,0.001471158,0.02122058],"study_design_scores_gemma":[0.0007863734,0.0003140591,0.0001369754,0.0001390316,0.00008764377,0.000009246816,0.00003587923,0.09143552,0.00005767232,0.2676304,0.6387114,0.0006557983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001834162,0.0005592515,0.1480803,0.00008141761,0.005064747,0.001840975,0.00002172203,0.0002089964,0.8441242],"genre_scores_gemma":[0.4638546,0.000002247429,0.0004190951,0.00001932852,0.0004900871,0.00001976755,0.00003494199,0.00004608468,0.5351139],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7081776,"threshold_uncertainty_score":0.9999543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2176580510","doi":"10.1007/978-3-540-25935-0_4","title":"DSL Implementation in MetaOCaml, Template Haskell, and C++","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Haskell; Computer science; Programming language; Domain-specific language; Embedding; Digital subscriber line; Functional programming; Template; Generative grammar; Generic programming; Interpreter; Domain (mathematical analysis); Range (aeronautics); Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02400008559653709,"gpt":0.2772864200667095,"spread":0.2532863344701724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001046055,0.0004222333,0.0004802243,0.000751629,0.0001904574,0.0006636271,0.001478643,0.0002392611,0.00002014096],"category_scores_gemma":[0.00002085082,0.0003699989,0.00007437119,0.0005268896,0.0004162196,0.0006783623,0.0007744381,0.0004918679,0.00002821464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002888662,"about_ca_system_score_gemma":0.0004161058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003820535,"about_ca_topic_score_gemma":0.0009132977,"domain_scores_codex":[0.9968205,0.00003903207,0.0005561857,0.001311784,0.0006651492,0.0006073682],"domain_scores_gemma":[0.9985829,0.0001550198,0.0002653392,0.0007594434,0.000101608,0.0001357019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003023734,0.00002185902,0.000510162,0.0000622141,0.00001138867,0.0001424971,0.001662367,0.002282718,0.0000582905,0.3171879,0.000009594783,0.678048],"study_design_scores_gemma":[0.0008559361,0.0003198516,0.0008468858,0.0001067569,0.00001028466,0.0001408014,0.000001276697,0.02615895,0.0008544552,0.9661411,0.003730129,0.0008335448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001814385,0.000870936,0.994552,0.0003947935,0.001136232,0.0005408229,0.000001271072,0.0001039983,0.00221856],"genre_scores_gemma":[0.9081573,0.00006795231,0.09075883,0.000615201,0.0002243621,0.00001682944,0.000006262841,0.00002464205,0.0001286536],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9079759,"threshold_uncertainty_score":0.9998752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1536129331","doi":"10.1007/978-3-642-14203-1_2","title":"Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematical proof; Computer science; Programming language; Abstract syntax; Syntax; Beluga Whale; Axiom; Compiler; Debugging; Theoretical computer science; Artificial intelligence; Semantics (computer science); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01865205842879661,"gpt":0.2383697603228672,"spread":0.2197177018940706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001337438,0.0006341927,0.0007500846,0.0005277743,0.0006706733,0.002007147,0.001763152,0.0006031578,8.082274e-7],"category_scores_gemma":[0.0001106926,0.0004893683,0.0001044585,0.0005082528,0.0007994145,0.000736948,0.0005756216,0.001057505,0.000006934249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002935525,"about_ca_system_score_gemma":0.0004560954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009041572,"about_ca_topic_score_gemma":0.00009665015,"domain_scores_codex":[0.9958863,0.00004611957,0.0005340707,0.001848007,0.0008112774,0.000874243],"domain_scores_gemma":[0.9969999,0.0004885284,0.0005540449,0.001159433,0.0005389802,0.0002590789],"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.00001239866,0.00001776055,0.0001752167,0.0002960989,0.00002958605,0.00004808909,0.001575258,0.0005550237,0.00002104547,0.7643299,0.000001470221,0.2329381],"study_design_scores_gemma":[0.002004851,0.00316443,0.0003361833,0.004947144,0.0001767645,0.004313871,0.00005200088,0.3931378,0.0008287714,0.5489199,0.03719223,0.004926106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008735791,0.00117494,0.992609,0.0001155394,0.003336864,0.001814532,0.00000217221,0.0003615728,0.0004979714],"genre_scores_gemma":[0.362078,0.000006016555,0.6367891,0.00006338217,0.0007550113,0.0001305324,0.000003117556,0.00004139049,0.0001334944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3925828,"threshold_uncertainty_score":0.9997558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1711276981","doi":"10.1007/978-3-540-69738-1_27","title":"Invariant Synthesis for Combined Theories","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Invariant (physics); Constraint satisfaction; Correctness; Programmer; Satisfiability; Theoretical computer science; Predicate (mathematical logic); Algorithm; Programming language; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02732379085539345,"gpt":0.2526834980298743,"spread":0.2253597071744808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002413688,0.0005518957,0.000679744,0.0007033788,0.0003819122,0.0007938095,0.003644039,0.0004243305,0.00001567004],"category_scores_gemma":[0.00034098,0.0004476248,0.0002138349,0.0005015286,0.000743325,0.0004415772,0.0009032479,0.0004601054,0.00004695185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002191006,"about_ca_system_score_gemma":0.0004788434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003694552,"about_ca_topic_score_gemma":0.0001122052,"domain_scores_codex":[0.9961886,0.00003958817,0.0006088665,0.001466864,0.0008309726,0.0008650682],"domain_scores_gemma":[0.9959247,0.001748758,0.0003611409,0.00143768,0.0003380753,0.000189621],"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.000009318494,0.0000194404,0.00001520288,0.00004776603,0.00001301456,0.00003495409,0.000401324,0.0002910285,0.00001547026,0.6776086,0.00001826536,0.3215256],"study_design_scores_gemma":[0.0002812497,0.0003012647,0.00002283207,0.00008792022,0.00001425967,0.00005512263,4.243875e-7,0.05949671,0.001761176,0.9278613,0.009407157,0.0007105834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000004391178,0.0003550677,0.9843972,0.0004414424,0.003011612,0.000827961,0.000003301674,0.0002486648,0.01071031],"genre_scores_gemma":[0.5205396,0.00003389195,0.4747904,0.001671839,0.001290391,0.00009452364,0.000007880559,0.00007715898,0.001494281],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5205353,"threshold_uncertainty_score":0.9997975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148870725","doi":"10.1109/lics.1991.151659","title":"A computation model for executable higher-order algebraic specification languages","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Functional programming; Recursion (computer science); Computer science; Programming language; Algebraic specification; Lemma (botany); Generalization; Theoretical computer science; Algebra over a field; Primitive recursive function; Algebraic number; Executable; Mathematics; Discrete mathematics; Pure mathematics; Algorithm; Specification language","retraction":null,"screen_n_in":null,"score":{"opus":0.05376486799649755,"gpt":0.27300515033522,"spread":0.2192402823387225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001285859,0.0000914491,0.0001045836,0.00005501661,0.00009647917,0.0001666193,0.0002745442,0.00005087471,0.00004666623],"category_scores_gemma":[0.00001032373,0.00007552945,0.00004126517,0.0002136835,0.00001523963,0.000312101,0.00003785699,0.00003603398,0.0001574179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002503471,"about_ca_system_score_gemma":0.000009629928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002968493,"about_ca_topic_score_gemma":0.000008102499,"domain_scores_codex":[0.9991993,0.00001941971,0.0001631474,0.0002740515,0.0001437254,0.0002003374],"domain_scores_gemma":[0.9994912,0.00004275257,0.00006875047,0.0002424552,0.0001079394,0.0000469686],"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.000001348094,0.00007701585,0.00004377602,0.00002119188,0.000009621965,0.000001005973,0.0008947207,0.002408213,0.0002004157,0.9342474,0.01642397,0.0456713],"study_design_scores_gemma":[0.0002414507,0.00003744454,0.00006499651,9.282891e-7,0.000003132209,0.000003021704,0.00003071939,0.9589965,0.0001811822,0.02898091,0.01134377,0.0001159879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001879665,0.0002419044,0.9723921,0.0007461577,0.000198769,0.0003096572,4.841168e-7,0.000296986,0.02562595],"genre_scores_gemma":[0.8716568,0.000006378926,0.1041647,0.000206653,0.00009592235,0.00005362971,0.000008159722,0.000008076104,0.02379961],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9565883,"threshold_uncertainty_score":0.3080001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2767778696","doi":"10.1145/3158121","title":"A new proof rule for almost-sure termination","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; Eidgenössische Technische Hochschule Zürich; McGill University","keywords":"Soundness; Probabilistic logic; Markov chain; Connection (principal bundle); Computer science; Determinism; Mathematical proof; Mathematics; Discrete mathematics; Programming language; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02387605539249461,"gpt":0.2929920630576812,"spread":0.2691160076651866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006162061,0.0001929505,0.0002351683,0.00006941753,0.0005123113,0.0007789406,0.004985663,0.0001080366,0.000002131214],"category_scores_gemma":[0.002112063,0.0001268008,0.0001696085,0.0001293352,0.00008024358,0.000566653,0.000984526,0.0001332514,0.000005420522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003113512,"about_ca_system_score_gemma":0.00005259465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009536934,"about_ca_topic_score_gemma":0.00000833323,"domain_scores_codex":[0.9985889,0.000007051382,0.0002536607,0.0004125645,0.0003721852,0.0003656505],"domain_scores_gemma":[0.9978441,0.00006072948,0.0006478089,0.001095879,0.0002685917,0.00008290815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002209631,0.0001002331,0.006921758,0.0002781819,0.00004125663,0.000001306442,0.002183311,3.936344e-7,0.003169478,0.128369,0.003334992,0.855578],"study_design_scores_gemma":[0.003592849,0.00205467,0.02481077,0.0004151815,0.0001706277,0.0001106123,0.0018325,0.0008959612,0.4789845,0.2904753,0.1952455,0.001411575],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6023842,0.005175082,0.1676752,0.09661971,0.01010861,0.03015058,0.00003087699,0.004444536,0.08341123],"genre_scores_gemma":[0.9274814,0.000002332826,0.06860084,0.00006920722,0.0002709918,0.0001516768,0.000001206421,0.00002033504,0.003401987],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8541664,"threshold_uncertainty_score":0.9264686,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913248536","doi":"10.1017/s0960129506005676","title":"Differential categories","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Calgary; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Computer science; Differential (mechanical device); Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01394231334674149,"gpt":0.246129583237573,"spread":0.2321872698908315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003306541,0.0001875348,0.0002418928,0.0001837726,0.0002115731,0.0007867247,0.001988233,0.00005221026,0.00003545102],"category_scores_gemma":[0.00002983323,0.0001334466,0.0000565977,0.0008201235,0.0004954627,0.0004804645,0.0006913927,0.0001409176,0.00004093339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006719192,"about_ca_system_score_gemma":0.00007365171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007085268,"about_ca_topic_score_gemma":0.00001439033,"domain_scores_codex":[0.9977869,0.00004178837,0.0003707026,0.0005813568,0.0006666828,0.0005525776],"domain_scores_gemma":[0.9990125,0.00009343812,0.00008570273,0.0006390795,0.00007003921,0.00009928723],"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":[7.230418e-7,0.00004075094,0.0007245645,0.00001915601,0.000001070794,0.00001951442,0.0002193299,0.0001377219,0.0001602147,0.9756806,0.00008724578,0.02290914],"study_design_scores_gemma":[0.0001522406,0.00002596122,0.007397497,0.000003186737,0.000001203216,0.00006420397,0.000003212511,0.1489859,0.001242107,0.8416963,0.0002543671,0.0001738387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02122209,0.00003480603,0.9748831,0.0001378436,0.0009541616,0.0001682635,1.885491e-7,0.0001734854,0.002426039],"genre_scores_gemma":[0.9270056,3.421081e-7,0.07265099,0.00006233608,0.0002245582,0.00000951255,6.164004e-7,0.000005328574,0.00004069913],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057835,"threshold_uncertainty_score":0.7586404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2417567569","doi":"10.1145/2908080.2908096","title":"From Datalog to flix: a declarative language for fixed points on lattices","year":2016,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datalog; Programming language; Computer science; Declarative programming; Arithmetic; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03864994135685897,"gpt":0.2973349449551425,"spread":0.2586850035982835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001856962,0.0001022064,0.0001299095,0.00004522215,0.00005821944,0.0001186257,0.0006086844,0.00003683966,0.00005344051],"category_scores_gemma":[0.0001118507,0.00005511863,0.00004217925,0.0000968519,0.00001528663,0.0002681447,0.0001472883,0.00002532087,0.0008664033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002192367,"about_ca_system_score_gemma":0.00002053572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002681729,"about_ca_topic_score_gemma":0.0002563304,"domain_scores_codex":[0.9991036,0.00004001974,0.0001269161,0.0003728364,0.0001401974,0.0002164268],"domain_scores_gemma":[0.9990082,0.0003174853,0.00004801223,0.0004907019,0.00004074415,0.00009481576],"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.00005245587,0.0001264151,0.0004762773,0.00001313168,0.00007284023,0.00002975879,0.007821972,7.894519e-7,0.006800401,0.773403,0.02688072,0.1843222],"study_design_scores_gemma":[0.005545798,0.002966418,0.005431436,0.0001005454,0.00003905617,0.00001605927,0.001906202,0.002887896,0.1455908,0.2166474,0.6171551,0.001713255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01400348,0.00002948395,0.9774911,0.001931615,0.0004316693,0.000398361,0.00002225606,0.00017907,0.005512979],"genre_scores_gemma":[0.9504627,6.50177e-7,0.04387626,0.0009773211,0.00020205,0.00006222988,0.00001099879,0.000007043201,0.004400767],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9364592,"threshold_uncertainty_score":0.9999115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146471655","doi":"10.1017/s0960129505004822","title":"Modelling general recursion in type theory","year":2005,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Type theory; Recursion (computer science); Mathematical proof; Computer science; Mutual recursion; Type (biology); Theory of computation; Functional programming; Constructive; Predicate (mathematical logic); Proof theory; Theoretical computer science; Algorithm; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02889547040022715,"gpt":0.2744766433418571,"spread":0.24558117294163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460478,0.0001647187,0.0002250214,0.0002557794,0.0001119853,0.0003164531,0.001695551,0.00006408716,0.0000226038],"category_scores_gemma":[0.00005315551,0.000122683,0.00003831436,0.001096318,0.0002312009,0.0005775519,0.0005305833,0.0002067903,0.00004680582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001271977,"about_ca_system_score_gemma":0.00008309323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001281896,"about_ca_topic_score_gemma":0.000005629245,"domain_scores_codex":[0.9979038,0.00009612074,0.0003838678,0.0005802068,0.0005178938,0.0005181428],"domain_scores_gemma":[0.9990414,0.0001319783,0.000072284,0.0005760968,0.00006312381,0.0001150549],"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.000002865037,0.00003468216,0.0001167898,0.00001301824,7.673937e-7,0.00001084048,0.0009842973,0.0583535,0.00003219308,0.8309892,0.00001583971,0.109446],"study_design_scores_gemma":[0.00009248887,0.00001934596,0.0001269013,0.000006906571,3.671157e-7,0.00002436265,0.000003224334,0.5470634,0.0001561862,0.4522064,0.0002060476,0.00009435514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04986013,0.0001404532,0.947799,0.0001625805,0.0005567954,0.0001756425,8.029436e-8,0.00008308509,0.001222246],"genre_scores_gemma":[0.7016475,0.000003125104,0.2980271,0.0001528259,0.0001333611,0.000003712477,1.849122e-7,0.000004496054,0.00002761866],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6517874,"threshold_uncertainty_score":0.5002868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150922760","doi":"10.1145/1167473.1167500","title":"Generic ownership for generic Java","year":2006,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Marsden Fund; Engineering and Physical Sciences Research Council; Royal Society","keywords":"Computer science; Java; Programming language; Mainstream; Reuse; Object-oriented programming; Scala; Encapsulation (networking); Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.04521620242507629,"gpt":0.2441257206659813,"spread":0.198909518240905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002136934,0.0001146633,0.0001286013,0.0000562284,0.0001164741,0.0001720373,0.0005430832,0.00005907207,0.0000158828],"category_scores_gemma":[0.00000880095,0.00008042152,0.00008962597,0.0002680583,0.00002162423,0.0001596642,0.00007521312,0.00003399512,0.0001350225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002592336,"about_ca_system_score_gemma":0.00003649231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002766101,"about_ca_topic_score_gemma":0.00007693118,"domain_scores_codex":[0.9989825,0.00002717418,0.000185023,0.0003199684,0.0001519452,0.0003333294],"domain_scores_gemma":[0.9993928,0.00003748732,0.00006470866,0.0003856736,0.00006234147,0.00005700184],"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.000001490721,0.00004599604,0.0009263616,0.00001857258,0.000007864615,0.000004761207,0.00005752247,0.00006718087,0.0007118791,0.9313473,0.02630832,0.0405028],"study_design_scores_gemma":[0.0007208657,0.0002433207,0.001909702,0.000001679773,0.00001218524,0.00004385391,0.0000345903,0.04541308,0.00634712,0.1560354,0.7886762,0.0005620344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00118429,0.0003370105,0.9703476,0.0004188026,0.0006474156,0.000239444,2.709975e-7,0.0003079944,0.02651721],"genre_scores_gemma":[0.9283208,0.000002941235,0.05510279,0.0003448197,0.0004911094,0.0000504071,0.000005696409,0.0000099788,0.01567152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9271364,"threshold_uncertainty_score":0.3279494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1521580745","doi":"10.1007/3-540-45937-5_10","title":"Decompiling Java Bytecode: Problems, Traps and Pitfalls","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Java bytecode; Computer science; Programming language; Bytecode; Java; Java Modeling Language; Java annotation; Compiler; Generics in Java; Real time Java","retraction":null,"screen_n_in":null,"score":{"opus":0.02550891549221492,"gpt":0.2370420212621076,"spread":0.2115331057698927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001066788,0.0006356661,0.0006813221,0.0006732107,0.0003600513,0.001076682,0.002768197,0.0004157252,0.00002618514],"category_scores_gemma":[0.00005014368,0.0005476014,0.000130344,0.0005064241,0.0006668959,0.0006228157,0.00112214,0.0008101854,0.00007728981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001692907,"about_ca_system_score_gemma":0.0002100857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004870393,"about_ca_topic_score_gemma":0.0001117492,"domain_scores_codex":[0.9956397,0.00004740427,0.0006667363,0.001879644,0.0008971689,0.000869394],"domain_scores_gemma":[0.9976031,0.000317047,0.0003493267,0.001271844,0.0001908822,0.0002678558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001683196,0.0000398871,0.0002030601,0.0001288738,0.00001838087,0.0001016553,0.001376907,0.002366589,0.0000505137,0.1151601,0.00005419746,0.8804982],"study_design_scores_gemma":[0.0006235209,0.0004594598,0.0001775593,0.0002672427,0.00001860774,0.0004823842,4.087046e-7,0.4632001,0.0003442286,0.4860244,0.04674755,0.001654529],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00004384969,0.002865283,0.9857026,0.0003503776,0.001716962,0.0005905587,0.000001398589,0.0002771737,0.00845181],"genre_scores_gemma":[0.68568,0.0005550017,0.3083861,0.001473124,0.001152942,0.00003359792,0.000006786401,0.00009618104,0.002616348],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8788437,"threshold_uncertainty_score":0.9999603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156881251","doi":"10.1145/1449764.1449792","title":"Typestate-like analysis of multiple interacting objects","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":80,"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; Static analysis; Heap (data structure); Semantics (computer science); Programming language; Theoretical computer science; Abstract interpretation; Set (abstract data type); Program analysis; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03247545696163772,"gpt":0.2591580250819836,"spread":0.2266825681203459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001511219,0.00007315329,0.0001986772,0.0001945269,0.00006518888,0.00002862814,0.0003485894,0.00003000295,0.00003073423],"category_scores_gemma":[0.00006306732,0.00005588586,0.0001130385,0.0009258097,0.00002538627,0.0002121287,0.000108812,0.00005261429,0.00004862504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001425207,"about_ca_system_score_gemma":0.00002843278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007555995,"about_ca_topic_score_gemma":0.0002548758,"domain_scores_codex":[0.9992267,0.00003890724,0.0002088765,0.0002077546,0.0001599695,0.000157828],"domain_scores_gemma":[0.9992656,0.0001450218,0.0001136081,0.0003417574,0.00008635865,0.00004772588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003342727,0.0007093193,0.7384542,0.0001015655,0.002915499,0.000299119,0.04081307,0.003565036,0.006011643,0.1380548,0.003598068,0.06544431],"study_design_scores_gemma":[0.001300813,0.000453743,0.09413678,0.00001165568,0.0003556297,0.0001285,0.001595866,0.8480277,0.02520821,0.00142889,0.02634188,0.001010307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.130561,0.00007175573,0.8396469,0.00003069315,0.0005657217,0.0001072895,3.44839e-7,0.000195234,0.02882114],"genre_scores_gemma":[0.9913247,0.000004496892,0.007260822,0.00005013675,0.00001727904,0.000002977666,0.000002430451,0.000003212735,0.001333989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8607637,"threshold_uncertainty_score":0.2278959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123691799","doi":"10.1145/2629609","title":"Foundations of Typestate-Oriented Programming","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Desarrollo Científico y Tecnológico; Computing Research Association; National Science Foundation","keywords":"Computer science; Programming language; Modular design; Object (grammar); Class (philosophy); State (computer science); Object-oriented programming; Type safety; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01979513296798275,"gpt":0.2803165803818746,"spread":0.2605214474138918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726963,0.0002166513,0.0003294018,0.0001981554,0.0002968634,0.0003076692,0.0005114001,0.000113459,0.000005163422],"category_scores_gemma":[0.00008318336,0.0001787211,0.0001089695,0.0005103781,0.0001007649,0.0002759596,0.00002475727,0.0001737335,0.00001836457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000278922,"about_ca_system_score_gemma":0.00003340123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000622039,"about_ca_topic_score_gemma":0.00007074884,"domain_scores_codex":[0.9982131,0.0001680997,0.0004541888,0.0004470929,0.0003300049,0.0003875569],"domain_scores_gemma":[0.9984293,0.0002130546,0.00021238,0.0008473937,0.0001557244,0.0001421714],"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.000008168536,0.0001902888,0.0004853354,0.0002174001,0.00007564962,0.000006020538,0.001951076,0.0001149607,0.0001261022,0.1362906,0.00001469215,0.8605196],"study_design_scores_gemma":[0.003799421,0.004275454,0.001479519,0.0003492172,0.0002946673,0.0005069131,0.0124675,0.03630583,0.002373626,0.005204507,0.9308062,0.002137192],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005346737,0.0004827202,0.9915884,0.0001522992,0.000647174,0.0006293738,0.000002198983,0.0003740065,0.0007770665],"genre_scores_gemma":[0.9744326,0.00002085159,0.02461024,0.00002274461,0.0000695748,0.0001599696,0.0000095375,0.00002023488,0.0006542323],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9690859,"threshold_uncertainty_score":0.7288035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147137665","doi":"10.1145/1389449.1389469","title":"Programming with proofs and explicit contexts","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematical proof; Computer science; Programming language; Functional programming; Semantics (computer science); Decidability; Data type; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02401452591102263,"gpt":0.2298431368797395,"spread":0.2058286109687169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001171694,0.0001079627,0.000130691,0.00003860503,0.0001604111,0.0001188179,0.0002480968,0.00003593459,0.000004381664],"category_scores_gemma":[0.000007451614,0.00006790848,0.00001899145,0.0001743665,0.0000587714,0.0003032041,0.00008973644,0.00005999919,0.00002733484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009186348,"about_ca_system_score_gemma":0.0000348622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008640148,"about_ca_topic_score_gemma":0.000046255,"domain_scores_codex":[0.999138,0.00002188237,0.0001179124,0.0002992075,0.000175818,0.0002471897],"domain_scores_gemma":[0.9995037,0.00002216611,0.00004722901,0.0002728927,0.00005706438,0.000096905],"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.000007520827,0.0000874961,0.02934579,0.00003105028,0.00002462906,0.0001401275,0.002890401,8.634551e-7,0.00006061098,0.6970183,0.0004669358,0.2699263],"study_design_scores_gemma":[0.006752652,0.005300119,0.04782832,0.00005667954,0.00003879106,0.007935284,0.001076311,0.008857885,0.00925693,0.02328016,0.8866844,0.002932452],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03257021,0.0004717411,0.948284,0.0002886144,0.0001167222,0.0005991907,5.593173e-8,0.0005396639,0.01712977],"genre_scores_gemma":[0.9737831,0.000006465069,0.02362177,0.0001140977,0.00004215654,0.00005255328,4.063027e-7,0.000006218742,0.002373233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9412129,"threshold_uncertainty_score":0.2769227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1588366745","doi":"10.1023/a:1026517200045","title":"Structured Theory Development for a Mechanized Logic","year":2001,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Structuring; Correctness; Computer science; Automated theorem proving; Programming language; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0195830759042623,"gpt":0.2671854592857371,"spread":0.2476023833814747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447883,0.0001413903,0.0002932565,0.0001612857,0.0001780757,0.0001858515,0.0006037076,0.00009328993,0.00001269186],"category_scores_gemma":[0.0002554424,0.00009680832,0.0001193489,0.0002880258,0.00001527989,0.0002926234,0.00006883773,0.0001348385,0.000007345603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008664657,"about_ca_system_score_gemma":0.0002015253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002087621,"about_ca_topic_score_gemma":0.000001849729,"domain_scores_codex":[0.9986356,0.0001130864,0.0004920924,0.0001628455,0.0002929291,0.0003034202],"domain_scores_gemma":[0.9986849,0.000130977,0.0005903967,0.0001781285,0.0003027152,0.0001128868],"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.0001908433,0.0001283002,0.0004375148,0.0000666554,0.000403753,0.0003842185,0.004678899,0.0004246415,0.006131251,0.8341465,0.001362763,0.1516447],"study_design_scores_gemma":[0.01084206,0.001960779,0.00623663,0.0004014347,0.0001873274,0.01349856,0.001511205,0.3019331,0.03345468,0.5106934,0.1176095,0.001671344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01872878,0.0005175932,0.9785566,0.0001236543,0.0009575631,0.0001869674,1.320665e-7,0.000352766,0.0005759505],"genre_scores_gemma":[0.8243628,0.00001055188,0.1752508,0.00008592296,0.0001225301,0.000005366919,8.180953e-7,0.00001029642,0.0001508855],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.805634,"threshold_uncertainty_score":0.3947729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085552917","doi":"10.1145/2500365.2500591","title":"Wellfounded recursion with copatterns","year":2013,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Normalization (sociology); Computer science; Rewriting; Recursion (computer science); Theoretical computer science; Programming language; Pattern matching; Data type; Functional programming; Algorithm; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01757718411116714,"gpt":0.2234025139826172,"spread":0.2058253298714501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008794309,0.00007891221,0.00008300721,0.00003123008,0.00006246314,0.0002382201,0.0003975565,0.0000317893,0.0002320659],"category_scores_gemma":[0.00000315875,0.00004684813,0.00002058883,0.0001362792,0.00002103911,0.0003654272,0.0000765716,0.00005043,0.001858457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000158786,"about_ca_system_score_gemma":0.00001838298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006658666,"about_ca_topic_score_gemma":0.00005202358,"domain_scores_codex":[0.999303,0.00002655926,0.00009354388,0.0002181586,0.0001657055,0.0001930368],"domain_scores_gemma":[0.9994455,0.00001783224,0.00003962779,0.0003621357,0.00006325009,0.00007168278],"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.000003260594,0.0001032192,0.01614953,0.0000270024,0.00002025496,0.00001922325,0.0007897968,0.000004581911,0.0003048329,0.8543152,0.02230403,0.1059591],"study_design_scores_gemma":[0.003227585,0.002766108,0.04891322,0.00003686416,0.0000195173,0.0004237315,0.0007158194,0.03231402,0.01183871,0.2034472,0.6943053,0.001991919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008864855,0.00002424983,0.9085933,0.0008720848,0.000295983,0.0002477163,3.114794e-8,0.0002776421,0.08082411],"genre_scores_gemma":[0.9825494,0.000001776437,0.008059272,0.0003593728,0.00004870638,0.00002320265,7.275409e-7,0.000004522059,0.00895304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9736845,"threshold_uncertainty_score":0.9989187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970954854","doi":"10.1016/s0168-0072(00)00006-3","title":"Higher type recursion, ramification and polynomial time","year":2000,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Mathematics; Type (biology); Polynomial; Ramification; Notation; Algebra over a field; Discrete mathematics; Pure mathematics; Arithmetic; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03763477329273652,"gpt":0.2673608311565192,"spread":0.2297260578637827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001894999,0.0000866488,0.0001426655,0.00003114134,0.00006486274,0.0000538207,0.0001637954,0.00007932853,0.00009491134],"category_scores_gemma":[0.000003200863,0.00006586387,0.00001922247,0.0001410233,0.00005311792,0.00009800569,0.00003645863,0.00005144517,0.0001014516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001646649,"about_ca_system_score_gemma":0.00001027445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008884436,"about_ca_topic_score_gemma":5.825175e-7,"domain_scores_codex":[0.9993677,0.0000220045,0.0001419411,0.0002297488,0.00009335573,0.0001452633],"domain_scores_gemma":[0.9996374,0.00002131634,0.0000623874,0.0001914744,0.00003769584,0.00004975014],"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.0000553606,0.00009698061,0.0001563926,0.00003809313,0.00002644555,0.000002924568,0.0004949687,0.00000584818,0.00408795,0.5722576,0.02692079,0.3958566],"study_design_scores_gemma":[0.0007819408,0.0006565843,0.01112023,0.00001011104,0.00001970204,0.00002430752,0.00004163729,0.0004422331,0.006685629,0.1795821,0.8000988,0.0005367424],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5594219,0.01230953,0.008980909,0.01538704,0.0008193484,0.001676973,0.000006735272,0.0006587873,0.4007388],"genre_scores_gemma":[0.9960889,0.0002562891,0.000508955,0.0005994037,0.00009078009,0.000005200286,0.000004376504,0.000003878112,0.002442272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.773178,"threshold_uncertainty_score":0.2685851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140849218","doi":"10.1007/s10817-010-9194-x","title":"Hybrid","year":2010,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Soundness; HOL; Syntax; Type theory; Abstract syntax; Object (grammar); Semantics (computer science); Theoretical computer science; Type (biology); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01017665470751357,"gpt":0.2508258454006908,"spread":0.2406491906931772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008094282,0.00009404924,0.000191736,0.0001272627,0.00009872808,0.000243147,0.0006811859,0.00005472636,0.00001514445],"category_scores_gemma":[0.0002022597,0.00006762028,0.0001044365,0.0001709531,0.00002683836,0.0004783416,0.0000739305,0.0003749864,0.00004237694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001796239,"about_ca_system_score_gemma":0.0001125551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001291206,"about_ca_topic_score_gemma":0.000001884568,"domain_scores_codex":[0.9989735,0.00004675058,0.000346577,0.0001142732,0.0003001673,0.0002186597],"domain_scores_gemma":[0.9989052,0.00005614695,0.0004484772,0.0002447098,0.0002138445,0.0001316205],"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.00002928779,0.0003668357,0.01005331,0.00007626668,0.0003324514,0.002738287,0.003013979,0.000333335,0.07419311,0.6809053,0.0306152,0.1973426],"study_design_scores_gemma":[0.003199992,0.001170461,0.02510896,0.0001591267,0.00008980238,0.03628697,0.0001988479,0.6300623,0.05874922,0.0316909,0.2121223,0.001161129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.575277,0.0005126318,0.401433,0.000743735,0.008619469,0.0001439635,2.991836e-7,0.001251674,0.01201824],"genre_scores_gemma":[0.9723277,0.000005413489,0.02720773,0.00005088173,0.0002944967,6.105858e-7,2.140813e-7,0.00000745014,0.000105465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6492144,"threshold_uncertainty_score":0.2757475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974070050","doi":"10.1002/rsa.10089","title":"Space complexity of random formulae in resolution","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Space (punctuation); Resolution (logic); Computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02431304330521862,"gpt":0.253169672390741,"spread":0.2288566290855223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688687,0.0001435123,0.0003793216,0.00009454446,0.00009486647,0.00007036061,0.0002174979,0.00007968163,0.000009371296],"category_scores_gemma":[0.00007816661,0.0001056632,0.00007492869,0.0002374924,0.0001257897,0.0001689945,0.00005582683,0.0001124863,0.000001071237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002280745,"about_ca_system_score_gemma":0.00003671121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003477585,"about_ca_topic_score_gemma":0.00006816649,"domain_scores_codex":[0.9987717,0.00017735,0.0002997747,0.0002822114,0.0002069252,0.0002620447],"domain_scores_gemma":[0.9993873,0.0001011038,0.000131475,0.0002619962,0.00004826672,0.00006988883],"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.0001194738,0.00002360466,0.0008403948,0.00005632246,0.00002147752,0.00001062695,0.0008519655,0.0001514774,0.0002685199,0.9807488,0.00007693622,0.01683041],"study_design_scores_gemma":[0.03293864,0.0002427984,0.009065062,0.00002046577,0.0000199934,0.0001500837,0.0001963774,0.06125256,0.005186896,0.8772364,0.01318894,0.0005017882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03158595,0.002608032,0.9611246,0.000126028,0.0006250446,0.0006115818,0.000002946275,0.00006772571,0.003248085],"genre_scores_gemma":[0.9796321,0.00006440518,0.0201563,0.00002387627,0.00004487883,0.000008626453,0.000002409579,0.000005418491,0.00006201983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9480461,"threshold_uncertainty_score":0.4308819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097181978","doi":"10.1016/j.jal.2007.11.001","title":"The seven virtues of simple type theory","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Simple (philosophy); Type theory; Type (biology); Computer science; Order (exchange); Calculus (dental); Extension (predicate logic); Programming language; Mathematics; Mathematics education; Theoretical computer science; Epistemology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01942985512094914,"gpt":0.2610006510376462,"spread":0.2415707959166971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002930477,0.00008195407,0.0001845527,0.00006071509,0.0001013294,0.00005848079,0.0008028112,0.00005602885,0.0000074292],"category_scores_gemma":[0.00005349677,0.00004331193,0.0000824212,0.0002457303,0.00007381653,0.00008148356,0.0000938891,0.000159694,0.00001939378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002246823,"about_ca_system_score_gemma":0.00005689076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002618819,"about_ca_topic_score_gemma":0.00000455653,"domain_scores_codex":[0.9989462,0.00004338873,0.0004253453,0.00009086814,0.0002916274,0.0002025579],"domain_scores_gemma":[0.9986801,0.000342092,0.0005015389,0.0002544193,0.0001590545,0.00006279223],"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.00006690594,0.00003439206,0.00009680988,0.000006321072,0.00003130472,0.00001448584,0.000437592,0.00003176619,0.001251157,0.9230106,0.0004187822,0.07459989],"study_design_scores_gemma":[0.0002672021,0.0003427469,0.001082687,0.000002360844,0.00001184857,0.00007030777,0.0005592222,0.00005474213,0.004185875,0.9398484,0.05348442,0.00009019973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02456156,0.001437915,0.9115471,0.0001882229,0.001134772,0.0002115184,1.866795e-7,0.00004464882,0.06087402],"genre_scores_gemma":[0.9964467,0.00003551258,0.003057412,0.0001351926,0.0001974009,5.530092e-7,1.359771e-7,0.00000449458,0.0001226287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9718851,"threshold_uncertainty_score":0.1766209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3005412289","doi":"10.1145/354222.353189","title":"Practical virtual method call resolution for Java","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bytecode; Call graph; Java; Program analysis; Static analysis; Variable (mathematics); Benchmark (surveying); Class hierarchy; Call stack; Theoretical computer science; Hierarchy; Dependence analysis; Class (philosophy); Programming language; Algorithm; Computer engineering; Object-oriented programming; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06052537541571937,"gpt":0.3429938513744404,"spread":0.282468475958721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008015313,0.0001348445,0.0001800895,0.00004819782,0.0001713299,0.0002296949,0.0007918599,0.0001150711,0.00005722971],"category_scores_gemma":[0.0004859537,0.0001093806,0.00007177574,0.0001577299,0.0000359789,0.0005240059,0.0001100895,0.0001197969,0.0003111536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002675839,"about_ca_system_score_gemma":0.00006385519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001763181,"about_ca_topic_score_gemma":0.00006409672,"domain_scores_codex":[0.9985633,0.0001707522,0.0002386993,0.0004129527,0.0002533374,0.0003609261],"domain_scores_gemma":[0.9980795,0.001000944,0.0001003076,0.0006451492,0.00006444343,0.0001095885],"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.000103511,0.0001979442,0.0003083603,0.00005305128,0.00006771935,0.00004835775,0.001901868,0.000349454,0.0002474353,0.6199812,0.02887674,0.3478643],"study_design_scores_gemma":[0.0009684415,0.001029396,0.0008132626,0.000009129275,0.00005513541,0.0001034174,0.0001296069,0.1076601,0.001064595,0.02154554,0.866105,0.0005164822],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001555145,0.00009994361,0.9877062,0.002339825,0.0005594414,0.0003591681,0.000002848976,0.0002459721,0.007131476],"genre_scores_gemma":[0.641682,0.000007622456,0.3546941,0.000429071,0.0003957677,0.00004325415,0.0000120451,0.00001167653,0.002724496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8372282,"threshold_uncertainty_score":0.446041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1489240819","doi":"10.1007/bfb0012855","title":"Canonical conditional rewrite systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Decidability; Confluence; Rewriting; Expressive power; Lemma (botany); Computer science; Programming language; Function (biology); Property (philosophy); Theoretical computer science; Mathematics; Algebra over a field; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02198280417510451,"gpt":0.2505037992026657,"spread":0.2285209950275612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001120933,0.000557983,0.0006568743,0.0006118007,0.0003089568,0.00103997,0.003440958,0.0004836162,0.00003500998],"category_scores_gemma":[0.00006142614,0.0004823586,0.0001783433,0.0004569256,0.0007521436,0.0006037184,0.0009837183,0.0008803338,0.0002716033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004952516,"about_ca_system_score_gemma":0.0009701016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000931641,"about_ca_topic_score_gemma":0.0001281273,"domain_scores_codex":[0.9953074,0.00005977439,0.0007195715,0.001666053,0.001415289,0.0008318839],"domain_scores_gemma":[0.9972262,0.0003780298,0.0003698263,0.001422348,0.0003222646,0.0002813665],"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.000002842832,0.00003209206,0.0000555896,0.00005315942,0.00001797169,0.0001764437,0.0002556185,0.01071344,0.00001873133,0.8234208,0.000182752,0.1650705],"study_design_scores_gemma":[0.0006210501,0.0003475858,0.0001688765,0.0002034277,0.00001698739,0.0008873423,3.28386e-7,0.4123867,0.0001352119,0.4186195,0.1650356,0.001577365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000008509952,0.001558921,0.9766941,0.0005259784,0.003904389,0.0004871897,0.000005408553,0.0002652349,0.01655027],"genre_scores_gemma":[0.901188,0.00006674063,0.0877908,0.001508411,0.003974117,0.0000439922,0.00003529076,0.00006484686,0.005327816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9011795,"threshold_uncertainty_score":0.999997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1846157972","doi":"10.1007/978-3-642-11970-5_8","title":"Practical Extensions to the IFDS Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Dataflow; Computer science; Extension (predicate logic); Algorithm; Subroutine; Context (archaeology); Data-flow analysis; Distributive property; Class (philosophy); Epigraph; Theoretical computer science; Programming language; Data flow diagram; Mathematics; Mathematical optimization; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03097390232568992,"gpt":0.2869987577958471,"spread":0.2560248554701572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001604963,0.0004717005,0.000445102,0.0004218799,0.0005743948,0.001022732,0.003837743,0.0004217945,0.00002520606],"category_scores_gemma":[0.000292722,0.000304025,0.0001517993,0.0006827436,0.0006346008,0.000407603,0.002073249,0.001581614,0.0004112671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001216549,"about_ca_system_score_gemma":0.0006718153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005496742,"about_ca_topic_score_gemma":0.0002068585,"domain_scores_codex":[0.9959916,0.00005825598,0.0004583699,0.001504623,0.001200154,0.000786928],"domain_scores_gemma":[0.9962038,0.0006670316,0.0002238141,0.002224146,0.0003643009,0.0003169477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000134193,0.00002697875,0.000005348928,0.000007043163,0.000008063387,0.0001429099,0.0006827996,0.0004002744,0.00005678146,0.1689299,0.00025038,0.8294881],"study_design_scores_gemma":[0.0002386173,0.000429331,0.00009788527,0.00007109624,0.00001924524,0.0009526685,6.852462e-7,0.2605851,0.0008751789,0.3909798,0.3445965,0.001153784],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002245161,0.0001442375,0.9813488,0.008021199,0.005845551,0.0006291712,0.000001579729,0.0001899514,0.003817334],"genre_scores_gemma":[0.03579746,0.00001531448,0.9558271,0.005140425,0.00177971,0.0000295763,0.000002617933,0.00003700429,0.001370821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8283343,"threshold_uncertainty_score":0.9999412,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1933312167","doi":"10.1007/978-3-662-43948-7_27","title":"Characterization of Binary Constraint System Games","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Characterization (materials science); Simple (philosophy); Bounding overwatch; Class (philosophy); Constraint (computer-aided design); Binary number; Theoretical computer science; Decidability; Quantum entanglement; Algorithm; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01544711899045415,"gpt":0.2213026326919532,"spread":0.2058555137014991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001015652,0.000408062,0.0006579946,0.0006157185,0.0001322555,0.0002910097,0.002258462,0.0003136233,0.000007435067],"category_scores_gemma":[0.00003633715,0.0003438668,0.000137084,0.0004082856,0.0007037196,0.0002756049,0.0006806236,0.0003595156,0.00003927494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001807169,"about_ca_system_score_gemma":0.0003561154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002224609,"about_ca_topic_score_gemma":0.000008932735,"domain_scores_codex":[0.9969637,0.00006064915,0.0006693787,0.001066071,0.0007815352,0.0004586494],"domain_scores_gemma":[0.9975796,0.0001853888,0.0006346356,0.00117338,0.0003002018,0.0001268412],"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.000003007536,0.00001757935,0.00007041957,0.0002967893,0.0000136362,0.0000456128,0.0006020166,0.0007006031,0.004278726,0.6145892,0.000003412674,0.379379],"study_design_scores_gemma":[0.001010752,0.001261832,0.001057361,0.0014993,0.0000451049,0.0006606017,0.000002165426,0.872855,0.0182082,0.08491782,0.01595918,0.002522656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002879256,0.0001296266,0.9918724,0.0001030429,0.002490611,0.0004374236,0.000002817285,0.0002020214,0.004474163],"genre_scores_gemma":[0.9708829,0.00001074685,0.02822967,0.0001749643,0.0003878706,0.000008803756,0.00001028454,0.00002183757,0.0002729329],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9705949,"threshold_uncertainty_score":0.9999014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998844879","doi":"10.1016/s0167-6423(99)00029-5","title":"A calculus of functional BSP programs","year":2000,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Research Canada; Ericsson (Canada)","funders":"","keywords":"Computer science; Confluence; Mathematical proof; Extension (predicate logic); Process calculus; Calculus (dental); Reduction (mathematics); Functional programming; Programming language; Pi calculus; Process (computing); Theoretical computer science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02356556207407858,"gpt":0.2448996145174379,"spread":0.2213340524433593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321518,0.0002097368,0.0003521039,0.0002609736,0.000233496,0.000288485,0.001789923,0.00007178738,0.00003301333],"category_scores_gemma":[0.00001803749,0.0001746484,0.0001714571,0.002164132,0.0009508932,0.000917448,0.0003182784,0.0001368344,0.00003797246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000045537,"about_ca_system_score_gemma":0.0003195863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001050246,"about_ca_topic_score_gemma":0.000005768518,"domain_scores_codex":[0.9968781,0.00006122265,0.0005931105,0.000671943,0.001120375,0.0006752077],"domain_scores_gemma":[0.9983214,0.00004290776,0.0002696112,0.0007483015,0.0004140607,0.000203682],"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.000006117092,0.000221613,0.000690701,0.0000456314,0.00001276815,0.000004659652,0.0006935864,0.0002043959,0.0004062908,0.1241865,0.00003303281,0.8734947],"study_design_scores_gemma":[0.004768399,0.007487235,0.02122036,0.0003259885,0.00009370104,0.00076744,0.0004555147,0.7162758,0.02829306,0.04149063,0.1757622,0.003059761],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04569106,0.0001744178,0.949744,0.0001129485,0.0008598165,0.0005747956,3.062426e-7,0.0002688955,0.002573799],"genre_scores_gemma":[0.9027585,0.00000331954,0.09686108,0.00002736768,0.0001352046,0.00002999939,0.000002015827,0.000008364036,0.0001741287],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8704349,"threshold_uncertainty_score":0.7121955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970075481","doi":"10.1145/2676726.2676992","title":"Principal Type Schemes for Gradual Programs","year":2014,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Type inference; Computer science; Programming language; Correctness; Inference; Type (biology); Type theory; Principal (computer security); Static analysis; Theoretical computer science; Dependent type; Artificial intelligence; Lambda calculus","retraction":null,"screen_n_in":null,"score":{"opus":0.04622135198826501,"gpt":0.2769784815488602,"spread":0.2307571295605952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359994,0.00009802663,0.0001218599,0.00003052287,0.00008819563,0.0001900976,0.0005105392,0.00005281966,0.000005329118],"category_scores_gemma":[0.00005455826,0.00006992273,0.00005848594,0.0001692016,0.0000289016,0.000159328,0.0001136109,0.00004504934,0.0001205357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001051851,"about_ca_system_score_gemma":0.00003061649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002417415,"about_ca_topic_score_gemma":0.00002039999,"domain_scores_codex":[0.9991072,0.00002659577,0.0001440445,0.0002801288,0.0001543333,0.0002876318],"domain_scores_gemma":[0.9993586,0.00003801418,0.00004901602,0.0003616323,0.0001111487,0.0000815793],"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.000002104255,0.00003671482,0.0009779671,0.00001619016,0.000007453661,3.668268e-7,0.0001137993,3.564735e-7,0.00003094461,0.8259681,0.0004502683,0.1723957],"study_design_scores_gemma":[0.0003197957,0.0004655511,0.0001950056,0.000001579165,0.000003678761,0.000007823346,0.00001290217,0.01317346,0.000744597,0.02984712,0.9550602,0.0001682791],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002696973,0.00004073169,0.9788334,0.0002416885,0.0007281268,0.0003882239,4.831809e-8,0.0004156567,0.01665519],"genre_scores_gemma":[0.9438801,8.014554e-7,0.05204541,0.0001325083,0.000209229,0.00005311637,0.00000382259,0.000007289148,0.003667764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9546099,"threshold_uncertainty_score":0.2851366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544301742","doi":"10.1007/3-540-46000-4_6","title":"Coordination through Channel Composition","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cable gland; Component (thermodynamics); Computer science; Channel (broadcasting); Composition (language); Set (abstract data type); Expressive power; Distributed computing; Theoretical computer science; Programming language; Computer network; Telecommunications; Linguistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0272970808947033,"gpt":0.2455487375322255,"spread":0.2182516566375222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005944202,0.0004818723,0.0004847377,0.0004755222,0.0003447711,0.0006921153,0.002358517,0.0003712211,0.00002350388],"category_scores_gemma":[0.00002597168,0.0004336295,0.0001403886,0.000586655,0.0004425549,0.0009435678,0.0007153808,0.0005775319,0.0001872401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003218442,"about_ca_system_score_gemma":0.0001342317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005089405,"about_ca_topic_score_gemma":0.00002356488,"domain_scores_codex":[0.996512,0.00004498519,0.0004927883,0.001362736,0.0009686316,0.0006188559],"domain_scores_gemma":[0.9979713,0.0001842359,0.0003531936,0.001085162,0.0002885013,0.0001176012],"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.000003290843,0.00007494943,0.00002438517,0.00007627167,0.0000182272,0.0001181569,0.002140872,0.006687024,0.00009228016,0.6092873,0.0001985664,0.3812786],"study_design_scores_gemma":[0.0003069121,0.000229088,0.00002901353,0.00009041795,0.000008166333,0.0001389492,1.732191e-7,0.4312156,0.0007356936,0.5593763,0.007176098,0.0006935836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000008324743,0.0005681976,0.9764997,0.0008630385,0.002896851,0.0004824414,0.000001308875,0.0002855092,0.01839464],"genre_scores_gemma":[0.9022072,0.00005945205,0.09373523,0.001313156,0.001010786,0.00002167968,0.00001602599,0.00004199733,0.001594476],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9021989,"threshold_uncertainty_score":0.9998115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996612506","doi":"10.1016/s0304-3975(03)00315-3","title":"The regular-language semantics of second-order idealized ALGOL","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Decidability; Equivalence (formal languages); Computer science; Programming language; Fragment (logic); Operational semantics; Semantics (computer science); Game semantics; Formal semantics (linguistics); Denotational semantics; Mathematics; Theoretical computer science; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.009277252131278366,"gpt":0.2498936245028883,"spread":0.2406163723716099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002986947,0.000176837,0.0002431723,0.00007411279,0.0004899392,0.0004070367,0.002489937,0.00005971525,0.00006811379],"category_scores_gemma":[0.0002538492,0.0001090309,0.00008516919,0.001285495,0.002782224,0.0002730792,0.0006190676,0.0001618131,0.00006333001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002903087,"about_ca_system_score_gemma":0.0001488318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006087796,"about_ca_topic_score_gemma":0.000004096858,"domain_scores_codex":[0.9974509,0.0002840621,0.0003854247,0.0005274219,0.0007416453,0.0006105538],"domain_scores_gemma":[0.9978144,0.0003594417,0.000148761,0.001249547,0.000242653,0.0001852235],"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.000002585511,0.00002923245,0.0000373537,0.000009124446,0.000005927756,0.00001089468,0.000681928,0.00001405489,0.0006228306,0.9835945,0.00009406616,0.0148975],"study_design_scores_gemma":[0.0005855555,0.0003129081,0.000349689,0.00001065922,0.00001041239,0.00018178,0.00008120575,0.1141776,0.02387788,0.851027,0.008981725,0.0004035345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009011447,0.0001571722,0.9768234,0.0003412997,0.0008370046,0.0002351556,2.956512e-7,0.0001089007,0.0124853],"genre_scores_gemma":[0.9368171,0.000004599,0.06276628,0.0002118623,0.000048061,0.000006376893,2.094149e-7,0.000007504391,0.0001379893],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9278057,"threshold_uncertainty_score":0.9999316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156154755","doi":"10.1145/638750.638778","title":"A brief history of the object-oriented approach","year":2003,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Object-oriented programming; Software development; Software engineering; Object (grammar); Software; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01661775579820918,"gpt":0.1981522524547179,"spread":0.1815344966565087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0003096959,0.0001962045,0.0002361995,0.0000785051,0.00005301967,0.00002832144,0.001112348,0.00009901265,0.000007244984],"category_scores_gemma":[0.03082967,0.000148982,0.0001387476,0.0003932629,0.00005181912,0.0001719101,0.000235236,0.0001878204,0.00000880623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001677966,"about_ca_system_score_gemma":0.0001707836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007039775,"about_ca_topic_score_gemma":0.000001648022,"domain_scores_codex":[0.9987109,0.00005644352,0.0002617256,0.0003392099,0.0003075283,0.0003242425],"domain_scores_gemma":[0.9949784,0.003525138,0.0001196072,0.001210613,0.00009095467,0.00007525286],"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.000006547905,0.0003930694,0.3441625,0.0007095318,0.0001711641,0.00001799125,0.008986555,0.002639065,0.0029209,0.6245564,0.00432776,0.01110851],"study_design_scores_gemma":[0.002078212,0.0003635785,0.1021206,0.0001120617,0.00009452046,0.0002870308,0.0001082575,0.00415533,0.02016995,0.001816717,0.8665453,0.0021484],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009461394,0.002513774,0.9841964,0.00002922269,0.002498171,0.0003113117,0.000001123997,0.0006771743,0.0003114569],"genre_scores_gemma":[0.9445887,0.000003510645,0.05482313,0.00005494149,0.00004712339,0.00003054386,0.000001769495,0.00002153285,0.0004287912],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9351273,"threshold_uncertainty_score":0.9773341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163420823","doi":"10.1145/641888.641891","title":"PolyTOIL","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Williams College; National Science Foundation","keywords":"Computer science; Programming language; Type safety; Subtyping; Type theory; Type (biology); Operational semantics; Semantics (computer science); Model checking; Functional programming; Modular design; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02191948800640703,"gpt":0.2704776963579844,"spread":0.2485582083515773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005076121,0.0002078632,0.0002437958,0.0001319543,0.0003265328,0.0005386904,0.00046783,0.000116898,0.00000994263],"category_scores_gemma":[0.00004330955,0.0001659312,0.00009274626,0.0003387006,0.00005101473,0.0002383101,0.00001028857,0.0001811321,0.00004717202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002950974,"about_ca_system_score_gemma":0.00003301507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003399673,"about_ca_topic_score_gemma":0.00003138729,"domain_scores_codex":[0.9984201,0.00016308,0.0002826514,0.0004501705,0.0002702267,0.0004138214],"domain_scores_gemma":[0.9987562,0.0001111325,0.0000899357,0.0008280783,0.00005428443,0.0001603839],"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.000005251734,0.0002017464,0.0004514564,0.00013942,0.00009379955,0.00006800264,0.002072303,0.00006960734,0.0001652517,0.3379244,0.00007683888,0.6587319],"study_design_scores_gemma":[0.002685979,0.001655816,0.0004551756,0.0001115563,0.0001206946,0.001858776,0.01187157,0.003130181,0.003163708,0.007461654,0.9655063,0.001978541],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002732314,0.003354636,0.9882127,0.0001770101,0.0009952445,0.0004876071,0.000001389451,0.0005107995,0.003528276],"genre_scores_gemma":[0.9893525,0.00004294119,0.007855724,0.00006454923,0.00005187115,0.0001243519,0.00000154112,0.00001760415,0.002488957],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9866201,"threshold_uncertainty_score":0.6766477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1606540187","doi":"10.1007/978-3-540-71209-1_4","title":"A Reachability Predicate for Analyzing Low-Level Software","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Computer science; Programming language; Predicate abstraction; Pointer (user interface); Heap (data structure); Predicate (mathematical logic); Separation logic; Theoretical computer science; Artificial intelligence; Model checking","retraction":null,"screen_n_in":null,"score":{"opus":0.0468325491981635,"gpt":0.2779686562504431,"spread":0.2311361070522796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003002533,0.0005941057,0.0007095647,0.0007781678,0.0003826718,0.0005865082,0.003756263,0.0005108779,0.000008173357],"category_scores_gemma":[0.0003907502,0.0005107173,0.0002920984,0.0006614206,0.0007304579,0.0005096401,0.001141294,0.0007021198,0.00003043284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003935901,"about_ca_system_score_gemma":0.0006210366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006728877,"about_ca_topic_score_gemma":0.0001887741,"domain_scores_codex":[0.9950796,0.00003816958,0.0007769496,0.002076695,0.0009995766,0.001029058],"domain_scores_gemma":[0.996087,0.0008646512,0.0004611578,0.001835943,0.0004740687,0.0002771363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008582041,0.00004008265,0.0003152249,0.0001770268,0.00001892514,0.00003409658,0.0006212234,0.001175351,0.00001892467,0.0443039,0.00002673443,0.9532599],"study_design_scores_gemma":[0.0006784486,0.0005046309,0.0003931788,0.0002576385,0.00002728274,0.00009852753,3.146662e-7,0.1579003,0.0008321962,0.8250653,0.01277678,0.001465355],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000218891,0.0005274178,0.9944105,0.0002086368,0.002294201,0.001010714,0.000008751756,0.0003598046,0.001158067],"genre_scores_gemma":[0.1709997,0.0000186146,0.8259871,0.000824596,0.001157903,0.00004957809,0.00001874705,0.00005925509,0.0008844681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9517946,"threshold_uncertainty_score":0.9997345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1654262235","doi":"10.1007/3-540-45306-7_23","title":"A Framework for Optimizing Java Using Attributes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Java bytecode; Java annotation; Programming language; Compiler; Real time Java; strictfp; Generics in Java; Java concurrency; Java Modeling Language; Optimizing compiler; Operating system; Just-in-time compilation; Bytecode; Compiler correctness; Pointer (user interface); Class (philosophy); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05791996299029453,"gpt":0.2906001351846367,"spread":0.2326801721943421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001164316,0.0006136425,0.0007227328,0.0006518421,0.000492571,0.001100283,0.003402797,0.0005855698,0.00001281546],"category_scores_gemma":[0.0002153015,0.0005458184,0.0002565815,0.0007278882,0.0004683135,0.0005848018,0.001100521,0.00074027,0.00002416614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003727655,"about_ca_system_score_gemma":0.00050835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004075324,"about_ca_topic_score_gemma":0.00002209996,"domain_scores_codex":[0.995739,0.00003362154,0.0006253472,0.001727919,0.000817212,0.00105689],"domain_scores_gemma":[0.9967023,0.0008558895,0.0004464967,0.001420597,0.0003613379,0.0002134511],"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.000005978752,0.0000298771,0.00006751507,0.00008350288,0.0000235295,0.00008170219,0.0006988131,0.02927967,0.0000472309,0.6028411,0.00002291288,0.3668182],"study_design_scores_gemma":[0.0001808585,0.0001525723,0.000004465622,0.0001676166,0.00001122056,0.0001214818,2.879084e-7,0.3885913,0.0003130787,0.6023172,0.00753708,0.0006028616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00000906376,0.0011155,0.9923708,0.0003609345,0.003388444,0.0008024673,0.00000296527,0.0002577427,0.001692125],"genre_scores_gemma":[0.04997787,0.00003504761,0.9476092,0.0007520216,0.001291194,0.00002036122,0.000005165195,0.00004967163,0.0002594761],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3662153,"threshold_uncertainty_score":0.9999367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158912767","doi":"10.1016/s0022-0000(02)00020-x","title":"Monotone simulations of non-monotone proofs","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Pigeonhole principle; Monotone polygon; Mathematical proof; Mathematics; Sequent; Proof complexity; Combinatorics; Discrete mathematics; Bounded function; Matching (statistics); Polynomial; Strongly monotone; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0317102402430104,"gpt":0.2626914417893756,"spread":0.2309812015463653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009418376,0.0001144167,0.0003631665,0.0002479618,0.0001919599,0.0002488928,0.0007520826,0.00004586727,0.000003173979],"category_scores_gemma":[0.00001103739,0.00007604413,0.00009386098,0.000502993,0.0001437629,0.0007239769,0.0001145081,0.00008704679,0.00000495067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001976014,"about_ca_system_score_gemma":0.00004959424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000158218,"about_ca_topic_score_gemma":0.000001943295,"domain_scores_codex":[0.9983404,0.00009725376,0.0006577148,0.0001971777,0.0005087447,0.0001987503],"domain_scores_gemma":[0.9986988,0.0001288315,0.0006003052,0.0001936196,0.0002631909,0.000115276],"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.00002564192,0.0009653826,0.04388494,0.001073946,0.0003262715,0.0002323897,0.01947799,0.02752621,0.002392823,0.5840997,0.003337506,0.3166572],"study_design_scores_gemma":[0.0005725857,0.0009999617,0.003433632,0.00009508451,0.00001530658,0.0005873041,0.0001794187,0.9900887,0.000458032,0.001733903,0.0016555,0.0001805773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08515453,0.0009057524,0.9106991,0.0001872447,0.0009968738,0.0001796299,4.19594e-7,0.00002414894,0.001852249],"genre_scores_gemma":[0.9862736,0.00001348679,0.01338774,0.00002295442,0.0002336816,0.00000122299,5.083125e-8,0.000002834112,0.00006442911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9625625,"threshold_uncertainty_score":0.310099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W205991341","doi":"10.5555/1218615.1218619","title":"The development of CASC","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":53,"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":"Computer science; Competition (biology); Set (abstract data type); Operations research; Order (exchange); Event (particle physics); Management science; Risk analysis (engineering); Software engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.04157016436901032,"gpt":0.2364609753033954,"spread":0.194890810934385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001827381,0.00003316235,0.00004205817,0.00001055924,0.0001012619,0.00004436434,0.000377537,0.0000134092,0.00002252923],"category_scores_gemma":[0.000007705116,0.00001711295,0.0000167422,0.00008918178,0.00001641103,0.00004853783,0.00007537805,0.00001992276,0.0001633925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007341584,"about_ca_system_score_gemma":0.00001133709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001050973,"about_ca_topic_score_gemma":0.00004710385,"domain_scores_codex":[0.9995682,0.00001374365,0.0001229033,0.00007779379,0.0001147968,0.0001026104],"domain_scores_gemma":[0.9996799,0.00003066067,0.00003320555,0.0002077927,0.00002736726,0.00002109249],"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":[1.511295e-7,0.00001487442,0.0002753322,0.000003811309,0.000007827475,0.000001000215,0.002278142,7.404095e-7,0.00003715717,0.565035,0.002150338,0.4301956],"study_design_scores_gemma":[0.0001665818,0.00004445844,0.00111705,0.000001336084,0.000001294438,0.00001163,0.0001776502,0.00607194,0.006927362,0.009632161,0.9757114,0.0001371186],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001034929,0.0002731396,0.8518785,0.0002473759,0.0002925102,0.00007569697,9.72874e-9,0.00006662711,0.1461312],"genre_scores_gemma":[0.9752315,0.000003195935,0.01718711,0.00002551682,0.0000140258,0.000004519909,3.67897e-8,0.000001161126,0.007532981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9741965,"threshold_uncertainty_score":0.2100134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}