{"meta":{"query_hash":"d837e8afa381","filters":{"venue":"Journal of Functional Programming"},"cohort_total":26,"direct_labels_cover":0,"predictions_cover":26,"exported":26,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d837e8afa381","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Functional+Programming"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024128101708912393,"score_gpt":0.2259490081546352,"score_spread":0.20182090644572281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971907018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053615283,0.000562476,0.8518944,0.00097286457,0.00046155453,0.0002929698,0.00066509,0.02901121,0.062524244],"genre_scores_gemma":[0.6078277,0.0008829871,0.30409142,0.0025437826,0.00027557398,0.00055675814,0.0015326649,0.010642995,0.07164607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974589,0.0002948759,0.00016951993,0.00046330408,0.0010892284,0.0005242368],"domain_scores_gemma":[0.99533635,0.00048886705,0.00029512358,0.0032234823,0.0004947606,0.00016144532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077404,0.000653246,0.00080776337,0.00076286215,0.0011556421,0.002159024,0.003118555,0.0016083386,0.013974568],"category_scores_gemma":[0.006462268,0.0007448948,0.001364594,0.0008238488,0.0025503216,0.005946095,0.008921678,0.0023523576,0.0038237046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006238738,0.00020715219,0.004381483,0.00068471185,0.00009881223,0.0009839879,0.0017920306,0.005248524,0.064999886,0.7041685,0.034102563,0.18270846],"study_design_scores_gemma":[0.00010326477,0.00020866981,0.003149306,0.00038065648,0.00015715227,0.0023649458,0.00034292464,0.039071657,0.061217654,0.26948977,0.6233139,0.00020020595],"about_ca_topic_score_codex":0.0023541825,"about_ca_topic_score_gemma":0.0027865309,"teacher_disagreement_score":0.013974568,"about_ca_system_score_codex":0.0012024421,"about_ca_system_score_gemma":0.0012704047,"threshold_uncertainty_score":0.04674959},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040680885613513094,"score_gpt":0.24312956432644905,"score_spread":0.20244867871293595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980256844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041372497,0.00085779524,0.93582094,0.0005737519,0.000116153205,0.00007344319,0.00052054663,0.0003562276,0.020308651],"genre_scores_gemma":[0.6265512,0.0020251374,0.35359266,0.00076535216,0.00052873546,0.00062845985,0.0013509035,0.00041455787,0.01414299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873084,0.0002610541,0.00012412062,0.0003009105,0.000372274,0.00021067528],"domain_scores_gemma":[0.9976877,0.0009970741,0.00035625332,0.00040481752,0.00042752805,0.0001266484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020991205,0.00093672937,0.00053328247,0.0013867624,0.0010374236,0.0025968691,0.0015706463,0.0011754322,0.006507786],"category_scores_gemma":[0.0043518697,0.0005526414,0.0011754826,0.0023979612,0.0030561816,0.009959628,0.0028063648,0.0026434273,0.0010794419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003071196,0.000020371044,0.00056398025,0.00008068153,0.000005838985,0.000071595656,0.00035654963,0.002854871,0.0029005231,0.9826105,0.0008082636,0.00969612],"study_design_scores_gemma":[0.000008779131,0.000051213523,0.0004772246,0.00007518925,0.0000142660365,0.00020119325,0.00015033425,0.018191852,0.0031537958,0.9600084,0.01763821,0.000029528557],"about_ca_topic_score_codex":0.00094795495,"about_ca_topic_score_gemma":0.0006196901,"teacher_disagreement_score":0.006507786,"about_ca_system_score_codex":0.0010313021,"about_ca_system_score_gemma":0.00070709834,"threshold_uncertainty_score":0.021770716},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021579772452429976,"score_gpt":0.2926895793159914,"score_spread":0.2711098068635614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998690205","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011028178,0.023985425,0.029374035,0.056476086,0.5692616,0.00042420375,0.0017072586,0.0029289885,0.31473964],"genre_scores_gemma":[0.007815743,0.023992876,0.009697493,0.009814723,0.26122022,0.00035026675,0.003256353,0.003476285,0.68037605],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99679655,0.0005325754,0.000349758,0.00055624626,0.0015048026,0.0002601049],"domain_scores_gemma":[0.9928463,0.0021061073,0.00037284495,0.0009471514,0.002712095,0.0010155407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036039131,0.0014140866,0.0014132513,0.0024114053,0.0022317723,0.009289023,0.0021348079,0.0031674122,0.17226642],"category_scores_gemma":[0.011151977,0.00076232734,0.0014148861,0.0023893486,0.0016019912,0.008035163,0.003062757,0.0044487067,0.071244635],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032043412,0.000033758522,0.00006912466,0.00027346867,0.0000093394765,0.000056697078,0.00009961443,0.00017110734,0.00041641053,0.0199143,0.9362491,0.042675097],"study_design_scores_gemma":[0.0000067324945,0.000016766488,0.00010692517,0.000109450484,0.000004921987,0.00006053666,0.000031508334,0.00019764733,0.00012321901,0.0066223904,0.99271375,0.00000612209],"about_ca_topic_score_codex":0.0014861157,"about_ca_topic_score_gemma":0.0018387187,"teacher_disagreement_score":0.17226642,"about_ca_system_score_codex":0.0021887626,"about_ca_system_score_gemma":0.0031331135,"threshold_uncertainty_score":0.5762886},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020361135543055554,"score_gpt":0.2373861496724686,"score_spread":0.21702501412941305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000778709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029106813,0.0002098483,0.9541885,0.00073500135,0.00010183916,0.0001467571,0.0004683773,0.010433776,0.0046090316],"genre_scores_gemma":[0.51503503,0.00057707453,0.46957472,0.0011016165,0.00028835417,0.00065605546,0.0014016286,0.0056000776,0.0057654614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9708043,0.009160961,0.0034570782,0.0035885517,0.010060379,0.002928731],"domain_scores_gemma":[0.84670424,0.08627766,0.0056136944,0.038797636,0.020909237,0.0016975637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02002434,0.001479387,0.0020470766,0.0029676813,0.003023964,0.0063071814,0.004464246,0.0031723448,0.006411438],"category_scores_gemma":[0.1247549,0.0035614106,0.0037868265,0.00217343,0.00739152,0.013950331,0.009987063,0.0058056246,0.0032056875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019177136,0.00037729854,0.012316968,0.001568107,0.00039319086,0.0012695128,0.0036028852,0.040290534,0.038983572,0.7235113,0.013233348,0.16253561],"study_design_scores_gemma":[0.0007429198,0.00030348467,0.0016604004,0.00029096185,0.0005219853,0.0010611387,0.00027278063,0.19084124,0.16371518,0.60898346,0.031412724,0.00019372285],"about_ca_topic_score_codex":0.0018688623,"about_ca_topic_score_gemma":0.0016777697,"teacher_disagreement_score":0.02002434,"about_ca_system_score_codex":0.0027216554,"about_ca_system_score_gemma":0.0049318084,"threshold_uncertainty_score":0.10590011},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Haskell; Computer science; Functional programming; Programming language; Implementation","score_opus":0.01837450198453151,"score_gpt":0.23745078169488282,"score_spread":0.21907627971035132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015435703","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011841522,0.03472949,0.014370564,0.078652054,0.5074822,0.00035600914,0.0030274615,0.0054086293,0.3547895],"genre_scores_gemma":[0.007820935,0.02590822,0.006177948,0.020153718,0.24330978,0.00035056812,0.0063322815,0.005629105,0.6843174],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962298,0.00057656167,0.00038984665,0.000589768,0.0018596824,0.00035431783],"domain_scores_gemma":[0.9935607,0.0017092439,0.00030351788,0.0008977535,0.0024568564,0.0010718656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030170197,0.0015902513,0.0013938221,0.0030605493,0.0028252634,0.0061141984,0.0019480898,0.0030240503,0.24201967],"category_scores_gemma":[0.011772972,0.00055064727,0.001246096,0.002305556,0.0009798271,0.006819139,0.0041458597,0.0040478297,0.13729273],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017387589,0.000014238933,0.000032789503,0.0001291768,0.0000042921674,0.00005501587,0.000050726947,0.00004133794,0.00024729993,0.005134684,0.9579744,0.036298722],"study_design_scores_gemma":[0.0000034318136,0.00001061439,0.00006567269,0.00008873668,0.0000028908,0.00009055834,0.000018473589,0.00005556718,0.00009036715,0.0023654902,0.9972036,0.000004776198],"about_ca_topic_score_codex":0.0008304142,"about_ca_topic_score_gemma":0.0013384484,"teacher_disagreement_score":0.24201967,"about_ca_system_score_codex":0.0018345707,"about_ca_system_score_gemma":0.0027661894,"threshold_uncertainty_score":0.8096365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Action (physics); Content (measure theory); Physics; Mathematics; Quantum mechanics","score_opus":0.028113155482333414,"score_gpt":0.29269015560554706,"score_spread":0.26457700012321367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038567975","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017438282,0.64076626,0.0524449,0.023732528,0.009054586,0.000105256084,0.005245633,0.0106495395,0.25625753],"genre_scores_gemma":[0.011524688,0.28256303,0.02525625,0.004083506,0.0024218233,0.00025941493,0.0043527684,0.0102490485,0.65928936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989876,0.0001172072,0.00015315125,0.00022752519,0.00043698295,0.00007756815],"domain_scores_gemma":[0.9980413,0.0009004313,0.00015229633,0.00024560228,0.00049736333,0.00016303585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015195633,0.0021523712,0.0012117173,0.0024876287,0.001072507,0.006228449,0.0016219938,0.0018642313,0.16369857],"category_scores_gemma":[0.006646948,0.0019849904,0.00065105944,0.003921758,0.0016986342,0.012768464,0.0031660392,0.0025529468,0.12235548],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006755574,0.000016638882,0.00008093101,0.0010064567,0.000012034015,0.000045873217,0.00025705085,0.00022479551,0.00063361187,0.011215004,0.64565516,0.34078497],"study_design_scores_gemma":[0.000006901887,0.000008537083,0.00019939555,0.000695329,0.000008243084,0.0001613352,0.00009275381,0.00018358813,0.00035479382,0.004806969,0.99347055,0.000011512522],"about_ca_topic_score_codex":0.008489721,"about_ca_topic_score_gemma":0.012594451,"teacher_disagreement_score":0.16369857,"about_ca_system_score_codex":0.001767352,"about_ca_system_score_gemma":0.0027263178,"threshold_uncertainty_score":0.54762626},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03378854058142485,"score_gpt":0.23521659554703037,"score_spread":0.2014280549656055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060305077","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022000093,0.01076125,0.46391985,0.026993787,0.0019303189,0.000076921846,0.00073669857,0.0010709343,0.4725101],"genre_scores_gemma":[0.7582834,0.013749428,0.110736355,0.0050280346,0.0047593983,0.0002586478,0.000685645,0.0007001483,0.10579895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972682,0.0004914266,0.00016223855,0.0005577796,0.0013239902,0.00019636801],"domain_scores_gemma":[0.99764794,0.000895849,0.00017465101,0.0005064912,0.0006014687,0.00017352853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019313571,0.000568175,0.0009764392,0.0009419144,0.0030397782,0.008087255,0.0010683093,0.0014029925,0.008335293],"category_scores_gemma":[0.0052879257,0.00054618565,0.0011095263,0.0015187864,0.008679739,0.014915776,0.005137285,0.005286357,0.0025496741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025356433,0.0000024341152,0.000027942171,0.000017430108,0.0000024391393,0.000015442307,0.000112253976,0.00013648292,0.000064032596,0.9962031,0.0010172959,0.002398693],"study_design_scores_gemma":[0.0000037409764,0.0000038443945,0.000047208116,0.00001301748,0.0000030146748,0.00005466694,0.000033486423,0.0004605025,0.00006962616,0.96080923,0.038495805,0.000005790834],"about_ca_topic_score_codex":0.0024908823,"about_ca_topic_score_gemma":0.0014750087,"teacher_disagreement_score":0.008335293,"about_ca_system_score_codex":0.002213101,"about_ca_system_score_gemma":0.0021074754,"threshold_uncertainty_score":0.027884305},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025970922548006828,"score_gpt":0.25932971952547174,"score_spread":0.23335879697746492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101225843","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072120763,0.013792905,0.05265686,0.0827425,0.06908129,0.00025780703,0.0033024263,0.0011378516,0.7698162],"genre_scores_gemma":[0.08846552,0.015565518,0.027228901,0.007913391,0.020044478,0.00037756437,0.0040845415,0.0013194866,0.8350006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99746656,0.0008124598,0.0003403109,0.00030887325,0.0008476168,0.0002241726],"domain_scores_gemma":[0.99217176,0.0030193771,0.00026867742,0.000848229,0.0034269097,0.0002649482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004771677,0.0007359627,0.0006055298,0.0015577667,0.001759148,0.005707163,0.0014305495,0.0017595039,0.0660365],"category_scores_gemma":[0.010174963,0.0004734978,0.0011503082,0.0017028555,0.0025922663,0.0062113656,0.0021770233,0.0045376904,0.024501579],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057535293,0.000017284194,0.00015349302,0.0001417449,0.00000884414,0.00007595035,0.00026488444,0.00060155586,0.00040653395,0.62898093,0.34090406,0.028387163],"study_design_scores_gemma":[0.000005323788,0.00001134989,0.00016736763,0.00005868828,0.000004764382,0.000054965487,0.00006309365,0.00024855483,0.0003613669,0.017305452,0.9817105,0.000008579472],"about_ca_topic_score_codex":0.005519446,"about_ca_topic_score_gemma":0.0035328332,"teacher_disagreement_score":0.0660365,"about_ca_system_score_codex":0.0039178594,"about_ca_system_score_gemma":0.0015597407,"threshold_uncertainty_score":0.22091407},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03776732997830856,"score_gpt":0.30301293156069675,"score_spread":0.2652456015823882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123092976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042662323,0.00010055875,0.9481027,0.00019167564,0.000110455025,0.000063024025,0.00011383145,0.003137474,0.005517945],"genre_scores_gemma":[0.5989597,0.00017244321,0.38615927,0.00034335608,0.00008335532,0.000113280985,0.0002083451,0.0019434517,0.0120169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986583,0.00037945402,0.00013838311,0.00018474823,0.00045898728,0.00018019837],"domain_scores_gemma":[0.99771094,0.00066703407,0.00017290168,0.0008366957,0.0004986404,0.00011384808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001958902,0.00040801047,0.0004789928,0.0005551039,0.0005637479,0.002790968,0.0013034646,0.0007674112,0.003112995],"category_scores_gemma":[0.0040772106,0.00058996235,0.001198951,0.000388735,0.0036744582,0.004060323,0.0019430454,0.0021350333,0.0008897921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024969064,0.0000729987,0.0011283183,0.00018885118,0.00003153183,0.0006818782,0.0018106153,0.027866486,0.030204274,0.90289193,0.0017335902,0.033139925],"study_design_scores_gemma":[0.000104024904,0.00017111386,0.0003721162,0.000113895345,0.0000929218,0.00041190351,0.00023262275,0.18768068,0.07074615,0.70544916,0.034526747,0.0000986521],"about_ca_topic_score_codex":0.00075645477,"about_ca_topic_score_gemma":0.00108575,"teacher_disagreement_score":0.003112995,"about_ca_system_score_codex":0.0011719296,"about_ca_system_score_gemma":0.0010926854,"threshold_uncertainty_score":0.010414004},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030301537734628993,"score_gpt":0.25911077909014063,"score_spread":0.22880924135551164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127778137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028546395,0.00033634857,0.9500151,0.0063118106,0.00033825389,0.00004329542,0.00008346421,0.0039011147,0.010424146],"genre_scores_gemma":[0.40914786,0.00035313945,0.5689084,0.0026034613,0.0001814973,0.000056792116,0.00017208107,0.0024924828,0.016084341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935638,0.002677016,0.00027728366,0.00093505724,0.0018584636,0.0006884088],"domain_scores_gemma":[0.98550075,0.005955258,0.0006686781,0.0054629133,0.00206822,0.00034416447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012259358,0.00043195792,0.0009631136,0.00086037576,0.0029165791,0.0046364646,0.0025624402,0.0019398477,0.010414746],"category_scores_gemma":[0.024731537,0.0009150159,0.0014176375,0.00089298736,0.0067367307,0.018324487,0.0049147713,0.0053437855,0.0016421034],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043755825,0.0000841788,0.005031268,0.00015921371,0.000045163495,0.0004380117,0.0033831024,0.0066960366,0.00772754,0.82811254,0.015702752,0.13218252],"study_design_scores_gemma":[0.00007202774,0.00021456947,0.0010264721,0.00035471117,0.00011614089,0.0017973481,0.0029186665,0.0942838,0.052444275,0.69774884,0.14868788,0.00033533276],"about_ca_topic_score_codex":0.004326608,"about_ca_topic_score_gemma":0.005018423,"teacher_disagreement_score":0.012259358,"about_ca_system_score_codex":0.0019355622,"about_ca_system_score_gemma":0.001910768,"threshold_uncertainty_score":0.064834476},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021351602556791662,"score_gpt":0.23371579398237477,"score_spread":0.2123641914255831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145575901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020001423,0.0005463509,0.9641462,0.0007780379,0.00013337139,0.000062223,0.00016839607,0.0026144038,0.011549567],"genre_scores_gemma":[0.6144987,0.0009894746,0.3720463,0.0009778069,0.00024932044,0.00019149543,0.00041140267,0.00092543004,0.009710094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951755,0.001757544,0.0003968825,0.0007170693,0.001466697,0.00048642966],"domain_scores_gemma":[0.9899148,0.0050451546,0.0009160012,0.002376069,0.0015160273,0.00023197252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030485536,0.00045044822,0.00041371348,0.00081675017,0.000970318,0.0025561675,0.0014294419,0.0008392872,0.006116792],"category_scores_gemma":[0.008321608,0.00052814704,0.00085154164,0.0010211724,0.0047006696,0.004414881,0.0037220393,0.0024388558,0.00093273196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005667324,0.000033779266,0.00050292787,0.00031980223,0.000032089596,0.00029972626,0.000708193,0.009150747,0.0040082913,0.9456372,0.0030212605,0.03622927],"study_design_scores_gemma":[0.00004070467,0.000040358176,0.00033691383,0.00012639847,0.000041969466,0.00039591,0.00020910498,0.037038263,0.015060621,0.8986139,0.04805459,0.00004116006],"about_ca_topic_score_codex":0.0016974354,"about_ca_topic_score_gemma":0.001276003,"teacher_disagreement_score":0.006116792,"about_ca_system_score_codex":0.00129905,"about_ca_system_score_gemma":0.0015478287,"threshold_uncertainty_score":0.020462632},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024157324038158134,"score_gpt":0.3204166327895847,"score_spread":0.2962593087514266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158277676","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004501644,0.13116089,0.62481236,0.006512326,0.0051384657,0.00066771015,0.005998126,0.049972586,0.17123593],"genre_scores_gemma":[0.02490895,0.079967186,0.19587013,0.0015996197,0.001840405,0.00094149774,0.00796506,0.015034204,0.671873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995598,0.00009289346,0.000025372174,0.00006629382,0.00022205107,0.00003352901],"domain_scores_gemma":[0.9995159,0.00022870416,0.000023194167,0.00004166379,0.00013159816,0.000059000566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011461556,0.0022901478,0.00089062634,0.0019820423,0.00044790385,0.002383543,0.0013343215,0.0010068715,0.098348394],"category_scores_gemma":[0.0016247093,0.0010797895,0.00076791015,0.0013887917,0.00071312964,0.00430047,0.0017715893,0.0018703653,0.04971682],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012146736,0.000041502037,0.00013599807,0.0008574089,0.000025829506,0.00010562127,0.00023507516,0.0009429911,0.0050390866,0.009311405,0.5586367,0.42454684],"study_design_scores_gemma":[0.000026298721,0.0000647731,0.00088420714,0.00038035226,0.000033271655,0.0005636213,0.000097057404,0.0053012753,0.003988695,0.005139013,0.9834631,0.000058369027],"about_ca_topic_score_codex":0.0020241481,"about_ca_topic_score_gemma":0.0036089555,"teacher_disagreement_score":0.098348394,"about_ca_system_score_codex":0.00049642,"about_ca_system_score_gemma":0.00077281473,"threshold_uncertainty_score":0.32900816},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07853703555114158,"score_gpt":0.31215277808933567,"score_spread":0.2336157425381941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163886598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036003917,0.00050132954,0.9355416,0.0015329247,0.00027508737,0.000049349477,0.00021079494,0.0010002614,0.024884697],"genre_scores_gemma":[0.7525643,0.00071897206,0.22640151,0.0012604983,0.0004069402,0.00021071993,0.0004779428,0.00071605324,0.017243054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969357,0.0006706341,0.00021063081,0.0005920101,0.0011769125,0.00041416672],"domain_scores_gemma":[0.9966419,0.001469886,0.0002146215,0.0008288004,0.00072180305,0.00012312691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036730869,0.00056924234,0.00070758734,0.00169611,0.0013935899,0.0032146745,0.0016112208,0.0015523871,0.0051931804],"category_scores_gemma":[0.006510108,0.0004943902,0.0026099305,0.0014006058,0.0052038105,0.008666664,0.004240556,0.003967903,0.0009957977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004429841,0.0000039543315,0.0000851406,0.000017774777,0.0000037067955,0.00005130697,0.00014431146,0.0005015409,0.00041536812,0.99515164,0.00043380848,0.0031870443],"study_design_scores_gemma":[0.000009341588,0.00002071755,0.000092402646,0.000023833707,0.000011313297,0.00024484744,0.000063640495,0.006473541,0.001782377,0.98046136,0.010800565,0.00001597553],"about_ca_topic_score_codex":0.0012801521,"about_ca_topic_score_gemma":0.0005975056,"teacher_disagreement_score":0.0051931804,"about_ca_system_score_codex":0.002232456,"about_ca_system_score_gemma":0.00096359465,"threshold_uncertainty_score":0.019425392},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scope (computer science); Computer science; Library science; Cover (algebra); Operations research; Data science; Programming language","score_opus":0.007906516086205687,"score_gpt":0.22354119635551592,"score_spread":0.21563468026931024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172214464","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013342108,0.0041039796,0.00054152927,0.017627815,0.9696674,0.000050368893,0.00013829318,0.00017284603,0.007564386],"genre_scores_gemma":[0.0015087756,0.004431974,0.00041135144,0.0068751564,0.9469417,0.00005711395,0.00017959272,0.00020039144,0.039393954],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99637455,0.0003595827,0.0003972656,0.0006210624,0.0018855606,0.000361888],"domain_scores_gemma":[0.9733926,0.003406483,0.0012070478,0.0007615334,0.0173222,0.003910179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004528006,0.0026942655,0.0023452311,0.005032316,0.002222178,0.0074128276,0.0019195061,0.0064188936,0.062534116],"category_scores_gemma":[0.01731836,0.00062821014,0.0017142368,0.0014985072,0.0013407271,0.0035335484,0.0014098233,0.0070269518,0.03675449],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003699803,0.000013493629,0.000030705163,0.00015217556,0.0000054655275,0.000085552645,0.000009773797,0.000045452492,0.000151443,0.00046580736,0.9838097,0.015193444],"study_design_scores_gemma":[0.0000176911,0.000038226557,0.00020116518,0.00023318485,0.000012838371,0.00028474274,0.000022010823,0.0001467918,0.00021799073,0.00079627085,0.9980173,0.000011754699],"about_ca_topic_score_codex":0.0012928279,"about_ca_topic_score_gemma":0.001935927,"teacher_disagreement_score":0.062534116,"about_ca_system_score_codex":0.0032685054,"about_ca_system_score_gemma":0.0034403559,"threshold_uncertainty_score":0.20919746},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02022604562355896,"score_gpt":0.2315528772498165,"score_spread":0.21132683162625754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188068291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041352857,0.00020102448,0.9506454,0.0004262772,0.00007924129,0.000073089665,0.000108534165,0.002548275,0.0045652236],"genre_scores_gemma":[0.5536414,0.0002793557,0.43452057,0.0005711427,0.0001642235,0.00030741075,0.00025568283,0.0017789177,0.008481309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99089783,0.0024279854,0.00084074016,0.0020808096,0.0028351073,0.0009175512],"domain_scores_gemma":[0.98100924,0.009483272,0.0010201518,0.0055707507,0.0024222839,0.00049435796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007748462,0.00050239515,0.0015957762,0.0012837088,0.001516215,0.003919717,0.0032854397,0.0011872376,0.0026450295],"category_scores_gemma":[0.019602407,0.0013881656,0.002573787,0.0013777576,0.0066455593,0.011734477,0.005802562,0.005062916,0.00079504703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010748587,0.00005360179,0.0020077617,0.000108034656,0.000037904927,0.0002037546,0.00079519453,0.010034855,0.005350098,0.96025556,0.00086950674,0.020176314],"study_design_scores_gemma":[0.000048945763,0.00008243831,0.00069445814,0.000102446844,0.00014756258,0.00036608218,0.00014232237,0.15487735,0.0327591,0.78818876,0.02250007,0.00009048415],"about_ca_topic_score_codex":0.0056197806,"about_ca_topic_score_gemma":0.0038046513,"teacher_disagreement_score":0.007748462,"about_ca_system_score_codex":0.004303256,"about_ca_system_score_gemma":0.00322544,"threshold_uncertainty_score":0.040978253},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02849093842516767,"score_gpt":0.2466756690347579,"score_spread":0.21818473060959023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522116950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023068545,0.0001602601,0.96746105,0.00038985754,0.00009395481,0.00012534318,0.00013451502,0.0023035314,0.006262979],"genre_scores_gemma":[0.5567213,0.00026246763,0.43432748,0.00042090303,0.00013368938,0.00020678944,0.00022703072,0.00051759987,0.007182733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99285454,0.0018805988,0.0006102328,0.0017687536,0.0020439292,0.0008419438],"domain_scores_gemma":[0.9803977,0.009061279,0.0012375984,0.005877125,0.0028549402,0.0005714192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008602187,0.000691305,0.00081699266,0.0022202537,0.001370619,0.00295975,0.002924096,0.0014599423,0.0034931723],"category_scores_gemma":[0.019841509,0.0010860396,0.0021978281,0.0010903006,0.007291531,0.0072170408,0.005189863,0.0034121857,0.0006450619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009286638,0.00003425789,0.0016374198,0.00015242139,0.00004515788,0.00029762933,0.00058586715,0.014327741,0.003913889,0.9576442,0.0009875427,0.02028105],"study_design_scores_gemma":[0.00010793918,0.000117317126,0.0007100639,0.00014204718,0.0002277045,0.00046363423,0.00017008524,0.09422745,0.016722927,0.85683936,0.030151967,0.0001195091],"about_ca_topic_score_codex":0.0032279002,"about_ca_topic_score_gemma":0.003009997,"teacher_disagreement_score":0.008602187,"about_ca_system_score_codex":0.002089831,"about_ca_system_score_gemma":0.0019580724,"threshold_uncertainty_score":0.045493245},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023659883795211382,"score_gpt":0.2329471454006798,"score_spread":0.2092872616054684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995917016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028683972,0.00050168653,0.9510049,0.002575663,0.0003852752,0.00013807246,0.00015404477,0.006119174,0.010437177],"genre_scores_gemma":[0.47942567,0.0007007835,0.5074611,0.001583086,0.00030031207,0.00034936488,0.0003572055,0.0018253957,0.00799697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9789985,0.012176437,0.00092019833,0.0020951559,0.0046934634,0.0011162544],"domain_scores_gemma":[0.9588811,0.023268476,0.0011679622,0.011867946,0.0040096533,0.000804869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0183033,0.000565986,0.0011794217,0.0019223116,0.001812331,0.0058888323,0.00403774,0.001714529,0.0074475375],"category_scores_gemma":[0.051528174,0.0010836677,0.0014399409,0.0015531508,0.00895997,0.017334329,0.009685585,0.0055554756,0.0016921229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098129596,0.00008988551,0.00067303574,0.00020519814,0.000029049488,0.00012230036,0.0005375328,0.008001325,0.0035990772,0.9370409,0.0043307217,0.04527281],"study_design_scores_gemma":[0.00007470381,0.00010840128,0.00033014757,0.00017796525,0.0000696914,0.00016648743,0.00032209334,0.054365717,0.018595573,0.88395953,0.04173145,0.000098190125],"about_ca_topic_score_codex":0.0024787784,"about_ca_topic_score_gemma":0.0026579837,"teacher_disagreement_score":0.0183033,"about_ca_system_score_codex":0.0027387985,"about_ca_system_score_gemma":0.0061437148,"threshold_uncertainty_score":0.0967983},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Action (physics); Content (measure theory); Functional programming; Artificial intelligence; Programming language; Mathematics","score_opus":0.035885233436880284,"score_gpt":0.2572712874423624,"score_spread":0.2213860540054821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042329448","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003935045,0.8176782,0.11361645,0.030189322,0.020445596,0.000034413173,0.00028396392,0.00031110755,0.01704747],"genre_scores_gemma":[0.013106222,0.82618195,0.06965982,0.010623004,0.037804347,0.00015195852,0.00069807656,0.0007823471,0.040992223],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818605,0.0005289255,0.00015836858,0.00037353623,0.0006599257,0.00009317514],"domain_scores_gemma":[0.995697,0.0025249722,0.00014150949,0.00028027513,0.0012084054,0.00014781678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030845995,0.0017152604,0.0013762842,0.002574191,0.00061689835,0.0023427187,0.0016783846,0.0018447576,0.012559246],"category_scores_gemma":[0.0094238715,0.0007942958,0.0010194256,0.003500728,0.002629441,0.0053039147,0.0014129807,0.004992809,0.010751171],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040384308,0.00003344664,0.00013515745,0.0016413248,0.00006240192,0.000044746135,0.00006683388,0.004303578,0.00036188954,0.1429574,0.46850646,0.3818463],"study_design_scores_gemma":[0.0000108773565,0.000024795465,0.0001979269,0.0010371974,0.000020272373,0.00019132065,0.000023140958,0.0025173868,0.00030505093,0.0701207,0.9255194,0.000031878506],"about_ca_topic_score_codex":0.0027315253,"about_ca_topic_score_gemma":0.0021319462,"teacher_disagreement_score":0.012559246,"about_ca_system_score_codex":0.0019218836,"about_ca_system_score_gemma":0.0021534846,"threshold_uncertainty_score":0.042014837},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035323179758167636,"score_gpt":0.21156716947117313,"score_spread":0.17624398971300548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236518552","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008016763,0.0032895019,0.00069413485,0.0071640406,0.044077013,0.00009407232,0.003291317,0.0011871613,0.93940103],"genre_scores_gemma":[0.002438482,0.001559044,0.00024397249,0.0013480517,0.005867347,0.000029655084,0.0015118188,0.0005091401,0.98649246],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991456,0.00006394677,0.000038035603,0.0001385452,0.00051134365,0.00010253025],"domain_scores_gemma":[0.99766624,0.0002928045,0.00011058269,0.00025562252,0.0010935938,0.000581198],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007547156,0.00083489256,0.0009057917,0.002576962,0.0017117448,0.006578385,0.00096294936,0.0017241373,0.8035836],"category_scores_gemma":[0.0046136654,0.00027313043,0.0005358972,0.0023018024,0.0006163844,0.002799598,0.002051498,0.0018592338,0.7248784],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017045948,0.000020113883,0.00007046938,0.00008829404,0.0000022885727,0.000023935265,0.000009406442,0.000031038406,0.00012585333,0.0012464847,0.96253115,0.035833947],"study_design_scores_gemma":[0.000004259837,0.000008500923,0.0002636006,0.000086042106,0.0000014751118,0.000034999808,0.000018304925,0.00005550694,0.00009404197,0.00064290327,0.9987878,0.000002472848],"about_ca_topic_score_codex":0.0015557063,"about_ca_topic_score_gemma":0.0021530092,"teacher_disagreement_score":0.19641638,"about_ca_system_score_codex":0.0014673239,"about_ca_system_score_gemma":0.0016349138,"threshold_uncertainty_score":0.28016406},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03529181957938049,"score_gpt":0.2116999839248436,"score_spread":0.1764081643454631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244321449","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007680001,0.003546849,0.0009174667,0.011031172,0.071155034,0.00012276949,0.0034441953,0.001448709,0.9075658],"genre_scores_gemma":[0.0029598493,0.0019623546,0.00037846935,0.0024862017,0.010214771,0.00005027136,0.001790258,0.00090221927,0.9792556],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986613,0.00009310142,0.000057992973,0.00018837197,0.00084613694,0.00015319354],"domain_scores_gemma":[0.99605274,0.00046187837,0.00016046227,0.00046737166,0.0019289555,0.00092863117],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010872994,0.0009519863,0.0009310038,0.0030381212,0.0022734855,0.009550261,0.0011084937,0.002164773,0.7647799],"category_scores_gemma":[0.006455463,0.0003218315,0.0006922029,0.00256119,0.0008413855,0.0038308545,0.0024556525,0.002551825,0.6897377],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014260753,0.00002067812,0.000068866684,0.00008208783,0.0000020906516,0.000020427315,0.000010150273,0.000026559665,0.000117770775,0.0013204308,0.9690205,0.029296225],"study_design_scores_gemma":[0.0000041971757,0.000008505739,0.00026964792,0.00009100528,0.0000014758152,0.00003349356,0.000022234586,0.00004875911,0.00009185042,0.0007552748,0.9986706,0.0000029855335],"about_ca_topic_score_codex":0.0020268923,"about_ca_topic_score_gemma":0.0026897115,"teacher_disagreement_score":0.23522007,"about_ca_system_score_codex":0.00216532,"about_ca_system_score_gemma":0.0021691457,"threshold_uncertainty_score":0.33551288},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05758165745358277,"score_gpt":0.28339819789091947,"score_spread":0.2258165404373367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296058499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1023159,0.00010292569,0.87419677,0.00051910843,0.00039357704,0.0001022997,0.00021375508,0.004998124,0.017157549],"genre_scores_gemma":[0.7838591,0.00013756838,0.20020644,0.0005725197,0.00019115658,0.00013551814,0.00027395762,0.0026346787,0.011989067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753004,0.00041706648,0.0002057433,0.00045964724,0.0011095706,0.00027789403],"domain_scores_gemma":[0.9946977,0.0015554598,0.00037532402,0.0019195544,0.0012958271,0.0001561608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021652489,0.00046751404,0.00044372238,0.0006523591,0.0006693779,0.0016456187,0.0009907174,0.00074581214,0.0031382993],"category_scores_gemma":[0.006592694,0.0005142204,0.0009702247,0.00043962433,0.0026287755,0.0028914667,0.0024636479,0.002586076,0.0008870076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027776608,0.00020409102,0.0021155789,0.0002010532,0.00004376941,0.00064335886,0.0013611519,0.011941559,0.044259977,0.85904527,0.006151512,0.07375499],"study_design_scores_gemma":[0.00015297096,0.00030072557,0.0015937128,0.00015300918,0.00013516606,0.0012162683,0.00039608232,0.120127246,0.13355388,0.6647587,0.07748905,0.00012318481],"about_ca_topic_score_codex":0.001156501,"about_ca_topic_score_gemma":0.0007612293,"teacher_disagreement_score":0.0031382993,"about_ca_system_score_codex":0.00080004166,"about_ca_system_score_gemma":0.0011333374,"threshold_uncertainty_score":0.011451066},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08618167847390777,"score_gpt":0.32515608081163294,"score_spread":0.23897440233772516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317906537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014382665,0.00034651262,0.96565676,0.002331851,0.00044007364,0.000099035584,0.00015277746,0.008488836,0.00810151],"genre_scores_gemma":[0.3907766,0.0005571597,0.58637726,0.0033287539,0.00062477915,0.0003802526,0.00050041714,0.007936558,0.009518237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9844376,0.005237063,0.0012615805,0.002649201,0.005060966,0.0013535918],"domain_scores_gemma":[0.9462587,0.027771024,0.0024365354,0.015594129,0.0069220904,0.0010174741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015379617,0.00080063584,0.0012747779,0.0013136757,0.002052714,0.006899031,0.00405137,0.0023482754,0.016008299],"category_scores_gemma":[0.064734854,0.001497287,0.001703465,0.0016959744,0.0054423995,0.018106727,0.00832232,0.005077616,0.0033128366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041413924,0.000117378295,0.0059936335,0.0004708054,0.00006421895,0.00026875664,0.0013045036,0.0056854156,0.007837408,0.8452411,0.01802988,0.11457283],"study_design_scores_gemma":[0.00012016732,0.00016714093,0.0011781795,0.00058774836,0.00011446408,0.0006157042,0.0007336517,0.095696785,0.022394402,0.73319507,0.14506276,0.00013407065],"about_ca_topic_score_codex":0.0036543906,"about_ca_topic_score_gemma":0.0025775074,"teacher_disagreement_score":0.016008299,"about_ca_system_score_codex":0.00337837,"about_ca_system_score_gemma":0.0044424096,"threshold_uncertainty_score":0.0813362},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0500007676924014,"score_gpt":0.29392982024175035,"score_spread":0.24392905254934893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387270836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015064181,0.00018142126,0.9742887,0.00045946328,0.000114982875,0.00006735236,0.00008861307,0.0016499567,0.008085391],"genre_scores_gemma":[0.46933565,0.00043132677,0.51714593,0.0007733908,0.000202526,0.0002580925,0.00020784131,0.0014539195,0.010191238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935889,0.0017373861,0.0003392496,0.0008986678,0.0027362506,0.00069962355],"domain_scores_gemma":[0.9922097,0.004245906,0.00022223135,0.0016380805,0.0015040912,0.00018007125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066128867,0.00046499667,0.001107924,0.0014418544,0.0015501265,0.0029044198,0.0022728788,0.0010010265,0.005775614],"category_scores_gemma":[0.014109243,0.001155767,0.0020282296,0.0012246612,0.0049787844,0.009540375,0.0065018414,0.0049181865,0.001061579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007128471,0.000035306904,0.0007461424,0.000118273856,0.000020971602,0.00014506702,0.00034088676,0.0040327697,0.0044557215,0.95494086,0.0020357403,0.03305705],"study_design_scores_gemma":[0.00003571307,0.00003407346,0.00045934378,0.00010448117,0.000046543417,0.00026242805,0.000116922114,0.09290326,0.029887501,0.852697,0.023381889,0.00007075782],"about_ca_topic_score_codex":0.001747097,"about_ca_topic_score_gemma":0.002209693,"teacher_disagreement_score":0.0066128867,"about_ca_system_score_codex":0.003166673,"about_ca_system_score_gemma":0.002576575,"threshold_uncertainty_score":0.034972668},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Proof of concept; Programming language","score_opus":0.0351478444025809,"score_gpt":0.277750935814294,"score_spread":0.2426030914117131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405259879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009467951,0.0002515614,0.8872389,0.002955283,0.0002318164,0.00033003232,0.00047605348,0.004389029,0.094659336],"genre_scores_gemma":[0.24068274,0.0003608808,0.7372251,0.0007151098,0.000084575266,0.00033590663,0.0006994569,0.0010407222,0.018855514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979956,0.0008295538,0.00011592328,0.00018659132,0.0006851398,0.00018727394],"domain_scores_gemma":[0.9956519,0.0026988958,0.00009861808,0.00072668964,0.00066747144,0.00015643587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023947374,0.0005385369,0.0003595916,0.0014244628,0.0019827527,0.0025806134,0.0018513438,0.0010759255,0.017552724],"category_scores_gemma":[0.007314433,0.0004020371,0.0010757011,0.0012608531,0.0025736194,0.0026237334,0.0031196747,0.0016229299,0.0029107041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043849694,0.00007877311,0.00018277329,0.00020619796,0.000015736454,0.00037119424,0.00041767696,0.004205899,0.0022562472,0.95571995,0.009646792,0.02685505],"study_design_scores_gemma":[0.00008464042,0.000034468307,0.00016462112,0.00009289277,0.000023774708,0.00024440073,0.00017340458,0.03702591,0.0057134307,0.8359526,0.12045786,0.000031938653],"about_ca_topic_score_codex":0.002911749,"about_ca_topic_score_gemma":0.0041323015,"teacher_disagreement_score":0.017552724,"about_ca_system_score_codex":0.001390899,"about_ca_system_score_gemma":0.001588551,"threshold_uncertainty_score":0.058719754},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03697686058846159,"score_gpt":0.2798679575272404,"score_spread":0.24289109693877883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405809911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055720493,0.0007183246,0.87595534,0.0028057136,0.0006198933,0.0001025399,0.00025696054,0.002194722,0.061626017],"genre_scores_gemma":[0.7627281,0.0004871806,0.18961473,0.001322854,0.0005630097,0.00020208591,0.0001964459,0.00096099253,0.04392465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765956,0.00041008787,0.0001245814,0.00035746337,0.0011161354,0.00033209898],"domain_scores_gemma":[0.99741936,0.0008412575,0.00016658385,0.0006708667,0.00068482844,0.00021706498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035580345,0.0005411457,0.00077196385,0.0014737557,0.0027025396,0.0034443017,0.001961291,0.0017521316,0.005216972],"category_scores_gemma":[0.0060598166,0.0007943636,0.0016193474,0.00085782225,0.007077645,0.008416252,0.004539563,0.003743857,0.0011411074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008230253,0.000007318715,0.000081912156,0.000009095372,0.0000024749602,0.000075287775,0.00016794799,0.0004943795,0.00040657553,0.99710065,0.0005190504,0.0011270556],"study_design_scores_gemma":[0.000023852692,0.000016860171,0.00012273683,0.000029455774,0.000017814431,0.00015470444,0.00009794294,0.012170019,0.0013118056,0.9590441,0.026973236,0.000037464404],"about_ca_topic_score_codex":0.0031918457,"about_ca_topic_score_gemma":0.00300478,"teacher_disagreement_score":0.005216972,"about_ca_system_score_codex":0.0024273377,"about_ca_system_score_gemma":0.0017431895,"threshold_uncertainty_score":0.018816948},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.16257359141838365,"score_gpt":0.398653377644027,"score_spread":0.23607978622564332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414955533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028572477,0.00025927715,0.96644706,0.0005068477,0.000061582905,0.00007762242,0.00037309414,0.0017535199,0.001948533],"genre_scores_gemma":[0.63214,0.0004455337,0.36205494,0.0003299892,0.00011836684,0.0002642429,0.0008036401,0.0005315958,0.0033117356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682486,0.0012684715,0.00029764595,0.000504006,0.0007214156,0.0003836139],"domain_scores_gemma":[0.9945128,0.0029453863,0.0005141674,0.0010762094,0.0007043638,0.000247052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004945254,0.00058347086,0.0005894984,0.0017312001,0.0009256564,0.0032677366,0.0019373898,0.0011869853,0.00256393],"category_scores_gemma":[0.009357071,0.0006820562,0.0019401829,0.001533555,0.0036695723,0.008219514,0.0039051182,0.002287837,0.0004487853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015849993,0.00004284674,0.0023095508,0.00012226637,0.00003947242,0.00036134204,0.0013762763,0.060754426,0.0026393714,0.90783936,0.001394971,0.022961657],"study_design_scores_gemma":[0.00003646515,0.00004109097,0.00035932296,0.000088295375,0.000054055374,0.00011126446,0.0003324356,0.3251333,0.0063607907,0.6489455,0.018484823,0.000052737858],"about_ca_topic_score_codex":0.011252834,"about_ca_topic_score_gemma":0.009515032,"teacher_disagreement_score":0.011252834,"about_ca_system_score_codex":0.002106115,"about_ca_system_score_gemma":0.0014449891,"threshold_uncertainty_score":0.026153266},"labels":[],"label_agreement":null}]}