{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Ondřej Lhoták","is_ca":true},{"name":"Laurie Hendren","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141118,0.001892059,0.001910595,0.002962308,0.00124522,0.003252627,0.002951803,0.0008226176,0.01542665],"category_scores_gemma":[0.01230911,0.0009812337,0.001696259,0.003214629,0.0008570575,0.004810581,0.002727438,0.002375252,0.00575658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214726,"about_ca_system_score_gemma":0.002302851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006173604,"about_ca_topic_score_gemma":0.006644083,"domain_scores_codex":[0.9958816,0.0006257893,0.0002814892,0.0008117441,0.001955369,0.0004439894],"domain_scores_gemma":[0.9933738,0.001925233,0.0002337702,0.002586442,0.001608901,0.0002719543],"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.00211569,0.0007643109,0.009108497,0.0006489946,0.0004702538,0.0002013262,0.0005636364,0.06548176,0.03021498,0.06752646,0.1129278,0.7099763],"study_design_scores_gemma":[0.0004423661,0.0002153037,0.002931088,0.0001160866,0.0002771121,0.0002187183,0.0003028948,0.735132,0.04996506,0.1506273,0.05960372,0.000168257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06034152,0.001228378,0.7405823,0.0006907526,0.0009159716,0.0002242984,0.001768478,0.1627331,0.03151507],"genre_scores_gemma":[0.432338,0.000651228,0.5257217,0.0005708715,0.0003046344,0.00034753,0.005111984,0.02265956,0.01229443],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01542665,"threshold_uncertainty_score":0.05160731,"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)","authors":[{"name":"James R. Cordy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147277,0.001097073,0.0007642891,0.001493759,0.0007084939,0.003808749,0.002772877,0.001065467,0.04970329],"category_scores_gemma":[0.004678899,0.001059563,0.001305574,0.001544034,0.001089021,0.004742674,0.003616697,0.004146756,0.03745378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007887486,"about_ca_system_score_gemma":0.001803482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001215262,"about_ca_topic_score_gemma":0.001019984,"domain_scores_codex":[0.9985349,0.0002489678,0.0001757192,0.0002803234,0.0006144035,0.0001455998],"domain_scores_gemma":[0.9976927,0.0006471108,0.0001408423,0.0009425019,0.0004749758,0.0001018372],"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.0004503073,0.0002109159,0.001148795,0.001087961,0.00007345004,0.0005247373,0.0006761039,0.003980379,0.01559766,0.3091443,0.3232159,0.3438896],"study_design_scores_gemma":[0.0001992747,0.00007699242,0.0004427913,0.0003021758,0.00006853387,0.0007726067,0.0001640741,0.0289623,0.05182554,0.1704727,0.7466107,0.0001023236],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003414168,0.000267745,0.7756622,0.0008629785,0.0005130768,0.0001926395,0.01071446,0.1719097,0.03646311],"genre_scores_gemma":[0.134721,0.001892359,0.5589851,0.001928952,0.0007023168,0.001140808,0.06157727,0.1372267,0.1018255],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04970329,"threshold_uncertainty_score":0.1662741,"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","authors":[{"name":"John Aycock","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001517637,0.00069711,0.0009394237,0.003238345,0.001229305,0.003088407,0.001383796,0.001817575,0.01134951],"category_scores_gemma":[0.003643848,0.0007120771,0.0004966195,0.006744958,0.00245093,0.007837425,0.001425101,0.002909239,0.008500726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002277258,"about_ca_system_score_gemma":0.002365576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002459662,"about_ca_topic_score_gemma":0.002329761,"domain_scores_codex":[0.9988521,0.0002426556,0.0001107046,0.0002237827,0.0004667493,0.0001038915],"domain_scores_gemma":[0.9971464,0.001713435,0.0002370618,0.0002420484,0.0005468647,0.00011413],"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.00008301833,0.00008852076,0.0005991539,0.006313925,0.00003347108,0.0002138071,0.000665877,0.0008188586,0.00115225,0.2727381,0.1031912,0.6141018],"study_design_scores_gemma":[0.000003195402,0.00002623349,0.0003155227,0.0008339477,0.000008373442,0.0003658834,0.00007894351,0.0001216343,0.0002237348,0.02305795,0.9749527,0.00001188604],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0007584071,0.9501972,0.004332309,0.003727438,0.001169399,0.0000161593,0.00006503938,0.00007356684,0.03966048],"genre_scores_gemma":[0.01319999,0.960207,0.003944482,0.002862328,0.002935727,0.00005491156,0.0001425042,0.00007648853,0.01657648],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01134951,"threshold_uncertainty_score":0.03796798,"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","authors":[{"name":"Michael Sperber","is_ca":false},{"name":"R. Kent Dybvig","is_ca":false},{"name":"Matthew Flatt","is_ca":false},{"name":"ANTON VAN STRAATEN","is_ca":true},{"name":"Robby Findler","is_ca":false},{"name":"Jacob Matthews","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004771677,0.0007359627,0.0006055298,0.001557767,0.001759148,0.005707163,0.00143055,0.001759504,0.0660365],"category_scores_gemma":[0.01017496,0.0004734978,0.001150308,0.001702855,0.002592266,0.006211366,0.002177023,0.00453769,0.02450158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003917859,"about_ca_system_score_gemma":0.001559741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005519446,"about_ca_topic_score_gemma":0.003532833,"domain_scores_codex":[0.9974666,0.0008124598,0.0003403109,0.0003088732,0.0008476168,0.0002241726],"domain_scores_gemma":[0.9921718,0.003019377,0.0002686774,0.000848229,0.00342691,0.0002649482],"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.00005753529,0.00001728419,0.000153493,0.0001417449,0.00000884414,0.00007595035,0.0002648844,0.0006015559,0.0004065339,0.6289809,0.3409041,0.02838716],"study_design_scores_gemma":[0.000005323788,0.00001134989,0.0001673676,0.00005868828,0.000004764382,0.00005496549,0.00006309365,0.0002485548,0.0003613669,0.01730545,0.9817105,0.000008579472],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.007212076,0.01379291,0.05265686,0.0827425,0.06908129,0.000257807,0.003302426,0.001137852,0.7698162],"genre_scores_gemma":[0.08846552,0.01556552,0.0272289,0.007913391,0.02004448,0.0003775644,0.004084541,0.001319487,0.8350006],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.0660365,"threshold_uncertainty_score":0.2209141,"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","authors":[{"name":"Vijay Sundaresan","is_ca":true},{"name":"Laurie Hendren","is_ca":true},{"name":"Chrislain Razafimahefa","is_ca":true},{"name":"Raja Vallée-Rai","is_ca":true},{"name":"Patrick Lam","is_ca":true},{"name":"Étienne Gagnon","is_ca":true},{"name":"Charles Godin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001790621,0.000928257,0.0006636651,0.001500887,0.0009848938,0.001576668,0.002084684,0.001093197,0.002520111],"category_scores_gemma":[0.01326952,0.0007424236,0.0009988648,0.001397691,0.001514272,0.003229895,0.002105222,0.002143623,0.0006446394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001309728,"about_ca_system_score_gemma":0.002172561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005141413,"about_ca_topic_score_gemma":0.005846176,"domain_scores_codex":[0.9954745,0.0009287017,0.0001872991,0.000655301,0.002357621,0.0003965424],"domain_scores_gemma":[0.9906132,0.005286697,0.001080982,0.001968482,0.0009014797,0.0001490619],"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.0006815158,0.0002335982,0.01300306,0.0006178687,0.0001502568,0.0004202435,0.001609811,0.08754077,0.09991608,0.06456914,0.009807011,0.7214506],"study_design_scores_gemma":[0.00009883696,0.0002155003,0.006411966,0.0001356943,0.0001038301,0.000481649,0.0004694381,0.7495981,0.1182063,0.09599092,0.02813572,0.0001520768],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08833875,0.0004844718,0.888534,0.0003257821,0.0000766518,0.00007878853,0.000154049,0.01941008,0.00259749],"genre_scores_gemma":[0.4103234,0.0002319269,0.5822021,0.0002706421,0.0000502573,0.00008700568,0.0004168823,0.003991568,0.00242622],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005141413,"threshold_uncertainty_score":0.01022297,"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)","authors":[{"name":"Jacques Carette","is_ca":true},{"name":"Oleg Kiselyov","is_ca":false},{"name":"Chung-chieh Shan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001958902,0.0004080105,0.0004789928,0.0005551039,0.0005637479,0.002790968,0.001303465,0.0007674112,0.003112995],"category_scores_gemma":[0.004077211,0.0005899624,0.001198951,0.000388735,0.003674458,0.004060323,0.001943045,0.002135033,0.0008897921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00117193,"about_ca_system_score_gemma":0.001092685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007564548,"about_ca_topic_score_gemma":0.00108575,"domain_scores_codex":[0.9986583,0.000379454,0.0001383831,0.0001847482,0.0004589873,0.0001801984],"domain_scores_gemma":[0.9977109,0.0006670341,0.0001729017,0.0008366957,0.0004986404,0.0001138481],"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.0002496906,0.0000729987,0.001128318,0.0001888512,0.00003153183,0.0006818782,0.001810615,0.02786649,0.03020427,0.9028919,0.00173359,0.03313993],"study_design_scores_gemma":[0.0001040249,0.0001711139,0.0003721162,0.0001138953,0.0000929218,0.0004119035,0.0002326228,0.1876807,0.07074615,0.7054492,0.03452675,0.0000986521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04266232,0.0001005587,0.9481027,0.0001916756,0.000110455,0.00006302402,0.0001138314,0.003137474,0.005517945],"genre_scores_gemma":[0.5989597,0.0001724432,0.3861593,0.0003433561,0.00008335532,0.000113281,0.0002083451,0.001943452,0.0120169],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003112995,"threshold_uncertainty_score":0.010414,"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","authors":[{"name":"Aleksandar Nanevski","is_ca":false},{"name":"Frank Pfenning","is_ca":false},{"name":"Brigitte Pientka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931021,0.0006071358,0.0007586408,0.001642858,0.002025982,0.004097399,0.00163885,0.001576319,0.01103233],"category_scores_gemma":[0.002993899,0.0005210142,0.001121882,0.002035137,0.004784456,0.006691738,0.002725874,0.003379684,0.001318187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002275737,"about_ca_system_score_gemma":0.001179093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002477449,"about_ca_topic_score_gemma":0.001965712,"domain_scores_codex":[0.998271,0.0004460689,0.00009731633,0.0004394537,0.0005396434,0.0002064248],"domain_scores_gemma":[0.9987689,0.0004474041,0.0001069131,0.0003072947,0.0002716154,0.00009795647],"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.000003613073,0.000001945326,0.00003378445,0.00002256042,0.000002957421,0.00001223556,0.00004789852,0.0001849756,0.0001367284,0.9967063,0.0005071326,0.002339875],"study_design_scores_gemma":[0.000007366002,0.000007387205,0.00009922419,0.00003179873,0.00001306143,0.00007044945,0.00004547492,0.002497711,0.0003554932,0.9795259,0.01733596,0.00001018151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01361596,0.004495676,0.8169709,0.005194102,0.0006683318,0.0001037495,0.0009227247,0.001011113,0.1570175],"genre_scores_gemma":[0.713999,0.003914598,0.2573517,0.002690079,0.001571644,0.0002709498,0.0008507745,0.000267619,0.01908369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01103233,"threshold_uncertainty_score":0.03690684,"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","authors":[{"name":"Trieu H. Trinh","is_ca":false},{"name":"Yuhuai Wu","is_ca":false},{"name":"Quoc V. Le","is_ca":false},{"name":"He He","is_ca":false},{"name":"Thang Luong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001703415,0.001174545,0.0007049959,0.0006870319,0.0005954624,0.001429266,0.002130432,0.001351163,0.01133962],"category_scores_gemma":[0.01575596,0.0004894863,0.001024997,0.00046779,0.001890687,0.002444976,0.002962956,0.001650946,0.002020749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00131434,"about_ca_system_score_gemma":0.002258821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003277735,"about_ca_topic_score_gemma":0.005493274,"domain_scores_codex":[0.9980432,0.0006866442,0.0001233357,0.0004636244,0.0005585104,0.0001246957],"domain_scores_gemma":[0.9904531,0.00639834,0.0004206846,0.001685794,0.0007930337,0.0002489492],"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.0008626052,0.0004891934,0.009103036,0.002428961,0.0002554153,0.0009161046,0.000897873,0.3201382,0.02328742,0.05085807,0.05024327,0.5405199],"study_design_scores_gemma":[0.000228883,0.0003222937,0.002392999,0.0002223286,0.0000611041,0.0005121125,0.0005046246,0.8621164,0.02944597,0.0568955,0.04724842,0.00004944923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3375673,0.002097625,0.58489,0.003309725,0.0005728754,0.0004667934,0.003738458,0.02705913,0.04029805],"genre_scores_gemma":[0.6170235,0.0004238971,0.3740482,0.0003892025,0.00005824426,0.0001300295,0.003248778,0.0007360977,0.003941917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01133962,"threshold_uncertainty_score":0.03793484,"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","authors":[{"name":"Gilles Dowek","is_ca":false},{"name":"Thérèse Hardin","is_ca":false},{"name":"Claude Kirchner","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002867743,0.0009009208,0.0009590453,0.002047697,0.003177996,0.005547191,0.001588191,0.0009085213,0.01406861],"category_scores_gemma":[0.006196674,0.0006905866,0.001531474,0.001929628,0.003775829,0.009779193,0.003314618,0.005222027,0.002738873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902348,"about_ca_system_score_gemma":0.001324678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009522221,"about_ca_topic_score_gemma":0.0007720907,"domain_scores_codex":[0.9977035,0.0005764868,0.0001735116,0.0005653058,0.0007308294,0.0002503157],"domain_scores_gemma":[0.9956828,0.002536012,0.0002182329,0.0007748991,0.0005875684,0.00020041],"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.0000500182,0.00004880412,0.0002781437,0.00007530185,0.00001780327,0.00005204092,0.0002282871,0.0002879587,0.0004621776,0.9678897,0.00645932,0.02415049],"study_design_scores_gemma":[0.00003304033,0.00001268873,0.0001588567,0.00002383781,0.00002641427,0.00008469915,0.00004237291,0.001795853,0.001199359,0.981357,0.01525997,0.000006031879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.05183118,0.005924679,0.4526073,0.01063648,0.001655361,0.0001893167,0.001380802,0.002772139,0.4730026],"genre_scores_gemma":[0.7617156,0.004148649,0.1694624,0.002122541,0.002715049,0.0002125094,0.002123561,0.0006607691,0.05683904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01406861,"threshold_uncertainty_score":0.04706419,"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","authors":[{"name":"Patrice Chalin","is_ca":true},{"name":"Joseph R. Kiniry","is_ca":false},{"name":"Gary T. Leavens","is_ca":false},{"name":"Erik Poll","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008870688,0.0009466995,0.0008327196,0.0009748914,0.00119237,0.005162142,0.003953537,0.001677722,0.008200912],"category_scores_gemma":[0.01800594,0.001425309,0.002013574,0.000843955,0.002800518,0.008504779,0.003525351,0.003380205,0.003157621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008343363,"about_ca_system_score_gemma":0.002495017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003223238,"about_ca_topic_score_gemma":0.003686633,"domain_scores_codex":[0.9942659,0.001675506,0.0005166683,0.0006300884,0.002386825,0.0005250889],"domain_scores_gemma":[0.9878033,0.006321051,0.0007237098,0.003006385,0.00193244,0.0002131521],"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.0004594673,0.0003566928,0.002620832,0.0009191551,0.0001152966,0.0007770974,0.001597736,0.03327372,0.02320469,0.6215381,0.0202768,0.2948605],"study_design_scores_gemma":[0.0001545735,0.0001087721,0.0006626459,0.0003919612,0.0001339388,0.0004380403,0.0002379899,0.3773426,0.07345865,0.4747798,0.07218695,0.0001039248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005534394,0.0001292527,0.9820864,0.0003784556,0.00007860332,0.0001023285,0.0002350158,0.006621513,0.004834131],"genre_scores_gemma":[0.1388101,0.0003887384,0.8479351,0.0004165332,0.00009952259,0.000185221,0.001162244,0.003463526,0.007538922],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008870688,"threshold_uncertainty_score":0.04691327,"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","authors":[{"name":"François Bobot","is_ca":true},{"name":"Jean-Christophe Filliâtre","is_ca":true},{"name":"Claude Marché","is_ca":true},{"name":"Andrei Paskevich","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00721354,0.0008393388,0.0009340922,0.001411548,0.002710441,0.005033696,0.001794414,0.002170589,0.07548091],"category_scores_gemma":[0.02244648,0.001134066,0.00237581,0.0011634,0.003325259,0.01322864,0.004496059,0.00711917,0.03115807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00190622,"about_ca_system_score_gemma":0.003427884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004164089,"about_ca_topic_score_gemma":0.004535397,"domain_scores_codex":[0.9953049,0.001378324,0.0001757586,0.0007127518,0.001863898,0.0005643719],"domain_scores_gemma":[0.9870128,0.003972698,0.0004237666,0.004276417,0.003556317,0.0007579494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004584019,0.00008237054,0.001680637,0.0003426982,0.0001066251,0.0003111022,0.0006766533,0.002721112,0.005851037,0.3611132,0.4275285,0.1991277],"study_design_scores_gemma":[0.0001204599,0.00005714119,0.0005264432,0.0002506664,0.00005191331,0.0005837519,0.0002842165,0.01686517,0.008837942,0.277202,0.6951336,0.00008670492],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.009232778,0.003310434,0.7494752,0.08142405,0.007513869,0.0002432323,0.001865411,0.04309094,0.1038441],"genre_scores_gemma":[0.1682382,0.003127535,0.5978124,0.03247324,0.002247574,0.0003557987,0.003587611,0.03015641,0.1620013],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.07548091,"threshold_uncertainty_score":0.2525088,"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","authors":[{"name":"Étienne Gagnon","is_ca":true},{"name":"Laurie Hendren","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031197,0.0008886255,0.0008361692,0.002059658,0.001103924,0.002953767,0.003103518,0.001235081,0.004497869],"category_scores_gemma":[0.005043379,0.001164328,0.001428813,0.001145051,0.00113367,0.003015357,0.00188654,0.002185901,0.003308563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001360591,"about_ca_system_score_gemma":0.004511718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004721586,"about_ca_topic_score_gemma":0.004630402,"domain_scores_codex":[0.998497,0.000205001,0.0001562765,0.0001906953,0.0007619231,0.0001891445],"domain_scores_gemma":[0.997896,0.0005907031,0.0001631751,0.0004387355,0.0007287312,0.0001826231],"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.0004419288,0.0003096919,0.00210122,0.001410106,0.000174738,0.001067291,0.0009979432,0.03222356,0.01975452,0.2635029,0.0832743,0.5947419],"study_design_scores_gemma":[0.0002295964,0.0001326526,0.0006918032,0.0003406415,0.0001149176,0.001354618,0.000141631,0.1444808,0.02297624,0.1033778,0.7259508,0.0002085921],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.001882399,0.0004170375,0.9422026,0.0002020246,0.0002003106,0.0002119575,0.0003229246,0.04940519,0.005155572],"genre_scores_gemma":[0.02860513,0.0006729188,0.9529804,0.000418535,0.0001040585,0.000322905,0.001519984,0.008179305,0.007196718],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.004721586,"threshold_uncertainty_score":0.01649868,"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","authors":[{"name":"Jules Desharnais","is_ca":true},{"name":"Bernhard Möller","is_ca":false},{"name":"Georg Struth","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002288614,0.0005336267,0.0007418554,0.001509295,0.001972488,0.003713586,0.001449792,0.001125573,0.007274304],"category_scores_gemma":[0.003001594,0.0004071972,0.00179285,0.001590325,0.003623232,0.01138982,0.002998642,0.003433394,0.002543844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001321145,"about_ca_system_score_gemma":0.001616798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400436,"about_ca_topic_score_gemma":0.001374237,"domain_scores_codex":[0.9980401,0.0004746396,0.0001740921,0.0004663783,0.0006209604,0.0002238534],"domain_scores_gemma":[0.9986231,0.0003558792,0.0001150847,0.0003651452,0.0003718219,0.0001689627],"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.000005607806,0.000006655022,0.00003679652,0.00001751737,0.000002999493,0.00003167466,0.000048791,0.000376007,0.0002534552,0.9954391,0.0004506317,0.003330778],"study_design_scores_gemma":[0.000009701294,0.0000145662,0.00003590768,0.00001791499,0.000009693396,0.0001085585,0.00003421659,0.003940857,0.0007666723,0.9579887,0.03705803,0.00001509336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01294751,0.002104037,0.8929951,0.002361058,0.0006423894,0.0001825536,0.000595983,0.0007065415,0.08746471],"genre_scores_gemma":[0.4527413,0.003520748,0.5041023,0.001624658,0.001077592,0.0004096685,0.001169507,0.0002670757,0.0350872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007274304,"threshold_uncertainty_score":0.02433497,"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","authors":[{"name":"Yannis Smaragdakis","is_ca":false},{"name":"Martin Bravenboer","is_ca":false},{"name":"Ondřej Lhoták","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003420395,0.002244084,0.001444347,0.002150975,0.003071324,0.008317025,0.002302357,0.002319418,0.03248392],"category_scores_gemma":[0.01978935,0.001751413,0.002463111,0.001418099,0.004045162,0.01788063,0.008028519,0.004558152,0.01841889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001823346,"about_ca_system_score_gemma":0.002286417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003112707,"about_ca_topic_score_gemma":0.004110958,"domain_scores_codex":[0.9943464,0.0011761,0.0003565631,0.001469529,0.001860471,0.0007909748],"domain_scores_gemma":[0.9916944,0.002154147,0.0004547746,0.00394354,0.001390195,0.0003630208],"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.0006493818,0.0001124195,0.007925835,0.0006258393,0.0001630541,0.000838287,0.002897864,0.009436856,0.01354254,0.6812559,0.04984996,0.2327021],"study_design_scores_gemma":[0.00004985178,0.00008931741,0.001431629,0.0004253267,0.000177164,0.0007043051,0.001404409,0.02389078,0.02171415,0.622183,0.3277396,0.0001905767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0353787,0.002200269,0.8400386,0.006822183,0.001588364,0.0004214171,0.001393315,0.01906681,0.09309026],"genre_scores_gemma":[0.3971876,0.00220117,0.4907984,0.007613549,0.000788802,0.0004793227,0.001818281,0.01840846,0.08070447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03248392,"threshold_uncertainty_score":0.1086696,"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","authors":[{"name":"Claude Marché","is_ca":true},{"name":"Christine Paulin-Mohring","is_ca":true},{"name":"Xavier Urbain","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00653728,0.001738135,0.001432028,0.007638812,0.002215014,0.006677801,0.003497865,0.002163609,0.04557821],"category_scores_gemma":[0.02456619,0.002686647,0.002363546,0.003527211,0.002010372,0.01106181,0.006079394,0.003803471,0.01612049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002817984,"about_ca_system_score_gemma":0.006228074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01164635,"about_ca_topic_score_gemma":0.01365612,"domain_scores_codex":[0.992849,0.001620495,0.0008813556,0.001117099,0.002481714,0.001050336],"domain_scores_gemma":[0.9837003,0.004989545,0.001405332,0.006034923,0.003382495,0.0004873697],"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.00174444,0.0006252664,0.01107264,0.003382354,0.0002225533,0.001387059,0.002396379,0.01032708,0.03329751,0.1686374,0.1914298,0.5754775],"study_design_scores_gemma":[0.0007714725,0.000253278,0.005605385,0.001748087,0.0003143726,0.001921185,0.0009911177,0.1439547,0.1280428,0.1635049,0.5522689,0.0006237988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200088,0.0003454804,0.644537,0.0003811822,0.0002290322,0.0004268215,0.003266236,0.3239849,0.01482837],"genre_scores_gemma":[0.2811676,0.0008262171,0.5738487,0.000614718,0.0002157926,0.0008144183,0.02077081,0.09949165,0.02225012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04557821,"threshold_uncertainty_score":0.1524743,"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","authors":[{"name":"Venanzio Capretta","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00433099,0.0007012559,0.0009438306,0.002253439,0.001721956,0.004692992,0.001347452,0.001428691,0.003975845],"category_scores_gemma":[0.004632773,0.0007372663,0.001984176,0.002164614,0.007855919,0.01179657,0.004970094,0.003453824,0.0009073624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002716874,"about_ca_system_score_gemma":0.001623368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001793581,"about_ca_topic_score_gemma":0.002144977,"domain_scores_codex":[0.99713,0.0008171825,0.0002390157,0.0005556687,0.0008526793,0.0004055728],"domain_scores_gemma":[0.9975237,0.001047385,0.0001955572,0.0007386365,0.0003557134,0.0001390098],"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.000003656956,0.000002460478,0.0000480386,0.0000110435,0.000001985708,0.00002087759,0.00009684409,0.0004079569,0.000173316,0.9973776,0.0001143697,0.001741749],"study_design_scores_gemma":[0.000008475512,0.00001143105,0.00005731928,0.00001689835,0.00001247264,0.00008944044,0.00002968622,0.006117408,0.0008078394,0.983847,0.008988569,0.00001343001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04561505,0.002055241,0.914053,0.00112423,0.0003472438,0.00008362133,0.0001561077,0.0009627231,0.03560275],"genre_scores_gemma":[0.7339051,0.002310526,0.2382824,0.0008897267,0.0005100041,0.0003144451,0.0002669088,0.0004565051,0.02306446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004692992,"threshold_uncertainty_score":0.02290475,"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","authors":[{"name":"Shafi Goldwasser","is_ca":false},{"name":"Silvio Micali","is_ca":true},{"name":"Chales Rackoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00646708,0.0009487311,0.001495878,0.002718037,0.003470851,0.0118618,0.002927187,0.002721904,0.01978053],"category_scores_gemma":[0.04269318,0.001352609,0.002127672,0.003396365,0.007688845,0.03126076,0.008961952,0.006979968,0.003005019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007634287,"about_ca_system_score_gemma":0.003204914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003326159,"about_ca_topic_score_gemma":0.001574524,"domain_scores_codex":[0.9828531,0.005234519,0.0009760691,0.001832108,0.007713419,0.00139067],"domain_scores_gemma":[0.931765,0.05389629,0.00189107,0.007711805,0.00357011,0.001165696],"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.00004309129,0.00002467443,0.0002636924,0.0001547317,0.000026894,0.00007238807,0.0003763166,0.005833126,0.000239178,0.9744756,0.004156306,0.01433408],"study_design_scores_gemma":[0.00001138806,0.00000630824,0.0001210101,0.0000378341,0.00001294162,0.00004825636,0.00004430069,0.009559408,0.0003323366,0.9831688,0.006644201,0.00001318974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08222189,0.009437764,0.6902354,0.02209583,0.0004903947,0.000263214,0.001799729,0.00187811,0.1915776],"genre_scores_gemma":[0.8663976,0.005375697,0.09396508,0.001198835,0.001121296,0.000364182,0.001585303,0.0007825044,0.02920945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01978053,"threshold_uncertainty_score":0.06617242,"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","authors":[{"name":"Krzysztof Czarnecki","is_ca":true},{"name":"John T. O’Donnell","is_ca":false},{"name":"Jörg Striegnitz","is_ca":false},{"name":"Walid Taha","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169578,0.0006872572,0.0007095415,0.001020889,0.000653307,0.004491426,0.002623172,0.001149769,0.02335939],"category_scores_gemma":[0.004133211,0.0009956525,0.001313453,0.0008607871,0.0007360342,0.003246443,0.001716683,0.002674501,0.009373036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00110821,"about_ca_system_score_gemma":0.001653715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002996563,"about_ca_topic_score_gemma":0.003341222,"domain_scores_codex":[0.9987811,0.0001701375,0.0001572487,0.0002011449,0.0005911951,0.00009912995],"domain_scores_gemma":[0.9981068,0.0005518323,0.00007064069,0.0007079705,0.0004551533,0.0001076014],"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.0004498205,0.0002252957,0.0009222847,0.00104691,0.0001155581,0.0004846472,0.0006999183,0.01259135,0.03270084,0.3330686,0.1183033,0.4993914],"study_design_scores_gemma":[0.0002183077,0.00009206331,0.0003934305,0.0002578518,0.0001165247,0.0006717608,0.0001368349,0.1366776,0.1254842,0.1025641,0.6332406,0.0001466107],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0036932,0.0002167685,0.8678885,0.0004895091,0.0004313645,0.0001161482,0.001985477,0.1038723,0.02130669],"genre_scores_gemma":[0.08799086,0.0005584181,0.8279054,0.0009054145,0.000156138,0.0003204871,0.006153353,0.03609663,0.03991336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02335939,"threshold_uncertainty_score":0.07814497,"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","authors":[{"name":"Brigitte Pientka","is_ca":true},{"name":"Jana Dunfield","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003437147,0.001751814,0.001470611,0.002730601,0.001630061,0.007292098,0.005724411,0.001812943,0.01666669],"category_scores_gemma":[0.004405613,0.002246898,0.003846618,0.003144113,0.00383023,0.01117282,0.003966806,0.005904622,0.006421339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002797614,"about_ca_system_score_gemma":0.002771186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01175217,"about_ca_topic_score_gemma":0.01245142,"domain_scores_codex":[0.9974233,0.0008585522,0.0002657488,0.0003591456,0.0008634921,0.0002298443],"domain_scores_gemma":[0.99854,0.0007538805,0.00007309236,0.0003149487,0.00022612,0.00009183623],"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.00003774466,0.00002046134,0.00008920652,0.0004311962,0.00002401675,0.00008323523,0.0003549252,0.003792413,0.0005768228,0.9277242,0.01273785,0.05412783],"study_design_scores_gemma":[0.00004143063,0.00002650144,0.00008821178,0.0001769627,0.00005555453,0.0002025473,0.00009627105,0.03406154,0.001889037,0.756318,0.2069924,0.00005138699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006074176,0.001087382,0.981995,0.000454614,0.0001185745,0.00008772602,0.0007298972,0.004252987,0.01066636],"genre_scores_gemma":[0.03702681,0.002012688,0.9443666,0.0005116963,0.0001776611,0.0004087085,0.002242737,0.001262104,0.01199101],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01666669,"threshold_uncertainty_score":0.05575562,"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","authors":[{"name":"Dirk Beyer","is_ca":true},{"name":"Thomas A. Henzinger","is_ca":false},{"name":"Rupak Majumdar","is_ca":false},{"name":"Andrey Rybalchenko","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001466613,0.0008069501,0.001105067,0.001961281,0.0011379,0.003002887,0.001604927,0.0009824062,0.01810091],"category_scores_gemma":[0.003360021,0.0008786124,0.002228763,0.001384731,0.00249223,0.00570785,0.003106504,0.003237556,0.002960715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001727825,"about_ca_system_score_gemma":0.0007646723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006283614,"about_ca_topic_score_gemma":0.001133164,"domain_scores_codex":[0.9982653,0.0003909977,0.0001288423,0.0003291874,0.0007173703,0.0001682534],"domain_scores_gemma":[0.9985386,0.00069962,0.00007115545,0.0004477354,0.0001932576,0.00004957589],"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.00004651431,0.00002732808,0.0001114966,0.0001044414,0.00003266077,0.00005146804,0.000113644,0.004300552,0.001437088,0.9422596,0.002805951,0.04870927],"study_design_scores_gemma":[0.00001552493,0.00001484979,0.00004905792,0.00003409625,0.0000301666,0.00003685225,0.0000286685,0.01661439,0.00232602,0.9732507,0.007588518,0.00001100067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01394859,0.001241978,0.9001455,0.0004465901,0.0002718496,0.00008574605,0.0002945224,0.001621017,0.08194415],"genre_scores_gemma":[0.5360349,0.001399375,0.4118556,0.0005292895,0.0003960317,0.0003930989,0.001770643,0.001489645,0.04613146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01810091,"threshold_uncertainty_score":0.06055361,"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","authors":[{"name":"Jean-Pierre Jouannaud","is_ca":false},{"name":"Mitsuhiro Okada","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001763378,0.000762948,0.0005764868,0.0008989893,0.001294023,0.005395898,0.002143841,0.001643004,0.006658973],"category_scores_gemma":[0.003078926,0.0007925667,0.001818881,0.001045419,0.002578741,0.006117366,0.001906319,0.002444882,0.001747124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002001341,"about_ca_system_score_gemma":0.002174578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002925935,"about_ca_topic_score_gemma":0.00314757,"domain_scores_codex":[0.9985801,0.0003859275,0.0001652182,0.0001997132,0.00051535,0.0001536733],"domain_scores_gemma":[0.998226,0.0007909312,0.0001511328,0.0003780001,0.0003393312,0.0001146243],"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.00001853988,0.00001619976,0.0001217893,0.00005534528,0.000005829873,0.0001060398,0.0002813656,0.00723416,0.001302522,0.9856951,0.0005210061,0.004642251],"study_design_scores_gemma":[0.00006809543,0.00006421344,0.0001047588,0.00007379293,0.00003839493,0.0002514384,0.0001552042,0.1523843,0.005455004,0.7943191,0.04704497,0.00004080969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01082258,0.0001937292,0.9789841,0.0004634593,0.00006717167,0.0001110011,0.0002188807,0.001409829,0.007729234],"genre_scores_gemma":[0.3749507,0.0007246265,0.5959789,0.0003414052,0.0001602631,0.0006183403,0.001059844,0.0006675894,0.0254983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006658973,"threshold_uncertainty_score":0.02227646,"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","authors":[{"name":"Annabelle McIver","is_ca":false},{"name":"Carroll Morgan","is_ca":false},{"name":"Benjamin Lucien Kaminski","is_ca":false},{"name":"Joost-Pieter Katoen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01082689,0.001118103,0.001777497,0.002322178,0.001920467,0.003750655,0.003948273,0.003038846,0.005396087],"category_scores_gemma":[0.03787574,0.001393762,0.004127375,0.001217446,0.006608925,0.008906933,0.00695698,0.01136047,0.002666793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001736513,"about_ca_system_score_gemma":0.002679776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001402364,"about_ca_topic_score_gemma":0.001348867,"domain_scores_codex":[0.9839776,0.002964164,0.001701934,0.003480709,0.006980198,0.0008954198],"domain_scores_gemma":[0.9702203,0.01737424,0.0009487954,0.004876605,0.005687931,0.000892276],"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.0001223286,0.0001057879,0.0008302918,0.0003687904,0.0001177109,0.0005752259,0.00063794,0.009477801,0.008054091,0.8811338,0.009317865,0.08925842],"study_design_scores_gemma":[0.0001168697,0.0001239531,0.0001938109,0.0001648888,0.0001384561,0.0007879874,0.00006345788,0.08455686,0.01701154,0.8494859,0.04723151,0.0001247842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00147991,0.0001334002,0.9931725,0.0007271205,0.0003345684,0.00008819467,0.00009742329,0.0009573445,0.003009521],"genre_scores_gemma":[0.08125163,0.0004080634,0.9069343,0.002678845,0.0007464403,0.0005610788,0.0003426386,0.00106129,0.006015724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01082689,"threshold_uncertainty_score":0.05725873,"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","authors":[{"name":"Richard Blute","is_ca":true},{"name":"J.R.B. Cockett","is_ca":true},{"name":"R. A. G. Seely","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001558995,0.0006504637,0.0006083304,0.00283096,0.002519283,0.002981781,0.001208271,0.0009400777,0.009028484],"category_scores_gemma":[0.002373982,0.0003773457,0.0007895017,0.00209966,0.005114217,0.006295466,0.004016472,0.002299498,0.001818832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002149512,"about_ca_system_score_gemma":0.0009278043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001722619,"about_ca_topic_score_gemma":0.001489114,"domain_scores_codex":[0.9986439,0.0003941239,0.00008939363,0.0003304817,0.0003820978,0.0001598677],"domain_scores_gemma":[0.9988616,0.0003842181,0.00006906306,0.0002089344,0.0003278412,0.000148471],"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.000001763256,0.000001728345,0.00004536481,0.00001329848,0.000001671306,0.00001354159,0.0001369397,0.00006253547,0.00006952571,0.9963775,0.0009495982,0.002326474],"study_design_scores_gemma":[0.000003967734,0.00000706384,0.0001125025,0.00001954094,0.000003721527,0.0001511181,0.0001089723,0.0004582239,0.0001853294,0.8786085,0.1203348,0.00000626614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0268131,0.01538176,0.5320727,0.005588048,0.00155531,0.000187821,0.001116513,0.0005891976,0.4166956],"genre_scores_gemma":[0.6836311,0.007686262,0.2050894,0.004020609,0.001471912,0.0004101485,0.001449025,0.0003640925,0.09587745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009028484,"threshold_uncertainty_score":0.03020334,"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","authors":[{"name":"Magnus Madsen","is_ca":true},{"name":"Ming‐Ho Yee","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003878332,0.0009162535,0.0007517182,0.00136897,0.000783814,0.004064002,0.002699897,0.0009781912,0.007096977],"category_scores_gemma":[0.005587487,0.001074281,0.001585631,0.001211854,0.002870805,0.005447965,0.002830897,0.004776374,0.002126356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00168857,"about_ca_system_score_gemma":0.002530944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002577761,"about_ca_topic_score_gemma":0.003578253,"domain_scores_codex":[0.9982694,0.0004037481,0.0002419571,0.0002960342,0.0006409027,0.000147862],"domain_scores_gemma":[0.997084,0.001616899,0.0002198645,0.0004205308,0.0005127944,0.0001459956],"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.0001516083,0.00008615689,0.0005656116,0.0006203266,0.0000409489,0.0003291528,0.001226831,0.02295309,0.007835926,0.8256286,0.03537744,0.1051844],"study_design_scores_gemma":[0.0001181957,0.00009636494,0.0002921736,0.0003124887,0.00004742884,0.000583979,0.0002836659,0.1043853,0.01816755,0.5709026,0.3046831,0.000127071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00124707,0.0001366303,0.9905717,0.0004521473,0.00007688095,0.00005231926,0.0008159616,0.004148833,0.002498443],"genre_scores_gemma":[0.05044088,0.0006088646,0.937369,0.00146668,0.0001976115,0.000449164,0.002145341,0.002441974,0.004880517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007096977,"threshold_uncertainty_score":0.02374172,"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","authors":[{"name":"Ana Bove","is_ca":false},{"name":"Venanzio Capretta","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007730971,0.000870944,0.001263777,0.002517032,0.001817236,0.007113476,0.003013501,0.002683331,0.003464805],"category_scores_gemma":[0.01071599,0.00096066,0.002610921,0.002912218,0.01049461,0.01385667,0.003954102,0.003952248,0.001129002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003583036,"about_ca_system_score_gemma":0.002496073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003824058,"about_ca_topic_score_gemma":0.003851805,"domain_scores_codex":[0.9950059,0.002329694,0.0003935992,0.0007994786,0.00106209,0.000409264],"domain_scores_gemma":[0.9936149,0.003876682,0.0004169967,0.001366187,0.0005333417,0.0001917198],"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.000007837079,0.000006539525,0.0001260212,0.00003784976,0.000006698182,0.00004738671,0.0002951364,0.00516308,0.0002094238,0.9898976,0.0002824989,0.00391993],"study_design_scores_gemma":[0.0000124125,0.000009564092,0.00004120475,0.00003904791,0.00001198962,0.00006969445,0.00004787841,0.02818839,0.0003794657,0.9589142,0.01227346,0.00001263416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007577605,0.001229981,0.9786738,0.0006991657,0.0001264755,0.00007015481,0.00009850597,0.0005153744,0.0110091],"genre_scores_gemma":[0.2528391,0.002461271,0.7334774,0.0005721315,0.0004951097,0.0004412614,0.0003170042,0.000444813,0.008951844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007730971,"threshold_uncertainty_score":0.04088581,"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","authors":[{"name":"Alex Potanin","is_ca":false},{"name":"James Noble","is_ca":false},{"name":"Dave Clarke","is_ca":false},{"name":"Robert Biddle","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001947484,0.0002788257,0.0004954446,0.0005885673,0.0007387048,0.002407207,0.001041752,0.00103639,0.004867484],"category_scores_gemma":[0.004576627,0.0004774552,0.001023429,0.0005828678,0.003107457,0.004168243,0.003620301,0.001996098,0.001153203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106531,"about_ca_system_score_gemma":0.001274854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009812064,"about_ca_topic_score_gemma":0.001075944,"domain_scores_codex":[0.9985331,0.0002233284,0.0001376046,0.0003047528,0.0005511431,0.000250099],"domain_scores_gemma":[0.9977753,0.0004455784,0.00022198,0.001156011,0.0003081067,0.00009310368],"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.00006616304,0.000033953,0.001179978,0.00020845,0.0000143904,0.0001611874,0.0006048524,0.001941385,0.009043951,0.9117423,0.00556078,0.06944259],"study_design_scores_gemma":[0.0000795271,0.0001131244,0.001969624,0.0002869619,0.000115789,0.001073765,0.0001857741,0.03299172,0.01532109,0.5884134,0.3593496,0.00009958841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02836777,0.0005943498,0.9313205,0.001105564,0.0004091453,0.0001265811,0.0002491335,0.007232488,0.03059443],"genre_scores_gemma":[0.4860201,0.0008052615,0.4879045,0.001531983,0.0004384118,0.0002841568,0.0006851165,0.002977825,0.01935275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004867484,"threshold_uncertainty_score":0.01628339,"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","authors":[{"name":"Jerome Miecznikowski","is_ca":true},{"name":"Laurie Hendren","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003596506,0.0009602413,0.0008216089,0.001733238,0.001197048,0.002742993,0.002253974,0.001082692,0.002867032],"category_scores_gemma":[0.01719993,0.0009614707,0.0008779229,0.002315291,0.002436591,0.007396594,0.00266792,0.003466196,0.002271006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009177501,"about_ca_system_score_gemma":0.002375958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00282148,"about_ca_topic_score_gemma":0.005488403,"domain_scores_codex":[0.9968699,0.0005475755,0.000234045,0.0003983116,0.001598763,0.0003514021],"domain_scores_gemma":[0.9868208,0.005804955,0.001017363,0.003836715,0.002133533,0.0003867599],"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.0001372846,0.0001406282,0.002311782,0.0003285947,0.00002349593,0.0002735379,0.0006543965,0.007418139,0.010931,0.04049708,0.01600251,0.9212815],"study_design_scores_gemma":[0.0001225807,0.0002772832,0.003013506,0.0008961179,0.0001447581,0.002398673,0.001925121,0.1966953,0.1122641,0.5789126,0.1031706,0.0001795238],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1032456,0.005789977,0.8398365,0.007870044,0.0006358875,0.0002138338,0.0003077022,0.02729574,0.01480474],"genre_scores_gemma":[0.3449996,0.00376689,0.6219429,0.001718297,0.0003322565,0.0001898899,0.0007862914,0.01211788,0.01414615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003596506,"threshold_uncertainty_score":0.01902032,"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","authors":[{"name":"Nomair A. Naeem","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002620822,0.0006004007,0.0007128627,0.001933241,0.001217448,0.003226667,0.002022976,0.001101562,0.003534737],"category_scores_gemma":[0.008081367,0.0006981189,0.001915157,0.001233443,0.002700756,0.005424746,0.002565973,0.001835479,0.0005374252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001986622,"about_ca_system_score_gemma":0.001943352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004592854,"about_ca_topic_score_gemma":0.002458235,"domain_scores_codex":[0.9968615,0.0004570364,0.0002145204,0.0005019889,0.001556832,0.000408181],"domain_scores_gemma":[0.9957632,0.001602935,0.0004855621,0.0009589762,0.001052453,0.0001368865],"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.000208082,0.00006681648,0.006269735,0.0001922171,0.00007110421,0.0007591975,0.001040957,0.1117362,0.01788756,0.7971014,0.001068845,0.06359778],"study_design_scores_gemma":[0.00002590052,0.00009397745,0.0007861416,0.00006481529,0.00007795493,0.0004121852,0.0003052035,0.4907048,0.05172323,0.4356998,0.02003259,0.00007346459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02784791,0.00005106891,0.9682087,0.00007367976,0.00002408465,0.00005624758,0.0001053295,0.001022092,0.00261078],"genre_scores_gemma":[0.5098447,0.0001473538,0.482563,0.0001116127,0.00004706728,0.0002108095,0.0004763434,0.0006633326,0.00593588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004592854,"threshold_uncertainty_score":0.01441401,"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","authors":[{"name":"Ronald Garcia","is_ca":true},{"name":"Éric Tanter","is_ca":false},{"name":"Roger Wolff","is_ca":false},{"name":"Jonathan Aldrich","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005425266,0.001030592,0.0008351623,0.001923844,0.001743404,0.005962253,0.00299864,0.002547197,0.00525105],"category_scores_gemma":[0.009445659,0.001276936,0.00241153,0.002072744,0.009689648,0.008106238,0.003101174,0.006348125,0.002986149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00297628,"about_ca_system_score_gemma":0.00412392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003496464,"about_ca_topic_score_gemma":0.001560694,"domain_scores_codex":[0.994504,0.001520462,0.0005869999,0.001190287,0.001668429,0.0005298881],"domain_scores_gemma":[0.9938706,0.003565934,0.0003927291,0.001009513,0.0009432103,0.0002180103],"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.000009328162,0.0000133496,0.0001200252,0.00009187665,0.000007265169,0.00006223347,0.0004133842,0.001874562,0.0003400116,0.975453,0.001378653,0.02023629],"study_design_scores_gemma":[0.00001240793,0.00001255946,0.00007178112,0.0001072155,0.000009168672,0.0001107433,0.00005565726,0.007646775,0.000697317,0.9236519,0.06760235,0.00002205222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002754147,0.001658447,0.9638972,0.002451302,0.0002953727,0.000136082,0.0002281554,0.001585872,0.02699346],"genre_scores_gemma":[0.1032906,0.0048255,0.8738957,0.001325386,0.001099486,0.0006662512,0.0005001864,0.0009597527,0.01343712],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005962253,"threshold_uncertainty_score":0.02869183,"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","authors":[{"name":"Brigitte Pientka","is_ca":true},{"name":"Jana Dunfield","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01045424,0.0007646796,0.0006920234,0.001214678,0.001948959,0.005001347,0.002191888,0.001462827,0.003809364],"category_scores_gemma":[0.01811808,0.001156003,0.001394024,0.001281183,0.007699585,0.02009825,0.007181137,0.005234906,0.0008874041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001627659,"about_ca_system_score_gemma":0.002198491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001098015,"about_ca_topic_score_gemma":0.001011049,"domain_scores_codex":[0.9931519,0.003197629,0.0006084471,0.001024095,0.001450804,0.0005670945],"domain_scores_gemma":[0.9844151,0.009172733,0.0007438712,0.003861838,0.001417989,0.0003885055],"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.00001199089,0.000006724853,0.00007724983,0.00004858903,0.0000056756,0.00003877271,0.0002779889,0.0008573681,0.0002752092,0.9905748,0.0003471924,0.00747854],"study_design_scores_gemma":[0.00001554935,0.00001172593,0.00003225515,0.00003761398,0.00001656554,0.00008282444,0.00006943949,0.003817386,0.001335809,0.9815381,0.01302999,0.00001278631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01471562,0.001407341,0.9624826,0.002663417,0.0001710132,0.00004369722,0.00008677907,0.0008857968,0.01754374],"genre_scores_gemma":[0.500334,0.002207089,0.4831293,0.00110281,0.000499954,0.0002108543,0.0002241625,0.0006234359,0.01166839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045424,"threshold_uncertainty_score":0.05528796,"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","authors":[{"name":"Matt Kaufmann","is_ca":true},{"name":"J Strother Moore","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002347575,0.000358863,0.0006204921,0.001287183,0.001584524,0.002900112,0.001998387,0.001085833,0.01190678],"category_scores_gemma":[0.006913607,0.0008726977,0.002266346,0.000834105,0.002695743,0.005351394,0.003780535,0.002848835,0.001628252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361676,"about_ca_system_score_gemma":0.002133877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001245953,"about_ca_topic_score_gemma":0.002757481,"domain_scores_codex":[0.9981187,0.0005728483,0.0001523064,0.0002880694,0.0006859491,0.0001821114],"domain_scores_gemma":[0.9961796,0.001965176,0.0001353591,0.0008580432,0.0007287304,0.0001331386],"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.00004715394,0.0000732147,0.0003061653,0.00009400021,0.00002607366,0.0001344488,0.000271101,0.004609942,0.001975106,0.9601387,0.00301569,0.02930836],"study_design_scores_gemma":[0.00005202719,0.00004007243,0.0001052107,0.00004873055,0.00003459378,0.0001138819,0.00009759034,0.05880511,0.003562953,0.9257513,0.01137043,0.00001819138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01148025,0.0001016642,0.9746215,0.00104614,0.0001163828,0.0001529136,0.0002242823,0.0007935718,0.01146328],"genre_scores_gemma":[0.1810577,0.0001987828,0.8097543,0.0003872128,0.0001183162,0.0002100823,0.0006461741,0.0002675053,0.007359955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01190678,"threshold_uncertainty_score":0.03983212,"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","authors":[{"name":"Andreas Abel","is_ca":false},{"name":"Brigitte Pientka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00602604,0.0004902934,0.001275553,0.001060472,0.001708136,0.00324211,0.002205813,0.001084523,0.002819495],"category_scores_gemma":[0.01353158,0.001043791,0.002284906,0.001012985,0.006232756,0.0102185,0.005824856,0.004193922,0.0008421675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003296113,"about_ca_system_score_gemma":0.002799416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003758153,"about_ca_topic_score_gemma":0.002787615,"domain_scores_codex":[0.9932193,0.001554703,0.0005721635,0.001740934,0.002140174,0.0007727969],"domain_scores_gemma":[0.9903241,0.004620775,0.0005450939,0.002788461,0.001445495,0.0002761185],"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.00006419173,0.00002854533,0.001186312,0.00008412952,0.00001956532,0.0001606146,0.0009610517,0.004052665,0.004056382,0.9715366,0.0005610616,0.01728901],"study_design_scores_gemma":[0.0000437908,0.00008045632,0.0005154242,0.00007729635,0.00008938973,0.0003993782,0.0001436227,0.0767644,0.02510541,0.8700151,0.02669155,0.00007415094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03296203,0.000200132,0.9590039,0.0003061577,0.0000628882,0.00006003593,0.00008863128,0.002016738,0.005299552],"genre_scores_gemma":[0.5813059,0.0003048544,0.4066333,0.0004525164,0.0001417617,0.0002881738,0.0002364795,0.001533878,0.009103131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00602604,"threshold_uncertainty_score":0.03186917,"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","authors":[{"name":"Stephen J. Bellantoni","is_ca":true},{"name":"Karl-Heinz Niggl","is_ca":false},{"name":"Helmut Schwichtenberg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003495387,0.0006828666,0.001774927,0.001705566,0.002271158,0.006903004,0.002156753,0.002042198,0.008195356],"category_scores_gemma":[0.01146892,0.0009442911,0.001658568,0.003385049,0.010964,0.01881939,0.003128476,0.00957246,0.001157534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005054296,"about_ca_system_score_gemma":0.001837928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003640538,"about_ca_topic_score_gemma":0.003664682,"domain_scores_codex":[0.9972319,0.0007935326,0.0001313923,0.0006667422,0.0006589328,0.0005174687],"domain_scores_gemma":[0.9901968,0.006898188,0.0005673873,0.001382572,0.0005726783,0.0003822566],"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.00002401282,0.00001167257,0.000155869,0.00002762781,0.000003918994,0.00001687321,0.0001465722,0.0005044283,0.0001093191,0.9938973,0.0008819198,0.004220529],"study_design_scores_gemma":[0.000007173195,0.000003329749,0.00006384966,0.000006888783,0.000005012852,0.00002886811,0.00002092439,0.0009432351,0.00007359438,0.996974,0.001867743,0.000005395189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1922522,0.03288512,0.5121935,0.02215133,0.001392186,0.0000572852,0.0006445677,0.001434437,0.2369893],"genre_scores_gemma":[0.9217505,0.005804919,0.04377659,0.001409893,0.001758883,0.00005665264,0.0003101535,0.0002483128,0.02488406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008195356,"threshold_uncertainty_score":0.03667164,"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","authors":[{"name":"Amy Felty","is_ca":true},{"name":"Alberto Momigliano","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005430882,0.000500127,0.0004850798,0.001237046,0.001232811,0.003125735,0.001553162,0.0009996149,0.08027704],"category_scores_gemma":[0.001414691,0.0004027721,0.0007389051,0.001114478,0.0006506231,0.002972095,0.002362191,0.001197359,0.02010768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007498398,"about_ca_system_score_gemma":0.001156337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002274269,"about_ca_topic_score_gemma":0.003525857,"domain_scores_codex":[0.9992901,0.00007042875,0.00003081314,0.0002047655,0.0002928551,0.0001110258],"domain_scores_gemma":[0.9990771,0.0001321766,0.00003288381,0.0004001402,0.0002813347,0.00007636948],"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.0009547207,0.0003668538,0.002987598,0.0003167216,0.0001451972,0.0003369286,0.0004164905,0.01497158,0.02129316,0.412743,0.1109541,0.4345135],"study_design_scores_gemma":[0.0001807176,0.0002157788,0.001987564,0.0001401285,0.0001576173,0.0008827164,0.00040706,0.07531946,0.03620599,0.2071636,0.6772401,0.00009923938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04037758,0.001306441,0.4543286,0.001251129,0.001622586,0.0002773323,0.00395216,0.01469209,0.482192],"genre_scores_gemma":[0.407719,0.0008018523,0.2232528,0.001145962,0.0002387866,0.000299222,0.008268581,0.002591837,0.3556818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.08027704,"threshold_uncertainty_score":0,"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","authors":[{"name":"Eli Ben‐Sasson","is_ca":false},{"name":"Nicola Galesi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01059411,0.0007591376,0.002310361,0.001799774,0.00170792,0.00450786,0.004487703,0.002574031,0.01082665],"category_scores_gemma":[0.07077478,0.00110151,0.002218955,0.002024437,0.004166876,0.01088822,0.004132679,0.003465591,0.0007791726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004220206,"about_ca_system_score_gemma":0.003034224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002593603,"about_ca_topic_score_gemma":0.002469519,"domain_scores_codex":[0.9816566,0.008455631,0.0009944747,0.00251896,0.00424944,0.002124972],"domain_scores_gemma":[0.8646049,0.1154568,0.004684088,0.01060245,0.002853912,0.001797903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002719929,0.0004912352,0.009522404,0.0008758113,0.0005751632,0.0007005301,0.001335258,0.6066797,0.0180929,0.2946386,0.006176455,0.058192],"study_design_scores_gemma":[0.0001495573,0.0001296658,0.0008421839,0.00002891383,0.00009581519,0.0001663272,0.00014113,0.8217736,0.005899857,0.1698202,0.0009126341,0.00004003415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6435637,0.0007106917,0.338526,0.005164404,0.0000836995,0.0003942041,0.001161566,0.001892345,0.008503458],"genre_scores_gemma":[0.955188,0.000231607,0.04010147,0.0003900488,0.00008409814,0.0002463345,0.0007010237,0.000327472,0.002729826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01082665,"threshold_uncertainty_score":0.05602771,"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","authors":[{"name":"William M. Farmer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009389964,0.0005003881,0.001287671,0.002023945,0.003608035,0.01010679,0.001651697,0.003685175,0.006030726],"category_scores_gemma":[0.02392935,0.0009000825,0.001104451,0.002239787,0.02807471,0.01926943,0.004684018,0.006405933,0.0014387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121638,"about_ca_system_score_gemma":0.002002247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009552404,"about_ca_topic_score_gemma":0.0008707237,"domain_scores_codex":[0.9931226,0.003154618,0.0006162816,0.0007242919,0.001975452,0.0004066239],"domain_scores_gemma":[0.977915,0.01272209,0.0009289885,0.005107196,0.002286195,0.001040536],"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.00001618212,0.000004763054,0.0001145627,0.00002518885,0.000003434595,0.00001235222,0.0001920233,0.00007038724,0.00004450883,0.9946434,0.001605451,0.00326768],"study_design_scores_gemma":[0.000008855724,0.000003410147,0.00005233053,0.0000141556,0.000002861588,0.0000261685,0.000059798,0.0001912565,0.00004852872,0.9943072,0.005279693,0.000005747886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06646615,0.01461399,0.39179,0.09056925,0.006115486,0.0001702656,0.001108247,0.0009917325,0.4281749],"genre_scores_gemma":[0.8372959,0.007484206,0.1192282,0.007645409,0.005922765,0.0003949705,0.0004347984,0.0003880258,0.0212057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01010679,"threshold_uncertainty_score":0.04965949,"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","authors":[{"name":"Vijay Sundaresan","is_ca":true},{"name":"Laurie Hendren","is_ca":true},{"name":"Chrislain Razafimahefa","is_ca":true},{"name":"Raja Vallée-Rai","is_ca":true},{"name":"Patrick Lam","is_ca":true},{"name":"Étienne Gagnon","is_ca":true},{"name":"Charles Godin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001790621,0.000928257,0.0006636651,0.001500887,0.0009848938,0.001576668,0.002084684,0.001093197,0.002520111],"category_scores_gemma":[0.01326952,0.0007424236,0.0009988648,0.001397691,0.001514272,0.003229895,0.002105222,0.002143623,0.0006446394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001309728,"about_ca_system_score_gemma":0.002172561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005141413,"about_ca_topic_score_gemma":0.005846176,"domain_scores_codex":[0.9954745,0.0009287017,0.0001872991,0.000655301,0.002357621,0.0003965424],"domain_scores_gemma":[0.9906132,0.005286697,0.001080982,0.001968482,0.0009014797,0.0001490619],"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.0006815158,0.0002335982,0.01300306,0.0006178687,0.0001502568,0.0004202435,0.001609811,0.08754077,0.09991608,0.06456914,0.009807011,0.7214506],"study_design_scores_gemma":[0.00009883696,0.0002155003,0.006411966,0.0001356943,0.0001038301,0.000481649,0.0004694381,0.7495981,0.1182063,0.09599092,0.02813572,0.0001520768],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08833875,0.0004844718,0.888534,0.0003257821,0.0000766518,0.00007878853,0.000154049,0.01941008,0.00259749],"genre_scores_gemma":[0.4103234,0.0002319269,0.5822021,0.0002706421,0.0000502573,0.00008700568,0.0004168823,0.003991568,0.00242622],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005141413,"threshold_uncertainty_score":0.01022297,"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","authors":[{"name":"Nachum Dershowitz","is_ca":false},{"name":"Mitsuhiro Okada","is_ca":true},{"name":"G. Sivakumar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021711,0.000579377,0.0005420723,0.001005959,0.001108996,0.003370945,0.001101463,0.0007639191,0.02551117],"category_scores_gemma":[0.00292193,0.000708393,0.0007135879,0.001001521,0.001990753,0.004961219,0.001915502,0.002690772,0.009628763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028094,"about_ca_system_score_gemma":0.0009949403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001000743,"about_ca_topic_score_gemma":0.001538512,"domain_scores_codex":[0.9986934,0.0002717732,0.0000931602,0.0003672521,0.0003955314,0.0001788329],"domain_scores_gemma":[0.9988053,0.0003158033,0.00004398648,0.0003818983,0.000382861,0.00007020478],"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.00001935176,0.00001699073,0.00009911774,0.00004694715,0.000007088197,0.00003350036,0.0001740691,0.0004122795,0.0008210182,0.9610699,0.01005119,0.0272487],"study_design_scores_gemma":[0.00001477267,0.00001183142,0.0001206265,0.00003200689,0.00002107771,0.0001299565,0.00006282364,0.004257619,0.002645605,0.9266847,0.0660001,0.00001884937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02313646,0.002991307,0.598707,0.001623746,0.001010467,0.0001408578,0.001298464,0.005512081,0.3655796],"genre_scores_gemma":[0.56491,0.003231851,0.17706,0.001033686,0.0008685042,0.0002202918,0.004040828,0.002099559,0.2465353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02551117,"threshold_uncertainty_score":0.08534336,"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","authors":[{"name":"Nomair A. Naeem","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Jonathan Rodriguez","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002906818,0.001131271,0.001170823,0.001667806,0.001449002,0.003109377,0.002992826,0.001377261,0.03409435],"category_scores_gemma":[0.009691382,0.0007136994,0.001546923,0.002026208,0.002191924,0.006632198,0.004851113,0.00337478,0.007785298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001596004,"about_ca_system_score_gemma":0.001448948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001545697,"about_ca_topic_score_gemma":0.002746735,"domain_scores_codex":[0.9972958,0.0009856509,0.0001809151,0.0004684954,0.0007552558,0.0003138757],"domain_scores_gemma":[0.9955947,0.001513395,0.0001147942,0.002007726,0.0005879677,0.0001814424],"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.0004991003,0.0001354674,0.0005013482,0.0002093174,0.00003707763,0.00008422905,0.0001863286,0.01366109,0.001432439,0.5948111,0.03185784,0.3565847],"study_design_scores_gemma":[0.0001821799,0.000065826,0.0001685282,0.0001032129,0.00003406545,0.0002368624,0.00009147755,0.08831584,0.00301741,0.8098083,0.09794413,0.00003222761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01220448,0.0008539381,0.9158187,0.00145216,0.0007394342,0.0001107919,0.0004754624,0.002860595,0.06548443],"genre_scores_gemma":[0.1612833,0.0009401467,0.7877626,0.0007018532,0.0006342469,0.0002768308,0.001501353,0.001361813,0.045538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03409435,"threshold_uncertainty_score":0.114057,"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","authors":[{"name":"Richard Cleve","is_ca":true},{"name":"Rajat Mittal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275747,0.001002182,0.001065187,0.002535842,0.001771481,0.006094155,0.002220718,0.00156078,0.01618689],"category_scores_gemma":[0.007725724,0.0007829574,0.001067691,0.003049036,0.002423518,0.005846074,0.002518347,0.003587294,0.001178524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002809991,"about_ca_system_score_gemma":0.001702759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00370135,"about_ca_topic_score_gemma":0.00276087,"domain_scores_codex":[0.997587,0.0006879293,0.0001595767,0.0004144256,0.000728821,0.0004221654],"domain_scores_gemma":[0.9960586,0.002165245,0.0003881475,0.0002291335,0.0005489775,0.0006100236],"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.00003350444,0.0000239429,0.0001925508,0.00004186714,0.000009086773,0.00003159149,0.0001373807,0.001627905,0.0005072018,0.9911745,0.002122435,0.004098063],"study_design_scores_gemma":[0.0000231443,0.0000142452,0.0002527151,0.00003208595,0.000009797446,0.00007334887,0.00008517175,0.0256841,0.0003558455,0.9689794,0.004472595,0.00001752487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1802662,0.00106568,0.5455018,0.003814791,0.0003113736,0.0004466116,0.002102813,0.0006755298,0.2658152],"genre_scores_gemma":[0.8899724,0.0007016683,0.06557687,0.0007517629,0.0003268088,0.0004617787,0.002139071,0.0003105128,0.03975905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01618689,"threshold_uncertainty_score":0.05415058,"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","authors":[{"name":"Frédéric Loulergue","is_ca":false},{"name":"Gaétan Hains","is_ca":false},{"name":"Christian Foisy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123506,0.0005920618,0.0004543512,0.001347664,0.001828436,0.003270039,0.001247384,0.0009023255,0.009685311],"category_scores_gemma":[0.002723345,0.0005077077,0.0008761533,0.001451828,0.002266416,0.004122085,0.00197534,0.002158128,0.001825388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222384,"about_ca_system_score_gemma":0.001006906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001544242,"about_ca_topic_score_gemma":0.001037356,"domain_scores_codex":[0.9991552,0.0001603668,0.0000448822,0.000126471,0.0003995318,0.0001136579],"domain_scores_gemma":[0.9990309,0.0003304361,0.00006744519,0.0001629714,0.0002650524,0.000143163],"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.00001226889,0.000007215607,0.00004836369,0.00001879736,0.000002457526,0.00004793906,0.00009060084,0.0004386147,0.0008361391,0.9906274,0.001318509,0.006551697],"study_design_scores_gemma":[0.00001769231,0.00001593816,0.0001190409,0.00001904418,0.00001144641,0.0001925179,0.00006002339,0.009799933,0.00139308,0.9564702,0.03188564,0.0000155027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02315343,0.0005885821,0.9003127,0.001317298,0.0003997931,0.0000813647,0.0004881761,0.001968,0.07169052],"genre_scores_gemma":[0.5989497,0.001224251,0.3358854,0.0008408632,0.0006598469,0.0002628331,0.0006770842,0.0005475127,0.06095245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009685311,"threshold_uncertainty_score":0.03240061,"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","authors":[{"name":"Ronald Garcia","is_ca":true},{"name":"Matteo Cimini","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005403947,0.0005425629,0.0005295421,0.001824446,0.001961601,0.003983997,0.001703834,0.001143867,0.007064381],"category_scores_gemma":[0.01158839,0.0008297406,0.001636904,0.001953029,0.005397667,0.01024472,0.004662179,0.00410424,0.002007512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001770562,"about_ca_system_score_gemma":0.001691565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114297,"about_ca_topic_score_gemma":0.0009677053,"domain_scores_codex":[0.9961163,0.00105682,0.0004192414,0.00084216,0.001191535,0.0003739286],"domain_scores_gemma":[0.9932076,0.00254145,0.0005605094,0.00203843,0.001315558,0.0003363793],"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.00001351693,0.000003881991,0.00008524091,0.00002231871,0.000002821853,0.00001740545,0.0001810111,0.0003089014,0.0003531568,0.9940587,0.0004615689,0.004491474],"study_design_scores_gemma":[0.00003651598,0.0000358057,0.0001747855,0.00004758682,0.00002265459,0.0001304634,0.00009480029,0.004978175,0.001583196,0.9637441,0.02912058,0.00003118202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02353877,0.0009658213,0.9440863,0.001129659,0.0003325259,0.0001401695,0.0003522721,0.0008811342,0.02857341],"genre_scores_gemma":[0.4924603,0.001879694,0.474891,0.0007972319,0.0004483698,0.0004280166,0.0007095388,0.0004649831,0.02792088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007064381,"threshold_uncertainty_score":0.02857918,"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","authors":[{"name":"Farhad Arbab","is_ca":false},{"name":"Farhad Mavaddat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001670977,0.000860569,0.000951241,0.001304594,0.002859794,0.005700251,0.001778605,0.001405621,0.03153536],"category_scores_gemma":[0.00548152,0.00091765,0.001104983,0.001604652,0.00311574,0.009587848,0.005074564,0.002700718,0.007447467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001399216,"about_ca_system_score_gemma":0.001910957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002333407,"about_ca_topic_score_gemma":0.002810366,"domain_scores_codex":[0.997647,0.0006145365,0.0001464636,0.0006909657,0.0004946185,0.0004063218],"domain_scores_gemma":[0.9973636,0.0009206738,0.0001365591,0.0009473122,0.0003776552,0.0002541257],"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.0001096056,0.00004019611,0.0001736204,0.00006300019,0.00001638644,0.0001004481,0.0003171559,0.00231668,0.002387664,0.9539538,0.007569329,0.03295213],"study_design_scores_gemma":[0.00004114606,0.00002516215,0.0001032477,0.00005196296,0.00003749368,0.000168217,0.0001294766,0.01969111,0.006039883,0.9215811,0.05209954,0.00003174867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01551881,0.0007207738,0.8048378,0.001261634,0.0008203513,0.000148806,0.0003196345,0.004037079,0.1723352],"genre_scores_gemma":[0.5384336,0.001515926,0.306084,0.0009367191,0.0006022485,0.000544494,0.001095464,0.003085867,0.1477017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03153536,"threshold_uncertainty_score":0.1054963,"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","authors":[{"name":"Dan R. Ghica","is_ca":true},{"name":"Guy McCusker","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927844,0.0005667218,0.0006291341,0.001346192,0.001855886,0.006472446,0.001722685,0.001191969,0.005119402],"category_scores_gemma":[0.002903778,0.0006055754,0.001117767,0.001071975,0.005188054,0.01100917,0.002749048,0.003110387,0.0011827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002145968,"about_ca_system_score_gemma":0.001492987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001257516,"about_ca_topic_score_gemma":0.001103094,"domain_scores_codex":[0.9985025,0.0004088424,0.0001103979,0.000232895,0.0004648724,0.0002806379],"domain_scores_gemma":[0.9984018,0.0004875592,0.0001325127,0.0003425141,0.000459631,0.0001759708],"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.00002961912,0.000008646643,0.00007167653,0.00002003272,0.000004129741,0.00002460073,0.0002562399,0.0002508023,0.0004262214,0.9960855,0.000586394,0.00223605],"study_design_scores_gemma":[0.00001576407,0.00001316547,0.00007256184,0.00001305633,0.00001031806,0.00009894957,0.0001610329,0.003182941,0.001294258,0.9856128,0.009508776,0.00001644247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1360006,0.001435255,0.6907025,0.006134335,0.0009467601,0.0001144227,0.001023408,0.004329467,0.1593134],"genre_scores_gemma":[0.9234627,0.0003576438,0.05930932,0.0007751005,0.0003004001,0.00008413147,0.0003684829,0.0006556579,0.01468654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006472446,"threshold_uncertainty_score":0.01712614,"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","authors":[{"name":"Luiz Fernando Capretz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002163822,0.0007835997,0.0006500314,0.003802798,0.001931037,0.005899662,0.001346562,0.002858003,0.01691096],"category_scores_gemma":[0.003075548,0.0005826156,0.0005457196,0.006613196,0.002984962,0.006955462,0.001826279,0.004305627,0.0127164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002211314,"about_ca_system_score_gemma":0.00196688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002607557,"about_ca_topic_score_gemma":0.002374175,"domain_scores_codex":[0.9985564,0.0003806131,0.0001445956,0.0001766023,0.0006121993,0.0001295609],"domain_scores_gemma":[0.9981146,0.001083929,0.0001198271,0.0001219203,0.0003786157,0.0001811193],"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.00005454633,0.0001218225,0.0007467643,0.001851421,0.0000172281,0.0005314374,0.001246803,0.0004665439,0.0007662284,0.3217954,0.1654976,0.5069042],"study_design_scores_gemma":[0.000001572523,0.00001424586,0.0001888427,0.0005081388,0.000002651299,0.0001963157,0.00008147927,0.00005369486,0.00006059663,0.02137997,0.9775043,0.000008255336],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001281034,0.7039222,0.0318706,0.02265073,0.0110986,0.0001165874,0.0002677121,0.0003710118,0.2284216],"genre_scores_gemma":[0.0190487,0.7709151,0.03629499,0.01906119,0.02087415,0.0002604753,0.0006381666,0.0003803036,0.1325269],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01691096,"threshold_uncertainty_score":0.05657285,"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","authors":[{"name":"Kim B. Bruce","is_ca":false},{"name":"Angela Schuett","is_ca":false},{"name":"R. H. van Gent","is_ca":false},{"name":"Adrian Fiech","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763747,0.000573089,0.0005302631,0.001281407,0.001095497,0.004045491,0.001912009,0.00075078,0.02638406],"category_scores_gemma":[0.002721034,0.0005992431,0.0008952952,0.001155137,0.001540371,0.004456149,0.003707022,0.002266221,0.007624687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008653805,"about_ca_system_score_gemma":0.002162128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001394284,"about_ca_topic_score_gemma":0.002091501,"domain_scores_codex":[0.9985077,0.0001586954,0.0001009923,0.0002775979,0.0007146441,0.0002403966],"domain_scores_gemma":[0.9987038,0.0003206934,0.0001625905,0.0003542191,0.0003185312,0.000139967],"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.000771406,0.000183703,0.001978816,0.00135878,0.00005875332,0.0007095007,0.0008216961,0.004824202,0.02006549,0.5761161,0.1034352,0.2896764],"study_design_scores_gemma":[0.0000862454,0.0001233962,0.0007242267,0.0001920216,0.00004873474,0.001019735,0.00009299312,0.01636915,0.01364851,0.08610533,0.8815017,0.00008802984],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.0157621,0.0009022959,0.7627837,0.001356855,0.0009337157,0.0005319357,0.004393973,0.03111629,0.1822191],"genre_scores_gemma":[0.2358982,0.002383537,0.551721,0.003317054,0.0005921617,0.001997037,0.01474013,0.01080368,0.1785472],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.02638406,"threshold_uncertainty_score":0,"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","authors":[{"name":"Shaunak Chatterjee","is_ca":false},{"name":"Shuvendu K. Lahiri","is_ca":false},{"name":"Shaz Qadeer","is_ca":false},{"name":"Zvonimir Rakamarić","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002324884,0.001276523,0.001278958,0.002963398,0.001410349,0.002805311,0.002377764,0.001775608,0.003268942],"category_scores_gemma":[0.004952131,0.0008418458,0.003104731,0.002420246,0.003550553,0.006825674,0.002883276,0.003318175,0.001104844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001332117,"about_ca_system_score_gemma":0.001679044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002694677,"about_ca_topic_score_gemma":0.002442491,"domain_scores_codex":[0.9980033,0.0003527686,0.000170217,0.0004619779,0.0007160458,0.0002955793],"domain_scores_gemma":[0.9961643,0.002657046,0.0002010661,0.0006612162,0.0002180338,0.00009830957],"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.0002894332,0.0003231834,0.00295547,0.0006875619,0.0001311287,0.0005372653,0.0006204677,0.06880765,0.02471554,0.6738346,0.006923469,0.2201742],"study_design_scores_gemma":[0.00003882145,0.0001775974,0.0008394095,0.0001056455,0.0001834059,0.0002663701,0.00009787983,0.4046944,0.01963594,0.5660957,0.007798572,0.00006618277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009537532,0.0001657164,0.9846901,0.0001225761,0.00003738809,0.00009840571,0.000306131,0.002725533,0.002316655],"genre_scores_gemma":[0.2568659,0.0004032005,0.7365509,0.0002035378,0.0001514637,0.0003815829,0.001903953,0.0007036637,0.002835851],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003268942,"threshold_uncertainty_score":0.01229531,"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","authors":[{"name":"Patrice Pominville","is_ca":false},{"name":"Feng Qian","is_ca":false},{"name":"Raja Vallée-Rai","is_ca":false},{"name":"Laurie Hendren","is_ca":false},{"name":"Clark Verbrugge","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00231466,0.001479143,0.001306102,0.001193911,0.001040275,0.003309611,0.003850667,0.001121045,0.007540476],"category_scores_gemma":[0.004802115,0.0018248,0.00204424,0.00165659,0.001375461,0.00754363,0.002957879,0.003289199,0.003276232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001032082,"about_ca_system_score_gemma":0.001627601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003829938,"about_ca_topic_score_gemma":0.00545246,"domain_scores_codex":[0.9981611,0.0003177275,0.0002128052,0.000341755,0.0007349109,0.0002317768],"domain_scores_gemma":[0.9979694,0.000838743,0.0001335848,0.0007017992,0.0002542446,0.0001021968],"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.0006968065,0.0003934191,0.002909676,0.0006887007,0.0001941949,0.0002556005,0.0006751137,0.02935613,0.01591516,0.2763499,0.05731698,0.6152483],"study_design_scores_gemma":[0.0004337385,0.0001793339,0.001273855,0.0003276055,0.0003199029,0.0004771738,0.000177295,0.3374782,0.04282139,0.424131,0.1921274,0.0002529689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003195741,0.0003283527,0.9575095,0.0001850757,0.0001057659,0.00007096947,0.0002594775,0.03472098,0.003624124],"genre_scores_gemma":[0.06669068,0.0006144156,0.9075181,0.0003221587,0.0001404079,0.0003219763,0.001108819,0.01597729,0.007306239],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007540476,"threshold_uncertainty_score":0.02522534,"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","authors":[{"name":"Albert Atserias","is_ca":false},{"name":"Nicola Galesi","is_ca":true},{"name":"Pavel Pudlák","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005580738,0.0007835761,0.001123553,0.001333903,0.002370088,0.004849653,0.002406588,0.002186493,0.01620396],"category_scores_gemma":[0.04835328,0.001352743,0.001639885,0.0008834873,0.0040425,0.01102936,0.004767098,0.003347148,0.001575088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002058123,"about_ca_system_score_gemma":0.002196634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007394493,"about_ca_topic_score_gemma":0.001085268,"domain_scores_codex":[0.9916831,0.004807052,0.0004954588,0.0009241809,0.001433071,0.0006571645],"domain_scores_gemma":[0.9135191,0.06908646,0.002569457,0.008093894,0.004272239,0.00245882],"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.0004228598,0.0001164845,0.001461073,0.0001281871,0.00005792726,0.0002545202,0.0005968892,0.01274221,0.002447563,0.9723055,0.001041347,0.008425402],"study_design_scores_gemma":[0.00007386965,0.00004144866,0.0001502624,0.00002604231,0.00002753054,0.0001283797,0.0001251888,0.05796548,0.002772319,0.9363344,0.002338141,0.00001691779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2805445,0.000552213,0.6686799,0.002702575,0.0002401122,0.0003421625,0.0006451036,0.002268835,0.04402454],"genre_scores_gemma":[0.9319841,0.0001617445,0.0595188,0.0003026507,0.0000990306,0.00021397,0.0003767551,0.0002658451,0.007077142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01620396,"threshold_uncertainty_score":0.05420768,"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","authors":[{"name":"Francis Jeffry Pelletier","is_ca":true},{"name":"Geoff Sutcliffe","is_ca":false},{"name":"Christian Suttner","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01816467,0.0009363822,0.0009132443,0.00304708,0.002797557,0.006298611,0.00504596,0.001840684,0.01272497],"category_scores_gemma":[0.03174563,0.001423105,0.002446002,0.003095927,0.007286121,0.01261022,0.006187519,0.007391936,0.004176144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006519506,"about_ca_system_score_gemma":0.009658341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005335833,"about_ca_topic_score_gemma":0.004279106,"domain_scores_codex":[0.9835666,0.004882229,0.001238735,0.00282475,0.00669981,0.0007877474],"domain_scores_gemma":[0.9684931,0.007090729,0.000937693,0.009134316,0.01303927,0.001304812],"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.0000527022,0.00004719602,0.0006096535,0.0002534881,0.00002555341,0.0001023073,0.0005064299,0.00452392,0.0007243844,0.8957189,0.01385477,0.08358078],"study_design_scores_gemma":[0.00004317009,0.0002103987,0.0004968694,0.000352444,0.00006052588,0.000675529,0.0003581445,0.04522413,0.003003363,0.4349298,0.5145473,0.00009828424],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.007587488,0.00160983,0.8760165,0.007958311,0.001141409,0.0005316521,0.0003020578,0.005340934,0.09951186],"genre_scores_gemma":[0.1043498,0.002227233,0.8442574,0.002478211,0.0006643783,0.0007908348,0.0006211043,0.002050811,0.0425603],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01816467,"threshold_uncertainty_score":0.09606516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}