{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003760468,0.0016021046,0.9881501,0.0006315922,0.0019191728,0.00013759534,1.3489527e-7,0.0000677682,0.0037310256],"genre_scores_gemma":[0.9670733,0.000007436807,0.029968675,0.00014947195,0.001557844,0.000009331177,0.0000024551007,0.0000105645495,0.0012208848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833596,0.00005570788,0.00053953356,0.00017978507,0.00060785416,0.0002811624],"domain_scores_gemma":[0.99883217,0.000051751344,0.0004864611,0.0001850752,0.00035121135,0.00009331839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065638433,0.00014076938,0.00021132176,0.00015880437,0.00015071851,0.00025439417,0.00039230625,0.000058674745,0.000051037612],"category_scores_gemma":[0.000020878628,0.000104435305,0.00019727073,0.00032242466,0.000038610946,0.00035536636,0.00006251022,0.00017533149,0.00003625472],"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.000037768154,0.00056574325,0.006186129,0.00003957891,0.00014996147,0.00020043601,0.000148614,0.000900153,0.002007468,0.57595444,0.019016305,0.3947934],"study_design_scores_gemma":[0.0008684225,0.0005009149,0.0048036813,0.000008936357,0.000028271126,0.00090223196,0.000056076387,0.0012798136,0.00063848804,0.018074092,0.9726054,0.00023364936],"about_ca_topic_score_codex":0.000037851525,"about_ca_topic_score_gemma":0.000007663179,"teacher_disagreement_score":0.96331286,"about_ca_system_score_codex":0.00008025442,"about_ca_system_score_gemma":0.0001222883,"threshold_uncertainty_score":0.4258748},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04938006,0.0004689697,0.93268967,0.0036954398,0.009084927,0.00044999915,0.0000017281667,0.00008667589,0.004142534],"genre_scores_gemma":[0.9965468,0.000018483586,0.001132628,0.00025133262,0.000717142,0.00001040563,0.000002557849,0.000009578992,0.0013110418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981971,0.00010307585,0.000560256,0.00017123693,0.0007473031,0.0002210753],"domain_scores_gemma":[0.99824476,0.00015130811,0.00072357716,0.00029710119,0.0004912158,0.000092045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007017738,0.00013014369,0.00020630636,0.00015973758,0.00024356534,0.0001234471,0.0004949746,0.00006392859,0.000080937876],"category_scores_gemma":[0.00018215539,0.00008285057,0.00026241818,0.00068556354,0.00006314664,0.0004511629,0.00007618977,0.0002505065,0.000023293109],"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.00017327828,0.0011574709,0.03544965,0.000056839854,0.00029093574,0.00003601599,0.0003178918,0.0021548793,0.0015361006,0.7669567,0.008139619,0.1837306],"study_design_scores_gemma":[0.0015096172,0.0012123098,0.08026254,0.00010610141,0.00007753122,0.0014068974,0.00014590131,0.0013463029,0.000720504,0.033523522,0.879327,0.0003617719],"about_ca_topic_score_codex":0.000005698561,"about_ca_topic_score_gemma":0.0000032502298,"teacher_disagreement_score":0.94716674,"about_ca_system_score_codex":0.000063099564,"about_ca_system_score_gemma":0.00019693289,"threshold_uncertainty_score":0.33785483},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19008228,0.0004873235,0.7999744,0.002454164,0.0026965034,0.0015516336,0.000009787216,0.00012940058,0.0026145368],"genre_scores_gemma":[0.9317625,0.000042976626,0.052886836,0.00007980053,0.014963858,0.000026473806,0.00002550657,0.000008656587,0.0002033759],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893713,0.000044441695,0.000437391,0.000126685,0.00034094535,0.00011340595],"domain_scores_gemma":[0.99928814,0.000035749435,0.00031592924,0.000101431164,0.00020316923,0.000055574183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039641102,0.00007852067,0.00013360263,0.000091364556,0.00009876632,0.00012695788,0.00014634752,0.000032662152,0.00006945871],"category_scores_gemma":[0.0000063802454,0.00006893081,0.00005899025,0.00019949867,0.000022923645,0.00023304323,0.000015796248,0.00009483298,0.00000900837],"study_design_candidate":"design_other","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.000012895046,0.000119188255,0.00067790796,0.000018330158,0.00002840252,0.0000018383357,0.0001366181,0.0012345909,0.00007578688,0.0029101553,0.0048408634,0.98994344],"study_design_scores_gemma":[0.00068693835,0.0008896165,0.005837388,0.00004196137,0.000021267082,0.00014719045,0.00010426348,0.006972072,0.00033376223,0.00031562216,0.98452556,0.00012436138],"about_ca_topic_score_codex":0.0000063732646,"about_ca_topic_score_gemma":0.0000025522472,"teacher_disagreement_score":0.98981905,"about_ca_system_score_codex":0.000026490066,"about_ca_system_score_gemma":0.000059053426,"threshold_uncertainty_score":0.2810917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02717985,0.0006217229,0.9672688,0.00031322762,0.0035331189,0.00022593727,4.5288917e-7,0.000053656775,0.00080320076],"genre_scores_gemma":[0.9915994,0.000007014655,0.007763933,0.000034202734,0.0004813017,0.000005698788,0.0000010462356,0.000009040212,0.00009836971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823594,0.00006762885,0.00054960564,0.00018223084,0.0007092606,0.00025531513],"domain_scores_gemma":[0.9984735,0.00008022847,0.0006530229,0.00019049316,0.00048675764,0.000115963594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092183275,0.00013891325,0.00027084426,0.00013732006,0.000104107465,0.000116162184,0.0004193316,0.00008305918,0.000014041549],"category_scores_gemma":[0.00012962475,0.00010248512,0.00020157718,0.00029051682,0.000081587656,0.00044684776,0.00007398341,0.000242351,0.000011602683],"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.0002984248,0.0008279181,0.0073251096,0.00013605112,0.0004019476,0.00018959848,0.0016571286,0.0113255605,0.0021667364,0.61993545,0.0002704007,0.35546565],"study_design_scores_gemma":[0.027383298,0.01859298,0.026376333,0.00074459915,0.0009863997,0.016302306,0.005934944,0.007119022,0.11290013,0.4570118,0.3227135,0.0039347066],"about_ca_topic_score_codex":0.000028003651,"about_ca_topic_score_gemma":0.0000087800945,"teacher_disagreement_score":0.96441954,"about_ca_system_score_codex":0.00009131182,"about_ca_system_score_gemma":0.00031597857,"threshold_uncertainty_score":0.4179222},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050632186,0.0004432062,0.6938578,0.006775077,0.026502276,0.00045338413,0.0000050765175,0.00031559382,0.22101541],"genre_scores_gemma":[0.8532096,0.000018343419,0.03229025,0.00093360204,0.101298854,0.0000040406635,0.0000069685393,0.000024066638,0.012214266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986486,0.000059272534,0.00039646006,0.00014854578,0.00053671707,0.00021041674],"domain_scores_gemma":[0.99927634,0.000092480266,0.0002089616,0.00015702126,0.00015150712,0.00011371437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050136185,0.00010782174,0.00016879784,0.00009651865,0.00013502988,0.00023110179,0.00042044526,0.000047813126,0.000549453],"category_scores_gemma":[0.000027522346,0.00008770459,0.00015619803,0.00026818961,0.000022243692,0.0002945083,0.000022302764,0.00024649917,0.000393281],"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.000070291724,0.0001696443,0.0001712825,0.0000073893307,0.00003968923,0.00007328695,0.00014754961,0.012334357,0.000010516381,0.0031848992,0.10765245,0.8761386],"study_design_scores_gemma":[0.000376889,0.00041822167,0.0009685143,0.00005232769,0.0000052837913,0.0003577969,0.0000119055685,0.0019912426,0.000017001119,0.00044329386,0.99525994,0.00009757543],"about_ca_topic_score_codex":0.0000027304266,"about_ca_topic_score_gemma":4.1290258e-7,"teacher_disagreement_score":0.8876075,"about_ca_system_score_codex":0.00004825458,"about_ca_system_score_gemma":0.00007977147,"threshold_uncertainty_score":0.6016125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6822343,0.09597416,0.0047259694,0.16419598,0.01489324,0.0031989072,0.00016327338,0.0004833761,0.034130774],"genre_scores_gemma":[0.95260626,0.009155168,0.0062746173,0.006028594,0.017119907,0.0001729583,0.00013786061,0.0001488758,0.008355753],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99602026,0.0005878851,0.00087751605,0.0003398502,0.0013674238,0.00080707984],"domain_scores_gemma":[0.9954958,0.00223809,0.000652728,0.00024770328,0.0009493681,0.000416286],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016690129,0.00027913757,0.00043917162,0.000024299714,0.0010477834,0.0004921912,0.0006852595,0.0003330752,0.0040423707],"category_scores_gemma":[0.0019283933,0.00020631486,0.00036158928,0.00022279922,0.0011225371,0.000715939,0.00013483119,0.0010098146,0.00022500889],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068155445,0.00021716418,0.0055584474,0.000009953246,0.00019958997,0.00001236879,0.001637143,0.00005920749,0.00035003352,0.002108168,0.9560966,0.033683155],"study_design_scores_gemma":[0.00057297247,0.00019554501,0.005440799,0.000078426376,0.00010338524,0.000018464227,0.0042128917,0.00007085949,0.000028549477,0.0032854413,0.98575234,0.00024029455],"about_ca_topic_score_codex":0.008238992,"about_ca_topic_score_gemma":0.0003621986,"teacher_disagreement_score":0.27037194,"about_ca_system_score_codex":0.00031542106,"about_ca_system_score_gemma":0.00037041865,"threshold_uncertainty_score":0.9983652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002399734,0.007526638,0.9719053,0.008071162,0.0053686686,0.0002697526,2.577634e-7,0.00012431854,0.0043341992],"genre_scores_gemma":[0.99192643,0.00007357865,0.0037419582,0.00040571546,0.001016739,0.000009388504,3.1009338e-7,0.000011263717,0.0028145995],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981196,0.0000845889,0.0005222444,0.00018050655,0.0007339616,0.00035909758],"domain_scores_gemma":[0.99855536,0.00019570245,0.0004550339,0.00028078485,0.0003652173,0.00014789558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009478818,0.00013993373,0.00018157494,0.00009415968,0.00047656076,0.0005286154,0.00067751855,0.00006837977,0.00006289548],"category_scores_gemma":[0.00012015454,0.0000840606,0.0002484771,0.00039720762,0.000079549056,0.00051184307,0.00009735458,0.00032204945,0.00013109409],"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.000014385352,0.0001413711,0.0008869622,0.0000137075895,0.00013954904,0.00007287876,0.0006517076,0.000035644927,0.000062371815,0.18772851,0.028822463,0.7814304],"study_design_scores_gemma":[0.0004870953,0.000381392,0.0006293565,0.0000081157295,0.00002055921,0.000993964,0.0001385073,0.0058383835,0.000108572254,0.009863801,0.98136395,0.00016630742],"about_ca_topic_score_codex":0.000009687848,"about_ca_topic_score_gemma":0.0000047816984,"teacher_disagreement_score":0.9895267,"about_ca_system_score_codex":0.00006929461,"about_ca_system_score_gemma":0.000053455784,"threshold_uncertainty_score":0.509745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028864196,0.0017516394,0.9511772,0.010577704,0.001696352,0.0006974945,4.3373618e-7,0.00024209864,0.004992931],"genre_scores_gemma":[0.97670615,0.000009597526,0.019894604,0.0007854222,0.0016810037,0.000008994631,0.0000027608169,0.000010956276,0.0009004854],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775887,0.000120461285,0.00065972377,0.0002581365,0.0008726073,0.0003301836],"domain_scores_gemma":[0.99828345,0.00016537252,0.00064389274,0.0004369143,0.00033507243,0.00013532743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002013039,0.00018187112,0.00026009517,0.00015144979,0.00025115183,0.00035304952,0.0006237822,0.00008045177,0.00003053673],"category_scores_gemma":[0.00036314616,0.0001098064,0.00027807153,0.00044183352,0.000044290326,0.0004163755,0.000050836865,0.00047730177,0.0000495446],"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.00008900904,0.00052065303,0.00096160045,0.000031010004,0.00020337808,0.0021007753,0.0013882131,0.0007340653,0.0006936446,0.20037484,0.011142806,0.78176],"study_design_scores_gemma":[0.0028359855,0.004302111,0.0061877216,0.00021232635,0.000114521106,0.020588353,0.0018043426,0.03159837,0.001225782,0.028311007,0.90171033,0.0011091426],"about_ca_topic_score_codex":0.0000062200716,"about_ca_topic_score_gemma":3.4298856e-7,"teacher_disagreement_score":0.947842,"about_ca_system_score_codex":0.000089760375,"about_ca_system_score_gemma":0.00014732315,"threshold_uncertainty_score":0.4477775},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010516592,0.0006469626,0.98521054,0.0013131453,0.0014119383,0.00043038305,0.0000015013105,0.00010934809,0.00035960297],"genre_scores_gemma":[0.9757182,0.0000075715798,0.022704381,0.00044084486,0.0007340693,0.00001826811,0.0000082908455,0.000014416979,0.0003539848],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977777,0.00012564474,0.00069826207,0.000289311,0.00067179144,0.00043726063],"domain_scores_gemma":[0.9980435,0.00019733697,0.0006417328,0.0002601475,0.0006840042,0.00017331763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015452399,0.00021654663,0.00035559136,0.00019649164,0.00019716418,0.00041584004,0.00061930856,0.000110368084,0.0000252434],"category_scores_gemma":[0.00028083392,0.00016902311,0.0003103611,0.00028545532,0.00004315898,0.00066933857,0.000057598725,0.00029398937,0.0000133338945],"study_design_candidate":"design_other","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.0005250766,0.00046540867,0.001523154,0.00008929225,0.00031748062,0.00013834784,0.0013172943,0.001743323,0.0034658317,0.06337377,0.007068411,0.9199726],"study_design_scores_gemma":[0.013258778,0.017918242,0.020187447,0.00035645667,0.0006600106,0.0025325709,0.0030839345,0.04013664,0.005516376,0.08567335,0.80776435,0.0029118569],"about_ca_topic_score_codex":0.000008636566,"about_ca_topic_score_gemma":0.000011522711,"teacher_disagreement_score":0.96520156,"about_ca_system_score_codex":0.00010298989,"about_ca_system_score_gemma":0.00026364657,"threshold_uncertainty_score":0.68925625},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1647679,0.002774588,0.8073152,0.0013448525,0.021381091,0.0004987077,7.0793664e-7,0.00029143813,0.0016255353],"genre_scores_gemma":[0.953893,0.000013596773,0.042756617,0.0002851093,0.002352934,0.0000068369377,0.0000027658389,0.000019855188,0.0006692904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770683,0.00014964443,0.0006490452,0.00027346888,0.00069542055,0.0005255927],"domain_scores_gemma":[0.99788636,0.000085938125,0.0004975299,0.00033490165,0.0007009,0.00049434404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014463254,0.00021218814,0.00030240798,0.00029480417,0.00035749955,0.0002978402,0.00044818225,0.00012753549,0.00010039049],"category_scores_gemma":[0.00016909975,0.00017287627,0.00017027554,0.0006189057,0.00005134207,0.0022578216,0.00015204216,0.00034240333,0.0001683693],"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.0003047689,0.0006336663,0.09316285,0.00007190843,0.00032790034,0.00009542437,0.0035261877,0.0007471899,0.004190453,0.03384268,0.007849631,0.8552473],"study_design_scores_gemma":[0.0013484763,0.0017593522,0.017916482,0.00009546091,0.000096067335,0.012288466,0.0009973828,0.0015820161,0.0015419424,0.0027211008,0.9588214,0.0008318652],"about_ca_topic_score_codex":0.000017199347,"about_ca_topic_score_gemma":0.00000949507,"teacher_disagreement_score":0.9509718,"about_ca_system_score_codex":0.00028503238,"about_ca_system_score_gemma":0.0001809042,"threshold_uncertainty_score":0.704969},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12247434,0.0007694569,0.86776996,0.0011734583,0.005498167,0.0005793054,1.5786402e-7,0.00019942079,0.0015357125],"genre_scores_gemma":[0.96286225,0.0000048044485,0.035941914,0.00006295532,0.0008699458,0.0000145672975,0.0000012700763,0.000010800008,0.00023149651],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998311,0.00003856839,0.0004946331,0.00021557028,0.00053410325,0.00040613336],"domain_scores_gemma":[0.99869627,0.000057770227,0.00044195305,0.00021188131,0.00036147732,0.00023063812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011585017,0.00016374787,0.00022993627,0.0001741091,0.0002339952,0.00046892968,0.00040782106,0.00011536621,0.000012112134],"category_scores_gemma":[0.00009199732,0.0001203365,0.0001429488,0.0002993668,0.00010243097,0.0013043293,0.00013999826,0.0005642953,0.0000122245265],"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.000026289003,0.00014806999,0.010976659,0.000025219779,0.00004868065,0.00003240227,0.00021091886,0.0000026705868,0.00062921713,0.15062448,0.00013057154,0.83714485],"study_design_scores_gemma":[0.0037184285,0.004029118,0.03982213,0.000051993717,0.000115010575,0.013340794,0.0004769234,0.005830778,0.0009749369,0.06525069,0.8653364,0.001052804],"about_ca_topic_score_codex":0.000009715967,"about_ca_topic_score_gemma":0.000019605088,"teacher_disagreement_score":0.8652058,"about_ca_system_score_codex":0.00002255821,"about_ca_system_score_gemma":0.00014869469,"threshold_uncertainty_score":0.490718},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95640135,0.013172238,0.012555852,0.010210017,0.0033419225,0.0013817581,0.000037874695,0.0002183693,0.0026806097],"genre_scores_gemma":[0.98261666,0.00041053354,0.015499288,0.00024407277,0.00077147654,0.000035022884,0.00001890778,0.000019546815,0.0003844772],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841756,0.0000888136,0.0005092155,0.0002002619,0.00042320034,0.00036094678],"domain_scores_gemma":[0.99695504,0.0015472939,0.00054604036,0.00012453442,0.00054986315,0.0002772354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022760576,0.00014954738,0.0002533121,0.00029667935,0.00045855518,0.00032360043,0.0002968277,0.00021566778,0.00010573594],"category_scores_gemma":[0.001594645,0.00013499164,0.000091258575,0.00023063051,0.0004585233,0.0010516631,0.00010383468,0.00052986655,0.00000436526],"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.00033356756,0.00039362823,0.033976648,0.00004382252,0.0001981043,0.000009991974,0.009570854,0.000003370047,0.0017647014,0.0008391905,0.022724995,0.93014115],"study_design_scores_gemma":[0.0013971203,0.00018160598,0.008241106,0.00007001015,0.000053977434,0.000034561286,0.0072763306,0.0003716826,0.000194083,0.00035385237,0.9816398,0.00018584206],"about_ca_topic_score_codex":0.0001478296,"about_ca_topic_score_gemma":0.00081692555,"teacher_disagreement_score":0.9589148,"about_ca_system_score_codex":0.00012525712,"about_ca_system_score_gemma":0.00015266697,"threshold_uncertainty_score":0.55047995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009998208,0.0019349782,0.98415,0.000855795,0.009696713,0.0008407066,0.00000511789,0.000117434975,0.0013994279],"genre_scores_gemma":[0.81884485,0.00003184017,0.16741994,0.00041560156,0.008379999,0.0003773709,0.00014538289,0.000085906206,0.004299088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643,0.00020930835,0.0012103805,0.000574998,0.001147422,0.00042788987],"domain_scores_gemma":[0.99309874,0.00039683626,0.0019641004,0.00054064364,0.0037352075,0.00026450233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003253381,0.00036566952,0.00067510386,0.00042969297,0.00020686336,0.0007422144,0.0009043717,0.0003631929,0.00006558454],"category_scores_gemma":[0.00070307706,0.00029867,0.0006461995,0.0004596109,0.00007902817,0.0007137678,0.00045887986,0.0007823131,0.000022154343],"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.00072878314,0.00090078823,0.0017007007,0.0008237567,0.0018972119,0.00009203872,0.0017955407,0.014306939,0.00028373193,0.472416,0.09042903,0.41462547],"study_design_scores_gemma":[0.0021187558,0.000953667,0.00052129984,0.00008312883,0.00018489065,0.0008054891,0.00039880065,0.008456055,0.00019657014,0.53221685,0.45339686,0.00066761876],"about_ca_topic_score_codex":0.000013222419,"about_ca_topic_score_gemma":0.000009854452,"teacher_disagreement_score":0.81784505,"about_ca_system_score_codex":0.00027278042,"about_ca_system_score_gemma":0.0011741909,"threshold_uncertainty_score":0.99994653},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038102273,0.000100599835,0.15237594,0.0013757255,0.80360734,0.00026931564,0.0000053392987,0.00034202993,0.0038214338],"genre_scores_gemma":[0.015984211,0.00000778703,0.17933175,0.00007938779,0.8043048,0.0000055437026,0.000007666564,0.000037821006,0.00024104558],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988796,0.000009617641,0.0003571459,0.00008080757,0.00048444537,0.00018836431],"domain_scores_gemma":[0.99919116,0.000051538515,0.000083069644,0.000076280776,0.0003721842,0.00022578915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030181606,0.00010843453,0.00014691414,0.0001868392,0.000076533295,0.00008040836,0.0001215816,0.00012391318,0.0007568049],"category_scores_gemma":[0.00026131468,0.00009984407,0.000088281566,0.00028363115,0.0000217944,0.00016667186,0.000012915941,0.0005909179,0.000121973695],"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.00010187982,0.00007972094,0.00053572265,0.00001219645,0.00009929886,0.000016710117,0.00014793164,0.119956404,0.0020688546,0.00004900828,0.7505933,0.12633899],"study_design_scores_gemma":[0.00051247474,0.0000984653,0.0003272963,0.000015136868,0.000022535147,0.00009553064,0.00007545998,0.005050156,0.00048751602,0.000028275119,0.99315387,0.00013327296],"about_ca_topic_score_codex":0.0000018805334,"about_ca_topic_score_gemma":0.0000049598966,"teacher_disagreement_score":0.2425606,"about_ca_system_score_codex":0.000038152517,"about_ca_system_score_gemma":0.000064936874,"threshold_uncertainty_score":0.82864827},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038361594,0.0005107161,0.957423,0.0018055744,0.0010158595,0.00016213428,2.0361695e-7,0.00006356927,0.00065739197],"genre_scores_gemma":[0.98781437,0.000028352904,0.011069407,0.000076013894,0.0003573087,0.000004495534,3.357503e-7,0.00000891701,0.0006407758],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876744,0.00007171465,0.00030959464,0.00019033747,0.0004427525,0.00021815712],"domain_scores_gemma":[0.99889195,0.00016773638,0.00036617415,0.00014877891,0.0002927544,0.00013263398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006384689,0.00012453846,0.00019940262,0.00011593183,0.00012354634,0.0001786988,0.00022623398,0.00005999186,0.00003034443],"category_scores_gemma":[0.000060340313,0.00006446537,0.00006840228,0.00017086773,0.00006995249,0.0006033494,0.00006123306,0.00013541259,0.000023877272],"study_design_candidate":"design_other","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.000387923,0.00020306282,0.033570547,0.000057980338,0.00019686269,0.00014486574,0.000315047,0.000015903794,0.0017409965,0.056501146,0.0012374423,0.9056282],"study_design_scores_gemma":[0.010930196,0.009031247,0.033342123,0.00041503643,0.00016761041,0.008091965,0.000407045,0.0006472059,0.0023032723,0.041695133,0.8918517,0.0011174253],"about_ca_topic_score_codex":0.000008128543,"about_ca_topic_score_gemma":0.000008038481,"teacher_disagreement_score":0.9494528,"about_ca_system_score_codex":0.000054441076,"about_ca_system_score_gemma":0.000098376106,"threshold_uncertainty_score":0.26288214},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015211492,0.0022842686,0.97611666,0.000595463,0.0050640283,0.00022292974,1.858733e-7,0.00009230934,0.0004126582],"genre_scores_gemma":[0.9965104,0.000026946393,0.0021643203,0.000028618211,0.00082320016,0.0000072160146,3.3754623e-7,0.0000098428,0.00042912771],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845713,0.000114688926,0.00043825232,0.00019836547,0.0005216833,0.00026984754],"domain_scores_gemma":[0.99853677,0.00028553628,0.00039218678,0.00017821067,0.00044105537,0.00016624405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012959248,0.0001455153,0.00026664158,0.00015638355,0.00012576736,0.00024754376,0.00030670804,0.00007504134,0.000006302464],"category_scores_gemma":[0.00023306864,0.00007881716,0.000105246756,0.00030276887,0.000060586393,0.0006219548,0.000085985565,0.0001467666,0.000039031936],"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.000103590224,0.00009872544,0.014553953,0.00008356944,0.00020362952,0.00011617948,0.00013954414,0.000026412838,0.0018280948,0.346949,0.002754669,0.63314265],"study_design_scores_gemma":[0.0049410015,0.007498978,0.0116437925,0.00023313546,0.00015459725,0.0101349335,0.00015935254,0.0013208261,0.00086836074,0.019690033,0.94242126,0.0009337262],"about_ca_topic_score_codex":0.000010705681,"about_ca_topic_score_gemma":0.0000010099138,"teacher_disagreement_score":0.9812989,"about_ca_system_score_codex":0.00006564023,"about_ca_system_score_gemma":0.00009995688,"threshold_uncertainty_score":0.32140705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007405157,0.0011378301,0.9829104,0.0013916204,0.002778895,0.00037934998,4.2387973e-7,0.00013200064,0.003864331],"genre_scores_gemma":[0.97387147,0.0000076197125,0.023048226,0.00015258757,0.00041390647,0.000010664916,0.0000046554705,0.000014639,0.0024762577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777853,0.00011228636,0.000664253,0.00029516034,0.00078478985,0.00036498],"domain_scores_gemma":[0.99838364,0.00016430649,0.00061824697,0.00026103365,0.00039556623,0.00017723325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011919608,0.00017823988,0.00029477518,0.00018404455,0.00020020736,0.00030805654,0.00052283506,0.00014353868,0.00010456163],"category_scores_gemma":[0.00015178311,0.00013614402,0.00023186163,0.0005002338,0.000031804266,0.0009352335,0.00012606934,0.000490545,0.00022263647],"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.000104820494,0.0006191479,0.018017082,0.00008031868,0.00028782137,0.00008901103,0.0005539591,0.00057462684,0.0057782256,0.73841226,0.023608357,0.2118744],"study_design_scores_gemma":[0.0022364524,0.0021473654,0.0025534735,0.00007132203,0.00007336464,0.0020123057,0.0004379583,0.0054387846,0.00092991587,0.07021078,0.91314304,0.00074523437],"about_ca_topic_score_codex":0.000009438595,"about_ca_topic_score_gemma":0.0000013937993,"teacher_disagreement_score":0.9664663,"about_ca_system_score_codex":0.00013133347,"about_ca_system_score_gemma":0.00015596363,"threshold_uncertainty_score":0.55517924},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081891543,0.050614014,0.9434757,0.0016893675,0.0023631097,0.0006494381,0.000038218615,0.00020456708,0.00014666519],"genre_scores_gemma":[0.021013442,0.0099885175,0.9598983,0.0023697056,0.005569046,0.00018922087,0.0003469027,0.00026686056,0.00035802208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976408,0.000034700588,0.0010852594,0.00022828388,0.00066981075,0.00034114506],"domain_scores_gemma":[0.99812835,0.00015543059,0.00049843185,0.00013516303,0.0007846545,0.00029796848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007086961,0.000271938,0.00053086784,0.00013738216,0.000113587615,0.00006489959,0.00020840116,0.00012665351,0.00015699814],"category_scores_gemma":[0.00040892026,0.00025511018,0.00041660698,0.00051675143,0.00006982207,0.00034457963,0.000029685902,0.00042436205,0.00001154119],"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.0005262711,0.00059087813,0.0008833702,0.0113007575,0.0013863528,0.000017826605,0.0003045314,0.11157134,0.0020525022,0.00027367967,0.18646164,0.6846309],"study_design_scores_gemma":[0.002539725,0.0010850755,0.00024318197,0.0027041764,0.00041553157,0.00018864608,0.00021318508,0.072020456,0.0014086459,0.000039353967,0.91852045,0.00062155427],"about_ca_topic_score_codex":0.0000018451383,"about_ca_topic_score_gemma":3.0252824e-7,"teacher_disagreement_score":0.7320588,"about_ca_system_score_codex":0.00010550264,"about_ca_system_score_gemma":0.00013296807,"threshold_uncertainty_score":0.9999901},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007079237,0.014785699,0.0048401817,0.001312094,0.04115629,0.00022387978,0.0003006099,0.0000057949032,0.9366675],"genre_scores_gemma":[0.0010576082,0.00055134494,0.0010544432,0.00044669074,0.0024678083,0.000004772404,0.000023402294,0.000031110612,0.99436283],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99819404,0.000014358865,0.0010226177,0.00037932617,0.00008023266,0.00030942194],"domain_scores_gemma":[0.99808246,0.000054952772,0.0014428664,0.00016959858,0.000119132834,0.00013098792],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00078461913,0.00025138474,0.0008050509,0.00036286283,0.00015090872,0.00030912962,0.00019286333,0.00020072653,0.3563962],"category_scores_gemma":[0.000043643857,0.00025436818,0.00028827024,0.00010423373,0.00015275416,0.000316797,0.00011555505,0.0004043578,0.6291713],"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.00003390146,0.0000388601,0.0025823903,0.000096077834,0.00029027532,0.0000018874235,0.00007370927,0.0001693704,4.9724065e-7,0.0001658145,0.9955486,0.0009986367],"study_design_scores_gemma":[0.0004971477,0.00009042771,0.00068630354,0.00006903344,0.00003055402,0.0000572333,0.00008382584,0.00012056457,7.7748933e-7,0.00012183555,0.99797803,0.00026424005],"about_ca_topic_score_codex":0.000019453748,"about_ca_topic_score_gemma":2.7070288e-7,"teacher_disagreement_score":0.27277508,"about_ca_system_score_codex":0.00013027935,"about_ca_system_score_gemma":0.00003817766,"threshold_uncertainty_score":0.9999909},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007313093,0.014926477,0.0048618726,0.0013554131,0.042400427,0.00022882274,0.0003070403,0.000005967666,0.9351827],"genre_scores_gemma":[0.0010002791,0.0005712604,0.0010787342,0.000450929,0.0025783877,0.0000048671645,0.000023817041,0.000031713036,0.99426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817,0.000014655675,0.0010356614,0.0003844352,0.00008153532,0.00031369252],"domain_scores_gemma":[0.9980584,0.000055297016,0.0014598647,0.00017231252,0.00012108547,0.00013306594],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007928435,0.00025525808,0.00081529014,0.00036804794,0.00015365993,0.00031187452,0.00019594147,0.00020372633,0.35936707],"category_scores_gemma":[0.00004372562,0.00025836824,0.00029221034,0.00010608393,0.0001542483,0.0003210524,0.00011717427,0.0004095111,0.6295181],"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.000034514687,0.00003930975,0.0025581145,0.00009744713,0.00029341172,0.0000019229417,0.000074506635,0.0001725288,5.067191e-7,0.00016595366,0.9955473,0.0010144956],"study_design_scores_gemma":[0.000506248,0.00009162828,0.0006784043,0.000069676025,0.000031018863,0.00005828165,0.00008717329,0.00012342691,7.914547e-7,0.00011992569,0.9979651,0.00026833414],"about_ca_topic_score_codex":0.00001937834,"about_ca_topic_score_gemma":2.732447e-7,"teacher_disagreement_score":0.27015102,"about_ca_system_score_codex":0.00013184553,"about_ca_system_score_gemma":0.000038786424,"threshold_uncertainty_score":0.9999868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03596845,0.0013701051,0.9510715,0.0022783289,0.008044061,0.00041384695,0.0000023695295,0.00012160661,0.00072971813],"genre_scores_gemma":[0.9881483,0.00000244548,0.0093627935,0.00035064362,0.00059124397,0.000034029123,0.0000031144823,0.000011144342,0.001496328],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971278,0.0002510126,0.00059647876,0.0002895653,0.0013963969,0.00033874903],"domain_scores_gemma":[0.9984672,0.00014624366,0.00042869785,0.00027956025,0.00044932557,0.00022897108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022288803,0.00014857354,0.00025367446,0.0002265868,0.00046422594,0.00024022756,0.0007813752,0.000039623716,0.00015436574],"category_scores_gemma":[0.00017399724,0.0001233153,0.00020921983,0.00047463048,0.000026928428,0.00049015257,0.0005845361,0.000403211,0.000030211611],"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.0006774195,0.001208487,0.015010796,0.00011090457,0.0005546047,0.00043973787,0.0033046228,0.023138942,0.0023532582,0.45951837,0.024120398,0.46956244],"study_design_scores_gemma":[0.0015179508,0.0025604728,0.012349467,0.000015739473,0.000055670713,0.002805792,0.0012208095,0.0026634575,0.00040209002,0.0298482,0.94596666,0.0005937174],"about_ca_topic_score_codex":0.000037710375,"about_ca_topic_score_gemma":0.000008692595,"teacher_disagreement_score":0.9521798,"about_ca_system_score_codex":0.00016382853,"about_ca_system_score_gemma":0.00025180538,"threshold_uncertainty_score":0.5028652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008584209,0.0001942326,0.9904094,0.0051467246,0.002559845,0.00028310317,4.828961e-7,0.00015545877,0.00039237842],"genre_scores_gemma":[0.88701767,0.000029242374,0.1082017,0.0006479745,0.0019714448,0.000057631158,0.0000059393906,0.000029647808,0.0020387594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836594,0.0000576373,0.0005275303,0.00021697138,0.0004664856,0.0003654496],"domain_scores_gemma":[0.99808127,0.0005122298,0.00050371,0.00018780063,0.00057158724,0.00014342541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017029602,0.00012983604,0.00024771085,0.00022405524,0.00023488312,0.00031745073,0.00031621722,0.00008384125,0.000020103613],"category_scores_gemma":[0.00055183703,0.00010196784,0.00027840547,0.0006305119,0.00003554307,0.00067776977,0.000087792934,0.00022460769,0.00008837453],"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.00028126928,0.00033918882,0.002132726,0.00022162856,0.000512475,0.00014619304,0.0012622926,0.00027856394,0.0011491273,0.3538016,0.10112108,0.53875387],"study_design_scores_gemma":[0.0013717894,0.0006268837,0.00091580075,0.000022674287,0.00004549045,0.000571515,0.00026663483,0.010185221,0.00029551296,0.03459891,0.9508664,0.0002331598],"about_ca_topic_score_codex":0.0000031904312,"about_ca_topic_score_gemma":0.0000011936954,"teacher_disagreement_score":0.88615924,"about_ca_system_score_codex":0.000060790997,"about_ca_system_score_gemma":0.00026314007,"threshold_uncertainty_score":0.41581276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003919846,0.0005254776,0.99210584,0.0002477001,0.0025467807,0.0003557905,6.2094733e-7,0.000084968306,0.00021298887],"genre_scores_gemma":[0.9939677,0.000014894016,0.004680301,0.000065833694,0.000573456,0.000038868373,0.000034115063,0.000012344469,0.0006124457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829096,0.0001300964,0.00040611989,0.00016885095,0.00077229115,0.00023171396],"domain_scores_gemma":[0.9982473,0.00017309481,0.00038420368,0.0001326149,0.0009829826,0.00007980167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036539615,0.000101864134,0.00014291315,0.00018585965,0.00018186182,0.00019612558,0.0002752682,0.0000698242,0.000017512246],"category_scores_gemma":[0.0003393564,0.000082358696,0.000114767834,0.0005118592,0.000019557048,0.00058017875,0.000047829057,0.00010992911,0.00002998952],"study_design_candidate":"design_other","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.00017088653,0.00016124814,0.0012808262,0.00005793975,0.00016707848,0.000008652463,0.0004512928,0.0068983827,0.00157447,0.21534462,0.012891629,0.76099294],"study_design_scores_gemma":[0.004761635,0.002822594,0.0030562647,0.00004193059,0.00026095868,0.0005172551,0.0008216606,0.30091572,0.0021692757,0.3505873,0.3332962,0.0007491665],"about_ca_topic_score_codex":0.000003348839,"about_ca_topic_score_gemma":0.0000018524601,"teacher_disagreement_score":0.9900479,"about_ca_system_score_codex":0.00009938601,"about_ca_system_score_gemma":0.000185108,"threshold_uncertainty_score":0.33584902},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120884385,0.000981138,0.98539937,0.00018433796,0.00111615,0.0000730932,0.0000031413897,0.00006979335,0.000084553285],"genre_scores_gemma":[0.7001188,0.0000071509867,0.29893747,0.000031014548,0.0007868222,0.0000043687724,0.000016175982,0.000010532155,0.00008765874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859715,0.000046785746,0.00041929947,0.00018476747,0.00061526604,0.00013675743],"domain_scores_gemma":[0.99904203,0.00012442366,0.00018907584,0.00018075685,0.00036194103,0.00010177745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059096783,0.0000896561,0.00014427686,0.00019581053,0.00007847473,0.0001830728,0.0003174265,0.000045413813,0.00004486713],"category_scores_gemma":[0.000030053348,0.00006713615,0.000113597765,0.0003761041,0.000032061103,0.0013593193,0.000067461864,0.00019655476,0.0000041506523],"study_design_candidate":"design_other","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.00005274243,0.00033005554,0.0007452484,0.00007789694,0.00011578067,0.00007656607,0.00033939505,0.005401001,0.0063065495,0.03752469,0.0035129115,0.9455172],"study_design_scores_gemma":[0.0006310527,0.0009810365,0.014565704,0.00040112896,0.000048488884,0.0011120825,0.00006491292,0.71190715,0.0022375742,0.00947585,0.25827983,0.0002951875],"about_ca_topic_score_codex":0.00003335484,"about_ca_topic_score_gemma":0.0000017627785,"teacher_disagreement_score":0.94522196,"about_ca_system_score_codex":0.000041417767,"about_ca_system_score_gemma":0.00021979908,"threshold_uncertainty_score":0.27377328},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011411995,0.00198655,0.9925169,0.0006826421,0.0029375618,0.00026874736,8.552702e-7,0.00013714464,0.0003283946],"genre_scores_gemma":[0.98038554,0.0000101881,0.016871449,0.00013154425,0.0018182176,0.00004493335,0.0000037468365,0.000019595867,0.0007147807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983081,0.00004066014,0.000543312,0.0002593919,0.000495711,0.00035278642],"domain_scores_gemma":[0.9988361,0.0002571825,0.0002197557,0.00018289282,0.00034935697,0.00015470122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010350919,0.00015616817,0.00024526982,0.0002226691,0.0001543178,0.00065441447,0.0004098726,0.000082574436,0.000022520411],"category_scores_gemma":[0.000115983195,0.000116792886,0.0003679531,0.00041156006,0.000027735165,0.0007062879,0.00007171412,0.000239324,0.000039011917],"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.00004208825,0.00012904522,0.00021547299,0.0001715255,0.00022471117,0.000129095,0.0005053056,0.00022535419,0.0007939905,0.5375671,0.012068454,0.44792786],"study_design_scores_gemma":[0.0004832919,0.00072765886,0.00013295654,0.000031954038,0.000046056775,0.000809098,0.00014415849,0.020129705,0.0003683907,0.037692945,0.93922335,0.00021046562],"about_ca_topic_score_codex":0.000011080155,"about_ca_topic_score_gemma":0.0000036607153,"teacher_disagreement_score":0.97924435,"about_ca_system_score_codex":0.00010591088,"about_ca_system_score_gemma":0.00022750656,"threshold_uncertainty_score":0.6310534},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88667154,0.0306921,0.06851616,0.0010567803,0.007157101,0.0018276512,0.000027326612,0.0000847476,0.003966583],"genre_scores_gemma":[0.96547836,0.00008445071,0.030841766,0.00007045856,0.0012657503,0.000038209753,0.000004734486,0.000027184527,0.0021891142],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99318844,0.00041195398,0.0027585903,0.000973364,0.0022055926,0.00046205515],"domain_scores_gemma":[0.99149394,0.003525261,0.0027944,0.00054632017,0.0013752629,0.00026484238],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006617251,0.00041193602,0.0011818378,0.0013860447,0.0003176989,0.0019626433,0.0006545862,0.00035879447,0.000034813012],"category_scores_gemma":[0.011032794,0.0003210448,0.00036820566,0.0008477558,0.00016249681,0.00044919198,0.0013743218,0.001527224,0.0000022721388],"study_design_candidate":"observational","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.00024028645,0.00012824174,0.25390008,0.00014058869,0.000110919274,0.00018455442,0.0008458655,0.0012692965,0.000021081583,0.0013051904,0.0014034343,0.74045044],"study_design_scores_gemma":[0.0038513027,0.0007876715,0.6056979,0.014259693,0.00031288512,0.0025770145,0.008652318,0.03213092,0.0000076224974,0.11376148,0.21656781,0.0013933909],"about_ca_topic_score_codex":0.00011711182,"about_ca_topic_score_gemma":0.00028013127,"teacher_disagreement_score":0.73905706,"about_ca_system_score_codex":0.00012902853,"about_ca_system_score_gemma":0.00043271788,"threshold_uncertainty_score":0.9999242},"labels":[],"label_agreement":null}]}