{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":26,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":26,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"d837e8afa381","filters":{"venue":"Journal of Functional Programming"}},"results":[{"id":"W2101225843","doi":"10.1017/s0956796809990074","title":"Revised <sup>6</sup> Report on the Algorithmic Language Scheme","year":2009,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":325,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Emergent BioSolutions (Canada)","funders":"Office of Naval Research; Advanced Research Projects Agency; University of Cambridge; U.S. Department of Defense; National Science Foundation","keywords":"Computer science; Programming language; Lisp; Scheme (mathematics); Syntax; Feature (linguistics); Exception handling; Block (permutation group theory); Class (philosophy); Operator (biology); Functional programming; Theoretical computer science; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02597092254800683,"gpt":0.2593297195254717,"spread":0.2333587969774649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002013039,0.0001818711,0.0002600952,0.0001514498,0.0002511518,0.0003530495,0.0006237822,0.00008045177,0.00003053673],"category_scores_gemma":[0.0003631462,0.0001098064,0.0002780715,0.0004418335,0.00004429033,0.0004163755,0.00005083686,0.0004773018,0.0000495446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008976037,"about_ca_system_score_gemma":0.0001473232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006220072,"about_ca_topic_score_gemma":3.429886e-7,"domain_scores_codex":[0.9977589,0.0001204613,0.0006597238,0.0002581365,0.0008726073,0.0003301836],"domain_scores_gemma":[0.9982834,0.0001653725,0.0006438927,0.0004369143,0.0003350724,0.0001353274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008900904,0.000520653,0.0009616005,0.00003101,0.0002033781,0.002100775,0.001388213,0.0007340653,0.0006936446,0.2003748,0.01114281,0.78176],"study_design_scores_gemma":[0.002835986,0.004302111,0.006187722,0.0002123264,0.0001145211,0.02058835,0.001804343,0.03159837,0.001225782,0.02831101,0.9017103,0.001109143],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0288642,0.001751639,0.9511772,0.0105777,0.001696352,0.0006974945,4.337362e-7,0.0002420986,0.004992931],"genre_scores_gemma":[0.9767061,0.000009597526,0.0198946,0.0007854222,0.001681004,0.000008994631,0.000002760817,0.00001095628,0.0009004854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.947842,"threshold_uncertainty_score":0.4477775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123092976","doi":"10.1017/s0956796809007205","title":"Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages","year":2009,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":270,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language; Haskell; Combinatory logic; Interpreter; Functional programming; Abstract syntax; Data type; Compiler; Abstract syntax tree; Parsing; Semantics (computer science)","retraction":null,"screen_n_in":null,"score":{"opus":0.03776732997830856,"gpt":0.3030129315606968,"spread":0.2652456015823882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00154524,0.0002165466,0.0003555914,0.0001964916,0.0001971642,0.00041584,0.0006193086,0.0001103681,0.0000252434],"category_scores_gemma":[0.0002808339,0.0001690231,0.0003103611,0.0002854553,0.00004315898,0.0006693386,0.00005759873,0.0002939894,0.00001333389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029899,"about_ca_system_score_gemma":0.0002636466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008636566,"about_ca_topic_score_gemma":0.00001152271,"domain_scores_codex":[0.9977777,0.0001256447,0.0006982621,0.000289311,0.0006717914,0.0004372606],"domain_scores_gemma":[0.9980435,0.000197337,0.0006417328,0.0002601475,0.0006840042,0.0001733176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005250766,0.0004654087,0.001523154,0.00008929225,0.0003174806,0.0001383478,0.001317294,0.001743323,0.003465832,0.06337377,0.007068411,0.9199726],"study_design_scores_gemma":[0.01325878,0.01791824,0.02018745,0.0003564567,0.0006600106,0.002532571,0.003083935,0.04013664,0.005516376,0.08567335,0.8077644,0.002911857],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01051659,0.0006469626,0.9852105,0.001313145,0.001411938,0.0004303831,0.000001501311,0.0001093481,0.000359603],"genre_scores_gemma":[0.9757182,0.00000757158,0.02270438,0.0004408449,0.0007340693,0.00001826811,0.000008290845,0.00001441698,0.0003539848],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9652016,"threshold_uncertainty_score":0.6892563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2188068291","doi":"10.1017/s0956796816000022","title":"Well-founded recursion with copatterns and sized types","year":2016,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Computer science; Normalization (sociology); Rewriting; Recursion (computer science); Data type; Theoretical computer science; Pattern matching; Programming language; Algorithm; Discrete mathematics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02022604562355896,"gpt":0.2315528772498165,"spread":0.2113268316262575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006384689,0.0001245385,0.0001994026,0.0001159318,0.0001235463,0.0001786988,0.000226234,0.00005999186,0.00003034443],"category_scores_gemma":[0.00006034031,0.00006446537,0.00006840228,0.0001708677,0.00006995249,0.0006033494,0.00006123306,0.0001354126,0.00002387727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005444108,"about_ca_system_score_gemma":0.00009837611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008128543,"about_ca_topic_score_gemma":0.000008038481,"domain_scores_codex":[0.9987674,0.00007171465,0.0003095946,0.0001903375,0.0004427525,0.0002181571],"domain_scores_gemma":[0.9988919,0.0001677364,0.0003661742,0.0001487789,0.0002927544,0.000132634],"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.000387923,0.0002030628,0.03357055,0.00005798034,0.0001968627,0.0001448657,0.000315047,0.00001590379,0.001740996,0.05650115,0.001237442,0.9056282],"study_design_scores_gemma":[0.0109302,0.009031247,0.03334212,0.0004150364,0.0001676104,0.008091965,0.000407045,0.0006472059,0.002303272,0.04169513,0.8918517,0.001117425],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03836159,0.0005107161,0.957423,0.001805574,0.00101586,0.0001621343,2.036169e-7,0.00006356927,0.000657392],"genre_scores_gemma":[0.9878144,0.0000283529,0.01106941,0.00007601389,0.0003573087,0.000004495534,3.357503e-7,0.00000891701,0.0006407758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9494528,"threshold_uncertainty_score":0.2628821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980256844","doi":"10.1017/s0956796800003841","title":"On characterizations of the basic feasible functionals, Part I","year":2001,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Computer science; Characterization (materials science); Formalism (music); Type (biology); Functional programming; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04068088561351309,"gpt":0.2431295643264491,"spread":0.202448678712936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007017738,0.0001301437,0.0002063064,0.0001597376,0.0002435653,0.0001234471,0.0004949746,0.00006392859,0.00008093788],"category_scores_gemma":[0.0001821554,0.00008285057,0.0002624182,0.0006855635,0.00006314664,0.0004511629,0.00007618977,0.0002505065,0.00002329311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006309956,"about_ca_system_score_gemma":0.0001969329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005698561,"about_ca_topic_score_gemma":0.00000325023,"domain_scores_codex":[0.9981971,0.0001030759,0.000560256,0.0001712369,0.0007473031,0.0002210753],"domain_scores_gemma":[0.9982448,0.0001513081,0.0007235772,0.0002971012,0.0004912158,0.000092045],"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.0001732783,0.001157471,0.03544965,0.00005683985,0.0002909357,0.00003601599,0.0003178918,0.002154879,0.001536101,0.7669567,0.008139619,0.1837306],"study_design_scores_gemma":[0.001509617,0.00121231,0.08026254,0.0001061014,0.00007753122,0.001406897,0.0001459013,0.001346303,0.000720504,0.03352352,0.879327,0.0003617719],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04938006,0.0004689697,0.9326897,0.00369544,0.009084927,0.0004499991,0.000001728167,0.00008667589,0.004142534],"genre_scores_gemma":[0.9965468,0.00001848359,0.001132628,0.0002513326,0.000717142,0.00001040563,0.000002557849,0.000009578992,0.001311042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9471667,"threshold_uncertainty_score":0.3378548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060305077","doi":"10.1017/s0956796801004294","title":"The lambda calculus is algebraic","year":2002,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":32,"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":"Interpretation (philosophy); Computer science; Calculus (dental); Focus (optics); Curry–Howard correspondence; Typed lambda calculus; Natural deduction; Lambda calculus; Lambda; Algebraic number; Simply typed lambda calculus; Algebra over a field; Algorithm; Programming language; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03378854058142485,"gpt":0.2352165955470304,"spread":0.2014280549656055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009478818,0.0001399337,0.0001815749,0.00009415968,0.0004765608,0.0005286154,0.0006775185,0.00006837977,0.00006289548],"category_scores_gemma":[0.0001201545,0.0000840606,0.0002484771,0.0003972076,0.00007954906,0.0005118431,0.00009735458,0.0003220495,0.0001310941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006929461,"about_ca_system_score_gemma":0.00005345578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009687848,"about_ca_topic_score_gemma":0.000004781698,"domain_scores_codex":[0.9981196,0.0000845889,0.0005222444,0.0001805066,0.0007339616,0.0003590976],"domain_scores_gemma":[0.9985554,0.0001957025,0.0004550339,0.0002807849,0.0003652173,0.0001478956],"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.00001438535,0.0001413711,0.0008869622,0.00001370759,0.000139549,0.00007287876,0.0006517076,0.00003564493,0.00006237182,0.1877285,0.02882246,0.7814304],"study_design_scores_gemma":[0.0004870953,0.000381392,0.0006293565,0.00000811573,0.00002055921,0.000993964,0.0001385073,0.005838383,0.0001085723,0.009863801,0.981364,0.0001663074],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002399734,0.007526638,0.9719053,0.008071162,0.005368669,0.0002697526,2.577634e-7,0.0001243185,0.004334199],"genre_scores_gemma":[0.9919264,0.00007357865,0.003741958,0.0004057155,0.001016739,0.000009388504,3.100934e-7,0.00001126372,0.0028146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9895267,"threshold_uncertainty_score":0.509745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995917016","doi":"10.1017/s0956796819000170","title":"POPLMark reloaded: Mechanizing proofs by logical relations","year":2019,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":31,"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; Metatheory; Programming language; Proof assistant; Abstract syntax; Functional programming; Semantics (computer science); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02365988379521138,"gpt":0.2329471454006798,"spread":0.2092872616054684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001191961,0.0001782399,0.0002947752,0.0001840445,0.0002002074,0.0003080565,0.0005228351,0.0001435387,0.0001045616],"category_scores_gemma":[0.0001517831,0.000136144,0.0002318616,0.0005002338,0.00003180427,0.0009352335,0.0001260693,0.000490545,0.0002226365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001313335,"about_ca_system_score_gemma":0.0001559636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009438595,"about_ca_topic_score_gemma":0.000001393799,"domain_scores_codex":[0.9977785,0.0001122864,0.000664253,0.0002951603,0.0007847899,0.00036498],"domain_scores_gemma":[0.9983836,0.0001643065,0.000618247,0.0002610337,0.0003955662,0.0001772332],"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.0001048205,0.0006191479,0.01801708,0.00008031868,0.0002878214,0.00008901103,0.0005539591,0.0005746268,0.005778226,0.7384123,0.02360836,0.2118744],"study_design_scores_gemma":[0.002236452,0.002147365,0.002553473,0.00007132203,0.00007336464,0.002012306,0.0004379583,0.005438785,0.0009299159,0.07021078,0.913143,0.0007452344],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007405157,0.00113783,0.9829104,0.00139162,0.002778895,0.00037935,4.238797e-7,0.0001320006,0.003864331],"genre_scores_gemma":[0.9738715,0.000007619713,0.02304823,0.0001525876,0.0004139065,0.00001066492,0.000004655471,0.000014639,0.002476258],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9664663,"threshold_uncertainty_score":0.5551792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971907018","doi":"10.1017/s0956796806006125","title":"Featherweight generic confinement","year":2006,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":23,"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; Royal Society Te Apārangi","keywords":"Computer science; Programming language; Java; Encapsulation (networking); Type (biology); Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02412810170891239,"gpt":0.2259490081546352,"spread":0.2018209064457228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006563843,0.0001407694,0.0002113218,0.0001588044,0.0001507185,0.0002543942,0.0003923062,0.00005867474,0.00005103761],"category_scores_gemma":[0.00002087863,0.0001044353,0.0001972707,0.0003224247,0.00003861095,0.0003553664,0.00006251022,0.0001753315,0.00003625472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008025442,"about_ca_system_score_gemma":0.0001222883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003785153,"about_ca_topic_score_gemma":0.000007663179,"domain_scores_codex":[0.998336,0.00005570788,0.0005395336,0.0001797851,0.0006078542,0.0002811624],"domain_scores_gemma":[0.9988322,0.00005175134,0.0004864611,0.0001850752,0.0003512113,0.00009331839],"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.00003776815,0.0005657432,0.006186129,0.00003957891,0.0001499615,0.000200436,0.000148614,0.000900153,0.002007468,0.5759544,0.0190163,0.3947934],"study_design_scores_gemma":[0.0008684225,0.0005009149,0.004803681,0.000008936357,0.00002827113,0.000902232,0.00005607639,0.001279814,0.000638488,0.01807409,0.9726054,0.0002336494],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003760468,0.001602105,0.9881501,0.0006315922,0.001919173,0.0001375953,1.348953e-7,0.0000677682,0.003731026],"genre_scores_gemma":[0.9670733,0.000007436807,0.02996868,0.0001494719,0.001557844,0.000009331177,0.000002455101,0.00001056455,0.001220885],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9633129,"threshold_uncertainty_score":0.4258748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2522116950","doi":"10.1017/s0956796816000162","title":"Gradual type-and-effect systems","year":2016,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Abstract interpretation; Decidability; Type theory; Type (biology); Interpretation (philosophy); Model checking; Programming language; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02849093842516767,"gpt":0.2466756690347579,"spread":0.2181847306095902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295925,0.0001455153,0.0002666416,0.0001563836,0.0001257674,0.0002475438,0.000306708,0.00007504134,0.000006302464],"category_scores_gemma":[0.0002330686,0.00007881716,0.0001052468,0.0003027689,0.00006058639,0.0006219548,0.00008598556,0.0001467666,0.00003903194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006564023,"about_ca_system_score_gemma":0.00009995688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001070568,"about_ca_topic_score_gemma":0.000001009914,"domain_scores_codex":[0.9984571,0.0001146889,0.0004382523,0.0001983655,0.0005216833,0.0002698475],"domain_scores_gemma":[0.9985368,0.0002855363,0.0003921868,0.0001782107,0.0004410554,0.000166244],"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.0001035902,0.00009872544,0.01455395,0.00008356944,0.0002036295,0.0001161795,0.0001395441,0.00002641284,0.001828095,0.346949,0.002754669,0.6331427],"study_design_scores_gemma":[0.004941002,0.007498978,0.01164379,0.0002331355,0.0001545972,0.01013493,0.0001593525,0.001320826,0.0008683607,0.01969003,0.9424213,0.0009337262],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01521149,0.002284269,0.9761167,0.000595463,0.005064028,0.0002229297,1.858733e-7,0.00009230934,0.0004126582],"genre_scores_gemma":[0.9965104,0.00002694639,0.00216432,0.00002861821,0.0008232002,0.000007216015,3.375462e-7,0.0000098428,0.0004291277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9812989,"threshold_uncertainty_score":0.321407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127778137","doi":"10.1017/s0956796812000408","title":"An insider's look at LF type reconstruction: everything you (n)ever wanted to know","year":2012,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"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":"Correctness; Computer science; Type (biology); Programming language; Mathematical proof; Debugging; Abstraction; Theoretical computer science; Logical framework; Artificial intelligence; Algorithm; Mathematics; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.03030153773462899,"gpt":0.2591107790901406,"spread":0.2288092413555116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446325,0.0002121881,0.000302408,0.0002948042,0.0003574995,0.0002978402,0.0004481823,0.0001275355,0.0001003905],"category_scores_gemma":[0.0001690997,0.0001728763,0.0001702755,0.0006189057,0.00005134207,0.002257822,0.0001520422,0.0003424033,0.0001683693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002850324,"about_ca_system_score_gemma":0.0001809042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001719935,"about_ca_topic_score_gemma":0.00000949507,"domain_scores_codex":[0.9977068,0.0001496444,0.0006490452,0.0002734689,0.0006954205,0.0005255927],"domain_scores_gemma":[0.9978864,0.00008593813,0.0004975299,0.0003349016,0.0007009,0.000494344],"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.0003047689,0.0006336663,0.09316285,0.00007190843,0.0003279003,0.00009542437,0.003526188,0.0007471899,0.004190453,0.03384268,0.007849631,0.8552473],"study_design_scores_gemma":[0.001348476,0.001759352,0.01791648,0.00009546091,0.00009606734,0.01228847,0.0009973828,0.001582016,0.001541942,0.002721101,0.9588214,0.0008318652],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1647679,0.002774588,0.8073152,0.001344852,0.02138109,0.0004987077,7.079366e-7,0.0002914381,0.001625535],"genre_scores_gemma":[0.953893,0.00001359677,0.04275662,0.0002851093,0.002352934,0.000006836938,0.000002765839,0.00001985519,0.0006692904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9509718,"threshold_uncertainty_score":0.704969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000778709","doi":"10.1017/s0956796803004921","title":"Dependent types ensure partial correctness of theorem provers","year":2004,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"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":"Computer science; Correctness; Programming language; Automated theorem proving; Compiler; Proof assistant; Gas meter prover; Theoretical computer science; Mathematics; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.02036113554305555,"gpt":0.2373861496724686,"spread":0.2170250141294131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009218327,0.0001389133,0.0002708443,0.0001373201,0.0001041075,0.0001161622,0.0004193316,0.00008305918,0.00001404155],"category_scores_gemma":[0.0001296248,0.0001024851,0.0002015772,0.0002905168,0.00008158766,0.0004468478,0.00007398341,0.000242351,0.00001160268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009131182,"about_ca_system_score_gemma":0.0003159786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002800365,"about_ca_topic_score_gemma":0.000008780095,"domain_scores_codex":[0.9982359,0.00006762885,0.0005496056,0.0001822308,0.0007092606,0.0002553151],"domain_scores_gemma":[0.9984735,0.00008022847,0.0006530229,0.0001904932,0.0004867576,0.0001159636],"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.0002984248,0.0008279181,0.00732511,0.0001360511,0.0004019476,0.0001895985,0.001657129,0.01132556,0.002166736,0.6199355,0.0002704007,0.3554657],"study_design_scores_gemma":[0.0273833,0.01859298,0.02637633,0.0007445992,0.0009863997,0.01630231,0.005934944,0.007119022,0.1129001,0.4570118,0.3227135,0.003934707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02717985,0.0006217229,0.9672688,0.0003132276,0.003533119,0.0002259373,4.528892e-7,0.00005365677,0.0008032008],"genre_scores_gemma":[0.9915994,0.000007014655,0.007763933,0.00003420273,0.0004813017,0.000005698788,0.000001046236,0.000009040212,0.00009836971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9644195,"threshold_uncertainty_score":0.4179222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387270836","doi":"10.1017/s0956796823000060","title":"Normalization by evaluation for modal dependent type theory","year":2023,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Normalization (sociology); Type theory; Modal; Haskell; Typed lambda calculus; Curry–Howard correspondence; Programming language; Algorithm; Modular design; Calculus (dental); Theoretical computer science; Algebra over a field; Type (biology); Functional programming; Lambda calculus; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0500007676924014,"gpt":0.2939298202417504,"spread":0.2439290525493489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003653961,0.0001018641,0.0001429132,0.0001858597,0.0001818618,0.0001961256,0.0002752682,0.0000698242,0.00001751225],"category_scores_gemma":[0.0003393564,0.0000823587,0.0001147678,0.0005118592,0.00001955705,0.0005801787,0.00004782906,0.0001099291,0.00002998952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009938601,"about_ca_system_score_gemma":0.000185108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003348839,"about_ca_topic_score_gemma":0.00000185246,"domain_scores_codex":[0.998291,0.0001300964,0.0004061199,0.000168851,0.0007722912,0.000231714],"domain_scores_gemma":[0.9982473,0.0001730948,0.0003842037,0.0001326149,0.0009829826,0.00007980167],"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.0001708865,0.0001612481,0.001280826,0.00005793975,0.0001670785,0.000008652463,0.0004512928,0.006898383,0.00157447,0.2153446,0.01289163,0.7609929],"study_design_scores_gemma":[0.004761635,0.002822594,0.003056265,0.00004193059,0.0002609587,0.0005172551,0.0008216606,0.3009157,0.002169276,0.3505873,0.3332962,0.0007491665],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003919846,0.0005254776,0.9921058,0.0002477001,0.002546781,0.0003557905,6.209473e-7,0.00008496831,0.0002129889],"genre_scores_gemma":[0.9939677,0.00001489402,0.004680301,0.00006583369,0.000573456,0.00003886837,0.00003411506,0.00001234447,0.0006124457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9900479,"threshold_uncertainty_score":0.335849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145575901","doi":"10.1017/s0956796810000158","title":"Formal polytypic programs and proofs","year":2010,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"Irish Research Council; Science Foundation Ireland; Irish Research Council for Science, Engineering and Technology","keywords":"Mathematical proof; Computer science; Haskell; Programming language; Proof assistant; Lemma (botany); Function (biology); Recursion (computer science); Functional programming; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02135160255679166,"gpt":0.2337157939823748,"spread":0.2123641914255831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158502,0.0001637479,0.0002299363,0.0001741091,0.0002339952,0.0004689297,0.0004078211,0.0001153662,0.00001211213],"category_scores_gemma":[0.00009199732,0.0001203365,0.0001429488,0.0002993668,0.000102431,0.001304329,0.0001399983,0.0005642953,0.00001222453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002255821,"about_ca_system_score_gemma":0.0001486947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009715967,"about_ca_topic_score_gemma":0.00001960509,"domain_scores_codex":[0.998311,0.00003856839,0.0004946331,0.0002155703,0.0005341033,0.0004061334],"domain_scores_gemma":[0.9986963,0.00005777023,0.000441953,0.0002118813,0.0003614773,0.0002306381],"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.000026289,0.00014807,0.01097666,0.00002521978,0.00004868065,0.00003240227,0.0002109189,0.000002670587,0.0006292171,0.1506245,0.0001305715,0.8371449],"study_design_scores_gemma":[0.003718429,0.004029118,0.03982213,0.00005199372,0.0001150106,0.01334079,0.0004769234,0.005830778,0.0009749369,0.06525069,0.8653364,0.001052804],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1224743,0.0007694569,0.86777,0.001173458,0.005498167,0.0005793054,1.57864e-7,0.0001994208,0.001535713],"genre_scores_gemma":[0.9628623,0.000004804449,0.03594191,0.00006295532,0.0008699458,0.0000145673,0.000001270076,0.00001080001,0.0002314965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8652058,"threshold_uncertainty_score":0.490718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4317906537","doi":"10.1017/s0956796822000120","title":"Is sized typing for Coq practical?","year":2023,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Strong","keywords":"Computer science; Proof assistant; Type theory; Programming language; Type inference; Normalization property; Inference; Calculus (dental); Type (biology); Theoretical computer science; Mathematical proof; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08618167847390777,"gpt":0.3251560808116329,"spread":0.2389744023377252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170296,0.000129836,0.0002477109,0.0002240552,0.0002348831,0.0003174507,0.0003162172,0.00008384125,0.00002010361],"category_scores_gemma":[0.000551837,0.0001019678,0.0002784055,0.0006305119,0.00003554307,0.0006777698,0.00008779293,0.0002246077,0.00008837453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000060791,"about_ca_system_score_gemma":0.0002631401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003190431,"about_ca_topic_score_gemma":0.000001193695,"domain_scores_codex":[0.9983659,0.0000576373,0.0005275303,0.0002169714,0.0004664856,0.0003654496],"domain_scores_gemma":[0.9980813,0.0005122298,0.00050371,0.0001878006,0.0005715872,0.0001434254],"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.0002812693,0.0003391888,0.002132726,0.0002216286,0.000512475,0.000146193,0.001262293,0.0002785639,0.001149127,0.3538016,0.1011211,0.5387539],"study_design_scores_gemma":[0.001371789,0.0006268837,0.0009158007,0.00002267429,0.00004549045,0.000571515,0.0002666348,0.01018522,0.000295513,0.03459891,0.9508664,0.0002331598],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008584209,0.0001942326,0.9904094,0.005146725,0.002559845,0.0002831032,4.828961e-7,0.0001554588,0.0003923784],"genre_scores_gemma":[0.8870177,0.00002924237,0.1082017,0.0006479745,0.001971445,0.00005763116,0.000005939391,0.00002964781,0.002038759],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8861592,"threshold_uncertainty_score":0.4158128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4296058499","doi":"10.1017/s0956796822000090","title":"ANF preserves dependent types up to extensional equality","year":2022,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"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","keywords":"Computer science; Programming language; Compiler; Type safety; Type (biology); Correctness; Dependent type; Type theory; Lambda calculus","retraction":null,"screen_n_in":null,"score":{"opus":0.05758165745358277,"gpt":0.2833981978909195,"spread":0.2258165404373367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00222888,0.0001485735,0.0002536745,0.0002265868,0.0004642259,0.0002402276,0.0007813752,0.00003962372,0.0001543657],"category_scores_gemma":[0.0001739972,0.0001233153,0.0002092198,0.0004746305,0.00002692843,0.0004901526,0.0005845361,0.000403211,0.00003021161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001638285,"about_ca_system_score_gemma":0.0002518054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003771038,"about_ca_topic_score_gemma":0.000008692595,"domain_scores_codex":[0.9971278,0.0002510126,0.0005964788,0.0002895653,0.001396397,0.000338749],"domain_scores_gemma":[0.9984672,0.0001462437,0.0004286979,0.0002795602,0.0004493256,0.0002289711],"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.0006774195,0.001208487,0.0150108,0.0001109046,0.0005546047,0.0004397379,0.003304623,0.02313894,0.002353258,0.4595184,0.0241204,0.4695624],"study_design_scores_gemma":[0.001517951,0.002560473,0.01234947,0.00001573947,0.00005567071,0.002805792,0.00122081,0.002663458,0.00040209,0.0298482,0.9459667,0.0005937174],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03596845,0.001370105,0.9510715,0.002278329,0.008044061,0.000413847,0.00000236953,0.0001216066,0.0007297181],"genre_scores_gemma":[0.9881483,0.00000244548,0.009362794,0.0003506436,0.000591244,0.00003402912,0.000003114482,0.00001114434,0.001496328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9521798,"threshold_uncertainty_score":0.5028652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414955533","doi":"10.1017/s0956796825100105","title":"Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq","year":2025,"lang":"en","type":"preprint","venue":"Journal of Functional Programming","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Nondeterministic algorithm; Bisimulation; Concurrency; Embedding; Monad (category theory); Coinduction; HOL; Denotational semantics; Leverage (statistics)","retraction":null,"screen_n_in":null,"score":{"opus":0.1625735914183837,"gpt":0.398653377644027,"spread":0.2360797862256433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006617251,0.000411936,0.001181838,0.001386045,0.0003176989,0.001962643,0.0006545862,0.0003587945,0.00003481301],"category_scores_gemma":[0.01103279,0.0003210448,0.0003682057,0.0008477558,0.0001624968,0.000449192,0.001374322,0.001527224,0.000002272139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001290285,"about_ca_system_score_gemma":0.0004327179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001171118,"about_ca_topic_score_gemma":0.0002801313,"domain_scores_codex":[0.9931884,0.000411954,0.00275859,0.000973364,0.002205593,0.0004620551],"domain_scores_gemma":[0.9914939,0.003525261,0.0027944,0.0005463202,0.001375263,0.0002648424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0002402864,0.0001282417,0.2539001,0.0001405887,0.0001109193,0.0001845544,0.0008458655,0.001269297,0.00002108158,0.00130519,0.001403434,0.7404504],"study_design_scores_gemma":[0.003851303,0.0007876715,0.6056979,0.01425969,0.0003128851,0.002577015,0.008652318,0.03213092,0.000007622497,0.1137615,0.2165678,0.001393391],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8866715,0.0306921,0.06851616,0.00105678,0.007157101,0.001827651,0.00002732661,0.0000847476,0.003966583],"genre_scores_gemma":[0.9654784,0.00008445071,0.03084177,0.00007045856,0.00126575,0.00003820975,0.000004734486,0.00002718453,0.002189114],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7390571,"threshold_uncertainty_score":0.9999242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015435703","doi":"10.1017/s0956796800003737","title":"Special issue on Haskell","year":2000,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Haskell; Computer science; Functional programming; Programming language; Implementation","retraction":null,"screen_n_in":null,"score":{"opus":0.01837450198453151,"gpt":0.2374507816948828,"spread":0.2190762797103513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013619,0.0001078217,0.0001687978,0.00009651865,0.0001350299,0.0002311018,0.0004204453,0.00004781313,0.000549453],"category_scores_gemma":[0.00002752235,0.00008770459,0.000156198,0.0002681896,0.00002224369,0.0002945083,0.00002230276,0.0002464992,0.000393281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004825458,"about_ca_system_score_gemma":0.00007977147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002730427,"about_ca_topic_score_gemma":4.129026e-7,"domain_scores_codex":[0.9986486,0.00005927253,0.0003964601,0.0001485458,0.0005367171,0.0002104167],"domain_scores_gemma":[0.9992763,0.00009248027,0.0002089616,0.0001570213,0.0001515071,0.0001137144],"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.00007029172,0.0001696443,0.0001712825,0.000007389331,0.00003968923,0.00007328695,0.0001475496,0.01233436,0.00001051638,0.003184899,0.1076524,0.8761386],"study_design_scores_gemma":[0.000376889,0.0004182217,0.0009685143,0.00005232769,0.000005283791,0.0003577969,0.00001190557,0.001991243,0.00001700112,0.0004432939,0.9952599,0.00009757543],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05063219,0.0004432062,0.6938578,0.006775077,0.02650228,0.0004533841,0.000005076517,0.0003155938,0.2210154],"genre_scores_gemma":[0.8532096,0.00001834342,0.03229025,0.000933602,0.1012989,0.000004040663,0.000006968539,0.00002406664,0.01221427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8876075,"threshold_uncertainty_score":0.6016125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038567975","doi":"10.1017/s0956796813000087","title":"OCaml from the Very Beginning, by John Whitington, Coherent Press, 2013, £ 25.99, US $37.99. ISBN-10: 0957671105 (paperback), 204 pp.","year":2013,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Critical Realism in Sociology","field":"Social Sciences","cited_by":1,"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; Action (physics); Content (measure theory); Physics; Mathematics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.02811315548233341,"gpt":0.2926901556055471,"spread":0.2645770001232137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001669013,0.0002791376,0.0004391716,0.00002429971,0.001047783,0.0004921912,0.0006852595,0.0003330752,0.004042371],"category_scores_gemma":[0.001928393,0.0002063149,0.0003615893,0.0002227992,0.001122537,0.000715939,0.0001348312,0.001009815,0.0002250089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003154211,"about_ca_system_score_gemma":0.0003704187,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008238992,"about_ca_topic_score_gemma":0.0003621986,"domain_scores_codex":[0.9960203,0.0005878851,0.0008775161,0.0003398502,0.001367424,0.0008070798],"domain_scores_gemma":[0.9954958,0.00223809,0.000652728,0.0002477033,0.0009493681,0.000416286],"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.00006815544,0.0002171642,0.005558447,0.000009953246,0.00019959,0.00001236879,0.001637143,0.00005920749,0.0003500335,0.002108168,0.9560966,0.03368315],"study_design_scores_gemma":[0.0005729725,0.000195545,0.005440799,0.00007842638,0.0001033852,0.00001846423,0.004212892,0.00007085949,0.00002854948,0.003285441,0.9857523,0.0002402946],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6822343,0.09597416,0.004725969,0.164196,0.01489324,0.003198907,0.0001632734,0.0004833761,0.03413077],"genre_scores_gemma":[0.9526063,0.009155168,0.006274617,0.006028594,0.01711991,0.0001729583,0.0001378606,0.0001488758,0.008355753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2703719,"threshold_uncertainty_score":0.9983652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163886598","doi":"10.1017/s0956796815000088","title":"A representation theorem for second-order functionals","year":2015,"lang":"en","type":"preprint","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada)","funders":"Agencia Nacional de Promoción Científica y Tecnológica","keywords":"Finitary; Functor; Representation theorem; Representation (politics); Class (philosophy); Haskell; Mathematics; Algebra over a field; Abstraction; Pure mathematics; Computer science; Functional programming; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07853703555114158,"gpt":0.3121527780893357,"spread":0.2336157425381941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003253381,0.0003656695,0.0006751039,0.000429693,0.0002068634,0.0007422144,0.0009043717,0.0003631929,0.00006558454],"category_scores_gemma":[0.0007030771,0.00029867,0.0006461995,0.0004596109,0.00007902817,0.0007137678,0.0004588799,0.0007823131,0.00002215434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002727804,"about_ca_system_score_gemma":0.001174191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001322242,"about_ca_topic_score_gemma":0.000009854452,"domain_scores_codex":[0.99643,0.0002093083,0.00121038,0.000574998,0.001147422,0.0004278899],"domain_scores_gemma":[0.9930987,0.0003968363,0.0019641,0.0005406436,0.003735207,0.0002645023],"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.0007287831,0.0009007882,0.001700701,0.0008237567,0.001897212,0.00009203872,0.001795541,0.01430694,0.0002837319,0.472416,0.09042903,0.4146255],"study_design_scores_gemma":[0.002118756,0.000953667,0.0005212998,0.00008312883,0.0001848907,0.0008054891,0.0003988007,0.008456055,0.0001965701,0.5322168,0.4533969,0.0006676188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009998208,0.001934978,0.98415,0.000855795,0.009696713,0.0008407066,0.00000511789,0.000117435,0.001399428],"genre_scores_gemma":[0.8188449,0.00003184017,0.1674199,0.0004156016,0.008379999,0.0003773709,0.0001453829,0.00008590621,0.004299088],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.817845,"threshold_uncertainty_score":0.9999465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3042329448","doi":"10.1017/s0956796820000179","title":"Review of “Algorithms for Functional Programming” by John David Stone, Springer-Verlag, 2018","year":2020,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Action (physics); Content (measure theory); Functional programming; Artificial intelligence; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03588523343688028,"gpt":0.2572712874423624,"spread":0.2213860540054821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007086961,0.000271938,0.0005308678,0.0001373822,0.0001135876,0.00006489959,0.0002084012,0.0001266535,0.0001569981],"category_scores_gemma":[0.0004089203,0.0002551102,0.000416607,0.0005167514,0.00006982207,0.0003445796,0.0000296859,0.000424362,0.00001154119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055026,"about_ca_system_score_gemma":0.0001329681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001845138,"about_ca_topic_score_gemma":3.025282e-7,"domain_scores_codex":[0.9976408,0.00003470059,0.001085259,0.0002282839,0.0006698107,0.0003411451],"domain_scores_gemma":[0.9981284,0.0001554306,0.0004984319,0.000135163,0.0007846545,0.0002979685],"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.0005262711,0.0005908781,0.0008833702,0.01130076,0.001386353,0.00001782661,0.0003045314,0.1115713,0.002052502,0.0002736797,0.1864616,0.6846309],"study_design_scores_gemma":[0.002539725,0.001085076,0.000243182,0.002704176,0.0004155316,0.0001886461,0.0002131851,0.07202046,0.001408646,0.00003935397,0.9185205,0.0006215543],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008189154,0.05061401,0.9434757,0.001689367,0.00236311,0.0006494381,0.00003821862,0.0002045671,0.0001466652],"genre_scores_gemma":[0.02101344,0.009988518,0.9598983,0.002369706,0.005569046,0.0001892209,0.0003469027,0.0002668606,0.0003580221],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7320588,"threshold_uncertainty_score":0.9999901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4236518552","doi":"10.1017/s0956796815000027","title":"JFP volume 24 issue 6 Cover and Back matter","year":2014,"lang":"en","type":"paratext","venue":"Journal of Functional Programming","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"University of Cambridge; De Montfort University","keywords":"Computer science; Cover (algebra); Volume (thermodynamics); Content (measure theory); Action (physics); Data science; Information retrieval; Mechanical engineering; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03532317975816764,"gpt":0.2115671694711731,"spread":0.1762439897130055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007846191,0.0002513847,0.0008050509,0.0003628628,0.0001509087,0.0003091296,0.0001928633,0.0002007265,0.3563962],"category_scores_gemma":[0.00004364386,0.0002543682,0.0002882702,0.0001042337,0.0001527542,0.000316797,0.000115555,0.0004043578,0.6291713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001302794,"about_ca_system_score_gemma":0.00003817766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001945375,"about_ca_topic_score_gemma":2.707029e-7,"domain_scores_codex":[0.998194,0.00001435886,0.001022618,0.0003793262,0.00008023266,0.0003094219],"domain_scores_gemma":[0.9980825,0.00005495277,0.001442866,0.0001695986,0.0001191328,0.0001309879],"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.00003390146,0.0000388601,0.00258239,0.00009607783,0.0002902753,0.000001887424,0.00007370927,0.0001693704,4.972406e-7,0.0001658145,0.9955486,0.0009986367],"study_design_scores_gemma":[0.0004971477,0.00009042771,0.0006863035,0.00006903344,0.00003055402,0.0000572333,0.00008382584,0.0001205646,7.774893e-7,0.0001218355,0.997978,0.0002642401],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0007079237,0.0147857,0.004840182,0.001312094,0.04115629,0.0002238798,0.0003006099,0.000005794903,0.9366675],"genre_scores_gemma":[0.001057608,0.0005513449,0.001054443,0.0004466907,0.002467808,0.000004772404,0.00002340229,0.00003111061,0.9943628],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2727751,"threshold_uncertainty_score":0.9999909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158277676","doi":"10.1017/s0956796807006260","title":"SMIL 2.0 Interactive Multimedia for Web and Mobile Devices by C. A. Dick Bulterman and Lloyd Rutledge, Springer X.media.publishing, 2004, 440pp, ISBN 3-540-20234-X","year":2007,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Multimedia; Publishing; World Wide Web; Interactive media; Action (physics); Mobile device; Computer graphics (images); Art","retraction":null,"screen_n_in":null,"score":{"opus":0.02415732403815813,"gpt":0.3204166327895847,"spread":0.2962593087514266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002276058,0.0001495474,0.0002533121,0.0002966794,0.0004585552,0.0003236004,0.0002968277,0.0002156678,0.0001057359],"category_scores_gemma":[0.001594645,0.0001349916,0.00009125857,0.0002306305,0.0004585233,0.001051663,0.0001038347,0.0005298665,0.00000436526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001252571,"about_ca_system_score_gemma":0.000152667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001478296,"about_ca_topic_score_gemma":0.0008169255,"domain_scores_codex":[0.9984176,0.0000888136,0.0005092155,0.0002002619,0.0004232003,0.0003609468],"domain_scores_gemma":[0.996955,0.001547294,0.0005460404,0.0001245344,0.0005498632,0.0002772354],"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.0003335676,0.0003936282,0.03397665,0.00004382252,0.0001981043,0.000009991974,0.009570854,0.000003370047,0.001764701,0.0008391905,0.022725,0.9301412],"study_design_scores_gemma":[0.00139712,0.000181606,0.008241106,0.00007001015,0.00005397743,0.00003456129,0.007276331,0.0003716826,0.000194083,0.0003538524,0.9816398,0.0001858421],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9564013,0.01317224,0.01255585,0.01021002,0.003341923,0.001381758,0.0000378747,0.0002183693,0.00268061],"genre_scores_gemma":[0.9826167,0.0004105335,0.01549929,0.0002440728,0.0007714765,0.00003502288,0.00001890778,0.00001954681,0.0003844772],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9589148,"threshold_uncertainty_score":0.5504799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172214464","doi":"10.1017/s0956796810000250","title":"Special Issue Dedicated to ICFP 2008 Editorial","year":2010,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Scope (computer science); Computer science; Library science; Cover (algebra); Operations research; Data science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.007906516086205687,"gpt":0.2235411963555159,"spread":0.2156346802693102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003018161,0.0001084345,0.0001469141,0.0001868392,0.0000765333,0.00008040836,0.0001215816,0.0001239132,0.0007568049],"category_scores_gemma":[0.0002613147,0.00009984407,0.00008828157,0.0002836311,0.0000217944,0.0001666719,0.00001291594,0.0005909179,0.0001219737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003815252,"about_ca_system_score_gemma":0.00006493687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001880533,"about_ca_topic_score_gemma":0.000004959897,"domain_scores_codex":[0.9988796,0.000009617641,0.0003571459,0.00008080757,0.0004844454,0.0001883643],"domain_scores_gemma":[0.9991912,0.00005153851,0.00008306964,0.00007628078,0.0003721842,0.0002257891],"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.0001018798,0.00007972094,0.0005357226,0.00001219645,0.00009929886,0.00001671012,0.0001479316,0.1199564,0.002068855,0.00004900828,0.7505933,0.126339],"study_design_scores_gemma":[0.0005124747,0.0000984653,0.0003272963,0.00001513687,0.00002253515,0.00009553064,0.00007545998,0.005050156,0.000487516,0.00002827512,0.9931539,0.000133273],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.03810227,0.0001005998,0.1523759,0.001375725,0.8036073,0.0002693156,0.000005339299,0.0003420299,0.003821434],"genre_scores_gemma":[0.01598421,0.00000778703,0.1793317,0.00007938779,0.8043048,0.000005543703,0.000007666564,0.00003782101,0.0002410456],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.2425606,"threshold_uncertainty_score":0.8286483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244321449","doi":"10.1017/s0956796814000148","title":"JFP volume 24 issue 2-3 Cover and Back matter","year":2014,"lang":"en","type":"paratext","venue":"Journal of Functional Programming","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Cover (algebra); Volume (thermodynamics); Content (measure theory); Action (physics); Information retrieval; Data science; Physics; Mathematics; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03529181957938049,"gpt":0.2116999839248436,"spread":0.1764081643454631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007928435,0.0002552581,0.0008152901,0.0003680479,0.0001536599,0.0003118745,0.0001959415,0.0002037263,0.3593671],"category_scores_gemma":[0.00004372562,0.0002583682,0.0002922103,0.0001060839,0.0001542483,0.0003210524,0.0001171743,0.0004095111,0.6295181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001318455,"about_ca_system_score_gemma":0.00003878642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001937834,"about_ca_topic_score_gemma":2.732447e-7,"domain_scores_codex":[0.99817,0.00001465567,0.001035661,0.0003844352,0.00008153532,0.0003136925],"domain_scores_gemma":[0.9980584,0.00005529702,0.001459865,0.0001723125,0.0001210855,0.0001330659],"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.00003451469,0.00003930975,0.002558114,0.00009744713,0.0002934117,0.000001922942,0.00007450664,0.0001725288,5.067191e-7,0.0001659537,0.9955473,0.001014496],"study_design_scores_gemma":[0.000506248,0.00009162828,0.0006784043,0.00006967603,0.00003101886,0.00005828165,0.00008717329,0.0001234269,7.914547e-7,0.0001199257,0.9979651,0.0002683341],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0007313093,0.01492648,0.004861873,0.001355413,0.04240043,0.0002288227,0.0003070403,0.000005967666,0.9351827],"genre_scores_gemma":[0.001000279,0.0005712604,0.001078734,0.000450929,0.002578388,0.000004867165,0.00002381704,0.00003171304,0.99426],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.270151,"threshold_uncertainty_score":0.9999868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405259879","doi":"10.1017/s095679682400011x","title":"An example of goal-directed, calculational proof","year":2024,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Proof of concept; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0351478444025809,"gpt":0.277750935814294,"spread":0.2426030914117131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005909678,0.0000896561,0.0001442769,0.0001958105,0.00007847473,0.0001830728,0.0003174265,0.00004541381,0.00004486713],"category_scores_gemma":[0.00003005335,0.00006713615,0.0001135978,0.0003761041,0.0000320611,0.001359319,0.00006746186,0.0001965548,0.000004150652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004141777,"about_ca_system_score_gemma":0.0002197991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003335484,"about_ca_topic_score_gemma":0.000001762779,"domain_scores_codex":[0.9985971,0.00004678575,0.0004192995,0.0001847675,0.000615266,0.0001367574],"domain_scores_gemma":[0.999042,0.0001244237,0.0001890758,0.0001807568,0.000361941,0.0001017774],"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.00005274243,0.0003300555,0.0007452484,0.00007789694,0.0001157807,0.00007656607,0.000339395,0.005401001,0.00630655,0.03752469,0.003512911,0.9455172],"study_design_scores_gemma":[0.0006310527,0.0009810365,0.0145657,0.000401129,0.00004848888,0.001112083,0.00006491292,0.7119071,0.002237574,0.00947585,0.2582798,0.0002951875],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01208844,0.000981138,0.9853994,0.000184338,0.00111615,0.0000730932,0.00000314139,0.00006979335,0.00008455328],"genre_scores_gemma":[0.7001188,0.000007150987,0.2989375,0.00003101455,0.0007868222,0.000004368772,0.00001617598,0.00001053216,0.00008765874],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.945222,"threshold_uncertainty_score":0.2737733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405809911","doi":"10.1017/s0956796824000121","title":"A simple blame calculus for explicit nulls","year":2024,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Blame; Computer science; Type (biology); Calculus (dental); Function (biology); Simple (philosophy); Programming language; Null (SQL); Algebra over a field; Mathematics; Pure mathematics; Philosophy; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.03697686058846159,"gpt":0.2798679575272404,"spread":0.2428910969387788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035092,0.0001561682,0.0002452698,0.0002226691,0.0001543178,0.0006544145,0.0004098726,0.00008257444,0.00002252041],"category_scores_gemma":[0.0001159832,0.0001167929,0.0003679531,0.0004115601,0.00002773516,0.0007062879,0.00007171412,0.000239324,0.00003901192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001059109,"about_ca_system_score_gemma":0.0002275066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001108015,"about_ca_topic_score_gemma":0.000003660715,"domain_scores_codex":[0.9983081,0.00004066014,0.000543312,0.0002593919,0.000495711,0.0003527864],"domain_scores_gemma":[0.9988361,0.0002571825,0.0002197557,0.0001828928,0.000349357,0.0001547012],"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.00004208825,0.0001290452,0.000215473,0.0001715255,0.0002247112,0.000129095,0.0005053056,0.0002253542,0.0007939905,0.5375671,0.01206845,0.4479279],"study_design_scores_gemma":[0.0004832919,0.0007276589,0.0001329565,0.00003195404,0.00004605678,0.000809098,0.0001441585,0.0201297,0.0003683907,0.03769295,0.9392233,0.0002104656],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001141199,0.00198655,0.9925169,0.0006826421,0.002937562,0.0002687474,8.552702e-7,0.0001371446,0.0003283946],"genre_scores_gemma":[0.9803855,0.0000101881,0.01687145,0.0001315442,0.001818218,0.00004493335,0.000003746836,0.00001959587,0.0007147807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9792444,"threshold_uncertainty_score":0.6310534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998690205","doi":"10.1017/s0956796800003890","title":"Special issue on Semantics, Applications, and Implementation of Program Generation","year":2000,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Compiler; Context (archaeology); Implementation; Semantics (computer science); Theme (computing); Relevance (law); Programming language; Software engineering; Program transformation; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.02157977245242998,"gpt":0.2926895793159914,"spread":0.2711098068635614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000396411,0.00007852067,0.0001336026,0.00009136456,0.00009876632,0.0001269579,0.0001463475,0.00003266215,0.00006945871],"category_scores_gemma":[0.000006380245,0.00006893081,0.00005899025,0.0001994987,0.00002292364,0.0002330432,0.00001579625,0.00009483298,0.00000900837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002649007,"about_ca_system_score_gemma":0.00005905343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006373265,"about_ca_topic_score_gemma":0.000002552247,"domain_scores_codex":[0.9989371,0.00004444169,0.000437391,0.000126685,0.0003409453,0.0001134059],"domain_scores_gemma":[0.9992881,0.00003574944,0.0003159292,0.0001014312,0.0002031692,0.00005557418],"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.00001289505,0.0001191883,0.000677908,0.00001833016,0.00002840252,0.000001838336,0.0001366181,0.001234591,0.00007578688,0.002910155,0.004840863,0.9899434],"study_design_scores_gemma":[0.0006869384,0.0008896165,0.005837388,0.00004196137,0.00002126708,0.0001471905,0.0001042635,0.006972072,0.0003337622,0.0003156222,0.9845256,0.0001243614],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1900823,0.0004873235,0.7999744,0.002454164,0.002696503,0.001551634,0.000009787216,0.0001294006,0.002614537],"genre_scores_gemma":[0.9317625,0.00004297663,0.05288684,0.00007980053,0.01496386,0.00002647381,0.00002550657,0.000008656587,0.0002033759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.989819,"threshold_uncertainty_score":0.2810917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}