{"meta":{"query_hash":"7d44f54137f2","filters":{"venue":"Proceedings of the ACM on Programming Languages"},"cohort_total":133,"direct_labels_cover":0,"predictions_cover":133,"exported":133,"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/7d44f54137f2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+ACM+on+Programming+Languages"},"results":[{"id":"W2296691843","doi":"10.1145/3290322","title":"Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Programming language; Type inference; Type theory; Dependent type; Haskell; Soundness; Mathematical proof; Subtyping; Combinatory logic; Scala; Type (biology); Theoretical computer science; Lambda calculus; Inference; Functional programming; Mathematics; Artificial intelligence; Java","score_opus":0.04079259752242029,"score_gpt":0.27659583029821533,"score_spread":0.23580323277579504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296691843","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.93875265,0.018897591,0.016972093,0.005966581,0.0038890857,0.009006255,0.00004890263,0.0013041552,0.005162676],"genre_scores_gemma":[0.9680349,0.00002526437,0.030796425,0.00008056414,0.000210515,0.00011738121,0.000004530547,0.000035466834,0.0006949269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824685,0.000017834762,0.00031175173,0.0006967649,0.00038564295,0.00034116555],"domain_scores_gemma":[0.9983396,0.00016010404,0.0006104457,0.00055698614,0.00026432308,0.000068530346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005767386,0.00032919808,0.0004939725,0.00014194597,0.00019791575,0.000572339,0.001477632,0.00021939064,0.0000019099693],"category_scores_gemma":[0.00024264248,0.00021433985,0.00011668094,0.00018473847,0.00018164085,0.00015286825,0.0018669806,0.00031527015,0.0000016378876],"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.00060886046,0.0005480666,0.08102234,0.0108463885,0.0019443603,0.00001037,0.012359948,0.000047750756,0.010202975,0.6136733,0.0011153811,0.2676202],"study_design_scores_gemma":[0.0118477205,0.0065783113,0.07678893,0.0049538882,0.0020604536,0.00081113004,0.0047881426,0.003613892,0.041625947,0.7358399,0.103677355,0.0074143065],"about_ca_topic_score_codex":0.00012409645,"about_ca_topic_score_gemma":0.0000097032,"teacher_disagreement_score":0.2602059,"about_ca_system_score_codex":0.00003642892,"about_ca_system_score_gemma":0.000044529224,"threshold_uncertainty_score":0.8740525},"labels":[],"label_agreement":null},{"id":"W2625857119","doi":"10.1145/3133870","title":"A simple soundness proof for dependent object types","year":2017,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Soundness; Mathematical proof; Computer science; Simple (philosophy); Proof assistant; Scala; Type (biology); Proof of concept; Modular design; Calculus (dental); Core (optical fiber); Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.03382109932691566,"score_gpt":0.3052670116367823,"score_spread":0.27144591230986664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625857119","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.6213667,0.030189145,0.15386304,0.024546672,0.029272243,0.07495989,0.00029153694,0.009266898,0.0562439],"genre_scores_gemma":[0.9784188,0.000013987146,0.018593235,0.00006755932,0.00047997854,0.0009839617,0.000010300886,0.00005792074,0.0013742419],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970443,0.000022999719,0.0005220226,0.001019135,0.0007188006,0.00067271886],"domain_scores_gemma":[0.995439,0.00014958864,0.001424052,0.0022741393,0.00060693,0.00010629713],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012741638,0.0005016376,0.000680344,0.00016126812,0.00048814606,0.0013797863,0.010437118,0.00038119336,0.0000023341536],"category_scores_gemma":[0.0028533656,0.00033635163,0.00047547545,0.00015989169,0.00017172763,0.00026922402,0.0063433633,0.000558217,0.000006684006],"study_design_candidate":"theoretical_or_conceptual","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.00019182885,0.0010481912,0.014463888,0.009636281,0.0009880154,0.00001518051,0.01281022,0.00006357241,0.00205188,0.3098916,0.0064923223,0.64234704],"study_design_scores_gemma":[0.0020386493,0.0014531439,0.0015542071,0.000900917,0.00046512697,0.000086163614,0.0019090085,0.001232105,0.11633915,0.80345917,0.068219416,0.0023429573],"about_ca_topic_score_codex":0.0002306123,"about_ca_topic_score_gemma":0.00003861802,"teacher_disagreement_score":0.64000404,"about_ca_system_score_codex":0.00009955062,"about_ca_system_score_gemma":0.00017551871,"threshold_uncertainty_score":0.99990886},"labels":[],"label_agreement":null},{"id":"W2761352457","doi":"10.1145/3133923","title":"IDE <sup> <i>al</i> </sup> : efficient and precise alias-aware dataflow analysis","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":25,"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 Alberta","funders":"Heinz Nixdorf Stiftung","keywords":"Alias; Computer science; Dataflow; Programming language; Ideal (ethics); Aliasing; Static analysis; Parallel computing; Theoretical computer science; Algorithm; Data mining; Artificial intelligence","score_opus":0.020931023519955325,"score_gpt":0.29329843884934265,"score_spread":0.2723674153293873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761352457","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.9880183,0.00033903067,0.0032465265,0.006749373,0.00013393213,0.00043699448,0.000010543303,0.00023251727,0.0008327912],"genre_scores_gemma":[0.9666904,0.000016641723,0.032892965,0.00021665423,0.000058646696,0.000022424996,0.0000020196092,0.000010654011,0.000089564564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841535,0.000013920001,0.0002771937,0.0005522715,0.0004373616,0.00030389355],"domain_scores_gemma":[0.9974558,0.00013041624,0.00049171026,0.0016458698,0.00019034327,0.00008587761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076132227,0.00018130323,0.00025654698,0.00014516039,0.0007125096,0.0009203937,0.005162028,0.00006367209,0.000003592243],"category_scores_gemma":[0.0015570911,0.00013482047,0.00014360878,0.00044453543,0.0001774495,0.0003488264,0.0025866935,0.00019639265,0.0000038410794],"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.00009036226,0.00090127887,0.14964873,0.00075679517,0.0011129322,0.000011396184,0.02835312,0.00205506,0.003997458,0.04710152,0.008159851,0.7578115],"study_design_scores_gemma":[0.0029662328,0.0006865439,0.12955388,0.0015219863,0.0015039863,0.000103602346,0.008570826,0.67513406,0.12475704,0.0063674534,0.046306632,0.0025277776],"about_ca_topic_score_codex":0.00007592818,"about_ca_topic_score_gemma":0.0000028726008,"teacher_disagreement_score":0.7552837,"about_ca_system_score_codex":0.000023139975,"about_ca_system_score_gemma":0.000018494942,"threshold_uncertainty_score":0.95924187},"labels":[],"label_agreement":null},{"id":"W2761442781","doi":"10.1145/3133910","title":"A model for reasoning about JavaScript promises","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":36,"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","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Debugging; JavaScript; Correctness; Asynchrony (computer programming); Programming language; Asynchronous communication; Event (particle physics); Web application; Software engineering; Theoretical computer science; World Wide Web","score_opus":0.04014316125137894,"score_gpt":0.2973735126818726,"score_spread":0.25723035143049366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761442781","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.7067194,0.0060533783,0.1763037,0.022943966,0.0047767735,0.017731259,0.00002764975,0.004234939,0.061208908],"genre_scores_gemma":[0.8994732,0.0000076303,0.097758494,0.000091312126,0.00014523005,0.00028679828,6.6941413e-7,0.000025462103,0.0022112108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983006,0.0000071472514,0.0003004461,0.00050697813,0.00039136494,0.000493434],"domain_scores_gemma":[0.9973986,0.000055804616,0.0007061438,0.0014335171,0.00031936125,0.00008656683],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008069834,0.00023439032,0.00030417024,0.000070865826,0.0007928029,0.0010305975,0.0063651595,0.0001071347,7.8346204e-7],"category_scores_gemma":[0.0034282985,0.00015366227,0.00023120662,0.00011242746,0.00016078544,0.00061221974,0.0014214382,0.0001653731,0.000003856547],"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.000057233377,0.00023075081,0.011360719,0.00063863955,0.000112987276,0.0000020508587,0.006727867,0.000015201104,0.0044970796,0.6893891,0.0031674362,0.28380093],"study_design_scores_gemma":[0.0076204995,0.002660181,0.015074573,0.0016339391,0.00045439214,0.00017846354,0.0048702834,0.19341387,0.21079293,0.47350165,0.086162284,0.0036369374],"about_ca_topic_score_codex":0.0000695319,"about_ca_topic_score_gemma":0.000009839967,"teacher_disagreement_score":0.280164,"about_ca_system_score_codex":0.00003503182,"about_ca_system_score_gemma":0.000050204715,"threshold_uncertainty_score":0.99901086},"labels":[],"label_agreement":null},{"id":"W2762605937","doi":"10.1145/3133879","title":"The VM already knew that: leveraging compile-time knowledge to optimize gradual typing","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Compile time; Programmer; Soundness; JavaScript; Code (set theory); Compiler; Object (grammar); Parallel computing; Artificial intelligence","score_opus":0.035711187798949794,"score_gpt":0.30850801259024285,"score_spread":0.2727968247912931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762605937","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.6262939,0.0056902026,0.12807901,0.123877,0.0038246147,0.008023119,0.000014844049,0.0088713,0.09532601],"genre_scores_gemma":[0.80087346,0.000020391806,0.19719,0.00023724405,0.00012367546,0.0000514654,5.308301e-7,0.000026848886,0.0014764072],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984575,0.000025147761,0.00027837354,0.00044946143,0.00032225606,0.00046727812],"domain_scores_gemma":[0.99754,0.00018998446,0.00047919678,0.0014221758,0.0002685937,0.00010005604],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001034436,0.00023931143,0.0002591835,0.00009579308,0.0016002656,0.001347448,0.008086819,0.000068974376,0.0000013992544],"category_scores_gemma":[0.0017733526,0.00015019497,0.00013672777,0.00023635245,0.00016101846,0.00035541775,0.0034890417,0.0002576232,0.000023226808],"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.00010434693,0.0003982994,0.008273966,0.00021211655,0.00021974147,0.0000048909096,0.014330605,0.0007571725,0.0034555346,0.052412864,0.032790303,0.88704014],"study_design_scores_gemma":[0.005762378,0.0026391272,0.052758716,0.009258096,0.00034954768,0.00029959044,0.005354677,0.20068397,0.48840597,0.049377218,0.17894071,0.0061699864],"about_ca_topic_score_codex":0.000045533096,"about_ca_topic_score_gemma":0.0000023305379,"teacher_disagreement_score":0.88087016,"about_ca_system_score_codex":0.000046929257,"about_ca_system_score_gemma":0.00003702522,"threshold_uncertainty_score":0.99969953},"labels":[],"label_agreement":null},{"id":"W2764146461","doi":"10.1145/3133909","title":"Understanding the use of lambda expressions in Java","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Engineering Research","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Java; Programming language; Functional programming; Empirical research; Source code; Code (set theory); World Wide Web","score_opus":0.16163113067759652,"score_gpt":0.3304427533680927,"score_spread":0.16881162269049618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764146461","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.99202186,0.00010910568,0.002391544,0.0043731607,0.0001803222,0.00051285716,0.0000020252926,0.00013296177,0.00027614806],"genre_scores_gemma":[0.9758488,0.000007961355,0.023930361,0.000021749438,0.000022888564,0.000026010384,9.1193726e-8,0.000011577672,0.0001305828],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99889034,0.00001021996,0.00018226566,0.00021466309,0.00043047452,0.00027205056],"domain_scores_gemma":[0.99775374,0.0006850634,0.00022978047,0.001209301,0.00008653173,0.000035559486],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00056131114,0.000106088635,0.00014274947,0.00010746651,0.00023868053,0.00035041888,0.0051034456,0.000049266047,0.0000015326381],"category_scores_gemma":[0.012422058,0.000060389095,0.00006906523,0.0002469843,0.00018150215,0.00045495006,0.0021657594,0.0002532824,0.0000010077089],"study_design_candidate":"observational","study_design_consensus":"observational","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.000075110846,0.00044498907,0.70937604,0.00064870284,0.00012721258,0.000015699037,0.021303238,0.0004423995,0.056538723,0.11351048,0.0049070255,0.09261039],"study_design_scores_gemma":[0.002245,0.00064667023,0.62296355,0.0052332277,0.000053362935,0.00004565949,0.007268035,0.006306196,0.32329077,0.024263356,0.006579352,0.0011047941],"about_ca_topic_score_codex":0.00009478005,"about_ca_topic_score_gemma":0.000006280977,"teacher_disagreement_score":0.26675206,"about_ca_system_score_codex":0.000052809024,"about_ca_system_score_gemma":0.000022200535,"threshold_uncertainty_score":0.99589676},"labels":[],"label_agreement":null},{"id":"W2767778696","doi":"10.1145/3158121","title":"A new proof rule for almost-sure termination","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Eidgenössische Technische Hochschule Zürich; McGill University","keywords":"Soundness; Probabilistic logic; Markov chain; Connection (principal bundle); Computer science; Determinism; Mathematical proof; Mathematics; Discrete mathematics; Programming language; Statistics; Artificial intelligence","score_opus":0.023876055392494613,"score_gpt":0.29299206305768116,"score_spread":0.26911600766518656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767778696","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.60238415,0.005175082,0.16767524,0.09661971,0.010108605,0.030150581,0.00003087699,0.004444536,0.08341123],"genre_scores_gemma":[0.9274814,0.0000023328264,0.06860084,0.00006920722,0.00027099182,0.00015167681,0.0000012064205,0.000020335045,0.0034019866],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858886,0.000007051382,0.0002536607,0.00041256452,0.0003721852,0.00036565049],"domain_scores_gemma":[0.9978441,0.000060729482,0.0006478089,0.0010958795,0.00026859166,0.000082908155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061620615,0.00019295045,0.00023516826,0.000069417525,0.0005123113,0.00077894056,0.004985663,0.00010803657,0.0000021312142],"category_scores_gemma":[0.002112063,0.00012680085,0.00016960852,0.00012933523,0.000080243575,0.000566653,0.000984526,0.00013325142,0.0000054205225],"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.00002209631,0.00010023314,0.0069217584,0.00027818192,0.00004125663,0.0000013064424,0.0021833112,3.936344e-7,0.0031694777,0.12836897,0.0033349923,0.855578],"study_design_scores_gemma":[0.0035928485,0.0020546697,0.024810772,0.00041518145,0.00017062767,0.000110612265,0.0018324998,0.0008959612,0.47898448,0.29047528,0.19524552,0.0014115749],"about_ca_topic_score_codex":0.00009536934,"about_ca_topic_score_gemma":0.00000833323,"teacher_disagreement_score":0.85416645,"about_ca_system_score_codex":0.000031135118,"about_ca_system_score_gemma":0.00005259465,"threshold_uncertainty_score":0.92646855},"labels":[],"label_agreement":null},{"id":"W2778034045","doi":"10.1145/3158149","title":"Strategy synthesis for linear arithmetic games","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reachability; Computer science; Combinatorial game theory; Satisfiability; Dimension (graph theory); Game tree; Game theory; Repeated game; Theoretical computer science; Sequential game; Mathematical economics; Mathematics; Combinatorics","score_opus":0.04933114638016753,"score_gpt":0.34786677953858947,"score_spread":0.2985356331584219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778034045","genre_codex":"empirical","genre_gemma":"methods","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.91997993,0.00066160585,0.046841145,0.014386967,0.0013572645,0.0038918357,0.00002367272,0.0010331911,0.011824411],"genre_scores_gemma":[0.4472399,0.0000051681945,0.5523515,0.000031180993,0.00006223983,0.0001252873,1.2903651e-7,0.000010292644,0.00017429591],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989742,0.000009069301,0.00020460041,0.00030217972,0.00025407856,0.00025589622],"domain_scores_gemma":[0.9978813,0.00016415949,0.00048176554,0.0012199002,0.00021142658,0.000041450774],"candidate_categories":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.00088166806,0.0001340464,0.00017558425,0.000062675834,0.00037367633,0.00040094147,0.00560471,0.00006884993,0.0000013585355],"category_scores_gemma":[0.010779417,0.00009178014,0.00011714353,0.00010437752,0.00014888887,0.00048038585,0.0007899685,0.000116924035,0.0000032945954],"study_design_candidate":"bench_or_experimental","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.000022965454,0.00009111762,0.0014033022,0.00024040448,0.000032045773,3.1807267e-7,0.0005612883,0.000004373607,0.0062858067,0.12355352,0.00024640755,0.8675584],"study_design_scores_gemma":[0.0003780859,0.0004408424,0.014788986,0.0004150259,0.00006420086,0.0000151442855,0.00074344437,0.007087735,0.9464869,0.023406683,0.0057756035,0.00039732974],"about_ca_topic_score_codex":0.000018489787,"about_ca_topic_score_gemma":7.541272e-7,"teacher_disagreement_score":0.9402011,"about_ca_system_score_codex":0.000021209524,"about_ca_system_score_gemma":0.000020394353,"threshold_uncertainty_score":0.99977547},"labels":[],"label_agreement":null},{"id":"W2892721170","doi":"10.1145/3290357","title":"Skeletal semantics and their interpretations","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche; Canadian Institute of Steel Construction","keywords":"Generator (circuit theory); Simple (philosophy); Semantics (computer science); Consistency (knowledge bases); Constraint (computer-aided design); Compiler; Development (topology)","score_opus":0.010547955060049876,"score_gpt":0.24433457851459336,"score_spread":0.23378662345454349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892721170","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.98389417,0.00086012366,0.0032312602,0.002882051,0.000570074,0.0010920026,0.0000015736151,0.00040950777,0.0070592654],"genre_scores_gemma":[0.99164003,0.0000068995337,0.0076669306,0.00010579572,0.000042440486,0.000021666428,6.213038e-7,0.000012119658,0.00050349685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990551,0.000010145784,0.00019485646,0.00029867628,0.00019810074,0.00024315382],"domain_scores_gemma":[0.99904567,0.00008933579,0.00020332479,0.0004942997,0.00012008108,0.000047298854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324105,0.00015450943,0.00019217923,0.00007499792,0.00009276929,0.00023654311,0.001745561,0.000061031933,0.000002470284],"category_scores_gemma":[0.00034612283,0.00009018754,0.00009327636,0.0002821106,0.00008186454,0.0002574621,0.00090062985,0.00015188355,0.000014715418],"study_design_candidate":"theoretical_or_conceptual","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.000009620102,0.00015917617,0.038368434,0.0004720819,0.000103889965,0.0000011848446,0.014704132,0.0000020555888,0.011460211,0.6197725,0.0003509526,0.3145958],"study_design_scores_gemma":[0.0047445167,0.0053490647,0.047599025,0.0010201342,0.00024001955,0.0006427086,0.04835611,0.011911254,0.3750969,0.3560357,0.14519012,0.003814482],"about_ca_topic_score_codex":0.000021239975,"about_ca_topic_score_gemma":0.0000019320094,"teacher_disagreement_score":0.36363667,"about_ca_system_score_codex":0.000014095572,"about_ca_system_score_gemma":0.000013901805,"threshold_uncertainty_score":0.3677741},"labels":[],"label_agreement":null},{"id":"W2898093955","doi":"10.1145/3276532","title":"Finding broken promises in asynchronous JavaScript programs","year":2018,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Callback; Debugging; JavaScript; Asynchrony (computer programming); Programming language; Control flow; Event (particle physics); Web application; Asynchronous communication; Theoretical computer science; Software engineering; World Wide Web","score_opus":0.024722286052360872,"score_gpt":0.2683616435545759,"score_spread":0.24363935750221505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898093955","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.9696762,0.001217289,0.0016028334,0.0021452042,0.0012580911,0.0033934824,0.0000011263949,0.0011269253,0.019578828],"genre_scores_gemma":[0.97589546,0.0000070719034,0.023005724,0.00009974802,0.00026748213,0.00018589984,0.0000011263977,0.000030371097,0.0005070917],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99751174,0.00002856907,0.00048720615,0.0006577646,0.00058108306,0.00073360966],"domain_scores_gemma":[0.9982262,0.000064507105,0.00042996724,0.0009065542,0.00027083582,0.00010190914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096613483,0.00030947154,0.00037373762,0.00022308179,0.0002290459,0.00047308646,0.0043881554,0.00014952848,0.000006117827],"category_scores_gemma":[0.0010580092,0.00020937272,0.0001676221,0.0010802536,0.0002898574,0.00049589784,0.001367031,0.00029284082,0.000034335506],"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.00004568283,0.0006344397,0.11010947,0.00041141623,0.00007912402,0.000011103921,0.0113606155,7.822681e-7,0.004056237,0.13014925,0.0008248129,0.7423171],"study_design_scores_gemma":[0.0088584395,0.012540646,0.077121235,0.0023643863,0.00025576944,0.0006098737,0.018935304,0.0020506014,0.52609587,0.1485521,0.19742085,0.0051948894],"about_ca_topic_score_codex":0.00022357385,"about_ca_topic_score_gemma":0.000051949297,"teacher_disagreement_score":0.7371222,"about_ca_system_score_codex":0.00010073416,"about_ca_system_score_gemma":0.000060965638,"threshold_uncertainty_score":0.8537972},"labels":[],"label_agreement":null},{"id":"W2899524259","doi":"10.1145/3290344","title":"Quantitative robustness analysis of quantum programs","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wind Energy Technologies Office; Office of Science; Canadian Institute for Advanced Research; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Robustness (evolution); Quantum computer; Quantum; Quantum logic; Computation; Quantum algorithm; Quantum error correction; Property (philosophy)","score_opus":0.013642235190661834,"score_gpt":0.2654272453488792,"score_spread":0.25178501015821736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899524259","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.995248,0.00019891934,0.0026495866,0.0009298214,0.0001514219,0.00042412404,0.000002574226,0.00015321284,0.00024231813],"genre_scores_gemma":[0.8857912,0.0000030335243,0.11404853,0.000031870215,0.000017392465,0.000013870949,0.0000016494756,0.000013285515,0.00007918622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982888,0.000020144096,0.00036332256,0.00045121,0.0005373238,0.00033920005],"domain_scores_gemma":[0.99810785,0.00017592678,0.0005456127,0.0008205533,0.0002976924,0.00005233935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005496415,0.00020574432,0.00046809588,0.0003364976,0.000081988976,0.00011910519,0.0034976688,0.000069897505,0.0000037810755],"category_scores_gemma":[0.00044604478,0.00013180802,0.00034410655,0.0025938512,0.00012011223,0.00016667458,0.001091024,0.00022708386,0.0000026717087],"study_design_candidate":"simulation_or_modeling","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.00012976333,0.0012037008,0.086330526,0.0009357152,0.0024943876,0.0000044700664,0.014504205,0.021324627,0.014097167,0.32337508,0.00019745508,0.5354029],"study_design_scores_gemma":[0.0006346708,0.0017527831,0.02417737,0.00066143565,0.00048365098,0.000011310365,0.0029624086,0.9390508,0.02575436,0.0033097318,0.00059377047,0.0006076994],"about_ca_topic_score_codex":0.00004811366,"about_ca_topic_score_gemma":0.0000021707233,"teacher_disagreement_score":0.91772616,"about_ca_system_score_codex":0.000017196915,"about_ca_system_score_gemma":0.000025348985,"threshold_uncertainty_score":0.6499597},"labels":[],"label_agreement":null},{"id":"W2900044545","doi":"10.1145/3290361","title":"Context-, flow-, and field-sensitive data-flow analysis using synchronized Pushdown systems","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":73,"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 Alberta","funders":"Heinz Nixdorf Stiftung","keywords":"Reachability; Computer science; Context (archaeology); Path (computing); Flow (mathematics); Sensitivity (control systems); Decidability; Undecidable problem; Theoretical computer science; Set (abstract data type); Field (mathematics); Algorithm; Mathematics; Programming language; Pure mathematics; Geometry","score_opus":0.01762344739751871,"score_gpt":0.2833335576704017,"score_spread":0.265710110272883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900044545","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.77666867,0.0012157933,0.21644367,0.0012763715,0.0005175491,0.00216447,0.000035106117,0.0011759687,0.0005023725],"genre_scores_gemma":[0.8112945,0.000011240716,0.18842334,0.000112267924,0.000036208497,0.000016428012,0.0000022529666,0.000013094203,0.000090667265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998485,0.000020696953,0.0002802627,0.0005842739,0.0003578194,0.00027189188],"domain_scores_gemma":[0.9979275,0.00020892415,0.00035584293,0.0011904765,0.00026233602,0.000054959015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005108956,0.00019467337,0.00038452787,0.00022223592,0.00011962293,0.0002592067,0.002199325,0.00009246147,0.0000029656046],"category_scores_gemma":[0.0009963221,0.0001426772,0.00009589003,0.00085121207,0.000064127526,0.0006429251,0.0020244413,0.00020778639,0.000002352918],"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.00014828415,0.00017953788,0.011085115,0.0007601806,0.0012621757,0.000013079548,0.0044319094,0.0008715312,0.048909824,0.0073818536,0.000585496,0.924371],"study_design_scores_gemma":[0.0012026285,0.0008860769,0.0008134838,0.00088049995,0.0007149533,0.00015388776,0.0060142563,0.5700607,0.41393444,0.0013668749,0.0029350684,0.001037151],"about_ca_topic_score_codex":0.00014492295,"about_ca_topic_score_gemma":0.000006773821,"teacher_disagreement_score":0.9233339,"about_ca_system_score_codex":0.00005167737,"about_ca_system_score_gemma":0.000020019897,"threshold_uncertainty_score":0.5818208},"labels":[],"label_agreement":null},{"id":"W2939756730","doi":"10.1145/3360571","title":"A path to DOT: formalizing fully path-dependent types","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Scala; Soundness; Computer science; Path (computing); Modular design; Programming language; Theoretical computer science; Mathematical proof; Algorithm; Mathematics; Java","score_opus":0.020336131196861847,"score_gpt":0.26699412725629745,"score_spread":0.2466579960594356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939756730","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.83212465,0.013083418,0.035374895,0.016647423,0.017103473,0.024191167,0.00007603074,0.0061083906,0.055290535],"genre_scores_gemma":[0.9643324,0.000027872107,0.03328097,0.00033743176,0.00033938262,0.00030658423,0.0000050828644,0.000062493724,0.0013077983],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99623483,0.000034210512,0.0006750796,0.0011257387,0.0011014892,0.0008286429],"domain_scores_gemma":[0.99630696,0.00009873907,0.00092854345,0.002004593,0.0004773902,0.0001837725],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001306076,0.00058616785,0.0007185299,0.0002668796,0.00020079881,0.0009571172,0.008532228,0.00037920004,0.0000059579393],"category_scores_gemma":[0.0011128502,0.00039917318,0.0004088014,0.00050028693,0.000070576236,0.00030022714,0.010028354,0.00081765227,0.00009135263],"study_design_candidate":"theoretical_or_conceptual","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.0001910256,0.0010293585,0.025291398,0.011346083,0.00080362207,0.00005452411,0.041477017,0.00022999922,0.0076586856,0.35161617,0.009214363,0.55108774],"study_design_scores_gemma":[0.0076971846,0.010811286,0.014801905,0.013192495,0.0015814656,0.0008385421,0.02826131,0.005093267,0.25256708,0.3232898,0.32618982,0.01567584],"about_ca_topic_score_codex":0.00024836382,"about_ca_topic_score_gemma":0.000009937714,"teacher_disagreement_score":0.5354119,"about_ca_system_score_codex":0.00014590558,"about_ca_system_score_gemma":0.00013229236,"threshold_uncertainty_score":0.99984604},"labels":[],"label_agreement":null},{"id":"W2949241294","doi":"10.1145/3341692","title":"Approximate normalization for gradual dependent types","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"FP7 Ideas: European Research Council; Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Normalization (sociology); Soundness; Decidability; Type inference; Static analysis; Type (biology); Program analysis; Type theory; Data type","score_opus":0.01674766759670279,"score_gpt":0.2576217341192946,"score_spread":0.24087406652259183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949241294","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.8896633,0.0020909973,0.06686609,0.004980838,0.0036989122,0.010332139,0.000009322835,0.002066607,0.02029183],"genre_scores_gemma":[0.9794537,0.00000452222,0.019209692,0.00009004511,0.00008825987,0.00011244376,0.0000026807454,0.000018716522,0.0010199844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869657,0.000009183389,0.00024740602,0.00035641785,0.00036108753,0.00032934517],"domain_scores_gemma":[0.9988395,0.000064102074,0.00030447656,0.0005234438,0.00022354466,0.000044907396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053234433,0.00016390321,0.00020512719,0.000081533195,0.00011260821,0.00023008203,0.0022067253,0.00007794775,0.0000029432035],"category_scores_gemma":[0.0004119377,0.00010655373,0.00012138635,0.00029973628,0.000037769692,0.00030320598,0.0005821964,0.00009805491,0.000017076676],"study_design_candidate":"theoretical_or_conceptual","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.00004574983,0.00021770025,0.0246782,0.00081474223,0.00008480826,7.241571e-7,0.003790134,0.000020658174,0.0066162776,0.8222534,0.0006125844,0.140865],"study_design_scores_gemma":[0.006055324,0.004426743,0.007362857,0.00044119285,0.00027492314,0.00017549115,0.0064098164,0.0111209955,0.65543056,0.1997545,0.10587097,0.0026766267],"about_ca_topic_score_codex":0.000026777441,"about_ca_topic_score_gemma":0.0000028136083,"teacher_disagreement_score":0.64881426,"about_ca_system_score_codex":0.000028323013,"about_ca_system_score_gemma":0.00002029841,"threshold_uncertainty_score":0.43451348},"labels":[],"label_agreement":null},{"id":"W2952230935","doi":"10.1145/3341715","title":"Mixed linear and non-linear recursive types","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Air Force Office of Scientific Research; Leibniz-Gemeinschaft; Simons Institute for the Theory of Computing, University of California Berkeley; Multidisciplinary University Research Initiative; Agence Nationale de la Recherche","keywords":"Recursion (computer science); Linear programming; Linear logic; Categorical variable; Type theory; Type (biology); Computer science; Mathematics; Algorithm; Theoretical computer science; Algebra over a field; Pure mathematics","score_opus":0.017682923088276903,"score_gpt":0.2565652080810734,"score_spread":0.2388822849927965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952230935","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.98935354,0.00076413015,0.00069847546,0.0018260281,0.0007533122,0.0011707628,0.0000012210354,0.00030120485,0.0051313443],"genre_scores_gemma":[0.9657005,0.000014705858,0.03290595,0.00011383529,0.00012392407,0.000027013257,8.6339287e-7,0.000018413071,0.0010948107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986638,0.000012288706,0.00023333053,0.00042321323,0.000335707,0.00033169752],"domain_scores_gemma":[0.9987746,0.0000882019,0.00027420538,0.00059091917,0.00020001055,0.000072068295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004705583,0.00019247048,0.00026514204,0.00008673043,0.00010417486,0.00013754297,0.001952955,0.000102382626,0.0000039395795],"category_scores_gemma":[0.00055877364,0.00012360382,0.00009720132,0.00037083845,0.00008964671,0.00025162596,0.00095317274,0.0002010197,0.000048233014],"study_design_candidate":"theoretical_or_conceptual","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.00012083862,0.0004981548,0.10718205,0.0014387795,0.0003055826,0.000011262536,0.015193296,0.000014257623,0.017149853,0.49000826,0.0027898576,0.3652878],"study_design_scores_gemma":[0.007256579,0.0076011824,0.040112235,0.0012222116,0.00036339535,0.00038546885,0.01789865,0.0075177974,0.58289003,0.11842495,0.21227695,0.0040505594],"about_ca_topic_score_codex":0.000052179632,"about_ca_topic_score_gemma":0.0000025941115,"teacher_disagreement_score":0.56574017,"about_ca_system_score_codex":0.000019801777,"about_ca_system_score_gemma":0.000022604774,"threshold_uncertainty_score":0.5040418},"labels":[],"label_agreement":null},{"id":"W2962835979","doi":"10.1145/3371123","title":"A probabilistic separation logic","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; McGill University; University of Wisconsin-Madison; National Science Foundation","keywords":"Soundness; Probabilistic logic; Mathematical proof; Probabilistic CTL; Probabilistic argumentation; Independence (probability theory)","score_opus":0.013394098237960375,"score_gpt":0.27735756396492733,"score_spread":0.26396346572696694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962835979","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.99241185,0.00016891203,0.00042564736,0.0018527597,0.00019799874,0.0007943133,0.000003871965,0.0002598038,0.0038848622],"genre_scores_gemma":[0.95594585,0.00000337729,0.0437535,0.00017807432,0.000031363805,0.000030923693,0.0000016112645,0.0000063005214,0.00004901659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989978,0.000007924514,0.00016892106,0.00031477152,0.000298026,0.00021255988],"domain_scores_gemma":[0.99891603,0.0000688515,0.00017717842,0.0006844981,0.00011741892,0.00003599357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003287,0.00011987401,0.00013756192,0.0000739193,0.00007354709,0.0001637168,0.002494729,0.000052447387,0.00000827292],"category_scores_gemma":[0.00060610595,0.00007764614,0.000100139434,0.0005335487,0.000055915545,0.0003630727,0.000803832,0.00014021824,0.000024025541],"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.0000244404,0.00021783971,0.0107781,0.0002505957,0.000023961065,6.462399e-7,0.001991287,0.0000061964174,0.00823951,0.94285995,0.0010205661,0.034586903],"study_design_scores_gemma":[0.0022538016,0.0025494571,0.04723751,0.0009804828,0.00011191091,0.000094001196,0.0030420674,0.002859447,0.14715025,0.75717795,0.03495364,0.0015895092],"about_ca_topic_score_codex":0.0000123640975,"about_ca_topic_score_gemma":0.0000017653956,"teacher_disagreement_score":0.18568203,"about_ca_system_score_codex":0.000015750964,"about_ca_system_score_gemma":0.000015022476,"threshold_uncertainty_score":0.46358684},"labels":[],"label_agreement":null},{"id":"W2964516878","doi":"10.1145/3341719","title":"Teaching the art of functional programming using automated grading (experience report)","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":16,"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":"Correctness; Computer science; Functional programming; Grading (engineering); Programming language; Computer programming; Code (set theory); Multimedia; Software engineering; Mathematics education; Psychology","score_opus":0.020091384872334507,"score_gpt":0.2914121183470974,"score_spread":0.2713207334747629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964516878","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.99285865,0.00021239753,0.0024244096,0.0016138268,0.0005401711,0.00080383837,6.8233305e-7,0.0010454576,0.00050055713],"genre_scores_gemma":[0.8557154,9.749872e-7,0.14345035,0.000074500946,0.000089959154,0.00004088816,0.0000017241512,0.00003315218,0.000593023],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970422,0.000078095094,0.0006707799,0.00065428193,0.00095745607,0.00059721083],"domain_scores_gemma":[0.99705034,0.0003140484,0.0011102941,0.0012023328,0.00024453027,0.000078420344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022772318,0.00032001073,0.000385569,0.00019538726,0.00056933874,0.00038012638,0.0034175327,0.000114819,0.000005364097],"category_scores_gemma":[0.0024727052,0.00020025055,0.0002759713,0.0008150418,0.0002150261,0.0005785871,0.0013294447,0.0008323529,0.000007146039],"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.00010087104,0.00076581223,0.16131222,0.0009526706,0.00036164673,0.000028123017,0.05041437,0.0015384628,0.077267714,0.04627415,0.0012347542,0.6597492],"study_design_scores_gemma":[0.006101843,0.003924399,0.078928545,0.01210156,0.0007912734,0.006512546,0.07935281,0.17338175,0.14494936,0.004185749,0.4834813,0.0062888674],"about_ca_topic_score_codex":0.00019322684,"about_ca_topic_score_gemma":0.0000013993072,"teacher_disagreement_score":0.6534603,"about_ca_system_score_codex":0.000082135644,"about_ca_system_score_gemma":0.00006645935,"threshold_uncertainty_score":0.81659806},"labels":[],"label_agreement":null},{"id":"W2966091573","doi":"10.1145/3341702","title":"From high-level inference algorithms to efficient code","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":9,"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":"Defense Advanced Research Projects Agency; Lilly Endowment; Eli Lilly and Company; National Science Foundation","keywords":"Computer science; Probabilistic logic; Inference; Code (set theory); Theoretical computer science; Algorithm; Compiler; Programming language; Artificial intelligence","score_opus":0.027626908577492587,"score_gpt":0.2898079864273575,"score_spread":0.2621810778498649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966091573","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.96949553,0.000067057685,0.02603428,0.0028618607,0.00036526655,0.00044149152,0.000017952452,0.00024665502,0.00046991563],"genre_scores_gemma":[0.81408554,0.0000017518768,0.185196,0.00033234837,0.00006493243,0.000028250572,0.0000010875343,0.000013170232,0.00027694012],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982812,0.0000100447205,0.00026291405,0.000548008,0.0005247632,0.00037308494],"domain_scores_gemma":[0.998444,0.00014244168,0.00018277593,0.00088092475,0.00023735738,0.00011246754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033278967,0.00020648915,0.0002445861,0.00009550452,0.00008530119,0.0002515684,0.0041883606,0.000082752085,0.0000110781175],"category_scores_gemma":[0.0007198129,0.00014355071,0.000084257765,0.0005136628,0.000044921693,0.00014921323,0.0015917986,0.00023529417,0.000104586],"study_design_candidate":"bench_or_experimental","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.000081086226,0.00066660217,0.0113880215,0.0002161591,0.0001337193,0.0000047593408,0.018123068,0.0018461792,0.07152527,0.15274288,0.0017632421,0.741509],"study_design_scores_gemma":[0.0023362169,0.0020653168,0.04147554,0.0028773246,0.00010878241,0.000021722157,0.0045730425,0.07658753,0.80466735,0.058575112,0.004189826,0.0025222152],"about_ca_topic_score_codex":0.00026624615,"about_ca_topic_score_gemma":0.0000028708444,"teacher_disagreement_score":0.7389868,"about_ca_system_score_codex":0.000038494894,"about_ca_system_score_gemma":0.000039014532,"threshold_uncertainty_score":0.7783086},"labels":[],"label_agreement":null},{"id":"W2968326497","doi":"10.1145/3371077","title":"Undecidability of <i> d <sub>&lt;:</sub> </i> and its decidable fragments","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Strong","keywords":"Decidability; Soundness; Subtyping; Mathematical proof; Completeness (order theory); Undecidable problem; Intersection (aeronautics); Calculus (dental)","score_opus":0.013174676643727097,"score_gpt":0.2418999690306452,"score_spread":0.2287252923869181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968326497","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.99516624,0.0007098542,0.0001514416,0.0003293307,0.00023444335,0.0009848517,0.0000012368496,0.00012524302,0.0022973707],"genre_scores_gemma":[0.99624157,0.000018940114,0.0033819294,0.000076624674,0.000036085687,0.000045967066,5.313595e-7,0.00001621865,0.00018212797],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982008,0.000020928186,0.00038468672,0.00048837904,0.0005322757,0.00037293168],"domain_scores_gemma":[0.998351,0.00014100123,0.00045109767,0.00069951545,0.00027371867,0.0000837006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083028874,0.00021108035,0.00035512244,0.00009194944,0.000095309144,0.0001431905,0.0022199766,0.000112051785,0.0000034997408],"category_scores_gemma":[0.0007341281,0.00014270609,0.00012368523,0.0005031181,0.000090458496,0.00036022966,0.001277317,0.0001700237,0.000015330774],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000082217164,0.00072459836,0.1501903,0.0019395999,0.00017282522,0.0000026309924,0.0041029253,0.000008134571,0.39757034,0.24820104,0.0006503573,0.19635502],"study_design_scores_gemma":[0.0008279479,0.00064966857,0.009524824,0.00014139769,0.000035216297,0.000020301273,0.0006460502,0.00022345483,0.9655091,0.019334715,0.002734607,0.0003526924],"about_ca_topic_score_codex":0.0000272315,"about_ca_topic_score_gemma":0.000004083534,"teacher_disagreement_score":0.56793875,"about_ca_system_score_codex":0.00003655168,"about_ca_system_score_gemma":0.00003342461,"threshold_uncertainty_score":0.58193856},"labels":[],"label_agreement":null},{"id":"W2980232248","doi":"10.1145/3360582","title":"DProf: distributed profiler with strong guarantees","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Timestamp; Computer science; Bottleneck; Synchronization (alternating current); Distributed computing; Context (archaeology); Parallel computing; Real-time computing; Algorithm; Embedded system","score_opus":0.008038752805000207,"score_gpt":0.23542261593204922,"score_spread":0.227383863127049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980232248","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.99100786,0.0002397503,0.001567498,0.0020132342,0.00022670646,0.001248617,0.000035190573,0.0003550024,0.0033061232],"genre_scores_gemma":[0.98636454,0.0000016835489,0.012834058,0.00006398015,0.00004468348,0.000070608396,0.000005429519,0.000017479604,0.00059753755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998329,0.0000095081095,0.0002674481,0.00045009286,0.0005355319,0.00040843122],"domain_scores_gemma":[0.9984663,0.000045646833,0.0003325861,0.0008431523,0.00025546347,0.000056838457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998181,0.00022232239,0.0002852264,0.00005727434,0.00010350919,0.00024711664,0.003140857,0.00007147983,0.000007292163],"category_scores_gemma":[0.00019528241,0.00012792699,0.00009885911,0.0006152549,0.00007691483,0.00041064876,0.00062423496,0.00021983396,0.00002303531],"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.00040239838,0.0012012012,0.35046875,0.0021777337,0.00053777924,0.000020673078,0.0060144337,0.00017631153,0.03875613,0.39285743,0.011071536,0.19631563],"study_design_scores_gemma":[0.012263714,0.007175409,0.24200845,0.010984023,0.000302979,0.00048399408,0.020498289,0.009910212,0.54636186,0.0072152126,0.13743557,0.0053602927],"about_ca_topic_score_codex":0.000028153752,"about_ca_topic_score_gemma":0.0000016958465,"teacher_disagreement_score":0.50760573,"about_ca_system_score_codex":0.000037343587,"about_ca_system_score_gemma":0.000033648234,"threshold_uncertainty_score":0.5836546},"labels":[],"label_agreement":null},{"id":"W2995123640","doi":"10.1145/3371129","title":"Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FP7 Ideas: European Research Council; Leverhulme Trust; McGill University; National Science Foundation","keywords":"Kleene algebra; Kleene's recursion theorem; Completeness (order theory); Algebra over a field; Equational logic; Universal algebra; Contrast (vision); Linear algebra","score_opus":0.011165097913350956,"score_gpt":0.23049799987184091,"score_spread":0.21933290195848995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995123640","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.99587446,0.00015600768,0.0000752195,0.0003833738,0.000055117664,0.0007645597,8.218213e-7,0.00016666013,0.0025237491],"genre_scores_gemma":[0.9615775,0.0000037210061,0.0378426,0.000029939314,0.00002694571,0.00004255387,0.0000024946996,0.000018494291,0.0004557606],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863553,0.000017050983,0.00029615156,0.0003959512,0.00035173778,0.00030356398],"domain_scores_gemma":[0.9985164,0.00008089764,0.0003820599,0.0006877033,0.0002863183,0.00004663923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043406337,0.00018742723,0.00028880336,0.00013223091,0.000038753416,0.00010072254,0.0023869497,0.00008725877,0.0000075826415],"category_scores_gemma":[0.00056457764,0.00011867462,0.0000817223,0.0008728267,0.000116820935,0.0003083275,0.00049048464,0.00019668767,0.000023849881],"study_design_candidate":"bench_or_experimental","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.00042158048,0.0016455941,0.40911826,0.0009632114,0.0002001247,0.0000064966466,0.027912693,0.000025693309,0.14076352,0.045096222,0.0002773795,0.37356922],"study_design_scores_gemma":[0.0075504263,0.012510387,0.21170156,0.006897179,0.00019485183,0.00011832827,0.0070441966,0.018725932,0.7196263,0.0077757253,0.005408423,0.0024466694],"about_ca_topic_score_codex":0.00006505398,"about_ca_topic_score_gemma":0.0000054147977,"teacher_disagreement_score":0.5788628,"about_ca_system_score_codex":0.00004059765,"about_ca_system_score_gemma":0.00004483242,"threshold_uncertainty_score":0.48394108},"labels":[],"label_agreement":null},{"id":"W2995623611","doi":"10.1145/3371081","title":"Reductions for safety proofs","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":20,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Correctness; Computer science; Programming language; Class (philosophy); Context (archaeology); Soundness; Commutative property; Theoretical computer science; Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.015745069634750638,"score_gpt":0.2756575389875628,"score_spread":0.25991246935281215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995623611","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.93692315,0.00051605894,0.011624966,0.031150091,0.0021932994,0.0042585214,0.000009834858,0.0010879791,0.012236083],"genre_scores_gemma":[0.8338829,0.0000029234832,0.16516574,0.00014337484,0.00010814889,0.000063768355,8.365601e-7,0.000010375153,0.0006219343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991101,0.0000049795085,0.00019746031,0.00028604167,0.00019947885,0.00020193984],"domain_scores_gemma":[0.9988986,0.00012022764,0.0002092102,0.00054758263,0.00019487322,0.00002948506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041194883,0.00009438387,0.000117730124,0.000060343595,0.00016965631,0.00012181158,0.0023003416,0.000047301666,0.0000026714335],"category_scores_gemma":[0.0007902417,0.000069273614,0.00010270055,0.00036265468,0.00004084179,0.00021520781,0.00048540457,0.00011620467,0.0000065730187],"study_design_candidate":"theoretical_or_conceptual","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.000049497336,0.00024181514,0.004547678,0.00043374195,0.000060773447,1.0870604e-7,0.0058196094,0.00004007748,0.015512869,0.6712234,0.0038989028,0.29817152],"study_design_scores_gemma":[0.002468249,0.0013572555,0.011299426,0.001160348,0.00008440717,0.00008079493,0.007074194,0.00969699,0.5680558,0.08350742,0.31395355,0.0012615285],"about_ca_topic_score_codex":0.0000050351246,"about_ca_topic_score_gemma":3.0022963e-7,"teacher_disagreement_score":0.587716,"about_ca_system_score_codex":0.000027445585,"about_ca_system_score_gemma":0.00002367404,"threshold_uncertainty_score":0.42746454},"labels":[],"label_agreement":null},{"id":"W2996703997","doi":"10.1145/3371113","title":"The future is ours: prophecy variables in separation logic","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":60,"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":"Horizon 2020; Horizon 2020 Framework Programme; Fonds Wetenschappelijk Onderzoek; European Commission","keywords":"Separation logic; Computer science; Hoare logic; Correctness; Axiomatic semantics; Soundness; Programming language; Atomicity; Concurrency; Theoretical computer science; Operational semantics; Semantics (computer science)","score_opus":0.00815648363780745,"score_gpt":0.2676606539177327,"score_spread":0.25950417027992523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996703997","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.9580981,0.002960375,0.00037405195,0.028866671,0.0011638749,0.002132726,0.000008869103,0.00026754508,0.006127788],"genre_scores_gemma":[0.99187213,0.000023057672,0.0067185857,0.00025188227,0.0001208964,0.00006519483,8.628038e-7,0.000009047913,0.0009383539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988001,0.000013890869,0.00024437107,0.00030532735,0.00034980415,0.0002864871],"domain_scores_gemma":[0.99890995,0.000058116042,0.00025758703,0.00060200243,0.00014462149,0.000027697579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060085545,0.00013869189,0.00016569487,0.000041228068,0.0001273302,0.00032975365,0.0026464544,0.000078059165,0.0000025331046],"category_scores_gemma":[0.00020352943,0.000072380644,0.000073375806,0.0005487605,0.000038350503,0.00030612177,0.00044091785,0.00018994542,0.000016402795],"study_design_candidate":"theoretical_or_conceptual","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.00009455621,0.0004131252,0.06807125,0.00060867664,0.00009084085,0.0000042235365,0.010963132,0.000064902044,0.014114214,0.53371257,0.014826006,0.35703653],"study_design_scores_gemma":[0.0051061944,0.0022597306,0.08775471,0.0038741261,0.00008640006,0.00015009734,0.033166736,0.01277656,0.12255526,0.105799444,0.6238384,0.002632316],"about_ca_topic_score_codex":0.000025018326,"about_ca_topic_score_gemma":0.000005489262,"teacher_disagreement_score":0.6090124,"about_ca_system_score_codex":0.000034277822,"about_ca_system_score_gemma":0.00002657851,"threshold_uncertainty_score":0.49178147},"labels":[],"label_agreement":null},{"id":"W3010821527","doi":"10.1145/3428243","title":"A type-and-effect system for object initialization","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Initialization; Computer science; Correctness; Programming language; Java; Scala; Object (grammar); Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.02470907620312796,"score_gpt":0.27095255806464413,"score_spread":0.24624348186151618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010821527","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.8249359,0.0066311937,0.09730759,0.021864098,0.0045166654,0.019965323,0.000015703507,0.0069788424,0.017784653],"genre_scores_gemma":[0.9913112,0.0000032603803,0.008195115,0.00015723598,0.00016682067,0.000104222214,0.0000014357798,0.000017017572,0.00004367876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998951,0.000018564504,0.0002172158,0.00033658266,0.00024173428,0.00023488849],"domain_scores_gemma":[0.9990717,0.000119140015,0.00024130265,0.0002702903,0.00022542395,0.00007213945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004541996,0.0001568232,0.0002401872,0.000047277503,0.00013899438,0.00022918191,0.0013485925,0.00007358189,4.7662337e-7],"category_scores_gemma":[0.0018712773,0.000099776946,0.000083767925,0.00051300117,0.000047293503,0.00018411808,0.0004926527,0.000092506336,0.000004250998],"study_design_candidate":"bench_or_experimental","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.0001870405,0.00009012076,0.013209508,0.0047273845,0.00015716522,0.000004151937,0.011639722,0.00000518293,0.011707132,0.7097665,0.0017919783,0.2467141],"study_design_scores_gemma":[0.008800692,0.019222507,0.0038635803,0.0012152501,0.00070860545,0.00032843387,0.013932747,0.016094288,0.7840006,0.021134546,0.12761958,0.003079215],"about_ca_topic_score_codex":0.000017958388,"about_ca_topic_score_gemma":6.6868665e-7,"teacher_disagreement_score":0.77229345,"about_ca_system_score_codex":0.000022699709,"about_ca_system_score_gemma":0.000021158456,"threshold_uncertainty_score":0.40687856},"labels":[],"label_agreement":null},{"id":"W3035535885","doi":"10.1145/3386324","title":"Evolution of Emacs Lisp","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lisp; Programming language; Computer science; Interpreter; Exception handling; Syntax; Artificial intelligence","score_opus":0.02116559383682688,"score_gpt":0.25392585889098335,"score_spread":0.23276026505415648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035535885","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.9237166,0.0050875843,0.024530677,0.020251555,0.0013100501,0.003328002,0.0000059809927,0.0018328984,0.019936651],"genre_scores_gemma":[0.9857425,0.0000047504427,0.013857945,0.00012590221,0.00012652436,0.00002259131,3.9415588e-7,0.000012474358,0.00010689656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986434,0.000013391053,0.0003146923,0.0003245346,0.00044001266,0.00026398615],"domain_scores_gemma":[0.9987739,0.000050773375,0.0004156635,0.0004535999,0.00022660887,0.00007946361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034894384,0.00015323177,0.00024963694,0.00006234289,0.000082689745,0.000095190364,0.0029335234,0.00007736733,0.0000030499743],"category_scores_gemma":[0.0012925374,0.00010138433,0.000148496,0.0006774498,0.000097393895,0.00024638584,0.0009305297,0.00015804452,0.000009663206],"study_design_candidate":"theoretical_or_conceptual","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.00004480666,0.00024058543,0.031869914,0.0009878237,0.000085249034,0.0000029349776,0.010562007,0.00000966685,0.029659947,0.79590243,0.0023890706,0.12824555],"study_design_scores_gemma":[0.0031609286,0.0049341833,0.022132834,0.00052617607,0.00024604678,0.00009775736,0.015281772,0.003763144,0.7672233,0.1056322,0.07511345,0.0018881992],"about_ca_topic_score_codex":0.00006324529,"about_ca_topic_score_gemma":0.000001544961,"teacher_disagreement_score":0.7375634,"about_ca_system_score_codex":0.000032484702,"about_ca_system_score_gemma":0.000032521708,"threshold_uncertainty_score":0.54512656},"labels":[],"label_agreement":null},{"id":"W3036125758","doi":"10.1145/3371071","title":"Dependent type systems as macros","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"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; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Macro; Type (biology); Dependent type; Scheme (mathematics); Type theory; Type safety; Type inference","score_opus":0.01457143632659315,"score_gpt":0.26087956756548364,"score_spread":0.24630813123889048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036125758","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.9572672,0.002182686,0.0004086609,0.001216589,0.0032270306,0.0026031504,0.0000013780615,0.00087033765,0.032222915],"genre_scores_gemma":[0.9924241,0.000009206754,0.0023495348,0.000109179215,0.00011913951,0.00004762227,7.9188095e-7,0.000023230254,0.004917228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981004,0.000018626182,0.0003193206,0.00047956372,0.00063855795,0.00044350623],"domain_scores_gemma":[0.99823153,0.00007060176,0.0003690206,0.0009602467,0.00028479577,0.0000837935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006342125,0.00022320618,0.00029439613,0.00009617777,0.00011795963,0.00045875486,0.003845935,0.00011640876,0.0000102520335],"category_scores_gemma":[0.00054758607,0.00014227774,0.00012426145,0.0005155138,0.000056001198,0.00029014528,0.0011712946,0.00022355214,0.0002721438],"study_design_candidate":"theoretical_or_conceptual","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.0000590722,0.00030552945,0.053320687,0.00091271073,0.00015999444,0.000011500236,0.004135662,0.000024254976,0.018184543,0.8454421,0.0018547871,0.07558913],"study_design_scores_gemma":[0.0068289964,0.009274013,0.013822991,0.0013848103,0.00033505273,0.0015261506,0.027030716,0.0030707554,0.4200027,0.089313135,0.42235288,0.005057812],"about_ca_topic_score_codex":0.0002027026,"about_ca_topic_score_gemma":0.0000022675144,"teacher_disagreement_score":0.756129,"about_ca_system_score_codex":0.00005183358,"about_ca_system_score_gemma":0.00004199163,"threshold_uncertainty_score":0.7146768},"labels":[],"label_agreement":null},{"id":"W3042245160","doi":"10.1145/3434292","title":"Probabilistic programming semantics for name generation","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","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":"McGill University","funders":"","keywords":"Probabilistic logic; Semantics (computer science); Calculus (dental); Computer science; Analogy; Operational semantics; Mathematics; Algebra over a field; Discrete mathematics; Programming language; Pure mathematics; Artificial intelligence; Linguistics","score_opus":0.034371214083242056,"score_gpt":0.2882303096701417,"score_spread":0.2538590955868996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042245160","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.940657,0.0061551854,0.027639953,0.008018336,0.004091668,0.009950764,0.000026467536,0.001707173,0.0017534315],"genre_scores_gemma":[0.65592897,0.000036264097,0.34191075,0.000098141776,0.00061430817,0.00084119535,0.000029383264,0.00005653393,0.0004844305],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99708015,0.00002864551,0.0005760391,0.0010952053,0.0005933607,0.0006265884],"domain_scores_gemma":[0.99640435,0.00017479621,0.00086385047,0.0013816779,0.0010679258,0.000107373206],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009558128,0.0004929123,0.0005971485,0.00013975425,0.00030414714,0.0013031975,0.0049994984,0.00036908864,0.0000026747284],"category_scores_gemma":[0.0054721227,0.00035975716,0.00048039993,0.00041406738,0.00014552283,0.00025824446,0.004900789,0.00060633355,0.0000024471037],"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.00004969803,0.0015399685,0.0040763738,0.009591979,0.00055065966,0.000013041793,0.023239011,0.0002643609,0.00845762,0.14673232,0.003516231,0.80196875],"study_design_scores_gemma":[0.0070353784,0.0054652267,0.004999548,0.018862685,0.002943536,0.0004591379,0.015090994,0.14195584,0.5399565,0.15432037,0.097621545,0.011289234],"about_ca_topic_score_codex":0.000026020725,"about_ca_topic_score_gemma":0.000018305778,"teacher_disagreement_score":0.7906795,"about_ca_system_score_codex":0.00013428491,"about_ca_system_score_gemma":0.00020195215,"threshold_uncertainty_score":0.99988544},"labels":[],"label_agreement":null},{"id":"W3091193824","doi":"10.1145/3428225","title":"Automatic and efficient variability-aware lifting of functional programs","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; General Motors of Canada","keywords":"Correctness; Computer science; Rewriting; Software; Programming language; Product (mathematics); Modulo; Program analysis; Software product line; Static analysis; Theoretical computer science; Software development; Mathematics","score_opus":0.04321467819769632,"score_gpt":0.28671365649021785,"score_spread":0.24349897829252154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091193824","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.5836651,0.0007467729,0.40937635,0.0021817104,0.00070560625,0.0016727957,0.00000916064,0.001571556,0.00007096456],"genre_scores_gemma":[0.5024614,0.0000045748843,0.49735495,0.000016196029,0.000047985108,0.00008609996,0.000001475285,0.000020252048,0.0000070944166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783194,0.000046245208,0.0005153425,0.0007150078,0.0005722102,0.00031928078],"domain_scores_gemma":[0.99716306,0.00084454304,0.0007316991,0.00087770395,0.00030515468,0.00007782344],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012979618,0.00034143293,0.00055270863,0.00011886172,0.00008722375,0.00014200395,0.0028770557,0.00019250326,0.0000011397425],"category_scores_gemma":[0.0129414555,0.00025264648,0.00018175752,0.00045917137,0.00020866792,0.00009553217,0.0069697807,0.0006784782,5.578052e-7],"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.000032350494,0.00036591012,0.005980598,0.010007453,0.00026126308,0.0000035084083,0.0082400665,0.011387483,0.004031712,0.016216809,0.00007279416,0.9434],"study_design_scores_gemma":[0.002800559,0.0028019398,0.053652123,0.019224288,0.0008715886,0.0001833938,0.0071572727,0.28301466,0.16312559,0.461259,0.0009904592,0.0049191145],"about_ca_topic_score_codex":0.000008668907,"about_ca_topic_score_gemma":1.4304058e-7,"teacher_disagreement_score":0.9384809,"about_ca_system_score_codex":0.0000631935,"about_ca_system_score_gemma":0.00007162508,"threshold_uncertainty_score":0.99999255},"labels":[],"label_agreement":null},{"id":"W3095856608","doi":"10.1145/3434342","title":"Abstracting gradual typing moving forward: precise and space-efficient","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","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":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; Abstract interpretation; Modular design; Semantics (computer science); Static analysis; Subtyping; Operational semantics; Type theory; Theoretical computer science; Type (biology)","score_opus":0.021739906945744066,"score_gpt":0.2706596144476819,"score_spread":0.24891970750193781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095856608","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.9806547,0.00480071,0.0048298654,0.0021271175,0.0016514258,0.0018983718,0.0000028626578,0.0007141877,0.003320718],"genre_scores_gemma":[0.9584588,0.000044799675,0.040807698,0.0000501293,0.00024399436,0.000116764415,0.0000033794972,0.000045954912,0.00022848342],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969077,0.00003611841,0.000605422,0.0011054621,0.0006897685,0.000655533],"domain_scores_gemma":[0.99694145,0.00021397063,0.0010778359,0.001215815,0.0004040394,0.00014690762],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012771988,0.0004982861,0.00062310736,0.00020710102,0.00032725674,0.0014478213,0.0035830662,0.00032406466,0.0000025630377],"category_scores_gemma":[0.0024016346,0.00036966725,0.00031115668,0.0004374217,0.0001459748,0.00024438402,0.008075159,0.00096737227,0.0000029778332],"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.000060009075,0.0008816028,0.016788436,0.007100527,0.0006621728,0.000054230586,0.04296316,0.00062893605,0.0079884855,0.11986712,0.0006317245,0.8023736],"study_design_scores_gemma":[0.008280964,0.0032341334,0.04946793,0.020497937,0.002423121,0.0022771924,0.1487053,0.054350127,0.5117326,0.14453386,0.03825428,0.01624256],"about_ca_topic_score_codex":0.00021483276,"about_ca_topic_score_gemma":0.000009893086,"teacher_disagreement_score":0.786131,"about_ca_system_score_codex":0.000098966826,"about_ca_system_score_gemma":0.000108396525,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W3101540591","doi":"10.1145/3434300","title":"Data flow refinement type inference","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","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":"National Science Foundation","keywords":"Type inference; Abstract interpretation; Computer science; Inference; Predicate abstraction; Semantics (computer science); Theoretical computer science; Soundness; Abstraction; Programming language; Data type; Algorithm; Artificial intelligence; Model checking","score_opus":0.06334551667465678,"score_gpt":0.318797632600387,"score_spread":0.25545211592573025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101540591","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.7023948,0.056440957,0.058962274,0.045677334,0.045408353,0.021756837,0.00032186083,0.011160613,0.057877004],"genre_scores_gemma":[0.87637484,0.00011301362,0.1223029,0.00015901131,0.00031984382,0.00009178098,0.00007642014,0.000039474544,0.00052270025],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967075,0.000036098056,0.00057788065,0.0012611189,0.000893588,0.000523839],"domain_scores_gemma":[0.99386054,0.0001519443,0.0008060106,0.004421157,0.00065337156,0.00010700206],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011058521,0.00044307474,0.0005671648,0.00013218707,0.00016403024,0.0010677242,0.01564107,0.00029579672,0.000013813544],"category_scores_gemma":[0.0045522824,0.00030524118,0.00018014121,0.0006294669,0.000119290984,0.00033643437,0.026935136,0.0008027775,0.000014124148],"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.000044345587,0.0009267114,0.009035415,0.003778212,0.00062675605,0.000039336042,0.009128511,0.00007888489,0.0020120053,0.093878366,0.011128053,0.8693234],"study_design_scores_gemma":[0.005266265,0.003860306,0.014640025,0.009033308,0.0018494783,0.00041719546,0.022363456,0.032904007,0.11813006,0.18586813,0.5937859,0.011881895],"about_ca_topic_score_codex":0.00012645952,"about_ca_topic_score_gemma":0.00003895667,"teacher_disagreement_score":0.8574415,"about_ca_system_score_codex":0.00007293198,"about_ca_system_score_gemma":0.00022212372,"threshold_uncertainty_score":0.99996924},"labels":[],"label_agreement":null},{"id":"W3101609070","doi":"10.1145/3428193","title":"Fixpoints for the masses: programming with first-class Datalog constraints","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":21,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datalog; Programming language; Computer science; Soundness; Logic programming; Class (philosophy); Deductive database; Semantics (computer science); Extension (predicate logic); Theoretical computer science; Artificial intelligence","score_opus":0.029011482109149462,"score_gpt":0.25993401500968055,"score_spread":0.23092253290053108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101609070","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.12032196,0.007812933,0.47883606,0.31399375,0.004273404,0.04924434,0.00014204065,0.008808097,0.016567407],"genre_scores_gemma":[0.930328,0.0000131613815,0.068150334,0.0006477986,0.00022888715,0.0004576687,0.0000049684218,0.00003945151,0.00012972327],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764335,0.000017032395,0.00040570853,0.00069142896,0.0006015807,0.0006408706],"domain_scores_gemma":[0.99764204,0.00048034967,0.00052838336,0.00089172856,0.00030828614,0.00014920328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006973622,0.0003447693,0.0003675394,0.000057107678,0.00048065133,0.0006549533,0.0053340783,0.00010794858,0.0000046222135],"category_scores_gemma":[0.0021632125,0.00017781089,0.00019817319,0.000706564,0.00043458916,0.00041807152,0.0011856324,0.00029966678,0.000011110031],"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.00021370317,0.00038195992,0.015144342,0.0017129239,0.0005186877,0.00001569655,0.013858389,0.000023112485,0.00093890505,0.27842164,0.007847895,0.68092275],"study_design_scores_gemma":[0.0050840722,0.005417749,0.0020274862,0.0006156915,0.00049563305,0.00030118527,0.021331271,0.0039176056,0.040690623,0.010960294,0.9070641,0.0020943312],"about_ca_topic_score_codex":0.00004062244,"about_ca_topic_score_gemma":0.00002253813,"teacher_disagreement_score":0.8992162,"about_ca_system_score_codex":0.000036021203,"about_ca_system_score_gemma":0.00008006608,"threshold_uncertainty_score":0.9912133},"labels":[],"label_agreement":null},{"id":"W3107368437","doi":"10.1145/3428276","title":"ιDOT: a DOT calculus with object initialization","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Initialization; Soundness; Computer science; Scala; Object (grammar); Theoretical computer science; Programming language; Algorithm; Artificial intelligence","score_opus":0.022886517068023852,"score_gpt":0.256037180830737,"score_spread":0.23315066376271315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107368437","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.7148007,0.0035119567,0.12469878,0.060900938,0.0019715058,0.010331452,0.000011854992,0.007233891,0.07653891],"genre_scores_gemma":[0.9869165,0.000005070789,0.012202322,0.00054891536,0.0001550464,0.000056540164,0.0000013626392,0.000020870284,0.000093364215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850804,0.000017022754,0.0002467456,0.0004158185,0.00048925926,0.00032309364],"domain_scores_gemma":[0.99889654,0.0000450548,0.00030718624,0.00042849156,0.00021805252,0.00010464759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002725773,0.00019893296,0.00023715425,0.000060084865,0.00014883414,0.00028954138,0.0023472023,0.00007242582,0.0000036687557],"category_scores_gemma":[0.0007741367,0.00011803772,0.0000935758,0.00081157364,0.000094125164,0.000371176,0.0006616782,0.00017580808,0.0000130975495],"study_design_candidate":"theoretical_or_conceptual","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.0001506319,0.00033033037,0.02015705,0.0009173974,0.00019593953,0.000029161687,0.029593991,0.000027253393,0.009585662,0.7170236,0.0019884873,0.22000049],"study_design_scores_gemma":[0.009197532,0.01698854,0.009489456,0.0009917511,0.00056024553,0.0006034106,0.023598002,0.0077706287,0.6753173,0.034332898,0.21641427,0.0047359695],"about_ca_topic_score_codex":0.00005937264,"about_ca_topic_score_gemma":0.0000048535176,"teacher_disagreement_score":0.68269074,"about_ca_system_score_codex":0.000025304817,"about_ca_system_score_gemma":0.00004099768,"threshold_uncertainty_score":0.48134387},"labels":[],"label_agreement":null},{"id":"W3108760172","doi":"10.1145/3428249","title":"Designing types for R, empirically","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Engineering Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada; European Commission; National Science Foundation","keywords":"Computer science; Compiler; Data type; Programming language; Code (set theory); Variety (cybernetics); Source code; Overhead (engineering); Process (computing); Artificial intelligence","score_opus":0.03649795393744953,"score_gpt":0.30183421922706444,"score_spread":0.2653362652896149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108760172","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.68721265,0.0016287402,0.1895231,0.11239417,0.00057267613,0.0040979786,0.000011668192,0.0035214792,0.0010375255],"genre_scores_gemma":[0.61792976,0.0000016514786,0.38152903,0.00032414138,0.000081405924,0.00006035773,2.800356e-7,0.000016370455,0.000056995512],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899393,0.0000041793455,0.00014102872,0.00027806577,0.00031073537,0.00027205903],"domain_scores_gemma":[0.99888974,0.00047491942,0.00008224132,0.00029948997,0.00017423782,0.00007935142],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00030288703,0.00010817882,0.00013501449,0.000048267444,0.000077258206,0.0001414525,0.0030201501,0.000043272885,0.0000018217758],"category_scores_gemma":[0.011924882,0.00007566013,0.00008697521,0.00046972322,0.00003655201,0.00015208221,0.00080315943,0.00014760668,0.0000053169347],"study_design_candidate":"bench_or_experimental","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.0001820371,0.00029292895,0.05930092,0.0019296396,0.00026141744,0.000007646906,0.018178014,0.00022943909,0.20225346,0.04644158,0.02987249,0.6410504],"study_design_scores_gemma":[0.0011478781,0.0017657825,0.008783817,0.0003921461,0.000045599292,0.00001561662,0.00085644505,0.0044597113,0.9476553,0.0046291207,0.029541008,0.000707568],"about_ca_topic_score_codex":0.0000028303643,"about_ca_topic_score_gemma":8.825051e-8,"teacher_disagreement_score":0.74540186,"about_ca_system_score_codex":0.00001830959,"about_ca_system_score_gemma":0.000024732219,"threshold_uncertainty_score":0.9963981},"labels":[],"label_agreement":null},{"id":"W3108921083","doi":"10.1145/3428210","title":"Precise inference of expressive units of measurement types","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":"University of Waterloo","funders":"Air Force Research Laboratory; Ministère de l’Éducation, Gouvernement de l’Ontario; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Government of Ontario","keywords":"Computer science; Correctness; Type inference; Java; Programming language; Scalability; Data type; Inference; Annotation; Computation; Software inspection; Unit testing; Extensibility; Software; Theoretical computer science; Software development; Artificial intelligence; Database; Software quality","score_opus":0.05754636231231046,"score_gpt":0.2715869837430079,"score_spread":0.2140406214306974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108921083","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.96393555,0.0049704816,0.010280994,0.004876363,0.00067315553,0.0034098928,0.000010947638,0.0006768794,0.011165708],"genre_scores_gemma":[0.99060225,0.000010124569,0.00922819,0.00004194255,0.000043859764,0.00002823317,3.5473607e-7,0.000010326649,0.000034715078],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984076,0.000019860976,0.00037563074,0.00028416628,0.00069596875,0.00021677352],"domain_scores_gemma":[0.997874,0.00007766576,0.0006374493,0.000453076,0.0008859127,0.00007189378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045085629,0.00015689766,0.00030972649,0.00006102821,0.000048071488,0.000053454292,0.0027753697,0.00006506277,0.0000032555952],"category_scores_gemma":[0.0037111756,0.00010231723,0.000092279675,0.0006907024,0.00011546177,0.0001897,0.00091053336,0.00013223286,0.0000025717954],"study_design_candidate":"bench_or_experimental","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.00017037416,0.0006264715,0.0348251,0.0033888652,0.0003559765,0.0000042450242,0.05407717,0.000043270604,0.2362971,0.275061,0.0017356615,0.39341477],"study_design_scores_gemma":[0.00047333332,0.0008598239,0.0011120903,0.00026356117,0.00004865164,0.0000032325754,0.0022044724,0.00016971363,0.98597753,0.005071323,0.003580501,0.00023574644],"about_ca_topic_score_codex":0.000051706233,"about_ca_topic_score_gemma":0.0000019591048,"teacher_disagreement_score":0.74968046,"about_ca_system_score_codex":0.00001714235,"about_ca_system_score_gemma":0.00006313257,"threshold_uncertainty_score":0.51573735},"labels":[],"label_agreement":null},{"id":"W3109210160","doi":"10.1145/3428207","title":"Handling bidirectional control flow","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":12,"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":"National Aeronautics and Space Administration","keywords":"Computer science; Programming language; Control flow; Programmer; Soundness; Compiler; Semantics (computer science); Correctness; Theoretical computer science","score_opus":0.02022218492803879,"score_gpt":0.24711013353929143,"score_spread":0.22688794861125264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109210160","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.5053773,0.010497564,0.24919982,0.16027947,0.0073287864,0.0104367,0.000028071632,0.010159394,0.046692874],"genre_scores_gemma":[0.97568023,0.000004226191,0.023103533,0.00068006694,0.0003126099,0.000046484798,6.1553686e-7,0.000015640999,0.00015660423],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998558,0.000015034708,0.00026457803,0.0003945076,0.00044894975,0.00031894803],"domain_scores_gemma":[0.9990062,0.0000908378,0.00025433776,0.0003498349,0.00019051088,0.000108296364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038526082,0.0001777486,0.0002444822,0.00005554331,0.00018154935,0.00025753066,0.0024466545,0.0000754629,0.0000061091905],"category_scores_gemma":[0.0013722592,0.00011674669,0.00016507802,0.00050392706,0.0000726099,0.00024384688,0.0005337935,0.0002092069,0.000022831346],"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.00014094522,0.00038595882,0.03802407,0.0006792086,0.0003354433,0.000013646557,0.012226887,0.000114513234,0.023656245,0.27885363,0.0072893244,0.63828015],"study_design_scores_gemma":[0.010590764,0.0051318444,0.011890493,0.0005015561,0.00042208287,0.00031701924,0.0073681534,0.05472303,0.4048387,0.07249786,0.4279886,0.0037299232],"about_ca_topic_score_codex":0.00002404184,"about_ca_topic_score_gemma":0.0000012036804,"teacher_disagreement_score":0.6345502,"about_ca_system_score_codex":0.000023177707,"about_ca_system_score_gemma":0.000029481378,"threshold_uncertainty_score":0.4760792},"labels":[],"label_agreement":null},{"id":"W3109383821","doi":"10.1145/3428204","title":"How do programmers use unsafe rust?","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":75,"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":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Rust (programming language); Computer science; Programmer; Compiler; Memory safety; Programming language; Code (set theory); Source code; Abstraction","score_opus":0.027750533701888305,"score_gpt":0.246189855091322,"score_spread":0.21843932138943367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109383821","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.78063285,0.0021612262,0.008569099,0.19793428,0.0010785409,0.0043492373,0.00006389122,0.002570499,0.002640384],"genre_scores_gemma":[0.9525996,0.000009419075,0.046312824,0.0005876691,0.0001233656,0.00006221883,0.0000016701518,0.000021398258,0.0002818738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982486,0.000012382304,0.00025388092,0.0005079155,0.0005456659,0.00043159036],"domain_scores_gemma":[0.9985871,0.00005738787,0.00033630672,0.0006230148,0.00023588282,0.00016036083],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024467852,0.00023263397,0.00027926342,0.00004716796,0.00013917216,0.0012178136,0.0038087156,0.000086932916,0.0000015146941],"category_scores_gemma":[0.001582997,0.00015585941,0.00017577296,0.000872867,0.00010157471,0.0007666022,0.0009656895,0.0002534578,0.000007001512],"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.00006648613,0.00028982075,0.016576877,0.00061493646,0.00014644903,0.000015495985,0.007044231,0.000011439436,0.008397151,0.08677371,0.0151572,0.8649062],"study_design_scores_gemma":[0.0020359408,0.0013919733,0.0071609854,0.0010411321,0.00010032503,0.00006450422,0.009104584,0.001581724,0.06904337,0.0014773567,0.9054982,0.0014998948],"about_ca_topic_score_codex":0.000022983031,"about_ca_topic_score_gemma":7.142733e-7,"teacher_disagreement_score":0.890341,"about_ca_system_score_codex":0.00002579696,"about_ca_system_score_gemma":0.000024887604,"threshold_uncertainty_score":0.99981904},"labels":[],"label_agreement":null},{"id":"W3156620473","doi":"10.1145/3473593","title":"Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","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":"University of Toronto; Google (Canada)","funders":"","keywords":"Computer science; Parallelism (grammar); Search engine indexing; Benchmark (surveying); Associative property; Programming language; Parallel computing; Functional programming; Data parallelism; Programming style; Implicit parallelism; Function (biology); Point (geometry); Array data structure; Mathematics; Artificial intelligence","score_opus":0.01894816289790268,"score_gpt":0.2911922973149375,"score_spread":0.2722441344170348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156620473","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.335123,0.004840177,0.54449916,0.09717654,0.0014829986,0.01162049,0.000027062148,0.003815251,0.0014153512],"genre_scores_gemma":[0.35144955,0.00003008858,0.6468522,0.0007377743,0.00016481741,0.0005620689,0.0000069172747,0.00005127228,0.00014528172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686015,0.000054807908,0.0006437496,0.0011207226,0.0006264375,0.0006941074],"domain_scores_gemma":[0.99644494,0.00036241612,0.00082006404,0.0015925185,0.00063879875,0.00014128245],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017845186,0.0005109006,0.0005716433,0.00022287008,0.00055364025,0.0017514344,0.0066885594,0.00028512932,0.0000014962686],"category_scores_gemma":[0.0040114825,0.00034558625,0.00030978885,0.00057779945,0.00010935426,0.0002819416,0.009465948,0.00081723154,7.0047486e-7],"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.000109134366,0.0004803954,0.0055605606,0.0040443945,0.0005238885,0.000009086668,0.049324047,0.0063101766,0.003380245,0.008866552,0.010203508,0.911188],"study_design_scores_gemma":[0.0065063173,0.0036675646,0.019375982,0.038446117,0.001203379,0.00058677327,0.041378796,0.3474248,0.29403508,0.12007425,0.11462758,0.012673359],"about_ca_topic_score_codex":0.000101769954,"about_ca_topic_score_gemma":0.000011418345,"teacher_disagreement_score":0.8985146,"about_ca_system_score_codex":0.000074374024,"about_ca_system_score_gemma":0.000096206204,"threshold_uncertainty_score":0.9998996},"labels":[],"label_agreement":null},{"id":"W3194448197","doi":"10.1145/3473588","title":"Grafs: declarative graph analytics","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Simon Fraser University","funders":"National Science Foundation","keywords":"Computer science; Correctness; Analytics; Theoretical computer science; Graph; Source code; Programming language; Data mining","score_opus":0.01672219452698045,"score_gpt":0.2624621614790319,"score_spread":0.24573996695205144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194448197","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.97291046,0.0016308661,0.0060190274,0.008639071,0.00059473596,0.00057822664,0.000008445072,0.00058348186,0.009035689],"genre_scores_gemma":[0.8911637,0.000018949475,0.10785051,0.0003683774,0.000054727338,0.000020361414,0.000001011342,0.000013017064,0.0005093579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99877256,0.0000188852,0.00020850624,0.00035986817,0.00035230195,0.00028787184],"domain_scores_gemma":[0.9986568,0.00010770342,0.00019305154,0.0006598557,0.00031852175,0.00006405717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037678148,0.00016171463,0.00019583853,0.0001000722,0.00017560695,0.00020770401,0.0025563447,0.00006123582,0.00000495707],"category_scores_gemma":[0.0010782211,0.00011086347,0.00019327691,0.0012125148,0.00012678572,0.00027609454,0.0010139288,0.0002152053,0.0000051200955],"study_design_candidate":"theoretical_or_conceptual","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.000016884745,0.0003847895,0.005617266,0.00013401451,0.0001857628,0.00002575753,0.0055364124,0.000014554753,0.015622128,0.8183793,0.0008673541,0.1532158],"study_design_scores_gemma":[0.00057622814,0.0002983082,0.003884518,0.00031896762,0.00007603944,0.00009397201,0.0051254504,0.00049416104,0.6767077,0.30813915,0.0037852048,0.00050033926],"about_ca_topic_score_codex":0.0000034926888,"about_ca_topic_score_gemma":0.0000014474953,"teacher_disagreement_score":0.66108555,"about_ca_system_score_codex":0.000014214116,"about_ca_system_score_gemma":0.000031300293,"threshold_uncertainty_score":0.4750367},"labels":[],"label_agreement":null},{"id":"W3197383513","doi":"10.1145/3485523","title":"Rich specifications for Ethereum smart contract verification","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Blockchain Technology Applications and Security","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 British Columbia","funders":"","keywords":"Correctness; Computer science; Smart contract; Modular design; Domain (mathematical analysis); Design by contract; Code (set theory); Software engineering; Programming language; Resource (disambiguation); Software; Software development","score_opus":0.035201056320712375,"score_gpt":0.28587111916658264,"score_spread":0.2506700628458703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197383513","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.9205182,0.0030539753,0.022726214,0.04549298,0.0007153628,0.00474958,0.000056583358,0.0012288939,0.0014581659],"genre_scores_gemma":[0.7818938,0.00007017606,0.21652433,0.00011860902,0.00007574787,0.0011529195,0.000017700746,0.000021520134,0.00012521558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833566,0.00001299148,0.00038868666,0.0007152836,0.0002661815,0.00028121838],"domain_scores_gemma":[0.9965159,0.00019935066,0.00064910256,0.0019764644,0.0006161819,0.000042985957],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00058214425,0.00023965417,0.00031432425,0.00012577638,0.00023593691,0.0002996005,0.00543368,0.00038458858,0.0000035708222],"category_scores_gemma":[0.0014910705,0.00019268463,0.00021555425,0.0004524557,0.00013795373,0.000099846686,0.0020691687,0.000611058,0.00000243009],"study_design_candidate":"theoretical_or_conceptual","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.000030235213,0.0011992743,0.0037165466,0.0011651749,0.00032371603,8.3265553e-7,0.006467405,0.000018041414,0.025775686,0.6439059,0.0038211662,0.31357607],"study_design_scores_gemma":[0.0014714589,0.00041543323,0.020533884,0.0016231525,0.00040336166,0.00004261947,0.0058166566,0.0063837944,0.6692605,0.22920948,0.062879756,0.001959921],"about_ca_topic_score_codex":0.000032085554,"about_ca_topic_score_gemma":0.000006647882,"teacher_disagreement_score":0.6434848,"about_ca_system_score_codex":0.000060823048,"about_ca_system_score_gemma":0.00008330456,"threshold_uncertainty_score":0.9999474},"labels":[],"label_agreement":null},{"id":"W3201295163","doi":"10.1145/3485490","title":"Verifying concurrent multicopy search structures","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; New York University Abu Dhabi; National Science Foundation","keywords":"Computer science; Data structure; Merge (version control); Concurrent data structure; Parallel computing; Theoretical computer science; Reuse; Key (lock); Algorithm; Programming language; Operating system","score_opus":0.029565912091222172,"score_gpt":0.30954144997429056,"score_spread":0.2799755378830684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201295163","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.9842556,0.004987186,0.0030771203,0.0021512734,0.0024287202,0.0014706267,0.000051235562,0.00048120608,0.0010969932],"genre_scores_gemma":[0.9588973,0.000037155798,0.040556557,0.00008400819,0.00019117055,0.00008576667,0.000011711122,0.000027210457,0.00010914147],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99728954,0.000030775638,0.00047646806,0.00083861925,0.00086902577,0.00049556704],"domain_scores_gemma":[0.9974246,0.000087123146,0.0005019073,0.0013462569,0.0005384853,0.00010163549],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004988341,0.0003836089,0.00053310196,0.00010374895,0.00017817154,0.0010255232,0.006575328,0.00025618979,0.0000055115343],"category_scores_gemma":[0.0008967198,0.000273457,0.0003051837,0.00040177378,0.00012608562,0.00020040854,0.0072420677,0.0009852384,0.0000026645837],"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.000039767412,0.00061981333,0.007832097,0.007531489,0.000575582,0.000031768657,0.025092324,0.0008094481,0.015534801,0.07122286,0.003177,0.867533],"study_design_scores_gemma":[0.0047658253,0.0009921455,0.047685254,0.02501114,0.00047597196,0.00028818374,0.027765559,0.026346881,0.81653,0.010563138,0.03349094,0.0060849534],"about_ca_topic_score_codex":0.00012795963,"about_ca_topic_score_gemma":0.000002959096,"teacher_disagreement_score":0.8614481,"about_ca_system_score_codex":0.000088281915,"about_ca_system_score_gemma":0.00011474592,"threshold_uncertainty_score":0.99997175},"labels":[],"label_agreement":null},{"id":"W3205248599","doi":"10.1145/3485516","title":"Reachability types: tracking aliasing and separation in higher-order functional programs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":19,"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","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy; National Science Foundation","keywords":"Reachability; Computer science; Programming language; Aliasing; Semantics (computer science); Theoretical computer science; Functional programming; Reachability problem; Order (exchange); Artificial intelligence","score_opus":0.04358175016620899,"score_gpt":0.2868284587584339,"score_spread":0.2432467085922249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205248599","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.9807448,0.002928254,0.0023138532,0.0062356223,0.00089598226,0.0012236746,7.996857e-7,0.00048206642,0.005174942],"genre_scores_gemma":[0.9822126,0.000008108652,0.017035156,0.00007019846,0.00009895115,0.000056216413,0.0000026823984,0.000012447405,0.00050362706],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985127,0.00003305621,0.00030903742,0.0004793909,0.0003667986,0.00029904197],"domain_scores_gemma":[0.9989124,0.00007830067,0.00021409802,0.00042367654,0.0003199672,0.000051535462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069664785,0.00016816106,0.000221156,0.00007346144,0.0001297126,0.00034756746,0.00069532974,0.000102478465,0.0000046359705],"category_scores_gemma":[0.00076103647,0.00012267471,0.00007258599,0.00075130665,0.000100451296,0.00040099834,0.00050529686,0.00021143054,0.0000025195573],"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.00003011416,0.00047081683,0.10209982,0.00040449068,0.00005233362,0.000009168905,0.004788855,0.000010210934,0.005959738,0.18518923,0.00011212585,0.7008731],"study_design_scores_gemma":[0.0063504744,0.0023141936,0.3966026,0.0013982013,0.00026719403,0.0006838208,0.017515467,0.0034626164,0.19126824,0.24679403,0.12997635,0.003366825],"about_ca_topic_score_codex":0.000071097056,"about_ca_topic_score_gemma":0.00003153791,"teacher_disagreement_score":0.69750625,"about_ca_system_score_codex":0.000052711854,"about_ca_system_score_gemma":0.000046889196,"threshold_uncertainty_score":0.50025296},"labels":[],"label_agreement":null},{"id":"W3205444791","doi":"10.1145/3485520","title":"Scalability and precision by combining expressive type systems and deductive verification","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Computer science; Correctness; Programming language; Scalability; Type safety; Type theory; Decidability; Model checking; Overhead (engineering); Type (biology); Theoretical computer science","score_opus":0.01725341579518671,"score_gpt":0.26448404257418356,"score_spread":0.24723062677899685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205444791","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.991328,0.005403062,0.0009040603,0.00064843654,0.00035209634,0.0006045599,0.0000015018713,0.00014290302,0.0006153568],"genre_scores_gemma":[0.993843,0.00004287849,0.0058392705,0.000021364614,0.000035959158,0.00003917329,0.0000018564185,0.000009674864,0.00016682253],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880654,0.00003780641,0.00022241862,0.0004576488,0.00027612608,0.00019948752],"domain_scores_gemma":[0.99872404,0.00013504803,0.0002560673,0.0004526693,0.00036790705,0.00006427699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044796,0.00014033912,0.00020818463,0.000037025875,0.00016721536,0.0003598332,0.0007316269,0.00008206938,7.1062397e-7],"category_scores_gemma":[0.0015417766,0.000097902324,0.00003379659,0.0003273011,0.000107360596,0.0002946651,0.00073668495,0.00013815319,0.0000012081964],"study_design_candidate":"bench_or_experimental","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.000103440354,0.00063426007,0.06044637,0.001444307,0.00018429138,0.0000067728997,0.022997087,0.000005417869,0.17984362,0.2678122,0.00244238,0.46407986],"study_design_scores_gemma":[0.0031544957,0.0023009386,0.033582877,0.0010834988,0.00022420766,0.0005292968,0.04390879,0.0030209904,0.8123246,0.06362011,0.034346983,0.0019032044],"about_ca_topic_score_codex":0.000046835106,"about_ca_topic_score_gemma":9.350864e-7,"teacher_disagreement_score":0.632481,"about_ca_system_score_codex":0.000026037427,"about_ca_system_score_gemma":0.00002414134,"threshold_uncertainty_score":0.3992341},"labels":[],"label_agreement":null},{"id":"W3206419348","doi":"10.1145/3485537","title":"Automatic migration from synchronous to asynchronous JavaScript APIs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Engineering Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Asynchronous communication; JavaScript; Code refactoring; Callback; Programming language; Programmer; Distributed computing; Software; Computer network","score_opus":0.011510722755067895,"score_gpt":0.25955521929488073,"score_spread":0.24804449653981284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206419348","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.9900254,0.0005825486,0.0037972585,0.0042350823,0.0002704412,0.00038992387,0.000003884087,0.00056591776,0.0001295628],"genre_scores_gemma":[0.78526473,0.000005763501,0.21421556,0.00017369342,0.00008878937,0.00007758445,0.0000021363692,0.000022339507,0.00014940197],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982211,0.000015037566,0.00025542718,0.00048033067,0.0006339325,0.0003941665],"domain_scores_gemma":[0.99811065,0.00037507774,0.0001110856,0.0009889852,0.00029826406,0.00011591536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032109144,0.00018538801,0.00022547672,0.00012572155,0.000091777845,0.00036292314,0.002856897,0.00007415544,0.0000176479],"category_scores_gemma":[0.0074968487,0.00014604595,0.000110305424,0.0008902233,0.00003902432,0.00026336196,0.0014489397,0.00021805467,0.000044276603],"study_design_candidate":"bench_or_experimental","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.000010760603,0.00035590667,0.029671868,0.0003685521,0.0001620703,0.000030630785,0.009906654,0.000092937975,0.089911014,0.0028286853,0.0065469183,0.860114],"study_design_scores_gemma":[0.0007422689,0.00059361523,0.069234,0.0011786388,0.00006299351,0.000080284306,0.0018668704,0.0070046545,0.90930456,0.0030926126,0.005990144,0.0008493693],"about_ca_topic_score_codex":0.00015630804,"about_ca_topic_score_gemma":0.000014652626,"teacher_disagreement_score":0.8592646,"about_ca_system_score_codex":0.00012496668,"about_ca_system_score_gemma":0.00007934898,"threshold_uncertainty_score":0.897497},"labels":[],"label_agreement":null},{"id":"W3207026105","doi":"10.1145/3485522","title":"Modular specification and verification of closures in Rust","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":"University of British Columbia","funders":"","keywords":"Programming language; Computer science; Modular design; Closure (psychology); Formal verification; Rust (programming language); Code (set theory); Theoretical computer science","score_opus":0.01992079449776948,"score_gpt":0.25666674672400863,"score_spread":0.23674595222623915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207026105","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.99328434,0.0017960238,0.0010692822,0.0015167615,0.00015095157,0.0004316431,7.370986e-7,0.000085774394,0.0016644675],"genre_scores_gemma":[0.9826132,0.000040929794,0.017153103,0.000021181908,0.00003307398,0.000023281022,0.0000012110322,0.0000069501934,0.00010707533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904597,0.000016716229,0.0002600451,0.00027978444,0.00024617536,0.00015129957],"domain_scores_gemma":[0.9990214,0.000042770615,0.0002554037,0.0004661315,0.00018782116,0.000026437074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043155524,0.00009501583,0.00016497215,0.000077696364,0.000045092565,0.00008950176,0.0009167017,0.000060088678,0.0000013256508],"category_scores_gemma":[0.00066108815,0.00007013447,0.000048700316,0.0004770183,0.00007014845,0.00017544965,0.00033686042,0.0000972184,0.0000011975881],"study_design_candidate":"bench_or_experimental","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.000016851302,0.00028941725,0.06357585,0.00044549466,0.000030179257,0.0000031137176,0.005466023,0.000005763025,0.0931806,0.5635228,0.00010374959,0.27336013],"study_design_scores_gemma":[0.00094064575,0.0003194955,0.2288742,0.00020011372,0.000034394114,0.00005215647,0.0054513533,0.000488583,0.7084415,0.042353243,0.012413751,0.00043056026],"about_ca_topic_score_codex":0.000046786423,"about_ca_topic_score_gemma":0.000006307567,"teacher_disagreement_score":0.6152609,"about_ca_system_score_codex":0.000018753502,"about_ca_system_score_gemma":0.000020732958,"threshold_uncertainty_score":0.28600007},"labels":[],"label_agreement":null},{"id":"W4205512329","doi":"10.1145/3498677","title":"Reasoning about “reasoning about reasoning”: semantics and contextual equivalence for probabilistic programs with nested queries and recursion","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":19,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Soundness; Computer science; Operational semantics; Probabilistic logic; Equivalence (formal languages); Theoretical computer science; Inference; Semantics (computer science); Recursion (computer science); Denotational semantics; Programming language; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.01557696947963156,"score_gpt":0.25566242282379664,"score_spread":0.2400854533441651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205512329","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.9908284,0.0035326933,0.0010502763,0.0009886902,0.00018815072,0.002213122,0.000010047062,0.00047522294,0.00071340246],"genre_scores_gemma":[0.90380317,0.00005226089,0.09486443,0.00008379747,0.00008217182,0.00057384075,0.0000060965276,0.000048818103,0.00048541048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.997317,0.000053469557,0.00039598448,0.00090037985,0.00060880306,0.0007243271],"domain_scores_gemma":[0.99783623,0.00031975203,0.00064865086,0.0006072367,0.000425229,0.00016292844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012753878,0.0004142477,0.0004932958,0.00013130631,0.0011190033,0.0006222057,0.0019042363,0.00009897428,0.0000024083176],"category_scores_gemma":[0.0033121726,0.0002919399,0.000106234256,0.00067940867,0.00048284844,0.0004985385,0.0020912685,0.00043430412,3.943783e-7],"study_design_candidate":"theoretical_or_conceptual","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.0006705784,0.0006416976,0.12918627,0.0022551473,0.00020799847,0.00002083794,0.04142818,0.000028468108,0.0018397168,0.43868113,0.00043438675,0.3846056],"study_design_scores_gemma":[0.035303522,0.069675975,0.20146836,0.049306784,0.0033433007,0.009501772,0.23462859,0.10732187,0.060140453,0.092560925,0.11963599,0.017112456],"about_ca_topic_score_codex":0.00006520621,"about_ca_topic_score_gemma":0.000021481364,"teacher_disagreement_score":0.36749312,"about_ca_system_score_codex":0.00008854147,"about_ca_system_score_gemma":0.00009476437,"threshold_uncertainty_score":0.99995327},"labels":[],"label_agreement":null},{"id":"W4206286386","doi":"10.1145/3498700","title":"Mœbius: metaprogramming using contextual types: the stage where system f can pattern match on itself","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Espace pour la vie; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Metaprogramming; Computer science; Programming language; Exploit; Code generation; Code (set theory); Source code; Type inference; Theoretical computer science; Artificial intelligence; Key (lock); Inference","score_opus":0.026386560774839744,"score_gpt":0.2626384689665354,"score_spread":0.23625190819169567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206286386","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.959252,0.0051776115,0.005530931,0.009167733,0.004065495,0.0077828397,0.00005863358,0.002812745,0.0061520315],"genre_scores_gemma":[0.9953213,0.000004329633,0.0030139782,0.00032416417,0.00018843834,0.0003049038,0.0000026562245,0.000057449543,0.00078283093],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99652576,0.00014067157,0.00057670265,0.0007444151,0.001238104,0.0007743361],"domain_scores_gemma":[0.99727964,0.00022796051,0.0008205506,0.0013207368,0.00023857436,0.00011253287],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018837318,0.0004203241,0.0004871396,0.0001643396,0.0011317146,0.0006525914,0.005865013,0.00009523257,0.000014769615],"category_scores_gemma":[0.00037465565,0.000253813,0.00030660754,0.0009769591,0.00015811523,0.00022785978,0.0024880534,0.00066537823,0.000010829586],"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.00013788439,0.00094407744,0.017121786,0.0021208462,0.000808282,0.00008663974,0.040261097,0.00047015195,0.0032918286,0.39933404,0.00201877,0.5334046],"study_design_scores_gemma":[0.0069495984,0.008748965,0.0017112705,0.0015822989,0.0011544209,0.0015504799,0.4493504,0.022948055,0.053189244,0.007062047,0.43998742,0.005765828],"about_ca_topic_score_codex":0.001098637,"about_ca_topic_score_gemma":0.000057556197,"teacher_disagreement_score":0.52763873,"about_ca_system_score_codex":0.0002842321,"about_ca_system_score_gemma":0.000082699145,"threshold_uncertainty_score":0.9999914},"labels":[],"label_agreement":null},{"id":"W4206670752","doi":"10.1145/3498722","title":"Solving constrained Horn clauses modulo algebraic data types and recursive functions","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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","funders":"European Research Council; European Commission; Natural Sciences and Engineering Research Council of Canada; United States-Israel Binational Science Foundation; Israel Science Foundation; United States - Israel Binational Science Foundation","keywords":"Decidability; Correctness; Modulo; Computer science; RDF Schema; Theoretical computer science; Undecidable problem; Counterexample; Programming language; Discrete mathematics; Mathematics; RDF; Artificial intelligence","score_opus":0.03735519205231355,"score_gpt":0.2969661613641396,"score_spread":0.25961096931182603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206670752","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.97593987,0.0023368425,0.007966795,0.007696605,0.0010421245,0.0015137665,0.00007422585,0.0008005776,0.0026291949],"genre_scores_gemma":[0.58689266,0.000014339489,0.41260418,0.00018505407,0.0000474197,0.000068389854,0.000006131187,0.000013391496,0.00016842068],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988374,0.00002966145,0.00018979853,0.0004077206,0.0003227608,0.00021263825],"domain_scores_gemma":[0.9986148,0.00012244923,0.0002524653,0.0008674148,0.000102469225,0.00004039472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008496116,0.000118751756,0.00013418333,0.00010096518,0.0004205044,0.00014625902,0.0033952387,0.000031823867,0.000008577587],"category_scores_gemma":[0.0020126966,0.00009450028,0.000034593344,0.00049174915,0.00014796834,0.00048044248,0.0035412845,0.00025019934,0.0000016635228],"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.000058706835,0.00024231129,0.0033732273,0.00019660006,0.00013311183,0.0000019510862,0.007760612,0.000031065614,0.015334671,0.2552584,0.0055509554,0.71205837],"study_design_scores_gemma":[0.0054840413,0.007217984,0.038320504,0.0014315371,0.0009964785,0.0015721704,0.13527665,0.07096664,0.2547732,0.254214,0.22470503,0.005041797],"about_ca_topic_score_codex":0.000023753382,"about_ca_topic_score_gemma":0.0000014715904,"teacher_disagreement_score":0.7070166,"about_ca_system_score_codex":0.000034158766,"about_ca_system_score_gemma":0.000031282587,"threshold_uncertainty_score":0.6309254},"labels":[],"label_agreement":null},{"id":"W4225138414","doi":"10.1145/3527320","title":"Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"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":"Deutsche Forschungsgemeinschaft","keywords":"Soundness; Computer science; Lift (data mining); Class (philosophy); Scope (computer science); Type (biology); Artificial intelligence; Programming language; Data mining","score_opus":0.010650627326766122,"score_gpt":0.23818858771766435,"score_spread":0.22753796039089824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225138414","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.9898009,0.0040216944,0.0013461192,0.0016872184,0.00037482491,0.0015892506,0.000006098052,0.00036453406,0.0008093907],"genre_scores_gemma":[0.9334272,0.0000045418815,0.065635234,0.00047572245,0.00006850813,0.00016291841,0.0000034802547,0.00002888865,0.0001935052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99810195,0.00006382872,0.00027190047,0.0006492263,0.0004922207,0.00042085917],"domain_scores_gemma":[0.9985621,0.00035779647,0.00025922238,0.0005547753,0.00012467886,0.00014144384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008773262,0.00025470488,0.0003286677,0.00013290782,0.0004284149,0.00039304903,0.0016605981,0.00006398203,0.000010964456],"category_scores_gemma":[0.0015539998,0.00019472402,0.00007441123,0.000608585,0.000115767536,0.0001730348,0.0013537129,0.00027878798,0.0000049092064],"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.0008731412,0.0011397597,0.20695397,0.003960348,0.00037460972,0.000053985717,0.034582354,0.00028303268,0.036015727,0.12841085,0.006169394,0.58118284],"study_design_scores_gemma":[0.017346967,0.019053886,0.06560552,0.0042680306,0.0008258453,0.00025986665,0.035530087,0.022967389,0.49147338,0.031492308,0.30364162,0.0075351056],"about_ca_topic_score_codex":0.0007125368,"about_ca_topic_score_gemma":0.000011223564,"teacher_disagreement_score":0.57364774,"about_ca_system_score_codex":0.000083441446,"about_ca_system_score_gemma":0.000072072115,"threshold_uncertainty_score":0.79406154},"labels":[],"label_agreement":null},{"id":"W4293812983","doi":"10.1145/3547627","title":"Propositional equality for gradual dependently typed programming","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"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":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Metatheory; Propositional variable; Computer science; Dependent type; Type (biology); Programming language; Mathematical proof; Term (time); Witness; Mathematics; Calculus (dental); Algebra over a field; Theoretical computer science; Discrete mathematics; Lambda calculus; Pure mathematics","score_opus":0.031225313833160698,"score_gpt":0.2903141184745396,"score_spread":0.2590888046413789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293812983","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.8214903,0.0046214387,0.08054694,0.028082319,0.0083074905,0.031353675,0.000127459,0.006475337,0.018995041],"genre_scores_gemma":[0.9590271,0.0000012860587,0.038750872,0.00018971163,0.00016481701,0.0010850083,0.000011373144,0.000030439254,0.00073939125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735457,0.000049213206,0.00044720003,0.00061568426,0.00094926095,0.0005840767],"domain_scores_gemma":[0.9982564,0.00014171825,0.0005255384,0.00068334374,0.00030045983,0.000092528724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015330527,0.0002575775,0.00030499964,0.00013375863,0.0007747735,0.00032157433,0.0039605154,0.000070928916,0.000008153523],"category_scores_gemma":[0.00070215453,0.00019001777,0.00028279485,0.000660856,0.00011118157,0.00029151852,0.002074081,0.00033162005,0.000004554938],"study_design_candidate":"theoretical_or_conceptual","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.00010716046,0.0006935304,0.004664087,0.00040691806,0.00012534091,0.0000029083728,0.003897254,0.000011711566,0.0026198125,0.7914802,0.0018874924,0.19410363],"study_design_scores_gemma":[0.0074886186,0.009707088,0.006852036,0.00019303644,0.00043713942,0.0007649178,0.019638844,0.0020243914,0.11247294,0.28074425,0.55605364,0.003623132],"about_ca_topic_score_codex":0.0000879775,"about_ca_topic_score_gemma":0.000006476747,"teacher_disagreement_score":0.55416614,"about_ca_system_score_codex":0.000121695804,"about_ca_system_score_gemma":0.00008574619,"threshold_uncertainty_score":0.77487},"labels":[],"label_agreement":null},{"id":"W4307886379","doi":"10.1145/3563296","title":"Can guided decomposition help end-users write larger block-based programs? a mobile robot experiment","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Spreadsheets and End-User Computing","field":"Computer Science","cited_by":10,"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; National Science Foundation","keywords":"Computer science; Decomposition; Block (permutation group theory); Domain (mathematical analysis); Human–computer interaction; Programming language","score_opus":0.018844909309957282,"score_gpt":0.28379588928466226,"score_spread":0.26495097997470496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307886379","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.99245125,0.00044045591,0.00025652102,0.0040526753,0.00040685554,0.0013448587,0.0000056382487,0.00064849394,0.0003932682],"genre_scores_gemma":[0.92925507,0.000001887667,0.06928625,0.0005091505,0.00008759586,0.0007205991,0.0000075244716,0.000036369274,0.00009556567],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974151,0.000040281473,0.00042331568,0.00064504525,0.000855055,0.0006211716],"domain_scores_gemma":[0.9983886,0.00007711175,0.00039904806,0.0008499828,0.00016924259,0.000116009694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007208063,0.0002990261,0.0002925531,0.00018917257,0.00063075597,0.00036792632,0.0036071911,0.00005432261,0.00002121242],"category_scores_gemma":[0.00012658884,0.00023682215,0.00023012894,0.00080737675,0.00007905837,0.00018920159,0.0022961379,0.00033202983,0.0000024736203],"study_design_candidate":"bench_or_experimental","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.00022570885,0.004653183,0.043874074,0.00063896936,0.0004231126,0.00006269634,0.035926644,0.0103271045,0.20694755,0.014791543,0.007820339,0.6743091],"study_design_scores_gemma":[0.004064694,0.0043996857,0.0039191237,0.0008657873,0.00017575963,0.00027717502,0.014836099,0.02599984,0.90014666,0.0017946453,0.041254148,0.002266363],"about_ca_topic_score_codex":0.00019992238,"about_ca_topic_score_gemma":0.000005014244,"teacher_disagreement_score":0.6931991,"about_ca_system_score_codex":0.00019322336,"about_ca_system_score_gemma":0.000066300265,"threshold_uncertainty_score":0.9657327},"labels":[],"label_agreement":null},{"id":"W4307886450","doi":"10.1145/3563298","title":"Proving hypersafety compositionally","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"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":"European Research Council; European Commission","keywords":"Mathematical proof; Arity; Principle of compositionality; Idempotence; Construct (python library); Structural proof theory; Class (philosophy); Associative property; Computer science; Mathematics; Block (permutation group theory); Algebra over a field; Negation; Theoretical computer science; Programming language; Discrete mathematics; Pure mathematics; Proof theory; Combinatorics; Artificial intelligence","score_opus":0.014878248331600792,"score_gpt":0.24389543451143933,"score_spread":0.22901718617983854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307886450","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.8713011,0.0033223939,0.0081871115,0.033720985,0.0038548482,0.0067433477,0.00002337152,0.0036574,0.069189414],"genre_scores_gemma":[0.98079693,0.0000016314841,0.018029435,0.00030664555,0.00008723418,0.00016807612,0.0000022478384,0.000017111557,0.00059070816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821514,0.000029623347,0.00027763232,0.00041217453,0.00071840856,0.0003470093],"domain_scores_gemma":[0.9987768,0.000085709275,0.00032679093,0.0006129806,0.00014085823,0.00005686871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078311714,0.00016964637,0.00020159842,0.00010322518,0.0005718732,0.0001870722,0.004123056,0.00003761377,0.000013554242],"category_scores_gemma":[0.00032483862,0.00012246831,0.00015889145,0.00057212345,0.00007825274,0.00022982337,0.0026869539,0.00029855332,0.0000069054686],"study_design_candidate":"theoretical_or_conceptual","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.00004200486,0.00046748327,0.009706269,0.00020306441,0.00009193415,0.000008877676,0.005606162,0.000044099008,0.011509427,0.8233927,0.0022148879,0.14671311],"study_design_scores_gemma":[0.0050676223,0.006001428,0.02557335,0.00023807568,0.00025428014,0.001448817,0.029775608,0.0037136567,0.12420342,0.19455995,0.605546,0.0036177912],"about_ca_topic_score_codex":0.0000493914,"about_ca_topic_score_gemma":0.0000014241042,"teacher_disagreement_score":0.62883276,"about_ca_system_score_codex":0.00008658621,"about_ca_system_score_gemma":0.000045456723,"threshold_uncertainty_score":0.76617324},"labels":[],"label_agreement":null},{"id":"W4307886768","doi":"10.1145/3563308","title":"Synthesis-powered optimization of smart contracts via data type refactoring","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Code refactoring; Smart contract; Computer science; Digital subscriber line; Transformation (genetics); Database; Software engineering; Programming language; Software; Telecommunications","score_opus":0.02422023960366824,"score_gpt":0.26861868628134045,"score_spread":0.24439844667767222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307886768","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.9726177,0.0015289293,0.010599257,0.010380183,0.0005721958,0.0017628069,0.0000502229,0.0009757829,0.0015129475],"genre_scores_gemma":[0.924817,0.000010822982,0.07503341,0.000038156442,0.0000122476495,0.000054157394,0.0000027214596,0.000008958166,0.000022514636],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901986,0.000012517707,0.00021753312,0.000308466,0.0002756632,0.00016596512],"domain_scores_gemma":[0.9981414,0.000113613765,0.0003401032,0.0012466073,0.00013542801,0.000022824837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057827093,0.00009395533,0.00015805733,0.000090770714,0.00019780309,0.000032847885,0.0050936947,0.00004953657,0.000009338176],"category_scores_gemma":[0.001208185,0.000075418095,0.000034997276,0.00062917825,0.00006938235,0.00015805055,0.0032385404,0.00021048593,5.849393e-7],"study_design_candidate":"bench_or_experimental","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.00021871905,0.001981696,0.015081272,0.0004145986,0.0003638033,0.000004783854,0.0054011513,0.001316695,0.08241838,0.17107956,0.0023683761,0.71935093],"study_design_scores_gemma":[0.001223393,0.0013033686,0.003915118,0.00032044822,0.00022380808,0.000111227804,0.0042033657,0.07504792,0.8574584,0.017734632,0.03734056,0.0011177761],"about_ca_topic_score_codex":0.00003154225,"about_ca_topic_score_gemma":0.0000012302061,"teacher_disagreement_score":0.77504003,"about_ca_system_score_codex":0.000027023058,"about_ca_system_score_gemma":0.000023051223,"threshold_uncertainty_score":0.9465437},"labels":[],"label_agreement":null},{"id":"W4307887062","doi":"10.1145/3563312","title":"SigVM: enabling event-driven execution for truly decentralized smart contracts","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Blockchain Technology Applications and Security","field":"Computer Science","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":"","keywords":"Computer science; Smart contract; Event (particle physics); Overhead (engineering); Dependency (UML); Compiler; Benchmark (surveying); Distributed computing; Server; Virtual machine; Relay; Blockchain; Operating system; Computer security; Software engineering","score_opus":0.014029170490675074,"score_gpt":0.26873379572002254,"score_spread":0.25470462522934745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307887062","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.9742864,0.00075300765,0.007042465,0.014733538,0.00024464022,0.0021040128,0.00001591159,0.00062850845,0.00019151246],"genre_scores_gemma":[0.95083404,0.000008711741,0.048087344,0.0002416663,0.000023138859,0.0007126136,0.000003167998,0.000012048948,0.00007726837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987911,0.000013387305,0.0002458793,0.0003521661,0.00027239573,0.00032505408],"domain_scores_gemma":[0.99886537,0.00012206667,0.00030659174,0.00052564766,0.00013997305,0.000040373012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056091975,0.00012953715,0.00017739697,0.000105407744,0.0005166883,0.00007925153,0.002816205,0.00006460507,0.0000046705363],"category_scores_gemma":[0.00065512495,0.0001047952,0.00013040786,0.0005018122,0.000069132344,0.00012684644,0.0010494296,0.0002469423,8.849197e-7],"study_design_candidate":"theoretical_or_conceptual","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.00014575255,0.00093044835,0.0041413135,0.0001731782,0.000120303426,0.0000020642249,0.00422906,0.00009546523,0.07268842,0.6167186,0.003879146,0.29687625],"study_design_scores_gemma":[0.005116631,0.0017567675,0.0033711647,0.00018170214,0.00020013374,0.00012525977,0.007362594,0.017359255,0.51441294,0.13857703,0.31029254,0.0012439687],"about_ca_topic_score_codex":0.000019067866,"about_ca_topic_score_gemma":0.0000021047174,"teacher_disagreement_score":0.47814158,"about_ca_system_score_codex":0.00006465322,"about_ca_system_score_gemma":0.000029790417,"threshold_uncertainty_score":0.5233256},"labels":[],"label_agreement":null},{"id":"W4307887673","doi":"10.1145/3563326","title":"Fractional resources in unbounded separation logic","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"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":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Separation logic; Assertion; Soundness; Computer science; Distributivity; Heap (data structure); Programming language; Mathematical proof; Semantics (computer science); Mathematics; Theoretical computer science; Arithmetic; Distributive property; Pure mathematics","score_opus":0.02238444774618,"score_gpt":0.2866410207537125,"score_spread":0.2642565730075325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307887673","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.9707053,0.001078204,0.0016911699,0.0084976945,0.0010274755,0.0016376678,0.0000027310837,0.00062991236,0.01472988],"genre_scores_gemma":[0.99395806,0.0000022625604,0.004965259,0.00021705782,0.000072961026,0.00017067602,0.0000016702924,0.000009968784,0.0006021009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984796,0.000036766203,0.0002714823,0.00034895222,0.0005867301,0.00027646095],"domain_scores_gemma":[0.9990779,0.00008556181,0.00031478977,0.00040354778,0.00008360368,0.000034600052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083299674,0.00013498118,0.00017001071,0.00016103189,0.00031157903,0.00019748913,0.0024017328,0.00004623958,0.000015852951],"category_scores_gemma":[0.00046095386,0.00009854423,0.00009163236,0.0007713729,0.00006024847,0.00025501085,0.0012049617,0.0003002838,0.000006136065],"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.00008429716,0.00065866974,0.0440298,0.00014669653,0.000053220283,0.000011523739,0.012796352,0.0002023926,0.0046373894,0.860809,0.0021966363,0.07437401],"study_design_scores_gemma":[0.0030795732,0.002782335,0.041598026,0.00009387979,0.000060856335,0.00035586522,0.023774644,0.0027564804,0.025436915,0.5347224,0.36376792,0.0015710938],"about_ca_topic_score_codex":0.00012458168,"about_ca_topic_score_gemma":0.000011147299,"teacher_disagreement_score":0.36157128,"about_ca_system_score_codex":0.00010526392,"about_ca_system_score_gemma":0.000029859551,"threshold_uncertainty_score":0.4463057},"labels":[],"label_agreement":null},{"id":"W4315606067","doi":"10.1145/3571253","title":"Taking Back Control in an Intermediate Representation for GPU Computing","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":4,"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":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Compiler; Fuzz testing; Programming language; Control flow; Software engineering; Formal specification; Formal methods; Process (computing); Set (abstract data type); Software","score_opus":0.04405870110884504,"score_gpt":0.346137627226172,"score_spread":0.30207892611732695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315606067","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.9820181,0.0000375535,0.010183098,0.0016208418,0.00021028084,0.0009367592,0.0000024140345,0.0048339698,0.00015699214],"genre_scores_gemma":[0.8636945,0.0000011125938,0.13598071,0.00016171558,0.00006356292,0.00005828126,0.0000018821139,0.00001559506,0.000022650993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998827,0.00001628904,0.00026980325,0.00035425485,0.00021930246,0.00031338588],"domain_scores_gemma":[0.9984976,0.0005300543,0.0003438508,0.00044107926,0.00015109256,0.00003633524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008976133,0.0001258368,0.00018550674,0.00021050133,0.00009797588,0.00018952765,0.0019841443,0.000054442953,6.2781186e-7],"category_scores_gemma":[0.004654191,0.00009695345,0.00007464437,0.0007634771,0.0000492025,0.00028133832,0.0005412544,0.00013410715,0.0000030659492],"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.00005054048,0.00012574342,0.23262353,0.0002728552,0.000021656215,0.0000038427393,0.00744779,0.000096725,0.0060806866,0.0034860675,0.0035753367,0.7462152],"study_design_scores_gemma":[0.0046993624,0.0021859012,0.34324014,0.0039417334,0.000066749875,0.000047613652,0.0027894215,0.40106785,0.08621111,0.15356588,0.0006995098,0.0014847292],"about_ca_topic_score_codex":0.000048701855,"about_ca_topic_score_gemma":0.0000035194505,"teacher_disagreement_score":0.7447305,"about_ca_system_score_codex":0.000029477227,"about_ca_system_score_gemma":0.000013165429,"threshold_uncertainty_score":0.55718374},"labels":[],"label_agreement":null},{"id":"W4315606097","doi":"10.1145/3571203","title":"On the Expressive Power of String Constraints","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Web Application Security Vulnerabilities","field":"Computer Science","cited_by":10,"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":"Deutsche Forschungsgemeinschaft","keywords":"String (physics); Concatenation (mathematics); Mathematics; Property (philosophy); Regular language; Formal language; Syntax; Set (abstract data type); Formal grammar; Discrete mathematics; Pure mathematics; Computer science; Algebra over a field; Combinatorics; Theoretical computer science; Algorithm; Rule-based machine translation; Artificial intelligence; Programming language","score_opus":0.01940751461595399,"score_gpt":0.27280397047318133,"score_spread":0.25339645585722737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315606097","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.99118257,0.000033085813,0.00007476861,0.0055280617,0.000068275236,0.00047517676,0.0000053485287,0.00021893192,0.0024137807],"genre_scores_gemma":[0.99626184,0.0000025769089,0.0033312934,0.00015205637,0.000018706598,0.0000891726,3.483968e-7,0.000010217484,0.00013377692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987943,0.000015710895,0.00023294112,0.0002650514,0.00046226048,0.00022974832],"domain_scores_gemma":[0.9980921,0.0006479985,0.00028992843,0.0007518021,0.00018697338,0.000031203388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065924734,0.00012316121,0.00015152838,0.00009559289,0.00012318627,0.0000982751,0.003185919,0.0000457869,0.000012910355],"category_scores_gemma":[0.002714488,0.00007124585,0.00009330002,0.00064266636,0.0002984416,0.00013185035,0.0010143663,0.00018998887,0.000014943574],"study_design_candidate":"theoretical_or_conceptual","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.000012323112,0.00009409587,0.0010001411,0.000098305296,0.000037438655,7.1174026e-7,0.014338814,0.000010565283,0.021870526,0.9307035,0.0034660876,0.02836749],"study_design_scores_gemma":[0.0003941184,0.00028598533,0.0043574744,0.00050108344,0.000014995794,0.000007990785,0.020052927,0.00018718485,0.8741045,0.09770289,0.00209599,0.00029487404],"about_ca_topic_score_codex":0.000008378899,"about_ca_topic_score_gemma":3.1357987e-7,"teacher_disagreement_score":0.85223395,"about_ca_system_score_codex":0.000017740364,"about_ca_system_score_gemma":0.000022028205,"threshold_uncertainty_score":0.5920283},"labels":[],"label_agreement":null},{"id":"W4315606532","doi":"10.1145/3571242","title":"Stratified Commutativity in Verification Algorithms for Concurrent Programs","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"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":"","keywords":"Soundness; Commutative property; Algorithm; Computer science; Theoretical computer science; Abstraction; Programming language; Mathematics; Discrete mathematics","score_opus":0.05947782296464332,"score_gpt":0.3218947002246022,"score_spread":0.2624168772599589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315606532","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.9476463,0.00097558816,0.022832809,0.009042428,0.0024865891,0.011721644,0.000014274902,0.0030344105,0.002245953],"genre_scores_gemma":[0.9842587,0.000007727811,0.014800866,0.000027246419,0.00006369574,0.0006237514,0.000011326506,0.00001699862,0.00018967778],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984026,0.000024704214,0.00035826836,0.0004186256,0.00036830737,0.00042748486],"domain_scores_gemma":[0.99872684,0.00015644838,0.0003264576,0.00054395717,0.00019210826,0.00005419005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770624,0.0001854526,0.0002553696,0.00014486126,0.00014300032,0.00026168805,0.0023261851,0.00008976184,5.7668115e-7],"category_scores_gemma":[0.000782813,0.00013066563,0.00012687157,0.0010452535,0.00010361955,0.0002614638,0.00048331634,0.0001793378,0.000008403601],"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.00001255697,0.00025672783,0.0060335035,0.0003190574,0.000025746558,0.0000013088617,0.004458415,0.000004319172,0.0016849766,0.17275208,0.00038377318,0.81406754],"study_design_scores_gemma":[0.011805336,0.0076597794,0.096633345,0.0012508825,0.00021760596,0.00008798114,0.039193425,0.05010536,0.29597905,0.36889732,0.123902075,0.004267857],"about_ca_topic_score_codex":0.00006932908,"about_ca_topic_score_gemma":0.000020767493,"teacher_disagreement_score":0.8097997,"about_ca_system_score_codex":0.000047696667,"about_ca_system_score_gemma":0.00003461768,"threshold_uncertainty_score":0.532839},"labels":[],"label_agreement":null},{"id":"W4315630815","doi":"10.1145/3571243","title":"Type-Preserving, Dependence-Aware Guide Generation for Sound, Effective Amortized Probabilistic Inference","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Soundness; Inference; Computer science; Type inference; Probabilistic logic; Fuzz testing; Theoretical computer science; Programming language; Exploit; Machine learning; Artificial intelligence","score_opus":0.05363607663135606,"score_gpt":0.36434413653709535,"score_spread":0.3107080599057393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315630815","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.9473338,0.00010171091,0.045636766,0.0009576688,0.0008579074,0.0035761206,0.0000073165947,0.0009713461,0.00055735523],"genre_scores_gemma":[0.69577163,0.0000059725053,0.30318075,0.000046932684,0.00010557925,0.00061153626,0.0000051449706,0.000018315644,0.0002541251],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985141,0.00003135546,0.00030386323,0.00043608816,0.00039401205,0.00032055203],"domain_scores_gemma":[0.9978761,0.00041525165,0.00033367032,0.0007403086,0.0005881007,0.00004657792],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0013360993,0.00016658235,0.00019000818,0.00012972002,0.00021051726,0.00022692431,0.0028587673,0.00008717246,0.0000020522164],"category_scores_gemma":[0.020950656,0.00012142028,0.0000908718,0.00094285805,0.000077840596,0.00044211812,0.0009894805,0.00014494095,0.000011042971],"study_design_candidate":"bench_or_experimental","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.00018549158,0.00029341795,0.015662072,0.0018292331,0.00016273292,0.000002751346,0.010801262,0.00073426345,0.13794424,0.20515607,0.0073823743,0.6198461],"study_design_scores_gemma":[0.0018268996,0.0017792325,0.022418445,0.0008092509,0.00015601047,0.000030374486,0.0024235696,0.27624035,0.54047877,0.14812616,0.0044441153,0.0012668488],"about_ca_topic_score_codex":0.000020477077,"about_ca_topic_score_gemma":0.000009556029,"teacher_disagreement_score":0.6185792,"about_ca_system_score_codex":0.00007114804,"about_ca_system_score_gemma":0.000039401344,"threshold_uncertainty_score":0.9872963},"labels":[],"label_agreement":null},{"id":"W4315631112","doi":"10.1145/3571204","title":"Proto-Quipper with Dynamic Lifting","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Syntax; Semantics (computer science); Construct (python library); Operational semantics; Programming language; Dynamic programming; Functional programming; State (computer science); Theoretical computer science; Categorical variable; Algorithm; Artificial intelligence","score_opus":0.008028892670940677,"score_gpt":0.25297755529038357,"score_spread":0.2449486626194429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315631112","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.9916704,0.000061187195,0.00035834927,0.0057037487,0.00010801101,0.00068221154,0.0000011644055,0.0009183759,0.00049651763],"genre_scores_gemma":[0.9003319,0.000002613199,0.09899869,0.00014047291,0.00006578616,0.000082097635,7.2243245e-7,0.000027020538,0.00035069036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985486,0.000008986756,0.0001848671,0.00039711574,0.00043794714,0.00042244478],"domain_scores_gemma":[0.9989611,0.00009295453,0.00020214722,0.00057387695,0.00011508254,0.000054826105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000434438,0.00018318217,0.0001771444,0.0001442489,0.00023044884,0.00021028591,0.0028918392,0.00004855873,0.0000010272657],"category_scores_gemma":[0.0004955595,0.000104559396,0.000084200416,0.0012390754,0.000086364744,0.00014439317,0.0013852777,0.0002666025,0.000011908744],"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.000036539997,0.00015598309,0.010167511,0.0004642096,0.00009453162,0.000019428408,0.008871745,0.00059560704,0.011066912,0.00954134,0.0008743263,0.9581119],"study_design_scores_gemma":[0.005139808,0.0062284935,0.10962368,0.00855653,0.0001915114,0.0007775937,0.011205093,0.55817986,0.2196752,0.04217765,0.033794347,0.004450216],"about_ca_topic_score_codex":0.0000105984345,"about_ca_topic_score_gemma":0.0000012343205,"teacher_disagreement_score":0.9536616,"about_ca_system_score_codex":0.00001778511,"about_ca_system_score_gemma":0.000025133813,"threshold_uncertainty_score":0.5373805},"labels":[],"label_agreement":null},{"id":"W4362676437","doi":"10.1145/3586049","title":"Pushing the Limit of 1-Minimality of Language-Agnostic Program Reduction","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":19,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Debugging; Programming language; Reduction (mathematics); Computer science; Syntax; Implementation; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.027250278268288686,"score_gpt":0.3119918759498543,"score_spread":0.2847415976815656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362676437","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.99188614,0.00019717134,0.00010543115,0.0023459822,0.00014772823,0.000714815,0.000003016993,0.004171086,0.00042861307],"genre_scores_gemma":[0.9165206,0.000012781581,0.08322207,0.00002555528,0.000049541337,0.0000940577,0.0000011507127,0.000016278102,0.000057977242],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849635,0.000027395663,0.0003852749,0.00030008948,0.0005030544,0.00028780825],"domain_scores_gemma":[0.99772924,0.00054381276,0.00056271144,0.00086100795,0.0002690023,0.000034206183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285646,0.00015789834,0.00024626407,0.00015540782,0.00012217132,0.000083770195,0.0029954049,0.000073208124,8.5473425e-7],"category_scores_gemma":[0.008172713,0.00009545082,0.00015025708,0.0013842892,0.0002298287,0.00018224677,0.0011514626,0.00021889496,0.0000017994666],"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.000037457732,0.00040434024,0.019134127,0.00082357513,0.00008366144,0.0000029829307,0.017131908,0.000018002103,0.029380472,0.0061389366,0.0068708966,0.9199736],"study_design_scores_gemma":[0.00055237836,0.00173956,0.05689075,0.002438754,0.00015149877,0.00009117721,0.0049898657,0.0017786083,0.88939446,0.040406037,0.00096837536,0.00059852854],"about_ca_topic_score_codex":0.00015941123,"about_ca_topic_score_gemma":0.0000013909593,"teacher_disagreement_score":0.9193751,"about_ca_system_score_codex":0.000019722469,"about_ca_system_score_gemma":0.000029886121,"threshold_uncertainty_score":0.9784091},"labels":[],"label_agreement":null},{"id":"W4365211599","doi":"10.1145/3591269","title":"flap: A Deterministic Parser with Fused Lexing","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":9,"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":"European Research Council; Horizon 2020 Framework Programme; Isaac Newton Trust; European Commission","keywords":"Computer science; Security token; Parsing; Parser combinator; Programming language; Context (archaeology); LR parser; Modularity (biology); Ambiguity; Interface (matter); Theoretical computer science; Parallel computing; Operating system","score_opus":0.017519603306589217,"score_gpt":0.2787272433611151,"score_spread":0.2612076400545259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365211599","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.9778507,0.0009065714,0.002577161,0.0081504015,0.00028194423,0.0014564504,0.0000052366536,0.006847958,0.0019236134],"genre_scores_gemma":[0.74458265,0.000004430629,0.25468415,0.00018321633,0.00004848413,0.000079056896,9.105966e-7,0.000028040522,0.00038903236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99827224,0.000010988196,0.00024164935,0.00045929264,0.0005518378,0.00046398683],"domain_scores_gemma":[0.998533,0.00014042597,0.00028982645,0.0007762285,0.00019431929,0.00006619818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047783167,0.00023318386,0.00023771318,0.00021542593,0.0001967873,0.00031990313,0.0041249497,0.00008407585,0.0000021600838],"category_scores_gemma":[0.0013122342,0.0001401006,0.00008997757,0.0014537221,0.0001320408,0.00038598,0.0014103955,0.00028012056,0.00001340046],"study_design_candidate":"bench_or_experimental","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.00015330734,0.000275378,0.012624135,0.0012101799,0.00016153447,0.00012572984,0.011041678,0.00001052768,0.0925387,0.094899125,0.0050233393,0.78193635],"study_design_scores_gemma":[0.0013419576,0.0014269591,0.003944072,0.0027578191,0.0001176132,0.00024167592,0.0024028919,0.0021735688,0.8996544,0.079315305,0.005159987,0.0014637763],"about_ca_topic_score_codex":0.000016796661,"about_ca_topic_score_gemma":0.0000028071702,"teacher_disagreement_score":0.8071157,"about_ca_system_score_codex":0.00003531444,"about_ca_system_score_gemma":0.000038693917,"threshold_uncertainty_score":0.76652515},"labels":[],"label_agreement":null},{"id":"W4379518528","doi":"10.1145/3591302","title":"Register Tiling for Unstructured Sparsity in Neural Network Inference","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Speedup; Computer science; Sparse matrix; Parallel computing; Matrix multiplication; Kernel (algebra); Multi-core processor; Algorithm; Mathematics","score_opus":0.030916206885024812,"score_gpt":0.30616507615526506,"score_spread":0.2752488692702402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379518528","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.9686062,0.00023898632,0.021293985,0.005007478,0.00054578355,0.0013785157,0.000002790468,0.0020649526,0.0008613375],"genre_scores_gemma":[0.7821128,0.0000058083697,0.21757221,0.00010898281,0.000058945287,0.00003212744,0.0000012369284,0.000008857336,0.000099030556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990021,0.000008223175,0.00021107457,0.0002838631,0.00018133741,0.0003134236],"domain_scores_gemma":[0.9990841,0.00020202916,0.00019467795,0.00037925053,0.00011108825,0.00002884365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051553646,0.00011855101,0.00016403742,0.000112627684,0.00011612312,0.00012657778,0.002075936,0.000060791946,3.8942468e-7],"category_scores_gemma":[0.0013952227,0.00008806331,0.000073648735,0.0008763006,0.00004489141,0.00015304238,0.0008450229,0.00014131011,8.9280894e-7],"study_design_candidate":"simulation_or_modeling","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.00014905361,0.00015945408,0.09711548,0.00067907124,0.000062005114,0.0000071394456,0.009683681,0.044339996,0.0020657855,0.08597321,0.017449481,0.74231565],"study_design_scores_gemma":[0.0021624651,0.0007251657,0.06300697,0.0016978135,0.00004342531,0.000027186434,0.0010343629,0.7374584,0.047393322,0.1372222,0.007818943,0.0014097533],"about_ca_topic_score_codex":0.000008333384,"about_ca_topic_score_gemma":0.0000036792921,"teacher_disagreement_score":0.7409059,"about_ca_system_score_codex":0.000019397383,"about_ca_system_score_gemma":0.00001395047,"threshold_uncertainty_score":0.385764},"labels":[],"label_agreement":null},{"id":"W4379536176","doi":"10.1145/3591283","title":"Flux: Liquid Types for Rust","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"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":"HORIZON EUROPE European Research Council; Office of Naval Research; HORIZON EUROPE Framework Programme; Microsoft Research; National Science Foundation","keywords":"Rust (programming language); Computer science; Memory safety; Correctness; Programming language; Compiler; Exploit; Separation logic; Aliasing; Pointer (user interface); Benchmark (surveying); Theoretical computer science; Type inference; Inference; Artificial intelligence","score_opus":0.02614794403722743,"score_gpt":0.28196192229593076,"score_spread":0.25581397825870333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379536176","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.8748354,0.0032908984,0.012589353,0.04218111,0.006755107,0.011545713,0.00002472594,0.010977439,0.037800293],"genre_scores_gemma":[0.98074037,0.0000074263253,0.01534062,0.00013863549,0.00022330698,0.0002234043,0.0000035115265,0.000026904938,0.0032958176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856234,0.00000856561,0.00025294928,0.0003841565,0.00034314403,0.0004488532],"domain_scores_gemma":[0.99875796,0.00013994651,0.00023333915,0.000598222,0.0002069328,0.000063572974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007177889,0.0001772688,0.00022465033,0.00013508146,0.00020221421,0.00021745716,0.003062574,0.00009174623,0.0000033006527],"category_scores_gemma":[0.0013441672,0.0001151749,0.00017611576,0.0008031576,0.00007632122,0.00021323278,0.00092712475,0.00012311502,0.00005254905],"study_design_candidate":"theoretical_or_conceptual","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.00007671975,0.00015654833,0.0015035598,0.00063848705,0.00011224117,0.000003647341,0.0045740986,0.000006710619,0.00922518,0.7406511,0.018256892,0.22479488],"study_design_scores_gemma":[0.0018486805,0.0034275374,0.0024353096,0.00023885175,0.00012630271,0.00005620918,0.0048279343,0.0009849248,0.29735196,0.07682786,0.6105859,0.0012885407],"about_ca_topic_score_codex":0.000022599626,"about_ca_topic_score_gemma":0.0000022986326,"teacher_disagreement_score":0.6638232,"about_ca_system_score_codex":0.00002438244,"about_ca_system_score_gemma":0.00002604369,"threshold_uncertainty_score":0.56910753},"labels":[],"label_agreement":null},{"id":"W4379536897","doi":"10.1145/3591286","title":"Extensible Metatheory Mechanization via Family Polymorphism","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Metatheory; Programming language; Mathematical proof; Computer science; Extensibility; Proof assistant; Software engineering; Theoretical computer science; Mathematics","score_opus":0.02153602823069928,"score_gpt":0.25672098351780664,"score_spread":0.23518495528710737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379536897","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.8387047,0.0046649594,0.10053774,0.01319865,0.005578169,0.005913936,0.0000070437163,0.010836521,0.020558305],"genre_scores_gemma":[0.9857851,0.000017408618,0.012418481,0.00023316083,0.00012116529,0.00007553163,0.000002547851,0.00003146922,0.0013151251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981866,0.00002440123,0.00031336994,0.00046483713,0.0005536149,0.0004572103],"domain_scores_gemma":[0.99848324,0.00009279674,0.00032621037,0.0007562063,0.00026565272,0.00007591542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010051249,0.00021889732,0.00026436237,0.00024357956,0.000222961,0.0002298214,0.0029215652,0.0001034521,0.000003313603],"category_scores_gemma":[0.00083496445,0.00014723573,0.00015815918,0.0016582788,0.00007864784,0.00034650133,0.0011601568,0.00016911104,0.000085983054],"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.00001460692,0.0001229818,0.0013084618,0.00018283344,0.000085274245,0.000008998447,0.003075272,0.0000069830653,0.059404455,0.6627127,0.002243907,0.27083352],"study_design_scores_gemma":[0.0014549199,0.0010720298,0.00839379,0.00018586624,0.00016807027,0.00013153745,0.0060135406,0.0037490723,0.35795295,0.59086764,0.0286076,0.0014029571],"about_ca_topic_score_codex":0.00006846055,"about_ca_topic_score_gemma":0.0000016258733,"teacher_disagreement_score":0.29854852,"about_ca_system_score_codex":0.000031265095,"about_ca_system_score_gemma":0.000026610613,"threshold_uncertainty_score":0.60040987},"labels":[],"label_agreement":null},{"id":"W4379537148","doi":"10.1145/3591233","title":"Recursive State Machine Guided Graph Folding for Context-Free Language Reachability","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Advanced Research Projects Agency; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Reachability; Scalability; Computer science; Graph; Theoretical computer science; Path (computing); Mathematics; Algorithm","score_opus":0.028197214482458714,"score_gpt":0.308115621640343,"score_spread":0.2799184071578843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379537148","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.9531513,0.0008251884,0.006637722,0.012322923,0.00049413583,0.0027847723,0.00007555477,0.023081591,0.00062685576],"genre_scores_gemma":[0.7109489,0.000011096875,0.2879315,0.00030630673,0.000062461164,0.00028751284,0.000005761242,0.00004187609,0.00040462802],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981947,0.000020307169,0.0003581659,0.000534833,0.0004023622,0.0004896331],"domain_scores_gemma":[0.99712104,0.0007784358,0.0003628772,0.0013499594,0.00031240185,0.00007527869],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0015733605,0.00023758138,0.00029846115,0.0002322555,0.00022979412,0.00017485672,0.004543903,0.0000755088,9.269626e-7],"category_scores_gemma":[0.017415754,0.00017144227,0.00021663657,0.0010218944,0.00012043246,0.00022822927,0.001843862,0.00020486061,0.00000282012],"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.00008813645,0.00021354697,0.018953059,0.00071441766,0.000118243224,0.000009194497,0.016791845,0.0000069926477,0.0074312612,0.023741689,0.10747231,0.8244593],"study_design_scores_gemma":[0.0015956456,0.0010309408,0.0045490456,0.0011493524,0.000072020244,0.00004760449,0.0016702814,0.0017216787,0.19653443,0.7870211,0.0037186437,0.00088927697],"about_ca_topic_score_codex":0.00026749456,"about_ca_topic_score_gemma":0.00001028335,"teacher_disagreement_score":0.82357,"about_ca_system_score_codex":0.00004991868,"about_ca_system_score_gemma":0.000025597927,"threshold_uncertainty_score":0.990861},"labels":[],"label_agreement":null},{"id":"W4385005490","doi":"10.1145/3632872","title":"Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Technische Universität Wien; Vienna Science and Technology Fund; McGill University","keywords":"Invariant (physics); Probabilistic logic; Mathematics; Polynomial; Decidability; Bracket polynomial; Reachability; Discrete mathematics; Matrix polynomial; Combinatorics; Square-free polynomial; Mathematical analysis","score_opus":0.06247433803599339,"score_gpt":0.30772430562095204,"score_spread":0.24524996758495865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385005490","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.9588588,0.0008003613,0.01300169,0.013426308,0.0034211809,0.007381241,0.00010139024,0.0009492973,0.0020597633],"genre_scores_gemma":[0.81111634,0.000004396438,0.18805377,0.00006478887,0.00015541894,0.00038266715,0.000002499064,0.000033132565,0.00018700016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979942,0.000042099982,0.0004484162,0.0005461581,0.0005455394,0.00042360145],"domain_scores_gemma":[0.9978996,0.0003333657,0.00046164,0.0009623649,0.00028186437,0.00006116886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017258152,0.00025771215,0.00029887684,0.00012942088,0.00018822106,0.00046990355,0.0040604887,0.00011462102,0.0000037228626],"category_scores_gemma":[0.0043087914,0.00015213026,0.00018746554,0.00065347506,0.00022982499,0.00043521525,0.0007815893,0.00032091685,0.0000047029957],"study_design_candidate":"bench_or_experimental","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.00016281154,0.00043104144,0.0019424213,0.0013342922,0.00016724234,0.0000017298521,0.0033911553,0.000019099272,0.0061444254,0.57651913,0.002402911,0.40748373],"study_design_scores_gemma":[0.0035879877,0.0076363687,0.056676,0.013838296,0.00073022966,0.000112771384,0.018523624,0.051563304,0.757559,0.05213481,0.03472137,0.0029162602],"about_ca_topic_score_codex":0.00003001139,"about_ca_topic_score_gemma":0.0000035853259,"teacher_disagreement_score":0.75141454,"about_ca_system_score_codex":0.000078589925,"about_ca_system_score_gemma":0.000076993645,"threshold_uncertainty_score":0.7545466},"labels":[],"label_agreement":null},{"id":"W4386317102","doi":"10.1145/3607851","title":"MacoCaml: Staging Composable and Compilable Macros","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"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 Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Trust","keywords":"Computer science; Compiler; Programming language; Macro; Soundness; Compile time; Porting; Code generation; Interleaving; Operating system; Software","score_opus":0.020407428407547886,"score_gpt":0.26967167632604155,"score_spread":0.24926424791849366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386317102","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.97382694,0.0009876094,0.0012312869,0.0065884776,0.00087545183,0.0017407569,0.0000052502633,0.0025007422,0.012243496],"genre_scores_gemma":[0.9852799,0.000022188508,0.012698719,0.0001428877,0.00005888396,0.000052127652,0.0000017819692,0.000022370474,0.0017211105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99838024,0.000014496521,0.00026349982,0.0004285021,0.00041153646,0.00050171185],"domain_scores_gemma":[0.9988801,0.00011094301,0.00023321733,0.0005538307,0.00013586158,0.0000860594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007385211,0.00020346497,0.00026350323,0.00013947125,0.00028625532,0.0004403882,0.0022890307,0.00006883622,0.0000035216706],"category_scores_gemma":[0.00029725957,0.00013607457,0.00008625459,0.0008885866,0.00013490446,0.00029852075,0.001716396,0.00019021555,0.000035204674],"study_design_candidate":"theoretical_or_conceptual","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.000048328227,0.00027817689,0.13003482,0.0014720646,0.00018300768,0.000026916401,0.01147939,0.000031703297,0.020881096,0.5481312,0.01574681,0.27168643],"study_design_scores_gemma":[0.0054511777,0.0024350053,0.056564018,0.00093380065,0.0002295166,0.00035417895,0.02259326,0.021753386,0.40524623,0.22153036,0.25934818,0.0035608928],"about_ca_topic_score_codex":0.00008992816,"about_ca_topic_score_gemma":0.000002281592,"teacher_disagreement_score":0.38436514,"about_ca_system_score_codex":0.00002470736,"about_ca_system_score_gemma":0.000019070061,"threshold_uncertainty_score":0.554896},"labels":[],"label_agreement":null},{"id":"W4387667119","doi":"10.1145/3622850","title":"Quantifying and Mitigating Cache Side Channel Leakage with Differential Set","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","field":"Computer Science","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 Waterloo","funders":"National Science Foundation","keywords":"Cache; Computer science; Side channel attack; Cache invalidation; Abstraction; Smart Cache; Information leakage; Cache algorithms; CPU cache; Parallel computing; Embedded system; Computer network; Cryptography; Computer security","score_opus":0.047971520637576086,"score_gpt":0.2967396356833562,"score_spread":0.2487681150457801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387667119","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.9962668,0.000081871236,0.0006626892,0.0020882278,0.00009948943,0.00022063473,0.0000013991475,0.0003866754,0.00019221558],"genre_scores_gemma":[0.9850317,0.000007747962,0.014725243,0.00007868789,0.00007364782,0.00002401472,0.0000014390156,0.000014496477,0.00004297262],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988377,0.000012362623,0.0001880562,0.00035149397,0.00031481864,0.00029558726],"domain_scores_gemma":[0.99909896,0.0001784517,0.00022247338,0.00035406023,0.00009533775,0.000050713323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039097745,0.00014372425,0.00015467116,0.00010788554,0.00030946874,0.00028747882,0.0014253878,0.0000506399,8.055035e-7],"category_scores_gemma":[0.0006397832,0.00009854764,0.00004757403,0.00066201936,0.00009673953,0.00022144394,0.0009602661,0.00020093418,0.000003102766],"study_design_candidate":"bench_or_experimental","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.00011650705,0.00035189555,0.086139925,0.0028917897,0.00037731294,0.000031426098,0.13477868,0.00019749186,0.13312246,0.15698345,0.0022133437,0.48279572],"study_design_scores_gemma":[0.0029467768,0.0012089178,0.11563031,0.0041035176,0.00016249689,0.00026960598,0.050061952,0.087667264,0.7208683,0.013065942,0.0018884878,0.002126442],"about_ca_topic_score_codex":0.000031200976,"about_ca_topic_score_gemma":0.0000035984067,"teacher_disagreement_score":0.58774585,"about_ca_system_score_codex":0.00001300614,"about_ca_system_score_gemma":0.000013366171,"threshold_uncertainty_score":0.40186563},"labels":[],"label_agreement":null},{"id":"W4387673945","doi":"10.1145/3622828","title":"Simple Reference Immutability for System F <sub>&lt;:</sub>","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Immutability; Soundness; Programming language; Scala; Computer science; Java; Inheritance (genetic algorithm); Simple (philosophy); Construct (python library); Context (archaeology); Subtyping; Theoretical computer science; Blockchain; Philosophy","score_opus":0.02971523116335913,"score_gpt":0.2777055378970418,"score_spread":0.24799030673368264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387673945","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.9852831,0.0003743261,0.0035044248,0.0013375679,0.00081023725,0.003088036,0.00001325059,0.0027693596,0.0028197179],"genre_scores_gemma":[0.99553424,0.000006223349,0.0037173002,0.000043243617,0.00013111363,0.00040223385,0.000007825271,0.000023203676,0.00013460021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99772143,0.000024761066,0.0004561194,0.0006410526,0.00051871355,0.0006379491],"domain_scores_gemma":[0.997784,0.00026010926,0.00042683087,0.0010456094,0.00038661456,0.000096817945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014974396,0.000264028,0.0003704548,0.00014324457,0.00031568244,0.00031195284,0.0036858711,0.00013867998,7.4799465e-7],"category_scores_gemma":[0.0016256988,0.00017809168,0.00022405393,0.0010175963,0.00011198194,0.00029344598,0.0012713989,0.00019252882,0.000024465658],"study_design_candidate":"bench_or_experimental","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.00006470964,0.00021731813,0.008970823,0.0027925437,0.0001240226,0.0000054271895,0.0034948864,0.00001025744,0.07191442,0.63235,0.004349318,0.27570626],"study_design_scores_gemma":[0.0019904752,0.0016389797,0.012168311,0.0003767881,0.00014237188,0.000079346086,0.009291879,0.0033801245,0.83886987,0.080734976,0.04981009,0.0015168166],"about_ca_topic_score_codex":0.00004436253,"about_ca_topic_score_gemma":0.000006439441,"teacher_disagreement_score":0.76695544,"about_ca_system_score_codex":0.00008693407,"about_ca_system_score_gemma":0.000046014888,"threshold_uncertainty_score":0.7262368},"labels":[],"label_agreement":null},{"id":"W4387674059","doi":"10.1145/3622869","title":"Saggitarius: A DSL for Specifying Grammatical Domains","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Natural Language Processing Techniques","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":"Simon Fraser University","funders":"Advanced Research Projects Agency; Defense Advanced Research Projects Agency; U.S. Department of Defense","keywords":"Computer science; Parsing; Rule-based machine translation; Suite; Natural language processing; Programming language; Grammar; Set (abstract data type); SQL; Artificial intelligence; Domain (mathematical analysis); Digital subscriber line; Context (archaeology); Linguistics","score_opus":0.025292021713337907,"score_gpt":0.30766713401946005,"score_spread":0.28237511230612217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387674059","genre_codex":"empirical","genre_gemma":"methods","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.7378742,0.0065538287,0.13027006,0.08024204,0.002453607,0.012075795,0.000047619673,0.025608445,0.0048744027],"genre_scores_gemma":[0.28859007,0.000009475267,0.7104005,0.00025481245,0.0001293422,0.00021486114,0.0000021596718,0.000032962016,0.00036580022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814194,0.000009222876,0.00032985985,0.00046500214,0.00050574745,0.0005482124],"domain_scores_gemma":[0.9983084,0.00038009608,0.0002678652,0.00073468057,0.00023296419,0.00007596433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069794705,0.00022989351,0.00027604436,0.00022820196,0.00024530807,0.0003401926,0.0044630016,0.000114152106,0.00000143684],"category_scores_gemma":[0.0045507667,0.00015407283,0.00020247707,0.0011922708,0.000121514735,0.00039637764,0.0016542498,0.0002586163,0.000009801445],"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.00004335619,0.00015673741,0.0010788908,0.0012162768,0.000076392585,0.000011257621,0.004121204,0.000001260897,0.029553898,0.5302874,0.009610687,0.42384267],"study_design_scores_gemma":[0.00075901404,0.00047105536,0.0006406833,0.00095969095,0.00005920365,0.000043249194,0.0013739386,0.0011512272,0.39932108,0.585948,0.008628284,0.0006445751],"about_ca_topic_score_codex":0.000010801825,"about_ca_topic_score_gemma":0.0000016370967,"teacher_disagreement_score":0.58013046,"about_ca_system_score_codex":0.000055107103,"about_ca_system_score_gemma":0.000030005685,"threshold_uncertainty_score":0.8293442},"labels":[],"label_agreement":null},{"id":"W4387674063","doi":"10.1145/3622810","title":"Mechanizing Session-Types using a Structural View: Enforcing Linearity without Linearity","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"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":"Session (web analytics); Computer science; Linearity; Channel (broadcasting); Linear logic; Syntax; Encoding (memory); Programming language; Abstract syntax; Theoretical computer science; Artificial intelligence; Computer network; Electronic engineering","score_opus":0.035632385818533285,"score_gpt":0.30770523975191394,"score_spread":0.27207285393338065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387674063","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.9912208,0.0004995489,0.0031905072,0.0007750078,0.0013319484,0.0010335615,0.0000021421176,0.0014000036,0.00054649066],"genre_scores_gemma":[0.9564439,0.000008357958,0.0428382,0.00011032042,0.00025415616,0.000025843425,0.0000021998123,0.000031177926,0.00028581682],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976706,0.000033420598,0.00044041994,0.00056557293,0.000666275,0.000623723],"domain_scores_gemma":[0.9982535,0.00011013166,0.0004734363,0.0007456358,0.00030739073,0.00010987215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011427556,0.00030333418,0.00040380107,0.00019909244,0.00050069555,0.0004841881,0.0029067255,0.00015638706,0.000003446721],"category_scores_gemma":[0.0015591024,0.00019902087,0.0001948774,0.0013294939,0.000096690404,0.00052284007,0.002063124,0.00039758696,0.000014676789],"study_design_candidate":"bench_or_experimental","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.000099695884,0.00024388859,0.11138187,0.002471216,0.0003773853,0.000037360544,0.021382166,0.00027857986,0.07815152,0.34115267,0.0006659701,0.44375768],"study_design_scores_gemma":[0.0039035077,0.0016340101,0.013379752,0.002035029,0.00045817214,0.00057502725,0.013571643,0.2690612,0.50838107,0.1540949,0.028704032,0.0042016464],"about_ca_topic_score_codex":0.00029898118,"about_ca_topic_score_gemma":0.000010404842,"teacher_disagreement_score":0.43955606,"about_ca_system_score_codex":0.00006636803,"about_ca_system_score_gemma":0.000061048326,"threshold_uncertainty_score":0.8115836},"labels":[],"label_agreement":null},{"id":"W4387674221","doi":"10.1145/3622844","title":"Initializing Global Objects: Time and Order","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Initialization; Computer science; Static analysis; Programming language; Scala; Programming paradigm; Distributed computing; Java","score_opus":0.018811776699838228,"score_gpt":0.27404711094698375,"score_spread":0.2552353342471455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387674221","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.94431955,0.0018029582,0.0008891748,0.0075308047,0.0012391255,0.0023036185,0.000008704922,0.0040755346,0.03783055],"genre_scores_gemma":[0.98969847,0.000013636625,0.009423404,0.00016047613,0.0001102778,0.000038786515,0.0000015846099,0.000015125224,0.00053825864],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985887,0.00001501507,0.00023057354,0.00038462953,0.00037938738,0.00040172646],"domain_scores_gemma":[0.99903154,0.00007654184,0.00020149228,0.00044912138,0.00016880548,0.00007248596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058458606,0.00017919342,0.00021739467,0.000085265514,0.00018421169,0.0003357567,0.0019019279,0.00008506238,0.0000028556426],"category_scores_gemma":[0.0011870525,0.00012012957,0.00007391895,0.0012730632,0.00010974134,0.00027500506,0.0014665653,0.00012477594,0.000054505697],"study_design_candidate":"theoretical_or_conceptual","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.000035144825,0.00019611827,0.027787507,0.000611141,0.0001780044,0.000028761946,0.010135988,0.000006178863,0.0060398304,0.38580063,0.005860148,0.5633206],"study_design_scores_gemma":[0.008231254,0.005224807,0.06590733,0.0014733614,0.00048441312,0.0012450442,0.029444726,0.010008331,0.11975942,0.5790876,0.17301515,0.0061185597],"about_ca_topic_score_codex":0.000075861724,"about_ca_topic_score_gemma":0.000004433244,"teacher_disagreement_score":0.557202,"about_ca_system_score_codex":0.000029021096,"about_ca_system_score_gemma":0.000027438504,"threshold_uncertainty_score":0.48987418},"labels":[],"label_agreement":null},{"id":"W4387674275","doi":"10.1145/3622842","title":"Building Dynamic System Call Sandbox with Partial Order Analysis","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Sandbox (software development); Computer science; System call; Attack surface; Static analysis; Call graph; Code (set theory); Program analysis; Server; Point (geometry); Order (exchange); Computer security; Operating system; Set (abstract data type); Programming language","score_opus":0.012058470131274613,"score_gpt":0.27636362275916954,"score_spread":0.26430515262789495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387674275","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.9706865,0.00009754855,0.025416892,0.001879683,0.00016999558,0.0003521512,0.000002076839,0.0010651621,0.0003300075],"genre_scores_gemma":[0.9152662,0.0000024209792,0.08454209,0.000042495823,0.000041664614,0.000035472025,0.0000012270515,0.0000119655115,0.00005643057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856734,0.000014356222,0.00024689408,0.00040526316,0.00044146436,0.00032469683],"domain_scores_gemma":[0.99872404,0.00012378214,0.00027923044,0.0006079886,0.0002115534,0.000053407886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059223454,0.00014808224,0.0002227697,0.00026617857,0.00024313423,0.0002531369,0.0024253305,0.00005658324,0.0000012327316],"category_scores_gemma":[0.00041950902,0.00009899714,0.00011446694,0.0037606715,0.00006509759,0.00018245597,0.00071952265,0.00016118695,0.0000072047255],"study_design_candidate":"simulation_or_modeling","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.000161895,0.00046124138,0.091233276,0.0021432647,0.0027270203,0.000038659713,0.026094716,0.007614688,0.01949032,0.5509314,0.0017743491,0.29732922],"study_design_scores_gemma":[0.0017427732,0.00071845757,0.03551841,0.0017754479,0.0011145857,0.00010018121,0.010365797,0.8572815,0.07972651,0.0025486513,0.0074613793,0.0016463237],"about_ca_topic_score_codex":0.000041211846,"about_ca_topic_score_gemma":0.0000033838626,"teacher_disagreement_score":0.8496668,"about_ca_system_score_codex":0.00004966551,"about_ca_system_score_gemma":0.000024407087,"threshold_uncertainty_score":0.45069075},"labels":[],"label_agreement":null},{"id":"W4387674307","doi":"10.1145/3622853","title":"TASTyTruffle: Just-in-Time Specialization of Parametric Polymorphism","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bytecode; Programming language; Compiler; Intermediate language; Data type; Compile time; Implementation; Type inference; Type safety; Theoretical computer science; Java; Artificial intelligence","score_opus":0.023863717963321332,"score_gpt":0.2714867060171256,"score_spread":0.24762298805380428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387674307","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.9878461,0.00062614086,0.0006540261,0.0020954134,0.000762526,0.0015328671,0.0000033296724,0.0008324014,0.0056471955],"genre_scores_gemma":[0.9948422,0.0000170016,0.004081101,0.00004568765,0.00011401791,0.000039934544,0.0000025464592,0.000019163434,0.00083835004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981552,0.000021875285,0.00042986198,0.00036961725,0.0006307601,0.00039268108],"domain_scores_gemma":[0.998623,0.00013012032,0.00044704138,0.00058642944,0.00016003552,0.000053371023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092162204,0.00017817742,0.00031209967,0.00051717146,0.00007721737,0.00013765546,0.0029882719,0.00010446767,0.0000068531026],"category_scores_gemma":[0.0015986619,0.00012736623,0.00012857388,0.0035391757,0.00009776629,0.00024437226,0.0009355461,0.00014688654,0.000042975833],"study_design_candidate":"theoretical_or_conceptual","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.00006730685,0.0007634706,0.13672663,0.0010144394,0.00012841573,0.000021801601,0.010532258,0.000055916433,0.018954005,0.4798231,0.006651802,0.34526083],"study_design_scores_gemma":[0.0065988884,0.0035084193,0.21658418,0.001175606,0.00027693115,0.00017440249,0.009320046,0.007834215,0.5192738,0.17474757,0.057158828,0.0033470802],"about_ca_topic_score_codex":0.00010026156,"about_ca_topic_score_gemma":0.0000029703115,"teacher_disagreement_score":0.50031984,"about_ca_system_score_codex":0.00004034464,"about_ca_system_score_gemma":0.000029725681,"threshold_uncertainty_score":0.55530024},"labels":[],"label_agreement":null},{"id":"W4388555695","doi":"10.1145/3632926","title":"Higher Order Bayesian Networks, Exactly","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Agence Nationale de la Recherche; Dalhousie University; European Commission; University of Cambridge","keywords":"Bayesian network; Rewriting; Computer science; Bayesian probability; Graphical model; Intersection (aeronautics); Probabilistic logic; Theoretical computer science; Inference; Bayesian inference; Semantics (computer science); Representation (politics); Variable-order Bayesian network; Algorithm; Mathematics; Programming language; Artificial intelligence","score_opus":0.017292279185754492,"score_gpt":0.2720950399917865,"score_spread":0.25480276080603204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388555695","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.21148011,0.026584402,0.5758911,0.10332371,0.008701709,0.0031570855,0.000014239033,0.010513565,0.06033408],"genre_scores_gemma":[0.9340398,0.000024172765,0.06394408,0.0003460681,0.0001925981,0.00003195923,5.674284e-7,0.000024135896,0.0013966359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998625,0.000009532719,0.00022539216,0.00043765217,0.00033907423,0.00036334893],"domain_scores_gemma":[0.9990366,0.0000875566,0.000088952125,0.00056983007,0.00014364973,0.00007342402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003749705,0.0001931153,0.00016942053,0.00009308589,0.00011069719,0.0005690769,0.0028573894,0.000095641895,0.000013944393],"category_scores_gemma":[0.00023785408,0.00012475248,0.00010853825,0.00087725086,0.00008169214,0.0003477681,0.00079232256,0.00032584753,0.000014928242],"study_design_candidate":"theoretical_or_conceptual","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.000011549562,0.00010520881,0.00084927864,0.00026115603,0.000083918654,0.000010229153,0.0013478057,0.000118424985,0.0020346774,0.37208372,0.009007752,0.6140863],"study_design_scores_gemma":[0.0017263463,0.0022349218,0.007985331,0.008895501,0.00043712638,0.00031130726,0.0018578919,0.39267266,0.08777509,0.28085998,0.21074262,0.0045012445],"about_ca_topic_score_codex":0.000024408335,"about_ca_topic_score_gemma":9.671819e-7,"teacher_disagreement_score":0.7225597,"about_ca_system_score_codex":0.000027691143,"about_ca_system_score_gemma":0.00003612734,"threshold_uncertainty_score":0.5487622},"labels":[],"label_agreement":null},{"id":"W4390604697","doi":"10.1145/3632925","title":"Commutativity Simplifies Proofs of Parameterized Programs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"","keywords":"Parameterized complexity; Mathematical proof; Computer science; Thread (computing); Theoretical computer science; Programming language; Commutative property; Soundness; Bounded function; Parametric statistics; Concurrency; Reduction (mathematics); Algorithm; Mathematics; Discrete mathematics","score_opus":0.0337666528042439,"score_gpt":0.3208212074906647,"score_spread":0.28705455468642077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390604697","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.98442024,0.0009937945,0.008555374,0.0019129404,0.00042251783,0.0014079995,0.000004965251,0.00081594626,0.0014662225],"genre_scores_gemma":[0.5968891,0.000005759655,0.40290755,0.000018671804,0.0000186095,0.000087187356,6.5560465e-7,0.00001169814,0.00006081835],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985867,0.000034204146,0.0003524969,0.00033242334,0.00043114377,0.0002629955],"domain_scores_gemma":[0.99857426,0.00018806323,0.00027221083,0.00074625976,0.00017937731,0.000039802428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011085179,0.00017129832,0.00024976008,0.00012165287,0.000079024256,0.00025896353,0.0030064771,0.00007368527,0.000001582105],"category_scores_gemma":[0.0018061623,0.00011203013,0.00015112358,0.0008668764,0.0002377783,0.00048208953,0.000978082,0.00023822385,0.0000034162017],"study_design_candidate":"bench_or_experimental","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.0000237727,0.00016815994,0.0013023398,0.0009323073,0.000055996996,9.696673e-7,0.004187643,0.0000018333201,0.022528524,0.12182684,0.000104586354,0.848867],"study_design_scores_gemma":[0.0003679588,0.0010745409,0.0033118248,0.0014842347,0.00007237725,0.000043729706,0.0015253876,0.0057444847,0.931251,0.04778631,0.006882812,0.00045533633],"about_ca_topic_score_codex":0.000019617897,"about_ca_topic_score_gemma":6.568604e-7,"teacher_disagreement_score":0.90872246,"about_ca_system_score_codex":0.00003066151,"about_ca_system_score_gemma":0.00003166182,"threshold_uncertainty_score":0.5586833},"labels":[],"label_agreement":null},{"id":"W4390604789","doi":"10.1145/3632922","title":"Indexed Types for a Statically Safe WebAssembly","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":4,"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; Compiler; Benchmark (surveying); Compile time; Parallel computing; Suite; Overhead (engineering); Memory safety; Programming language; Spec#; Binary number; Optimizing compiler; Arithmetic; Mathematics","score_opus":0.021009526633197807,"score_gpt":0.3041145624493795,"score_spread":0.2831050358161817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390604789","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.73194313,0.005189543,0.13969158,0.09712461,0.0035396714,0.0044432576,0.000030936026,0.0037840628,0.014253202],"genre_scores_gemma":[0.81066614,0.0000049695277,0.1887102,0.00020893253,0.00010284846,0.000060152972,6.957656e-7,0.000012803802,0.000233251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990176,0.000006003345,0.00020655915,0.0003021602,0.00024649527,0.00022118216],"domain_scores_gemma":[0.99902105,0.0003414663,0.000094012445,0.0003474402,0.00015814183,0.000037883707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050527294,0.00010888801,0.000120190896,0.0000871582,0.00012031038,0.00039267738,0.0020204296,0.00005173847,0.0000035047285],"category_scores_gemma":[0.0013394871,0.00007576877,0.000100830366,0.000447564,0.000049234655,0.00021328042,0.00045873973,0.00013608499,0.000008041161],"study_design_candidate":"theoretical_or_conceptual","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.000016543017,0.00007588021,0.0002707567,0.0005416894,0.000054920118,8.8855e-7,0.0038741417,0.0000057045295,0.0063618636,0.6732872,0.0036135172,0.31189686],"study_design_scores_gemma":[0.0013196485,0.0015002253,0.0040622805,0.0031848813,0.0001794665,0.000079837046,0.0036602137,0.068297625,0.4091784,0.26046905,0.2466651,0.0014032627],"about_ca_topic_score_codex":0.00000538976,"about_ca_topic_score_gemma":6.250129e-7,"teacher_disagreement_score":0.41281816,"about_ca_system_score_codex":0.000025314808,"about_ca_system_score_gemma":0.000044502143,"threshold_uncertainty_score":0.3786597},"labels":[],"label_agreement":null},{"id":"W4390605047","doi":"10.1145/3632861","title":"With a Few Square Roots, Quantum Computing Is as Easy as Pi","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pi; Square root; Square (algebra); Quantum; Mathematics; Physics; Computer science; Quantum mechanics; Geometry","score_opus":0.008725239926303079,"score_gpt":0.2634030320044901,"score_spread":0.254677792078187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390605047","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.98253363,0.0018401071,0.001665235,0.010153061,0.0003911761,0.0005587955,0.0000033696547,0.0011913743,0.0016632364],"genre_scores_gemma":[0.9479801,0.0000072044654,0.05075955,0.0005638446,0.00021930409,0.0000143437255,8.445469e-7,0.000044984852,0.00040981438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977049,0.000016825321,0.00029844788,0.00073235185,0.0007014396,0.0005460047],"domain_scores_gemma":[0.9986259,0.00019092228,0.00019832993,0.000701253,0.00017097846,0.000112649774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047584227,0.00033482217,0.00029875123,0.00018802352,0.0003055469,0.00085650646,0.003224812,0.00008988798,0.0000067199685],"category_scores_gemma":[0.00039681102,0.00020203534,0.00018727605,0.0011358313,0.00012741587,0.00023612655,0.0014626922,0.00053257705,0.00003625122],"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.000050021095,0.00023628552,0.0024104896,0.00123574,0.00023608247,0.000094368435,0.017349415,0.00022615932,0.0023802337,0.10965019,0.0024249363,0.8637061],"study_design_scores_gemma":[0.0028459847,0.008983102,0.010775352,0.024991816,0.00042738646,0.00397727,0.01096577,0.5490522,0.15349066,0.10418326,0.12568478,0.0046224594],"about_ca_topic_score_codex":0.000107793276,"about_ca_topic_score_gemma":0.000001426751,"teacher_disagreement_score":0.85908365,"about_ca_system_score_codex":0.000038089616,"about_ca_system_score_gemma":0.00008779141,"threshold_uncertainty_score":0.8259312},"labels":[],"label_agreement":null},{"id":"W4390605256","doi":"10.1145/3632873","title":"Coarser Equivalences for Causal Concurrency","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India","keywords":"Concurrency; Commutative property; Equivalence (formal languages); TRACE (psycholinguistics); Equivalence relation; Logical equivalence; Computer science; Mathematics; Thread (computing); Discrete mathematics; Theoretical computer science; Programming language","score_opus":0.022697104571304194,"score_gpt":0.3079195908962046,"score_spread":0.2852224863249004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390605256","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.8488408,0.03335357,0.03921856,0.03875957,0.011335555,0.00710838,0.0003620638,0.0043129427,0.01670861],"genre_scores_gemma":[0.98331934,0.000011858294,0.015507132,0.000074186166,0.00015720588,0.00013459945,0.0000016369609,0.000012763975,0.0007813046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988235,0.0000049185483,0.00023348449,0.00035460707,0.00029617798,0.00028726863],"domain_scores_gemma":[0.99920136,0.0001276343,0.00011370994,0.0003570908,0.00015554944,0.000044670818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041817687,0.00014286298,0.00017179547,0.000058037,0.000103511054,0.0004118473,0.002400987,0.00005595168,0.0000027571896],"category_scores_gemma":[0.0005170365,0.00008933767,0.00013831966,0.00040740537,0.00007666776,0.00033141248,0.00043404827,0.00012455329,0.000007119602],"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.000013936852,0.0001016535,0.0012583664,0.0013885924,0.000083327875,0.0000039270135,0.0028814503,0.0000032852656,0.00726796,0.43816113,0.023198875,0.5256375],"study_design_scores_gemma":[0.00138216,0.0016632623,0.0016631433,0.006252382,0.00016135546,0.00012645636,0.004098448,0.0116428,0.1512585,0.048373654,0.77188903,0.0014887857],"about_ca_topic_score_codex":0.000015433572,"about_ca_topic_score_gemma":0.000001042995,"teacher_disagreement_score":0.7486902,"about_ca_system_score_codex":0.000020950029,"about_ca_system_score_gemma":0.00003514593,"threshold_uncertainty_score":0.44616714},"labels":[],"label_agreement":null},{"id":"W4390605291","doi":"10.1145/3632903","title":"Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"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":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation; Royal Society; Semiconductor Research Corporation","keywords":"Probabilistic logic; Markov chain; Discrete mathematics; Computer science; Graph; Measure (data warehouse); Random graph; Mathematics; Theoretical computer science; Artificial intelligence; Data mining; Statistics","score_opus":0.01335425872438527,"score_gpt":0.26647790613374994,"score_spread":0.25312364740936466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390605291","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.9671156,0.017605457,0.002297912,0.0044678315,0.0013835417,0.0043698996,0.000019167017,0.0014222298,0.0013183798],"genre_scores_gemma":[0.94092363,0.00004067186,0.0580932,0.000043039454,0.000089139096,0.0004440966,0.0000029081507,0.000032439955,0.00033085374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813557,0.000018521574,0.00035348392,0.000681148,0.00029532562,0.00051593495],"domain_scores_gemma":[0.9986349,0.00040856746,0.00019020012,0.0004453977,0.00021841697,0.00010255187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009378577,0.00031736074,0.00035046533,0.000210497,0.00026213922,0.0008965803,0.002049758,0.000107696294,0.0000018820382],"category_scores_gemma":[0.0016829633,0.00020199486,0.00019967322,0.00069451734,0.00028539196,0.00042022907,0.00089470996,0.00025291386,0.0000020966934],"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.00017301798,0.00020767283,0.0021760273,0.0026324329,0.00019591716,0.0000069074617,0.011274227,8.6139613e-7,0.002409026,0.15630816,0.0022466916,0.82236904],"study_design_scores_gemma":[0.0112534445,0.008264507,0.007556062,0.009768832,0.0016392623,0.001165615,0.02188641,0.01517405,0.16303906,0.5630518,0.1917477,0.0054532364],"about_ca_topic_score_codex":0.0000492294,"about_ca_topic_score_gemma":0.000016985512,"teacher_disagreement_score":0.8169158,"about_ca_system_score_codex":0.00004362185,"about_ca_system_score_gemma":0.000058556416,"threshold_uncertainty_score":0.86457443},"labels":[],"label_agreement":null},{"id":"W4390605451","doi":"10.1145/3632870","title":"Semantic Code Refactoring for Abstract Data Types","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Engineering Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Code refactoring; Computer science; Programming language; Java; Code (set theory); Representation (politics); Equivalence (formal languages); Set (abstract data type); Theoretical computer science; Software","score_opus":0.05658574870714718,"score_gpt":0.34666339177316907,"score_spread":0.2900776430660219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390605451","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.9641985,0.0064589167,0.009364032,0.011025705,0.0021771074,0.0022017008,0.00008387252,0.0037450648,0.00074508344],"genre_scores_gemma":[0.9333449,0.000012383859,0.06609435,0.000017871736,0.00015013303,0.000040582323,0.0000028459795,0.00002807532,0.0003088671],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872774,0.000002161304,0.00016357236,0.00043455302,0.00036232718,0.00030965856],"domain_scores_gemma":[0.9980749,0.0006982304,0.000053039344,0.0010280965,0.00009978231,0.00004598497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095338,0.00012614457,0.00012978354,0.00011538416,0.00007335202,0.000422592,0.0052618054,0.00004990935,0.0000022137986],"category_scores_gemma":[0.0054912446,0.00008593266,0.00006307787,0.00041817102,0.00003714861,0.00043375173,0.0017917807,0.00021229911,0.0000088647985],"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.000032932116,0.00017152775,0.010602764,0.004914714,0.00031779418,0.000016596581,0.0036110957,0.00004778181,0.039380807,0.03430711,0.015638681,0.8909582],"study_design_scores_gemma":[0.0013279207,0.0011644666,0.047637418,0.008039352,0.00025632992,0.00016550095,0.0014427867,0.042572517,0.56311774,0.019227112,0.31284493,0.0022039553],"about_ca_topic_score_codex":0.000016009117,"about_ca_topic_score_gemma":0.0000013075809,"teacher_disagreement_score":0.88875425,"about_ca_system_score_codex":0.000035314933,"about_ca_system_score_gemma":0.00003607766,"threshold_uncertainty_score":0.97778314},"labels":[],"label_agreement":null},{"id":"W4392617628","doi":"10.1145/3649859","title":"Message-Observing Sessions","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Principle of compositionality; Computer science; Soundness; Session (web analytics); Semantics (computer science); Programming language; Theoretical computer science; Message passing; Process (computing); Artificial intelligence; World Wide Web","score_opus":0.02331670359806843,"score_gpt":0.28270556414566933,"score_spread":0.2593888605476009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392617628","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.695106,0.033109758,0.022086805,0.05180083,0.011705309,0.006459029,0.000012163144,0.013976978,0.16574308],"genre_scores_gemma":[0.9818278,0.00001564369,0.0154624805,0.00012722187,0.0001776887,0.000069333575,6.8006574e-7,0.000025430661,0.0022937143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834776,0.00001601025,0.0002853045,0.00047917422,0.0004715315,0.0004002327],"domain_scores_gemma":[0.9987718,0.0001389217,0.00014708887,0.0007327774,0.00012871753,0.000080691585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006643687,0.00020894835,0.0002169214,0.0001281484,0.00020800944,0.0006923858,0.0037085465,0.0000963797,0.0000102991635],"category_scores_gemma":[0.00075126515,0.00012511291,0.00019227668,0.00078900263,0.00008088046,0.0003611041,0.0015527537,0.0002915768,0.000038006674],"study_design_candidate":"theoretical_or_conceptual","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.0000047073254,0.000102650825,0.0027878713,0.0006426951,0.00007350845,0.000014617638,0.004247657,0.000002031006,0.0067079943,0.6796372,0.0055919983,0.3001871],"study_design_scores_gemma":[0.0009612041,0.0010273089,0.0050364374,0.0019651472,0.00024103207,0.0003679008,0.00850062,0.0032712882,0.1737812,0.24552311,0.5573752,0.0019495776],"about_ca_topic_score_codex":0.00005105047,"about_ca_topic_score_gemma":0.0000033838696,"teacher_disagreement_score":0.5517832,"about_ca_system_score_codex":0.000040853367,"about_ca_system_score_gemma":0.000041907315,"threshold_uncertainty_score":0.6891464},"labels":[],"label_agreement":null},{"id":"W4394659840","doi":"10.1145/3656418","title":"From Batch to Stream: Automatic Generation of Online Algorithms","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Online algorithm; Set (abstract data type); Algorithm; Function (biology); Online and offline; Computation; Theoretical computer science; Programming language","score_opus":0.026518647595186642,"score_gpt":0.3049339642941108,"score_spread":0.27841531669892416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394659840","genre_codex":"empirical","genre_gemma":"methods","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.96893615,0.0009761803,0.025078611,0.0033927101,0.0005080904,0.00051321543,0.00011528878,0.00038158766,0.00009814207],"genre_scores_gemma":[0.39201155,0.0000065785575,0.60746074,0.000060223934,0.0002477212,0.000031699237,0.000011879576,0.000013771835,0.00015585031],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989609,0.0000066342536,0.00026791927,0.0002989709,0.00030805322,0.00015752048],"domain_scores_gemma":[0.9991785,0.000070673086,0.000122025194,0.00047506831,0.00011057749,0.000043127122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018943223,0.00012450789,0.00017911884,0.00008797078,0.00004799582,0.00008889018,0.0010323095,0.000036220394,0.0000044493754],"category_scores_gemma":[0.0004702556,0.00008083493,0.00006785166,0.00045674128,0.00003406481,0.0003448389,0.00063563505,0.00009149655,0.0000046283135],"study_design_candidate":"bench_or_experimental","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.0000028288282,0.00009559085,0.00022114451,0.00030935186,0.000052775475,0.000002817301,0.0054198746,0.00001932701,0.06840106,0.021503855,0.0018581212,0.90211326],"study_design_scores_gemma":[0.0004093295,0.00075322785,0.0016360099,0.0034206638,0.000087930384,0.000026087433,0.0061288574,0.05718124,0.88476586,0.004673371,0.040244173,0.0006732716],"about_ca_topic_score_codex":0.0002043182,"about_ca_topic_score_gemma":0.000012918054,"teacher_disagreement_score":0.90143996,"about_ca_system_score_codex":0.000023810353,"about_ca_system_score_gemma":0.000026846075,"threshold_uncertainty_score":0.32963526},"labels":[],"label_agreement":null},{"id":"W4396214235","doi":"10.1145/3649849","title":"VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Data integrity; Computer science; Equivalence (formal languages); Bounded function; SQL; Programming language; Database; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.039721195698417415,"score_gpt":0.3154632234301081,"score_spread":0.27574202773169065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396214235","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.37701607,0.0022019607,0.59485275,0.014022314,0.0012739962,0.004585952,0.000304108,0.002544549,0.003198298],"genre_scores_gemma":[0.6245086,0.000008444065,0.37506226,0.000061357205,0.00005598143,0.0001501155,0.0000067095725,0.000015152982,0.00013138534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987948,0.0000081074095,0.00022790341,0.0004154269,0.0002890446,0.00026470376],"domain_scores_gemma":[0.9989081,0.00014365294,0.00015866607,0.00052376173,0.00022044839,0.000045369423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038320248,0.00017513211,0.00019394356,0.00006486061,0.00018453327,0.00025564415,0.0012261263,0.00004809421,0.000004094885],"category_scores_gemma":[0.0007044028,0.00010819094,0.00007697839,0.00036851453,0.000405041,0.00067023374,0.00038564,0.00017547351,0.0000027461488],"study_design_candidate":"theoretical_or_conceptual","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.000057616748,0.000049513605,0.0004405454,0.0009240715,0.00004953693,0.000002049355,0.0024251782,0.0000013215883,0.01808544,0.84865654,0.0008476678,0.12846054],"study_design_scores_gemma":[0.0017407216,0.0026942152,0.004792343,0.0067223995,0.0001732026,0.00034454843,0.018578542,0.0046609472,0.40749276,0.04059931,0.5103496,0.0018514429],"about_ca_topic_score_codex":0.00002932287,"about_ca_topic_score_gemma":0.0000067565747,"teacher_disagreement_score":0.8080572,"about_ca_system_score_codex":0.00004383339,"about_ca_system_score_gemma":0.00006666704,"threshold_uncertainty_score":0.44118986},"labels":[],"label_agreement":null},{"id":"W4396214258","doi":"10.1145/3649832","title":"Qualifying System F<sub>&lt;:</sub>: Some Terms and Conditions May Apply","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics","score_opus":0.017317369515603448,"score_gpt":0.2699108381574549,"score_spread":0.2525934686418515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396214258","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.9610449,0.0099853845,0.003954188,0.0059405975,0.0026665991,0.0031509919,0.000019255767,0.0044097104,0.00882836],"genre_scores_gemma":[0.99623144,0.000023588895,0.0029697497,0.00009184771,0.00024549864,0.0001768569,0.0000024761353,0.000031959928,0.00022660945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99810797,0.000025171827,0.0003781758,0.00058106804,0.00046447784,0.000443137],"domain_scores_gemma":[0.9988509,0.00016147354,0.00021932839,0.00055789563,0.00010203247,0.000108373104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008257928,0.00026463202,0.00030166467,0.00020073008,0.0002785213,0.0009241156,0.0018153753,0.00011968868,0.0000010630665],"category_scores_gemma":[0.00029921188,0.00017605435,0.00015459555,0.0005517924,0.0001608881,0.0005832964,0.0008994358,0.00026299915,0.000028987246],"study_design_candidate":"theoretical_or_conceptual","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.0000052489986,0.00005722603,0.0012676935,0.0018583904,0.00009601426,0.000017010105,0.0032813353,0.0000011318335,0.027725564,0.8626624,0.0011595289,0.101868466],"study_design_scores_gemma":[0.0021545973,0.0017415382,0.00442384,0.0043055634,0.00055484107,0.0018084053,0.019520858,0.004830229,0.7116616,0.16220203,0.08349813,0.0032983986],"about_ca_topic_score_codex":0.00003244676,"about_ca_topic_score_gemma":0.0000025313561,"teacher_disagreement_score":0.7004604,"about_ca_system_score_codex":0.00006508776,"about_ca_system_score_gemma":0.00003182972,"threshold_uncertainty_score":0.8911268},"labels":[],"label_agreement":null},{"id":"W4396214415","doi":"10.1145/3649836","title":"Persimmon: Nested Family Polymorphism with Extensible Variant Types","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Chemical synthesis and alkaloids","field":"Chemistry","cited_by":3,"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":"Polymorphism (computer science); Extensibility; Nested set model; Genetics; Biology; Computer science; Programming language; Genotype; Gene","score_opus":0.011333130606574504,"score_gpt":0.23414593209171122,"score_spread":0.2228128014851367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396214415","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.9781976,0.0034578224,0.000001219655,0.0019507908,0.00005586082,0.00010975561,0.000007756427,0.00031059826,0.01590862],"genre_scores_gemma":[0.99493176,0.000025262338,0.0020653333,0.00009708999,0.0001987448,0.000030068655,0.0000021259707,0.000047821475,0.0026018047],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882245,0.0000020470475,0.00019130901,0.0003557703,0.00033237858,0.00029601483],"domain_scores_gemma":[0.99930024,0.00010679026,0.000091396636,0.00035213758,0.000084054096,0.000065402404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013448883,0.00020855544,0.0002257947,0.00004799985,0.00008421332,0.00017025889,0.0008357424,0.000100366175,0.00010629045],"category_scores_gemma":[0.00038769786,0.000119289405,0.00013923644,0.00031085798,0.00012323666,0.00009663986,0.00027403058,0.0002558793,0.000013518368],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000086775624,0.00012098051,0.0010813648,0.0007043294,0.00015261034,0.000025345755,0.00066959724,7.2563574e-7,0.90927243,0.0030162618,0.0013988832,0.08347072],"study_design_scores_gemma":[0.0002830594,0.00009829038,0.0005576239,0.0021545887,0.00019832182,0.00010316726,0.002940897,0.00005902186,0.9718147,0.0009539992,0.020475807,0.00036056023],"about_ca_topic_score_codex":0.000075015785,"about_ca_topic_score_gemma":0.0000010997543,"teacher_disagreement_score":0.08311015,"about_ca_system_score_codex":0.000039269537,"about_ca_system_score_gemma":0.000027317577,"threshold_uncertainty_score":0.48644808},"labels":[],"label_agreement":null},{"id":"W4396214523","doi":"10.1145/3649850","title":"PyDex: Repairing Bugs in Introductory Python Assignments using LLMs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Testing and Debugging Techniques","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":"University of Waterloo","funders":"","keywords":"Python (programming language); Programming language; Computer science; Software engineering","score_opus":0.022964714500130406,"score_gpt":0.3016022634851895,"score_spread":0.2786375489850591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396214523","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.98320264,0.0015062989,0.0018558447,0.0018053086,0.0006185505,0.0005108527,0.0000011092351,0.009931546,0.00056786893],"genre_scores_gemma":[0.7647365,0.000005270509,0.23493694,0.000074529926,0.00010800951,0.000026182568,2.463254e-7,0.000025711068,0.000086610555],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983932,0.000016478929,0.00029861543,0.0005265693,0.00041074015,0.00035440907],"domain_scores_gemma":[0.9988913,0.0001950701,0.00013668777,0.0006550771,0.00007760933,0.00004424143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009984892,0.00019069518,0.00019896204,0.00028431823,0.0000901704,0.0003195602,0.002136603,0.000077910314,0.000001474818],"category_scores_gemma":[0.0025456608,0.00013990588,0.000100439014,0.00089123985,0.000075765274,0.00038452973,0.0012008825,0.0003267503,0.000003074438],"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.000032703243,0.00037598677,0.09573543,0.0014414106,0.00010675666,0.00006893549,0.0113395555,0.00006485149,0.060888026,0.016118092,0.01237003,0.80145824],"study_design_scores_gemma":[0.0013374945,0.00144285,0.025917964,0.02127973,0.0001950276,0.00063887116,0.0015678158,0.06679298,0.62090516,0.24288005,0.0139838895,0.0030581937],"about_ca_topic_score_codex":0.000109200584,"about_ca_topic_score_gemma":0.000001090763,"teacher_disagreement_score":0.79840004,"about_ca_system_score_codex":0.000133891,"about_ca_system_score_gemma":0.000041152885,"threshold_uncertainty_score":0.5705196},"labels":[],"label_agreement":null},{"id":"W4399851393","doi":"10.1145/3656389","title":"Optimistic Stack Allocation and Dynamic Heapification for Managed Runtimes","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"IBM Canada","keywords":"Stack (abstract data type); Computer science; Parallel computing; Distributed computing; Operating system","score_opus":0.012761576748477128,"score_gpt":0.28833592930975094,"score_spread":0.2755743525612738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399851393","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.091513634,0.0035165169,0.8833693,0.015409064,0.00034051324,0.0021376759,0.000006742285,0.0026373286,0.0010692115],"genre_scores_gemma":[0.6528468,0.000036580812,0.34665293,0.00004485418,0.000016033971,0.000058803827,0.0000021568403,0.000009944752,0.0003318695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992582,0.00000675767,0.00016303452,0.00029296326,0.0001363276,0.00014268454],"domain_scores_gemma":[0.99935544,0.00012096986,0.00009555567,0.00028709887,0.00011606914,0.000024875499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041013397,0.000103866325,0.000100878904,0.00010871986,0.000118215066,0.00032109983,0.0009611074,0.000046804224,4.7892433e-7],"category_scores_gemma":[0.0004987488,0.00007629324,0.00004880968,0.00029523,0.00004587323,0.00019973885,0.00028359628,0.00008888812,0.0000010338409],"study_design_candidate":"simulation_or_modeling","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.000026240969,0.00011814549,0.00028420895,0.0012540686,0.00008763375,7.546631e-7,0.0035919084,0.00057932234,0.009362428,0.23493122,0.0039079455,0.7458561],"study_design_scores_gemma":[0.0004823823,0.0006919198,0.0021079127,0.0012833672,0.00010438177,0.000029029892,0.0008188781,0.88483214,0.054550678,0.047622465,0.0068488666,0.00062797905],"about_ca_topic_score_codex":0.0000042798792,"about_ca_topic_score_gemma":3.8852593e-7,"teacher_disagreement_score":0.88425285,"about_ca_system_score_codex":0.000026226477,"about_ca_system_score_gemma":0.000014059436,"threshold_uncertainty_score":0.3111148},"labels":[],"label_agreement":null},{"id":"W4399851446","doi":"10.1145/3656445","title":"SpEQ: Translation of Sparse Codes using Equivalences","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Translation (biology); Computer science; Biology; Genetics","score_opus":0.05207368916312324,"score_gpt":0.3068119067114592,"score_spread":0.254738217548336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399851446","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.95658976,0.012283003,0.018556118,0.0020435122,0.0015179544,0.0015577178,0.000005354705,0.000968521,0.0064780395],"genre_scores_gemma":[0.96339524,0.000020385864,0.036316942,0.000016635478,0.00010344231,0.000013209329,5.207009e-7,0.000014065757,0.000119528784],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998584,0.000015787207,0.00033587788,0.00034003655,0.0004555899,0.0002687162],"domain_scores_gemma":[0.9991092,0.00011298,0.0002208225,0.0003871314,0.000128949,0.000040899937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068879226,0.000163987,0.00023519646,0.00014450657,0.00008730179,0.00025066527,0.0018799267,0.000075258904,0.0000040009472],"category_scores_gemma":[0.00026360902,0.00010483587,0.00016313187,0.0006765356,0.00013670675,0.0003940255,0.00034154986,0.00014214216,0.0000040890127],"study_design_candidate":"bench_or_experimental","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.000021285769,0.00016871345,0.0065049822,0.001869194,0.0001409186,0.0000069735315,0.011277717,0.000027600636,0.053574685,0.3582732,0.00020532926,0.5679294],"study_design_scores_gemma":[0.0010504067,0.0016625889,0.0022625052,0.0021568863,0.0003897441,0.00022417384,0.008517339,0.022527497,0.7802548,0.15307173,0.026453452,0.0014288861],"about_ca_topic_score_codex":0.00010270922,"about_ca_topic_score_gemma":0.0000041560847,"teacher_disagreement_score":0.7266801,"about_ca_system_score_codex":0.000024750228,"about_ca_system_score_gemma":0.000038779937,"threshold_uncertainty_score":0.42750826},"labels":[],"label_agreement":null},{"id":"W4399851487","doi":"10.1145/3656448","title":"Compiling Probabilistic Programs for Variable Elimination with Information Flow","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"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":"Variable (mathematics); Probabilistic logic; Computer science; Information flow; Programming language; Mathematics; Artificial intelligence; Philosophy","score_opus":0.016204014095643433,"score_gpt":0.2575482061316535,"score_spread":0.2413441920360101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399851487","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.18736868,0.0008983251,0.7793546,0.015062545,0.0016746181,0.007566137,0.000019251782,0.0035980097,0.0044578603],"genre_scores_gemma":[0.578083,0.0000014103653,0.42158198,0.00006566839,0.000063854786,0.00015411989,0.000007365151,0.000009113544,0.000033534936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989817,0.000005939689,0.00024955338,0.0002392528,0.00030435307,0.0002191921],"domain_scores_gemma":[0.99894506,0.00017575039,0.00016343337,0.000324065,0.00036019488,0.000031476386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006067763,0.00012581433,0.000116576746,0.00010843423,0.00018069963,0.00071950327,0.0013538415,0.00005250336,9.879585e-7],"category_scores_gemma":[0.0007845773,0.000083882245,0.00005733016,0.00069569144,0.00005480764,0.0008522913,0.00025254424,0.00013715489,0.000002888624],"study_design_candidate":"simulation_or_modeling","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.000024802503,0.000084682484,0.00018461696,0.0013813776,0.000036478657,1.850539e-7,0.0049385345,0.00034176107,0.00030735604,0.3605733,0.0004035883,0.63172334],"study_design_scores_gemma":[0.00094366015,0.0012914177,0.00065348594,0.003669866,0.0001283365,0.00006746029,0.0030214905,0.8335244,0.03077466,0.059100874,0.066064626,0.00075974426],"about_ca_topic_score_codex":0.0000068474633,"about_ca_topic_score_gemma":5.0731995e-7,"teacher_disagreement_score":0.83318263,"about_ca_system_score_codex":0.00004936343,"about_ca_system_score_gemma":0.000052303134,"threshold_uncertainty_score":0.6938187},"labels":[],"label_agreement":null},{"id":"W4399851533","doi":"10.1145/3656438","title":"Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Security and Verification in Computing","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":"University of British Columbia","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Trustworthiness; Computer science; Programming language; Software engineering; Natural language processing; Computer security","score_opus":0.0193190425675604,"score_gpt":0.33013030580165775,"score_spread":0.31081126323409736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399851533","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.98063654,0.0007402101,0.0047246697,0.0028134643,0.00074651104,0.0011763315,0.0000066453263,0.0077174306,0.0014382224],"genre_scores_gemma":[0.8267823,0.000008878698,0.17280585,0.00007661713,0.00013187392,0.00013220428,0.000013175606,0.000024472289,0.000024622752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982083,0.000031635882,0.0004418622,0.00052578514,0.0004446272,0.00034779185],"domain_scores_gemma":[0.9986918,0.00009427252,0.00022275049,0.0007177406,0.00018310695,0.00009030371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008109552,0.00022174885,0.00019239816,0.0002143999,0.0002799135,0.00090400595,0.0028117907,0.00011337081,0.0000057580983],"category_scores_gemma":[0.000551713,0.00017340222,0.00014877782,0.0011194649,0.00011122436,0.0011137248,0.00038819353,0.00032623607,0.000008959906],"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.000012975259,0.00017421096,0.0002843539,0.00040179578,0.000052207182,0.0000025906274,0.041864716,0.00003113389,0.008138883,0.025893774,0.00024002843,0.92290336],"study_design_scores_gemma":[0.00096714904,0.0014768231,0.008463183,0.0021526688,0.0001753772,0.000080547994,0.01829193,0.7225583,0.22112787,0.009041154,0.01430519,0.001359803],"about_ca_topic_score_codex":0.000055992685,"about_ca_topic_score_gemma":0.0000047951057,"teacher_disagreement_score":0.92154354,"about_ca_system_score_codex":0.00006429774,"about_ca_system_score_gemma":0.0000800054,"threshold_uncertainty_score":0.871735},"labels":[],"label_agreement":null},{"id":"W4399992113","doi":"10.1145/3674626","title":"Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"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":"Computer science; Programming language; Semantics (computer science); Lazy evaluation; Modular design; sort; Queue; Theoretical computer science; Computation; Functional programming","score_opus":0.031042446243746174,"score_gpt":0.28285921545311526,"score_spread":0.2518167692093691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399992113","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.689668,0.018173493,0.26583368,0.006064293,0.0050159683,0.010463248,0.00007999189,0.0026309446,0.002070381],"genre_scores_gemma":[0.9822733,0.00001941303,0.016784605,0.000029915656,0.000117135336,0.00023078895,0.000008601876,0.000025022455,0.00051126076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980732,0.000033499568,0.00049259537,0.00046985364,0.000576078,0.00035474528],"domain_scores_gemma":[0.998112,0.00024455256,0.00049988186,0.00049791107,0.0005643905,0.00008125224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016329951,0.00022531349,0.00053790223,0.00047333335,0.00015891148,0.00018098067,0.0014693837,0.00012990866,0.0000045544516],"category_scores_gemma":[0.0011056563,0.0001547471,0.0005034578,0.0020249442,0.00011962192,0.00023423696,0.00044262316,0.0002105138,0.000001671191],"study_design_candidate":"theoretical_or_conceptual","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.0002559838,0.0010416849,0.018974774,0.004410642,0.0060972087,0.0000033485485,0.009878624,0.00008081506,0.015695766,0.5537511,0.0020163527,0.3877937],"study_design_scores_gemma":[0.009605944,0.013645053,0.021066811,0.0031659051,0.02397101,0.00015300188,0.039051957,0.10272708,0.32984316,0.1335446,0.31805775,0.0051677665],"about_ca_topic_score_codex":0.0000690243,"about_ca_topic_score_gemma":0.000018199884,"teacher_disagreement_score":0.42020652,"about_ca_system_score_codex":0.000046087527,"about_ca_system_score_gemma":0.00008671487,"threshold_uncertainty_score":0.6310404},"labels":[],"label_agreement":null},{"id":"W4401202381","doi":"10.1145/3704856","title":"Formal Foundations for Translational Separation Logic Verifiers","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"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":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Separation logic; Programming language; Computer science; Soundness; Automated theorem proving; Non-monotonic logic; Proof theory; Mathematical proof; Automated reasoning; Semantics (computer science); Proof assistant; Front and back ends; Theoretical computer science; Mathematics","score_opus":0.025961397652422412,"score_gpt":0.31769378705981943,"score_spread":0.29173238940739704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401202381","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.059531197,0.0009871626,0.87080497,0.023118114,0.0022080266,0.0054931175,0.0000101884625,0.0010803363,0.036766905],"genre_scores_gemma":[0.9471853,0.0000024508702,0.051432338,0.00020319235,0.000065823544,0.00020470198,0.000005781565,0.000006706101,0.0008937483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898344,0.000007875539,0.0002525504,0.00026373882,0.00022609837,0.00026632205],"domain_scores_gemma":[0.9991253,0.000110387075,0.00018259375,0.00032069584,0.00023223739,0.000028760549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046629377,0.00012708346,0.00014731301,0.00011204872,0.0003051968,0.00022804264,0.0014948121,0.00007609397,0.0000020880566],"category_scores_gemma":[0.0005286108,0.000088853274,0.00014456008,0.00045040285,0.000068741036,0.00044331374,0.00020911265,0.00009502133,0.0000029317134],"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.000017544264,0.000061560284,0.0010590602,0.00012131219,0.00003422406,8.7604406e-8,0.0008740158,0.00001137584,0.00077874836,0.89151037,0.0008023384,0.104729354],"study_design_scores_gemma":[0.002267896,0.0008194898,0.0062784837,0.00013545765,0.00014356668,0.00001711098,0.0023012916,0.0056167627,0.0490406,0.77655673,0.15614435,0.0006782392],"about_ca_topic_score_codex":0.0000132686,"about_ca_topic_score_gemma":0.000005086168,"teacher_disagreement_score":0.88765407,"about_ca_system_score_codex":0.000028748529,"about_ca_system_score_gemma":0.000054963395,"threshold_uncertainty_score":0.36233315},"labels":[],"label_agreement":null},{"id":"W4401596910","doi":"10.1145/3674649","title":"Staged Compilation with Module Functors","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":"University of Toronto","funders":"","keywords":"Functor; Programming language; Computer science; Mathematics; Pure mathematics","score_opus":0.0172354960443027,"score_gpt":0.2523212622960378,"score_spread":0.2350857662517351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401596910","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.9302322,0.0042343703,0.02950191,0.007589108,0.0022088343,0.0032468005,0.000008380855,0.0043318016,0.01864656],"genre_scores_gemma":[0.985153,0.0000037579005,0.013675518,0.000057943365,0.00011351954,0.00005010456,0.0000019020595,0.000021881995,0.00092234457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858063,0.000012659777,0.0002150821,0.00041041573,0.00047895266,0.00030225088],"domain_scores_gemma":[0.99905366,0.00007832215,0.00014692145,0.0005221358,0.00014176902,0.000057214856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047588456,0.00018773551,0.00018678952,0.00012172425,0.0001396655,0.0005325377,0.0018149256,0.00006490675,0.000004534612],"category_scores_gemma":[0.00021584673,0.000104484614,0.0000970265,0.00070958317,0.000088230125,0.00040674215,0.00046209135,0.00021166165,0.000017803386],"study_design_candidate":"theoretical_or_conceptual","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.000038839007,0.00017727226,0.020078197,0.0008647103,0.00016737446,0.000014135571,0.0071383156,0.000023364455,0.00472922,0.6763623,0.0023232899,0.28808302],"study_design_scores_gemma":[0.003956517,0.0076906104,0.043599162,0.0023594615,0.00055430847,0.0005449973,0.013711072,0.014590215,0.39423472,0.16561711,0.34876963,0.0043721967],"about_ca_topic_score_codex":0.000037493388,"about_ca_topic_score_gemma":0.000004952232,"teacher_disagreement_score":0.51074517,"about_ca_system_score_codex":0.00004212701,"about_ca_system_score_gemma":0.000032814896,"threshold_uncertainty_score":0.51352733},"labels":[],"label_agreement":null},{"id":"W4401597033","doi":"10.1145/3674625","title":"How to Bake a Quantum Π","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Morphism; Unitary state; Categorical variable; Property (philosophy); Quantum; Construct (python library); Layering; Pure mathematics; Rotation (mathematics); Computer science; Mathematics; Algorithm; Algebra over a field; Programming language; Geometry; Physics; Quantum mechanics","score_opus":0.011010964300566608,"score_gpt":0.255551729874872,"score_spread":0.2445407655743054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401597033","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.8986163,0.0014005402,0.007179162,0.08891603,0.0010860622,0.0007088735,0.000004880009,0.0014619152,0.00062619906],"genre_scores_gemma":[0.8856954,0.000002865429,0.11318498,0.00026508133,0.000184591,0.00002588507,2.3024147e-7,0.000021366413,0.0006196191],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986547,0.000007349561,0.00014850314,0.00045018425,0.00039280878,0.00034645086],"domain_scores_gemma":[0.9990952,0.00010905487,0.00006789243,0.00055497244,0.00008733261,0.000085545355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035291343,0.00017768014,0.00016340481,0.0001593056,0.00012254098,0.0009447791,0.0032406526,0.000049383034,0.0000010425777],"category_scores_gemma":[0.00080708414,0.00010805267,0.0001404337,0.0009056842,0.000045429715,0.0001810871,0.0014572352,0.00026330445,0.000010104909],"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.000007298319,0.00006798488,0.00020396472,0.00038828768,0.000050442235,0.000012764889,0.005630204,0.00004001426,0.0109828245,0.12314801,0.005554463,0.8539137],"study_design_scores_gemma":[0.0008275211,0.0029448874,0.0047356095,0.006733625,0.00012509167,0.0004991678,0.0038046497,0.18071795,0.2520553,0.10077681,0.44442222,0.0023571937],"about_ca_topic_score_codex":0.000010413898,"about_ca_topic_score_gemma":5.7171013e-7,"teacher_disagreement_score":0.85155654,"about_ca_system_score_codex":0.000021169753,"about_ca_system_score_gemma":0.00002457205,"threshold_uncertainty_score":0.91105264},"labels":[],"label_agreement":null},{"id":"W4401597219","doi":"10.1145/3674643","title":"Blame-Correct Support for Receiver Properties in Recursively-Structured Actor Contracts","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Blockchain Technology Applications and Security","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":"Université du Québec à Montréal","funders":"","keywords":"Blame; Computer science; Psychology; Process management; Business; Social psychology","score_opus":0.015289890519767046,"score_gpt":0.2618878851278438,"score_spread":0.24659799460807674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401597219","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.98379064,0.0011169955,0.00042945435,0.011284398,0.00040179264,0.0018008787,0.000010998468,0.00068050675,0.00048435378],"genre_scores_gemma":[0.9733236,0.000017537663,0.025883019,0.00011815688,0.000041639774,0.0003168342,0.0000011297734,0.000015301233,0.00028279462],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989043,0.0000059564977,0.00022614283,0.00039964553,0.00017260165,0.00029136555],"domain_scores_gemma":[0.99918336,0.00009894537,0.00011592261,0.00043769402,0.00013301738,0.00003108855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036968317,0.000152803,0.0001902842,0.00015994802,0.000088615045,0.00015045544,0.0021395674,0.00013998331,0.0000027746808],"category_scores_gemma":[0.00095921557,0.000099387675,0.00009752065,0.0005265495,0.00012730071,0.00020189137,0.0003981419,0.0002800667,0.000002834937],"study_design_candidate":"bench_or_experimental","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.00007707659,0.0002525809,0.0023181806,0.00054709165,0.00009546118,0.0000048148436,0.00995766,0.0000023199693,0.05176347,0.14293349,0.0040944587,0.7879534],"study_design_scores_gemma":[0.0008111861,0.00066874735,0.0040858104,0.0008873211,0.000060356506,0.00007232115,0.0019219585,0.0020551651,0.85866433,0.059427958,0.07073315,0.00061171356],"about_ca_topic_score_codex":0.0000170449,"about_ca_topic_score_gemma":0.000008577109,"teacher_disagreement_score":0.80690086,"about_ca_system_score_codex":0.00004612662,"about_ca_system_score_gemma":0.00004464781,"threshold_uncertainty_score":0.40529117},"labels":[],"label_agreement":null},{"id":"W4401597351","doi":"10.1145/3674651","title":"Parallel Algebraic Effect Handlers","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":"Google (Canada); University of Toronto","funders":"","keywords":"Algebraic number; Computer science; Mathematics; Parallel computing; Mathematical analysis","score_opus":0.013583053790688426,"score_gpt":0.262864222507452,"score_spread":0.2492811687167636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401597351","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.8560498,0.03032524,0.020080468,0.020090582,0.0083149355,0.007472842,0.000005660294,0.00933174,0.048328757],"genre_scores_gemma":[0.989368,0.0000129822,0.009034362,0.000096664044,0.00017490666,0.000114888164,8.543256e-7,0.000026609328,0.0011706927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982736,0.000022300392,0.00026857748,0.0005144193,0.00048432496,0.0004367382],"domain_scores_gemma":[0.99885577,0.000185003,0.00014030168,0.0006521985,0.000085074564,0.000081623984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008396502,0.00024837852,0.00026930086,0.00014405932,0.00014995357,0.00067891716,0.0031621526,0.0001046116,0.0000054218012],"category_scores_gemma":[0.0006850078,0.00014469925,0.00024337794,0.00071743526,0.00011219588,0.00035322123,0.00088449835,0.00027178362,0.00006133816],"study_design_candidate":"theoretical_or_conceptual","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.000022549946,0.00009162625,0.004083077,0.0010083076,0.0001583534,0.000018098182,0.0035992735,0.0000033924503,0.0034563327,0.5172782,0.0043541817,0.46592662],"study_design_scores_gemma":[0.0035435897,0.006708424,0.0068172324,0.001997235,0.0005218351,0.0007013417,0.0031436724,0.0045451173,0.30764657,0.26636332,0.39456618,0.0034454756],"about_ca_topic_score_codex":0.000044273158,"about_ca_topic_score_gemma":0.0000022542724,"teacher_disagreement_score":0.46248114,"about_ca_system_score_codex":0.000042403506,"about_ca_system_score_gemma":0.000030832412,"threshold_uncertainty_score":0.6546814},"labels":[],"label_agreement":null},{"id":"W4403222856","doi":"10.1145/3689717","title":"A Low-Level Look at A-Normal Form","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.021964091444990508,"score_gpt":0.2627908707760068,"score_spread":0.24082677933101632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403222856","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.8981709,0.008913846,0.0103763025,0.011299136,0.0049219746,0.0040806355,0.00001618744,0.005070136,0.057150893],"genre_scores_gemma":[0.98526806,0.000012581291,0.009898232,0.00014531643,0.00021756417,0.000091683796,0.0000015309851,0.000029321778,0.004335724],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99806607,0.000009674693,0.00032813198,0.0005182094,0.00055810215,0.0005198059],"domain_scores_gemma":[0.9988095,0.00009590945,0.00017447514,0.00068672694,0.00013813975,0.000095252704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063313125,0.0002502168,0.00024483466,0.00014469173,0.00020555429,0.0005479593,0.0032547198,0.000115086266,0.00001261716],"category_scores_gemma":[0.00042036397,0.0001559592,0.00023680217,0.0006406365,0.00011737094,0.0004963084,0.0019178268,0.000250971,0.00009363879],"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.000025110405,0.00018095651,0.0032391583,0.0012013214,0.00013109979,0.000024828749,0.0078089098,0.0000013099949,0.0067040897,0.3906074,0.006966621,0.5831092],"study_design_scores_gemma":[0.0015228064,0.0018335998,0.0036729688,0.0010885845,0.00019845096,0.0007493163,0.0036679325,0.0021326682,0.53972113,0.12987308,0.31349435,0.0020450992],"about_ca_topic_score_codex":0.000046121906,"about_ca_topic_score_gemma":0.000009494931,"teacher_disagreement_score":0.5810641,"about_ca_system_score_codex":0.000098499084,"about_ca_system_score_gemma":0.000045141936,"threshold_uncertainty_score":0.63598317},"labels":[],"label_agreement":null},{"id":"W4403222962","doi":"10.1145/3689714","title":"Intensional Functions","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":"Microsoft (Canada)","funders":"","keywords":"Mathematics","score_opus":0.02000797147900105,"score_gpt":0.26567637411622863,"score_spread":0.24566840263722758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403222962","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.60616124,0.029680813,0.07159747,0.095937446,0.02581291,0.0074060895,0.000022154405,0.016025612,0.14735629],"genre_scores_gemma":[0.98848784,0.0000056481013,0.00828366,0.00015162915,0.00020095319,0.000053351843,0.0000010138859,0.000016243386,0.002799643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871606,0.00000827319,0.00022057939,0.00038127135,0.00039075615,0.00028304037],"domain_scores_gemma":[0.9990745,0.00009689739,0.00009560932,0.0004947223,0.00017969254,0.000058534562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043493634,0.00015509305,0.00015527454,0.00012902518,0.00014571572,0.00042136523,0.0020845344,0.00007036076,0.0000090618805],"category_scores_gemma":[0.0006743339,0.0000920172,0.00017005786,0.0006677585,0.000091861715,0.00029872454,0.00089009374,0.00023552524,0.000073297815],"study_design_candidate":"theoretical_or_conceptual","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.0000069017333,0.0000906924,0.0014290189,0.0002418017,0.000072080045,0.0000072176354,0.0017903231,0.0000014809603,0.0032123053,0.71351326,0.012988691,0.2666462],"study_design_scores_gemma":[0.0006110401,0.0011098946,0.003513801,0.0005872067,0.00014363798,0.00048800473,0.0050740424,0.0023097966,0.04502797,0.15589459,0.7841775,0.0010625217],"about_ca_topic_score_codex":0.00003126236,"about_ca_topic_score_gemma":0.0000020724956,"teacher_disagreement_score":0.7711888,"about_ca_system_score_codex":0.000033694287,"about_ca_system_score_gemma":0.000036374742,"threshold_uncertainty_score":0.40632346},"labels":[],"label_agreement":null},{"id":"W4403223004","doi":"10.1145/3689793","title":"Making Sense of Multi-threaded Application Performance at Scale with NonSequitur","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software System Performance and Reliability","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 British Columbia","funders":"","keywords":"Sense (electronics); Computer science; Scale (ratio); Engineering; Electrical engineering; Geography; Cartography","score_opus":0.02078093307109422,"score_gpt":0.2860024398985674,"score_spread":0.26522150682747314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403223004","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.9966583,0.0004336056,0.001249869,0.00050192984,0.00010582428,0.00052219426,0.0000017655171,0.0002976972,0.00022879976],"genre_scores_gemma":[0.955081,0.000010929419,0.04458909,0.000029079009,0.000038785318,0.00007526496,5.976118e-7,0.000014844455,0.00016041167],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987639,0.000006931414,0.00026058743,0.00036418193,0.00037093868,0.00023345764],"domain_scores_gemma":[0.9989198,0.000068352754,0.00020007735,0.0006177467,0.00016375027,0.000030274197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004849749,0.00015265452,0.00019216789,0.00009239349,0.000119301745,0.00008313039,0.0011789603,0.000068397545,0.0000011182444],"category_scores_gemma":[0.00010963774,0.00008703841,0.00008232034,0.00059649127,0.00014157502,0.00031008234,0.0006528758,0.00014805063,0.000008776223],"study_design_candidate":"bench_or_experimental","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.00016757629,0.00033876687,0.18081436,0.0070160665,0.00013563354,0.0000044295552,0.016092367,0.00011450872,0.07199163,0.0025211258,0.0002998568,0.7205037],"study_design_scores_gemma":[0.00089886144,0.0009102633,0.048104506,0.004782625,0.00010948912,0.00032141022,0.0016138649,0.030946614,0.907791,0.00036573224,0.0034579083,0.0006976943],"about_ca_topic_score_codex":0.000016535892,"about_ca_topic_score_gemma":0.0000041267213,"teacher_disagreement_score":0.8357994,"about_ca_system_score_codex":0.00006330245,"about_ca_system_score_gemma":0.000030894003,"threshold_uncertainty_score":0.35493234},"labels":[],"label_agreement":null},{"id":"W4403223013","doi":"10.1145/3689783","title":"QuAC: Quick Attribute-Centric Type Inference for Python","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Computational Physics and Python Applications","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":"University of British Columbia","funders":"Naval Information Warfare Center Pacific; Defense Advanced Research Projects Agency","keywords":"Python (programming language); Programming language; Computer science; Type inference; Inference; Artificial intelligence","score_opus":0.02638525004859774,"score_gpt":0.3213995639361055,"score_spread":0.29501431388750776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403223013","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.71021205,0.0056884545,0.19791035,0.06979895,0.0027467853,0.0063533746,0.00009538795,0.003204071,0.003990563],"genre_scores_gemma":[0.9454253,0.0000100986945,0.05391226,0.00012756062,0.000121489706,0.00010537869,0.0000042683255,0.000013848831,0.00027984657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991211,0.0000037398545,0.0001624899,0.00029071543,0.00023153973,0.00019041073],"domain_scores_gemma":[0.9989417,0.00033152066,0.000091846254,0.00033242253,0.00026232793,0.000040173818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023511761,0.00010795621,0.000109294204,0.00007936532,0.00011155496,0.00029933554,0.0016096678,0.00003520931,0.0000020283742],"category_scores_gemma":[0.00054822874,0.0000771082,0.0000954655,0.00092573784,0.0000337681,0.00018337986,0.00048790648,0.00011033557,0.000015040213],"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.0000076518645,0.00009349958,0.000542111,0.00023220529,0.000031807238,3.2876156e-7,0.0008953567,0.000036915008,0.0028649147,0.75657845,0.005265071,0.2334517],"study_design_scores_gemma":[0.00085072545,0.0010748819,0.007876093,0.0010629205,0.00013779817,0.000026429207,0.00072060607,0.04885522,0.06453832,0.54763716,0.32611185,0.0011079711],"about_ca_topic_score_codex":0.000010887641,"about_ca_topic_score_gemma":7.203455e-7,"teacher_disagreement_score":0.3208468,"about_ca_system_score_codex":0.0000298942,"about_ca_system_score_gemma":0.000058768423,"threshold_uncertainty_score":0.3144381},"labels":[],"label_agreement":null},{"id":"W4403223110","doi":"10.1145/3689770","title":"Lexical Effect Handlers, Directly","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"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":"Natural language processing; Linguistics; Computer science; Psychology; Chemistry; Philosophy","score_opus":0.01416515432102787,"score_gpt":0.27065398474595215,"score_spread":0.25648883042492426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403223110","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.85372823,0.026369654,0.011782368,0.017468302,0.008213373,0.0055486164,0.000006527338,0.009083737,0.0677992],"genre_scores_gemma":[0.99395,0.00001043673,0.004441654,0.00007297943,0.00022491348,0.00008204039,7.4020346e-7,0.00002390785,0.0011932983],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832493,0.0000240985,0.00025287416,0.00050054863,0.00048633924,0.00041120365],"domain_scores_gemma":[0.9989215,0.00020938106,0.00011392224,0.00058716367,0.00008470214,0.000083303035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085796585,0.00023135984,0.0002679101,0.00012498438,0.00014661133,0.0006764553,0.0028209717,0.00010825813,0.0000051630723],"category_scores_gemma":[0.00084313605,0.00013242006,0.00023704037,0.0006919969,0.00011539465,0.00031004762,0.00090211513,0.00028606792,0.000049428763],"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.000022196877,0.00010477044,0.0036617198,0.0008382927,0.00012279779,0.000019055082,0.0025746932,0.0000010579214,0.008706528,0.3865113,0.004104443,0.5933331],"study_design_scores_gemma":[0.001487336,0.003911702,0.0031685433,0.0011694441,0.0002715423,0.00040655793,0.0011282567,0.0023489776,0.55895543,0.07866633,0.34670246,0.001783434],"about_ca_topic_score_codex":0.000045719004,"about_ca_topic_score_gemma":0.0000020695543,"teacher_disagreement_score":0.5915497,"about_ca_system_score_codex":0.000042953165,"about_ca_system_score_gemma":0.000029171326,"threshold_uncertainty_score":0.65230745},"labels":[],"label_agreement":null},{"id":"W4403223543","doi":"10.1145/3689803","title":"The ART of Sharing Points-to Analysis: Reusing Points-to Analysis Results Safely and Efficiently","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","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":"IBM (Canada)","funders":"Indian Institute of Technology Bombay","keywords":"Reuse; Computer science; Engineering","score_opus":0.016510666271213757,"score_gpt":0.2805686060616219,"score_spread":0.2640579397904081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403223543","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.9413418,0.003261505,0.02227125,0.0241695,0.0007518199,0.0022998822,0.000016806189,0.0008990253,0.0049883923],"genre_scores_gemma":[0.98106134,0.000011971844,0.017995613,0.00013479049,0.00007079981,0.000043485612,0.0000021272206,0.000019626987,0.00066025613],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971581,0.00003117628,0.0006795011,0.0008675016,0.000753623,0.00051010994],"domain_scores_gemma":[0.99766326,0.00030935212,0.00035020968,0.0011998693,0.00032405433,0.00015323739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029992063,0.00026637304,0.0004966166,0.0007872878,0.00030639116,0.0010301776,0.0032955627,0.00008261131,0.0000015855825],"category_scores_gemma":[0.0023451452,0.00015694273,0.00039724723,0.006265869,0.00011747322,0.00022986968,0.0021006456,0.00022724415,0.000014562403],"study_design_candidate":"theoretical_or_conceptual","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.00048159415,0.000523936,0.055707812,0.0014163787,0.011387268,0.000037763974,0.06591384,0.0010237113,0.01485942,0.402211,0.0041612503,0.442276],"study_design_scores_gemma":[0.004962296,0.007503045,0.14740103,0.0040773693,0.026791058,0.00024463848,0.046743378,0.10994915,0.2715779,0.07073787,0.30246297,0.0075493334],"about_ca_topic_score_codex":0.00015540185,"about_ca_topic_score_gemma":0.000066890585,"teacher_disagreement_score":0.43472666,"about_ca_system_score_codex":0.000060615606,"about_ca_system_score_gemma":0.000029353332,"threshold_uncertainty_score":0.9934026},"labels":[],"label_agreement":null},{"id":"W4404342313","doi":"10.1145/3704855","title":"A Demonic Outcome Logic for Randomized Nondeterminism","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Outcome (game theory); Computer science; Psychology; Mathematics; Mathematical economics","score_opus":0.019886649650894858,"score_gpt":0.3124885896815581,"score_spread":0.29260194003066325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404342313","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.64219993,0.010543924,0.0936913,0.057135988,0.005973893,0.022555323,0.000017562223,0.004102374,0.16377969],"genre_scores_gemma":[0.8927636,0.000011807016,0.10274174,0.00063138624,0.00006415367,0.00042178592,5.406896e-7,0.000013273372,0.0033516765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985559,0.000020305415,0.0004078774,0.0004141953,0.00021516737,0.00038653967],"domain_scores_gemma":[0.99819654,0.0006004704,0.00032694885,0.0006040093,0.00022545771,0.000046578283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176334,0.00021567904,0.0005263427,0.00014376896,0.0001944018,0.0002115626,0.0036515354,0.00010477354,0.0000021027804],"category_scores_gemma":[0.00592821,0.00012659088,0.00041711138,0.00043723214,0.00015946408,0.00016892258,0.0011302906,0.00016639996,0.000004801231],"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.0012847463,0.00024743233,0.004364322,0.0005516077,0.00015676701,0.0000016547782,0.002417603,0.0000010855547,0.0017010996,0.8427496,0.0015765607,0.14494754],"study_design_scores_gemma":[0.11914836,0.001091587,0.0026888757,0.0013492123,0.00064451335,0.000052302064,0.0026767927,0.0064123133,0.123976596,0.7203006,0.020058056,0.001600791],"about_ca_topic_score_codex":0.000007589187,"about_ca_topic_score_gemma":0.0000016507057,"teacher_disagreement_score":0.25056368,"about_ca_system_score_codex":0.000038353206,"about_ca_system_score_gemma":0.00004429126,"threshold_uncertainty_score":0.70970494},"labels":[],"label_agreement":null},{"id":"W4404346748","doi":"10.1145/3704873","title":"Linear and Non-linear Relational Analyses for Quantum Program Optimization","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Quantum circuit; Quantum; Computer science; Electronic circuit; Quantum algorithm; Affine transformation; Quantum gate; Compiler; Representation (politics); Optimizing compiler; Algebra over a field; Mathematics; Pure mathematics; Quantum error correction; Quantum mechanics; Physics","score_opus":0.02384835767695466,"score_gpt":0.33013043255121305,"score_spread":0.3062820748742584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404346748","genre_codex":"empirical","genre_gemma":"methods","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.6150875,0.0007828641,0.36520138,0.014375868,0.000483693,0.0026696953,0.000009889668,0.0008077231,0.0005813743],"genre_scores_gemma":[0.28313023,0.0000059338577,0.716466,0.00011781638,0.000071520306,0.00006476825,0.0000027275728,0.000009412271,0.00013159648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989902,0.000007317168,0.00023415143,0.00034302645,0.0002048073,0.00022052701],"domain_scores_gemma":[0.999059,0.0001762441,0.00019133642,0.00030731715,0.00023044187,0.000035639452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031828202,0.00014926253,0.00018131065,0.00014733544,0.00023983953,0.00011899681,0.0010798856,0.00006818861,4.4400787e-7],"category_scores_gemma":[0.00097234466,0.00010083522,0.000101184196,0.0005911869,0.000082358274,0.00013237492,0.0006078699,0.00015253905,2.8079918e-7],"study_design_candidate":"simulation_or_modeling","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.00011117495,0.00068774016,0.0071288324,0.0009816834,0.00029564794,0.0000014105707,0.002537259,0.059355333,0.0034293411,0.08382702,0.0014984078,0.8401461],"study_design_scores_gemma":[0.00037574407,0.0002611415,0.0014342532,0.0002431907,0.000034566736,0.000004097704,0.00012448267,0.9860126,0.0061803535,0.0037628333,0.0014271725,0.00013957689],"about_ca_topic_score_codex":0.000009293933,"about_ca_topic_score_gemma":3.6728676e-7,"teacher_disagreement_score":0.92665726,"about_ca_system_score_codex":0.000013211287,"about_ca_system_score_gemma":0.000033282773,"threshold_uncertainty_score":0.4111941},"labels":[],"label_agreement":null},{"id":"W4405432368","doi":"10.1145/3704894","title":"Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"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":"European Research Council; European Commission; National Science Foundation","keywords":"Unary operation; Probabilistic logic; Probabilistic argumentation; Deductive reasoning; Computer science; Statistical relational learning; Independence (probability theory); Artificial intelligence; Non-monotonic logic; Psychology of reasoning; Reasoning system; Model-based reasoning; Mathematics; Relational database; Knowledge representation and reasoning; Information retrieval","score_opus":0.015666870287668798,"score_gpt":0.28435941125319864,"score_spread":0.26869254096552986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405432368","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.981596,0.0011630068,0.01277497,0.0017196323,0.00018898757,0.0012376803,0.000015963315,0.0001536905,0.001150067],"genre_scores_gemma":[0.89270836,0.0000036611782,0.10697377,0.000043036733,0.00002144513,0.000060174792,0.0000010953698,0.000005554271,0.00018292462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989868,0.000008165725,0.00027461138,0.00030931944,0.00024072049,0.00018042828],"domain_scores_gemma":[0.9988587,0.00015048544,0.0003032853,0.00033583312,0.00032059246,0.000031135773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063744315,0.00010731611,0.00017897342,0.00004274871,0.00012952891,0.00009292981,0.0012783466,0.00006536087,2.978972e-7],"category_scores_gemma":[0.0022820837,0.00008031176,0.00004878605,0.00035435328,0.000084773,0.00029820402,0.00038154674,0.00011830695,1.444882e-7],"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.000051131843,0.00017224243,0.04029291,0.0012303852,0.00005274295,4.8855543e-7,0.0025224236,0.00010081927,0.0069581405,0.78875756,0.00025684296,0.15960433],"study_design_scores_gemma":[0.0076899556,0.0032160184,0.2412761,0.026727162,0.00039892964,0.00012156217,0.012579357,0.18694848,0.23679188,0.25212553,0.029193662,0.0029313634],"about_ca_topic_score_codex":0.000026808942,"about_ca_topic_score_gemma":0.000004130542,"teacher_disagreement_score":0.536632,"about_ca_system_score_codex":0.000018531906,"about_ca_system_score_gemma":0.00004135504,"threshold_uncertainty_score":0.32750183},"labels":[],"label_agreement":null},{"id":"W4406222352","doi":"10.1145/3704851","title":"A Dependent Type Theory for Meta-programming with Intensional Analysis","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"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":"Programming language; Computer science; Type (biology); Type theory","score_opus":0.025659281380980423,"score_gpt":0.2842653169020579,"score_spread":0.25860603552107747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406222352","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.22486787,0.015794672,0.70645714,0.017608698,0.0029697178,0.013736125,0.00002202557,0.0036645227,0.014879236],"genre_scores_gemma":[0.914991,0.0000047041026,0.082498856,0.00029236687,0.000046795132,0.00043653656,0.000003153183,0.000017791248,0.001708796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800825,0.000031109215,0.00038059824,0.00062068034,0.0004924384,0.00046691042],"domain_scores_gemma":[0.9975978,0.000325002,0.0003874835,0.00086488674,0.00075521466,0.000069581874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013837978,0.00029519325,0.0005878338,0.00035984727,0.00025920462,0.00034858915,0.003004916,0.00010611526,0.000006267713],"category_scores_gemma":[0.0014459082,0.00016073878,0.00048744906,0.0020598082,0.00014428276,0.000221859,0.00089778454,0.00020558752,0.000002599335],"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.00020875639,0.00027667175,0.0068462645,0.0003091719,0.006670037,0.0000034560658,0.0012579807,0.00002833334,0.0005801132,0.8230005,0.0005000492,0.16031869],"study_design_scores_gemma":[0.0073661776,0.007127183,0.009894297,0.00059628603,0.0486513,0.00018658912,0.021202283,0.0039273635,0.16924825,0.5175061,0.21002808,0.0042660474],"about_ca_topic_score_codex":0.00005609938,"about_ca_topic_score_gemma":0.000025446663,"teacher_disagreement_score":0.69012314,"about_ca_system_score_codex":0.00004714007,"about_ca_system_score_gemma":0.00006914164,"threshold_uncertainty_score":0.6554737},"labels":[],"label_agreement":null},{"id":"W4409310616","doi":"10.1145/3720436","title":"IncIDFA: An Efficient and Generic Algorithm for Incremental Iterative Dataflow Analysis","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; IBM Canada","keywords":"Dataflow; Algorithm; Computer science; Parallel computing","score_opus":0.013148370357277754,"score_gpt":0.29266248176762827,"score_spread":0.27951411141035054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409310616","genre_codex":"empirical","genre_gemma":"methods","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.50021684,0.0009809571,0.49632174,0.0007011283,0.0001798721,0.0011147506,0.00012993897,0.00017706056,0.0001777239],"genre_scores_gemma":[0.26819256,0.000005490125,0.73141086,0.00013121363,0.000034971094,0.00010931648,0.000017034848,0.0000064713363,0.00009208749],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990157,0.00001009223,0.00020485828,0.0003888185,0.0001843823,0.00019616926],"domain_scores_gemma":[0.999097,0.000065754684,0.00016644275,0.0004847569,0.00014608509,0.000039960254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003596549,0.00013839212,0.00022089102,0.00017774863,0.00020655993,0.00012711063,0.0009865068,0.000032087202,6.199916e-7],"category_scores_gemma":[0.00027429388,0.00009281208,0.00007538712,0.000821853,0.00008127855,0.0003218983,0.0010418555,0.00006906342,1.8884592e-7],"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.000028821301,0.00024931025,0.003766113,0.00021578617,0.0005360168,0.0000013207192,0.0037057751,0.00008946862,0.009266408,0.087317854,0.00031379977,0.8945093],"study_design_scores_gemma":[0.0035644737,0.001903612,0.014990137,0.00095129135,0.0016969588,0.000033794335,0.021239731,0.43994355,0.46786654,0.0039194375,0.042120744,0.0017697064],"about_ca_topic_score_codex":0.000048298138,"about_ca_topic_score_gemma":0.000009226089,"teacher_disagreement_score":0.8927396,"about_ca_system_score_codex":0.000025346491,"about_ca_system_score_gemma":0.00001735233,"threshold_uncertainty_score":0.37847665},"labels":[],"label_agreement":null},{"id":"W4409311654","doi":"10.1145/3720437","title":"Type-Preserving Flat Closure Optimization","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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 British Columbia","funders":"","keywords":"Closure (psychology); Computer science; Mathematics; Geometry; Economics","score_opus":0.014850059535449002,"score_gpt":0.26721396589108454,"score_spread":0.25236390635563555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409311654","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.47592732,0.0139158955,0.16208805,0.044156045,0.010799028,0.00975373,0.000005307271,0.0068044118,0.27655023],"genre_scores_gemma":[0.9462154,0.000015012704,0.0510403,0.00020328526,0.00008303218,0.000037206395,0.0000012353667,0.000013907825,0.0023906238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870676,0.000017134742,0.00027145623,0.00036760638,0.00032823317,0.00030880544],"domain_scores_gemma":[0.9985771,0.00007537278,0.00023519642,0.0007520943,0.00031841017,0.000041808904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005031746,0.00017283182,0.00020863923,0.00013881069,0.0001936065,0.0003117164,0.0034977417,0.00010854673,0.000005729006],"category_scores_gemma":[0.0014047836,0.000116354706,0.00011096959,0.0010351505,0.00006328662,0.00030799714,0.0014438737,0.00018508545,0.000006710558],"study_design_candidate":"theoretical_or_conceptual","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.000053780943,0.0002238091,0.048979215,0.0008770022,0.00019787441,0.000004157408,0.003566419,0.0005031777,0.0045150416,0.7708106,0.010586273,0.15968265],"study_design_scores_gemma":[0.0052991044,0.0024460664,0.014203915,0.0018785094,0.0005088754,0.00011784821,0.010198924,0.039266884,0.40542546,0.25563255,0.2616171,0.0034047521],"about_ca_topic_score_codex":0.000046799472,"about_ca_topic_score_gemma":0.0000031413906,"teacher_disagreement_score":0.5151781,"about_ca_system_score_codex":0.000038383754,"about_ca_system_score_gemma":0.000039282462,"threshold_uncertainty_score":0.6499733},"labels":[],"label_agreement":null},{"id":"W4411260250","doi":"10.1145/3729261","title":"Certified Compilers à la Carte","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":"Computer science; Programming language","score_opus":0.01829269854596447,"score_gpt":0.2719810110069347,"score_spread":0.25368831246097023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411260250","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.52791786,0.004536658,0.012488706,0.035391305,0.004746081,0.005472892,0.0000057199622,0.00421754,0.40522325],"genre_scores_gemma":[0.9907657,0.000006214376,0.006858272,0.0002551213,0.000051427145,0.00006221896,6.125904e-7,0.0000114835075,0.0019889674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861115,0.000024506455,0.0002872478,0.0003911241,0.00033501186,0.00035094828],"domain_scores_gemma":[0.99866635,0.00014323827,0.00022602675,0.0007363573,0.00017473067,0.00005327702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005892003,0.00019101005,0.00025215716,0.00013786377,0.00018039685,0.00032310904,0.0035509197,0.000104486324,0.000002264327],"category_scores_gemma":[0.0007293089,0.00012569304,0.00015905364,0.00072519074,0.00014543792,0.00019101289,0.0011050889,0.00022578532,0.000010234793],"study_design_candidate":"theoretical_or_conceptual","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.000017863278,0.00015460982,0.008824479,0.00027302402,0.00008513326,0.000003112541,0.0022144222,0.0000033041565,0.0034581868,0.7801015,0.0052002845,0.1996641],"study_design_scores_gemma":[0.0028976088,0.00084127707,0.022137053,0.0006463064,0.00021805654,0.0000898308,0.007536852,0.0010768985,0.21159825,0.1852668,0.56615424,0.0015368378],"about_ca_topic_score_codex":0.00007485876,"about_ca_topic_score_gemma":0.0000046695936,"teacher_disagreement_score":0.5948347,"about_ca_system_score_codex":0.000037481157,"about_ca_system_score_gemma":0.00004127432,"threshold_uncertainty_score":0.6598551},"labels":[],"label_agreement":null},{"id":"W4411260318","doi":"10.1145/3729303","title":"Polygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Polygon (computer graphics); Computer science; SQL; Theoretical computer science; Programming language","score_opus":0.03871191883647356,"score_gpt":0.31838086749722366,"score_spread":0.2796689486607501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411260318","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.782725,0.002265231,0.19198912,0.006278313,0.0013132363,0.005550092,0.0000053203516,0.0012714732,0.008602249],"genre_scores_gemma":[0.9271024,0.000006068541,0.07191405,0.00016759362,0.000105632156,0.00010467287,0.0000019541246,0.000019249777,0.00057838106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99828005,0.000023266857,0.00035092686,0.00047669557,0.00038306726,0.0004859836],"domain_scores_gemma":[0.99851775,0.00014506234,0.00029037133,0.000630617,0.0003548252,0.00006134587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007797935,0.0002192541,0.00030385365,0.00021117268,0.00035690152,0.00043045083,0.0025435274,0.0001296734,0.000001187395],"category_scores_gemma":[0.0007456087,0.0001599287,0.00017657937,0.0007819571,0.00011129183,0.00031039683,0.0008835718,0.00020176335,0.000002439382],"study_design_candidate":"theoretical_or_conceptual","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.000032877528,0.00014533504,0.004555658,0.00066446065,0.000117016396,7.0323307e-7,0.004343961,0.000071782175,0.016493246,0.8931382,0.00031347416,0.08012331],"study_design_scores_gemma":[0.005547603,0.0017791945,0.00679113,0.0020779006,0.00048566586,0.00014574741,0.025147691,0.10553787,0.69751835,0.11607919,0.0364942,0.0023954625],"about_ca_topic_score_codex":0.00012154977,"about_ca_topic_score_gemma":0.0000032815958,"teacher_disagreement_score":0.77705896,"about_ca_system_score_codex":0.000095256786,"about_ca_system_score_gemma":0.000081432365,"threshold_uncertainty_score":0.65217036},"labels":[],"label_agreement":null},{"id":"W4411267694","doi":"10.1145/3729321","title":"Handling the Selection Monad","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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); University of Toronto","funders":"","keywords":"Monad (category theory); Selection (genetic algorithm); Computer science; Programming language; Mathematics; Artificial intelligence; Discrete mathematics; Functor","score_opus":0.013637760987317001,"score_gpt":0.2643635789147901,"score_spread":0.2507258179274731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411267694","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.7739197,0.008805069,0.058153544,0.0567025,0.0054444126,0.0070581716,0.0000022139677,0.0038124167,0.08610195],"genre_scores_gemma":[0.9912299,0.000008493142,0.00647751,0.00027558027,0.00009735552,0.000079952326,2.6093795e-7,0.000009064004,0.0018218841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99878323,0.000018415265,0.00024244783,0.00032300214,0.0003211731,0.00031175427],"domain_scores_gemma":[0.99890304,0.00011940255,0.00022364978,0.0005203963,0.00020348294,0.00003001046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070409774,0.00015756232,0.00017071894,0.000098953366,0.00037627903,0.00036397547,0.0031246324,0.00007648397,0.0000016095581],"category_scores_gemma":[0.00091741397,0.000083625804,0.00012847065,0.0009127345,0.00009159802,0.00019575267,0.00084143144,0.00023510844,0.0000062466297],"study_design_candidate":"theoretical_or_conceptual","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.000016193842,0.00011630457,0.017459575,0.00018955632,0.00008878036,7.3041014e-7,0.0022183426,0.000009426242,0.004838416,0.6379976,0.002825794,0.33423927],"study_design_scores_gemma":[0.0018078962,0.0009110873,0.02050189,0.00050471065,0.00023414892,0.00009896314,0.00719191,0.0039797137,0.45063633,0.24115072,0.27181622,0.0011663956],"about_ca_topic_score_codex":0.00011873701,"about_ca_topic_score_gemma":0.000011972092,"teacher_disagreement_score":0.44579792,"about_ca_system_score_codex":0.000041776144,"about_ca_system_score_gemma":0.000039144357,"threshold_uncertainty_score":0.58063966},"labels":[],"label_agreement":null},{"id":"W4411267730","doi":"10.1145/3729338","title":"Practical Type Inference with Levels","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","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":"","keywords":"Inference; Type (biology); Type inference; Computer science; Mathematics; Artificial intelligence; Geology","score_opus":0.03854778021873615,"score_gpt":0.3266478339321911,"score_spread":0.28810005371345493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411267730","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.5929475,0.0026204833,0.1445083,0.07242286,0.0040485044,0.007635997,0.0000048585807,0.0043858793,0.17142564],"genre_scores_gemma":[0.943316,0.0000035189044,0.05507847,0.00023185705,0.00003992114,0.00003520867,2.8217679e-7,0.000009126493,0.0012856616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987046,0.000015330668,0.00021959664,0.00036783243,0.00037101522,0.00032162832],"domain_scores_gemma":[0.99852604,0.0001775758,0.00022600271,0.0006651303,0.000354431,0.000050817507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044523567,0.000174725,0.00021505076,0.00010146698,0.00014319,0.00028986536,0.002244443,0.00008338628,0.000003620477],"category_scores_gemma":[0.0022006924,0.0000996184,0.00006228524,0.0009249647,0.000128642,0.00030759635,0.0009066245,0.0002437937,0.000011508049],"study_design_candidate":"theoretical_or_conceptual","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.000034230976,0.00016502567,0.01705453,0.00019309385,0.00007227312,0.0000045988045,0.0009516128,0.0000012537075,0.0011888336,0.90140975,0.0015979072,0.0773269],"study_design_scores_gemma":[0.004554655,0.0059140273,0.057096828,0.0015252254,0.00045300458,0.00033963658,0.009125774,0.0011767546,0.3799151,0.2704931,0.26657522,0.0028307065],"about_ca_topic_score_codex":0.000039719638,"about_ca_topic_score_gemma":0.000005577639,"teacher_disagreement_score":0.63091666,"about_ca_system_score_codex":0.000031422966,"about_ca_system_score_gemma":0.00011165341,"threshold_uncertainty_score":0.4170771},"labels":[],"label_agreement":null},{"id":"W4411267937","doi":"10.1145/3729319","title":"Graphiti: Bridging Graph and Relational Database Queries","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; SQL; Relational database; Programming language; Graph database; Theoretical computer science; Relational model; Embedding; Conjunctive query; Equivalence (formal languages); Data definition language; Graph; Database; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.011738424468465536,"score_gpt":0.2616002780033099,"score_spread":0.24986185353484439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411267937","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.8964031,0.0050000274,0.07493958,0.015115768,0.00075891986,0.0013603639,0.00008525637,0.0008546969,0.005482291],"genre_scores_gemma":[0.6332021,0.00006238344,0.3657343,0.00033597645,0.000054000488,0.00006575242,0.0000052381656,0.000012179637,0.0005281039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990266,0.000008523016,0.00021289567,0.0003219864,0.00023024046,0.00019976057],"domain_scores_gemma":[0.9990646,0.00012128929,0.00016337246,0.00049922086,0.00011605268,0.00003542142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031144446,0.00013716042,0.00015758058,0.00016328208,0.0002424848,0.00008200416,0.0008483522,0.000035183362,0.0000010508712],"category_scores_gemma":[0.00112513,0.00009672778,0.000058098733,0.0005932524,0.00018076377,0.0006368333,0.0012268114,0.00014321941,6.242485e-7],"study_design_candidate":"theoretical_or_conceptual","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.0000117479585,0.000029927336,0.013249129,0.00020611286,0.000028351224,0.0000012318227,0.0005346249,0.0000016611526,0.0039026437,0.94056135,0.000919456,0.040553767],"study_design_scores_gemma":[0.0038089026,0.00071462925,0.12804706,0.009267231,0.00025345944,0.00027279247,0.013420707,0.0015460511,0.3658502,0.20349555,0.270698,0.0026254083],"about_ca_topic_score_codex":0.00004856953,"about_ca_topic_score_gemma":0.0000064445762,"teacher_disagreement_score":0.7370658,"about_ca_system_score_codex":0.000011394911,"about_ca_system_score_gemma":0.000021819367,"threshold_uncertainty_score":0.39444444},"labels":[],"label_agreement":null},{"id":"W4412989178","doi":"10.1145/3747532","title":"Type Universes as Kripke Worlds","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Possible world; Kripke structure; Type (biology); Mathematics; Epistemology; Philosophy; Geology","score_opus":0.014158002481355294,"score_gpt":0.2720876694799208,"score_spread":0.2579296669985655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412989178","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.5043097,0.004776024,0.0024729776,0.019096725,0.0048714266,0.0033736213,0.0000020802186,0.002838525,0.4582589],"genre_scores_gemma":[0.97755724,0.000015224836,0.008020211,0.00032327767,0.00006349598,0.000020587426,4.2686875e-7,0.000011233593,0.013988296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873245,0.000013888157,0.00022499287,0.00037438038,0.00032087305,0.00033340292],"domain_scores_gemma":[0.99867845,0.000082570725,0.00020822142,0.0007142528,0.00026408842,0.00005243819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037262475,0.00018209976,0.00021932245,0.00017209779,0.00018059264,0.00024753684,0.0035024502,0.0000887925,0.000009619673],"category_scores_gemma":[0.0010429467,0.00012182428,0.000121324585,0.0011873342,0.00011325289,0.00024194892,0.0011913163,0.0001893693,0.000026625168],"study_design_candidate":"theoretical_or_conceptual","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.000021709344,0.00011395284,0.006004158,0.00015491352,0.000065115586,0.000003773603,0.0012466721,0.0000021796143,0.0011192096,0.8439618,0.004993373,0.14231318],"study_design_scores_gemma":[0.0013882772,0.0010572576,0.0045505543,0.00041657258,0.00014174303,0.000042025622,0.007331341,0.00024494986,0.10835747,0.13728368,0.7382572,0.00092889834],"about_ca_topic_score_codex":0.00010904296,"about_ca_topic_score_gemma":0.0000066046778,"teacher_disagreement_score":0.73326385,"about_ca_system_score_codex":0.00004719611,"about_ca_system_score_gemma":0.000068155554,"threshold_uncertainty_score":0.6508482},"labels":[],"label_agreement":null},{"id":"W4412989191","doi":"10.1145/3747519","title":"Fusing Session-Typed Concurrent Programming into Functional Programming","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Session (web analytics); Programming language; Functional reactive programming; Functional logic programming; Programming paradigm; Inductive programming; World Wide Web","score_opus":0.020504617480896676,"score_gpt":0.2854521876599401,"score_spread":0.26494757017904347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412989191","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.6446924,0.01896391,0.22785969,0.03125883,0.021300714,0.02064008,0.000008662139,0.011053625,0.024222052],"genre_scores_gemma":[0.95006454,0.0000122980555,0.048031345,0.00023918982,0.00024062693,0.00032300488,0.000005915344,0.000037870486,0.0010451886],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963209,0.000055003027,0.0007908825,0.0009911561,0.0009509096,0.0008911157],"domain_scores_gemma":[0.9971961,0.00022695046,0.0007016923,0.0010840712,0.0006313947,0.00015981977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012439856,0.00051383517,0.00055642775,0.0003852572,0.0007481506,0.00088650687,0.0038491897,0.00024015423,0.000007965933],"category_scores_gemma":[0.0017798513,0.0003580184,0.0003733328,0.0018937079,0.00030738834,0.00061157177,0.0023321535,0.00058698014,0.000017432882],"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.000028064549,0.00039486564,0.012501247,0.00065260066,0.00013508408,0.0000046960567,0.0022012414,0.000005458913,0.0026265266,0.17595673,0.0011160122,0.8043775],"study_design_scores_gemma":[0.0061269086,0.0021914092,0.01291207,0.003021184,0.0006269217,0.00022694515,0.020395981,0.0018142377,0.13853511,0.066798374,0.74359757,0.0037533005],"about_ca_topic_score_codex":0.00013097201,"about_ca_topic_score_gemma":0.000014794216,"teacher_disagreement_score":0.8006242,"about_ca_system_score_codex":0.00018535099,"about_ca_system_score_gemma":0.00018726104,"threshold_uncertainty_score":0.99988717},"labels":[],"label_agreement":null},{"id":"W4412989204","doi":"10.1145/3747534","title":"Compiling with Generating Functions","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","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 Waterloo","funders":"","keywords":"Computer science; Programming language","score_opus":0.013944004900838823,"score_gpt":0.26417096363455495,"score_spread":0.25022695873371614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412989204","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.8217148,0.0005364525,0.16024339,0.007097716,0.0002918557,0.00045470352,0.0000016830279,0.00061814376,0.009041255],"genre_scores_gemma":[0.8225938,0.0000024992282,0.17637876,0.0002804046,0.000029383391,0.000025879346,3.257114e-7,0.0000059265826,0.0006830211],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991492,0.000006275182,0.00016385551,0.00027092817,0.00020248724,0.0002072307],"domain_scores_gemma":[0.999167,0.00006055122,0.000117683616,0.0004361715,0.00018907042,0.000029513893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023869328,0.00011944976,0.00012910119,0.00008449903,0.00023800741,0.00021260492,0.001739562,0.000040302526,0.0000011035484],"category_scores_gemma":[0.00033104594,0.00007439368,0.00005136565,0.0005861913,0.000063933796,0.00016656793,0.0005467834,0.00018772333,0.000002196225],"study_design_candidate":"bench_or_experimental","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.000034800374,0.00023839371,0.017657928,0.0002479958,0.00012772734,0.000001965102,0.0020597058,0.0007598012,0.032788742,0.3000441,0.002185667,0.6438532],"study_design_scores_gemma":[0.0036943583,0.0023015994,0.0127996355,0.007874518,0.0004232573,0.000141097,0.012712029,0.17960642,0.69584346,0.06385276,0.018091608,0.002659278],"about_ca_topic_score_codex":0.000018709981,"about_ca_topic_score_gemma":0.0000026974797,"teacher_disagreement_score":0.6630547,"about_ca_system_score_codex":0.000019809055,"about_ca_system_score_gemma":0.00004105052,"threshold_uncertainty_score":0.3232568},"labels":[],"label_agreement":null},{"id":"W4412989207","doi":"10.1145/3747511","title":"McTT: A Verified Kernel for a Proof Assistant","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Kernel (algebra); Proof of concept; Burden of proof; Mathematics; Discrete mathematics; Operating system; Political science; Law","score_opus":0.018803416519263344,"score_gpt":0.2795932222139133,"score_spread":0.26078980569464993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412989207","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.49023956,0.011901278,0.2855963,0.058422584,0.009204789,0.031490725,0.000036260302,0.006169325,0.10693919],"genre_scores_gemma":[0.9587749,0.0000031820834,0.037843883,0.00023780685,0.00007710609,0.00042628113,0.0000010812164,0.000016177102,0.0026195666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984002,0.0000121722305,0.0003481725,0.000482571,0.0003290444,0.00042780195],"domain_scores_gemma":[0.99846554,0.00012756945,0.00031336825,0.00074700516,0.00029280075,0.000053746466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069726194,0.00021669516,0.00029971087,0.00013468927,0.00021942004,0.0003101307,0.003381673,0.000110159745,0.0000011771983],"category_scores_gemma":[0.0014948748,0.00014048058,0.0002184211,0.0006624549,0.00009679072,0.00020304415,0.00087058294,0.00016225365,0.0000028125944],"study_design_candidate":"theoretical_or_conceptual","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.000069941285,0.00028097356,0.0034414055,0.0007757818,0.00011660299,0.0000014521548,0.0019289028,0.0000012035431,0.005442155,0.76601636,0.0037179042,0.21820728],"study_design_scores_gemma":[0.0037319337,0.0017090744,0.0065980856,0.00066022784,0.00023050113,0.000037391204,0.003600255,0.0015426498,0.41965425,0.26295298,0.29803672,0.0012459252],"about_ca_topic_score_codex":0.000038047747,"about_ca_topic_score_gemma":0.000005555338,"teacher_disagreement_score":0.5030634,"about_ca_system_score_codex":0.00005703403,"about_ca_system_score_gemma":0.000069839654,"threshold_uncertainty_score":0.6284046},"labels":[],"label_agreement":null},{"id":"W4412989434","doi":"10.1145/3747518","title":"Multi-stage Programming with Splice Variables","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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 Toronto","funders":"","keywords":"Stage (stratigraphy); splice; Computer science; Geology; Biology; Paleontology; Genetics","score_opus":0.023137838784974617,"score_gpt":0.28155323203843774,"score_spread":0.25841539325346313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412989434","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.51621026,0.0109712295,0.3307363,0.021738518,0.004824712,0.021620605,0.000018564353,0.011104028,0.08277578],"genre_scores_gemma":[0.7768373,0.0000098310875,0.21870272,0.00021546656,0.00005363343,0.00022157269,0.0000013329745,0.000027178849,0.003930955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766916,0.000025130152,0.00041996207,0.000709859,0.0005274469,0.0006484404],"domain_scores_gemma":[0.99782825,0.00013519762,0.0004498338,0.0011360636,0.00035910652,0.00009152849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000828803,0.00035388945,0.00039410306,0.00021434807,0.0003373916,0.0004485984,0.0045118844,0.00014266481,0.0000032705366],"category_scores_gemma":[0.000848355,0.00021596815,0.00015598608,0.0014166062,0.00019826274,0.00041784864,0.0014238129,0.00034038885,0.000008073275],"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.000086397995,0.0008844461,0.041323557,0.0014100496,0.0003280984,0.00001531041,0.0047231065,0.000019456624,0.00658009,0.57484293,0.0009536741,0.3688329],"study_design_scores_gemma":[0.008769652,0.0034167084,0.017486801,0.0022723093,0.0006063995,0.00021342457,0.024440693,0.003778809,0.26257044,0.02334575,0.6492655,0.0038334948],"about_ca_topic_score_codex":0.00024741134,"about_ca_topic_score_gemma":0.000030923937,"teacher_disagreement_score":0.64831185,"about_ca_system_score_codex":0.0000666279,"about_ca_system_score_gemma":0.000088776156,"threshold_uncertainty_score":0.88069254},"labels":[],"label_agreement":null},{"id":"W4414977232","doi":"10.1145/3763799","title":"A Flow-Sensitive Refinement Type System for Verifying eBPF Programs","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type inference; Kernel (algebra); Component (thermodynamics); Model checking; Formal verification; Static analysis; Software verification; Type (biology)","score_opus":0.022443266157986138,"score_gpt":0.27433028806548687,"score_spread":0.25188702190750073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414977232","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.55592436,0.012171542,0.18418688,0.027822992,0.022613715,0.045977112,0.000031513016,0.013760614,0.13751131],"genre_scores_gemma":[0.9420788,0.000004661809,0.056505363,0.00009992107,0.000116901865,0.00032785936,0.00000344041,0.000021020856,0.0008420052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99808747,0.000020220623,0.00041971455,0.0005648225,0.00039178136,0.0005159693],"domain_scores_gemma":[0.998127,0.00011181923,0.00035830226,0.00075900654,0.00057968573,0.00006417373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082887174,0.000270688,0.00037088108,0.00015331204,0.00034182967,0.00036452577,0.002432948,0.0001242916,5.3542936e-7],"category_scores_gemma":[0.00086672965,0.00018251211,0.00021106968,0.00090449344,0.00009060673,0.0001842039,0.0009768952,0.00018363252,0.000006209722],"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.000095521464,0.0002350116,0.001879025,0.0018098848,0.00020188912,0.0000036754104,0.0025825622,0.000006155756,0.0025256104,0.46966857,0.0011333032,0.5198588],"study_design_scores_gemma":[0.0074147396,0.005900779,0.0026137386,0.0044895685,0.00077532197,0.00016714665,0.037132252,0.013882633,0.4648932,0.02987997,0.42984363,0.0030070469],"about_ca_topic_score_codex":0.00006175194,"about_ca_topic_score_gemma":0.000007841952,"teacher_disagreement_score":0.5168517,"about_ca_system_score_codex":0.00012642195,"about_ca_system_score_gemma":0.000058553567,"threshold_uncertainty_score":0.7442628},"labels":[],"label_agreement":null},{"id":"W4414977421","doi":"10.1145/3763177","title":"Zero-Overhead Lexical Effect Handlers","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, programming, and type systems","field":"Computer Science","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 Waterloo","funders":"","keywords":"Compiler; Implementation; Modularity (biology); Repressor lexA; Identifier; Correctness; Allocator; Control (management); Key (lock)","score_opus":0.012277275238410185,"score_gpt":0.27228650001091864,"score_spread":0.26000922477250843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414977421","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.86977494,0.0041801245,0.024143692,0.013115312,0.0040240646,0.004759694,0.0000030206484,0.0026637204,0.07733545],"genre_scores_gemma":[0.99109215,0.000005596875,0.0067700273,0.00023255494,0.000065721186,0.00008271058,6.15919e-7,0.000012816378,0.0017378354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835294,0.00002706796,0.00029692717,0.00046540244,0.00042186203,0.00043577413],"domain_scores_gemma":[0.99863505,0.00018950812,0.00021525734,0.00075702457,0.00013513752,0.00006804664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007675133,0.00023705384,0.00032509258,0.0001432595,0.00021006845,0.00032808955,0.0035127085,0.00012855786,0.000002582984],"category_scores_gemma":[0.0013876993,0.00014595674,0.00021665197,0.0007510946,0.0001447301,0.00022977144,0.001222242,0.00026331338,0.000016738191],"study_design_candidate":"theoretical_or_conceptual","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.00005566834,0.00019879352,0.032002993,0.0005473418,0.00013157906,0.000004173899,0.001471284,0.000002183595,0.005033243,0.60297966,0.00601845,0.35155463],"study_design_scores_gemma":[0.004977351,0.0036969786,0.021617288,0.0010409543,0.0003305753,0.00010121229,0.0020024588,0.0007377029,0.59195,0.21172428,0.15994495,0.001876212],"about_ca_topic_score_codex":0.000066598965,"about_ca_topic_score_gemma":0.000002778648,"teacher_disagreement_score":0.5869168,"about_ca_system_score_codex":0.000052328076,"about_ca_system_score_gemma":0.000037115533,"threshold_uncertainty_score":0.6527544},"labels":[],"label_agreement":null},{"id":"W4414978537","doi":"10.1145/3763128","title":"TraceLinking Implementations with Their Verified Designs","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"TRACE (psycholinguistics); Compiler; Correctness; Modular design; Tracing; Verifiable secret sharing; Debugging; Semantics (computer science); Implementation; Signature (topology)","score_opus":0.03409471806375904,"score_gpt":0.3255725245977236,"score_spread":0.2914778065339646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414978537","genre_codex":"empirical","genre_gemma":"methods","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.75250316,0.00036383636,0.2262235,0.007727615,0.00044591457,0.0020436551,0.0000058153196,0.0008309893,0.0098555265],"genre_scores_gemma":[0.4699872,0.0000037063176,0.52969277,0.00013161192,0.000012340342,0.00006817364,4.7044455e-7,0.0000060550624,0.00009768044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907434,0.000016470718,0.00021146609,0.00025854702,0.0002171847,0.00022198759],"domain_scores_gemma":[0.99893177,0.00010444511,0.00020818414,0.00056454015,0.00016678449,0.000024287827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058866927,0.00012780054,0.00012918022,0.000119977594,0.00020432558,0.00016541581,0.0024457984,0.000041035397,0.0000020047567],"category_scores_gemma":[0.000601781,0.00007866908,0.000056932393,0.0007817633,0.00007697198,0.00036746686,0.00043719474,0.00014995299,9.797958e-7],"study_design_candidate":"bench_or_experimental","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.00004448198,0.00013337845,0.0045926264,0.00016563313,0.000078757475,4.1907106e-7,0.0065607848,0.000020346539,0.034624573,0.53615355,0.00036096168,0.41726446],"study_design_scores_gemma":[0.0006954733,0.00037553534,0.010543552,0.00049220765,0.000053788906,0.000011597094,0.006930058,0.0011457215,0.95741844,0.015919758,0.0060989913,0.00031488002],"about_ca_topic_score_codex":0.000013278433,"about_ca_topic_score_gemma":0.0000025753923,"teacher_disagreement_score":0.92279387,"about_ca_system_score_codex":0.000039015602,"about_ca_system_score_gemma":0.000040106326,"threshold_uncertainty_score":0.45449424},"labels":[],"label_agreement":null},{"id":"W4414978573","doi":"10.1145/3763125","title":"Sound and Modular Activity Analysis for Automatic Differentiation in MLIR","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Speedup; Correctness; Compiler; Benchmark (surveying); Modular design; Function (biology); Representation (politics); Automatic differentiation","score_opus":0.013300363735059807,"score_gpt":0.28711590772076434,"score_spread":0.2738155439857045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414978573","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.7937158,0.00007078153,0.20474343,0.00089284964,0.000023081142,0.00031164568,5.4254036e-7,0.00016280664,0.000079082674],"genre_scores_gemma":[0.8609968,0.0000033813849,0.13886662,0.000039841354,0.0000047973276,0.000033922515,4.824338e-7,0.0000029526504,0.000051199215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993803,0.000009852449,0.00014425577,0.0002224747,0.00011304493,0.00013010853],"domain_scores_gemma":[0.99939114,0.000106094216,0.0001456665,0.00026381662,0.00007902254,0.000014283995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031708542,0.00008687882,0.00017156282,0.00028220267,0.00008284015,0.00013549133,0.0008262534,0.000043749635,2.3802119e-7],"category_scores_gemma":[0.00061193557,0.00006440147,0.00007297627,0.0008611263,0.000028245906,0.00013844603,0.00039401153,0.00006793257,5.7721053e-8],"study_design_candidate":"simulation_or_modeling","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.000044024542,0.000570705,0.29366446,0.0009785873,0.0005672944,4.2175003e-7,0.0049994052,0.0020940376,0.0070294146,0.061669443,0.00020774985,0.6281744],"study_design_scores_gemma":[0.00051061314,0.00011381731,0.20373884,0.00019763112,0.00014830333,7.642159e-7,0.000195467,0.7046915,0.047810078,0.042330414,0.000046368386,0.00021614826],"about_ca_topic_score_codex":0.000020776359,"about_ca_topic_score_gemma":0.0000045162265,"teacher_disagreement_score":0.7025975,"about_ca_system_score_codex":0.000025188123,"about_ca_system_score_gemma":0.000007910822,"threshold_uncertainty_score":0.26262158},"labels":[],"label_agreement":null},{"id":"W4414978574","doi":"10.1145/3763126","title":"Flix: A Design for Language-Integrated Datalog","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Semantic Web and Ontologies","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":"Datalog; Implementation; Guard (computer science); Constraint programming; Modular design; Declarative programming; Program analysis; Logic programming","score_opus":0.02405137264420407,"score_gpt":0.3026961629178796,"score_spread":0.2786447902736755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414978574","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.67718637,0.0066208337,0.25781003,0.035521444,0.002208757,0.006917702,0.00004300861,0.003232332,0.010459513],"genre_scores_gemma":[0.60823345,0.000006744788,0.38989356,0.00047638113,0.000038912196,0.00015266323,0.000002743261,0.000011424443,0.0011841259],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989438,0.0000111148365,0.00021342398,0.00034568663,0.00018229819,0.0003036513],"domain_scores_gemma":[0.998637,0.00033334052,0.00015070458,0.0006825129,0.0001691311,0.000027295328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004978245,0.00016048668,0.00021714058,0.00012739087,0.00013289804,0.00019620213,0.003851811,0.00007469977,0.0000014296711],"category_scores_gemma":[0.003077603,0.00009996006,0.00011128729,0.00055787474,0.000086850996,0.00020235014,0.00083090516,0.00012564503,0.0000026061357],"study_design_candidate":"bench_or_experimental","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.00015276215,0.00038298644,0.005308192,0.0005871292,0.00023252763,0.0000054639518,0.008057145,0.0000150663645,0.039117828,0.22985576,0.030914042,0.6853711],"study_design_scores_gemma":[0.0017726999,0.00067556504,0.005325813,0.0010166968,0.00014282302,0.00002154144,0.010961809,0.0027428442,0.9190757,0.032493547,0.025138719,0.00063220697],"about_ca_topic_score_codex":0.000043107982,"about_ca_topic_score_gemma":0.0000038783573,"teacher_disagreement_score":0.8799579,"about_ca_system_score_codex":0.000026554253,"about_ca_system_score_gemma":0.00004921713,"threshold_uncertainty_score":0.7157687},"labels":[],"label_agreement":null},{"id":"W4414978578","doi":"10.1145/3763122","title":"Place Capability Graphs: A General-Purpose Model of Rust’s Ownership and Borrowing Guarantees","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":0,"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":"Rust (programming language); Aliasing; Function (biology); Type (biology); Capability approach; Measure (data warehouse)","score_opus":0.01296934673141616,"score_gpt":0.2482667241712301,"score_spread":0.23529737743981394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414978578","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.9976957,0.0003017894,0.00009829682,0.0006408998,0.000050594615,0.00034825382,0.000015133544,0.00016603927,0.00068329996],"genre_scores_gemma":[0.98592687,0.000020700541,0.0137416925,0.00007671038,0.0000071208237,0.000051986626,0.0000026306027,0.0000129121645,0.0001593762],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923575,0.000003469507,0.00029617024,0.0001622702,0.00014302619,0.0001593016],"domain_scores_gemma":[0.99946624,0.000049471557,0.00007140729,0.00025299552,0.00013705899,0.000022815182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025838192,0.00013171809,0.00018703695,0.00013893301,0.00005863451,0.000024723982,0.00039424474,0.00006856505,0.000001909403],"category_scores_gemma":[0.00037420107,0.00010011129,0.00007611341,0.00043666357,0.00012375374,0.00010646575,0.000053197105,0.00015046154,1.34921e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00019529328,0.0005112516,0.10688297,0.006902761,0.00046853547,7.0340326e-7,0.020404082,0.01693458,0.527305,0.22750017,0.0020063203,0.09088835],"study_design_scores_gemma":[0.002683473,0.00023807507,0.0680041,0.0019411343,0.00054425653,0.0000056014055,0.017639348,0.031226648,0.84183073,0.03175926,0.003074912,0.0010524311],"about_ca_topic_score_codex":0.000035096036,"about_ca_topic_score_gemma":0.000017391112,"teacher_disagreement_score":0.31452578,"about_ca_system_score_codex":0.000020440368,"about_ca_system_score_gemma":0.000016787742,"threshold_uncertainty_score":0.408242},"labels":[],"label_agreement":null},{"id":"W4414988640","doi":"10.1145/3763160","title":"Products of Recursive Programs for Hypersafety Verification","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Key (lock); Product (mathematics); Class (philosophy); Property (philosophy); Set (abstract data type); Simple (philosophy); Parametric statistics","score_opus":0.021377923818186817,"score_gpt":0.2885382608968596,"score_spread":0.26716033707867276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414988640","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.823473,0.0038774863,0.05814149,0.06544024,0.0020214177,0.015765386,0.000024144674,0.023119481,0.008137386],"genre_scores_gemma":[0.5414841,0.000003847966,0.45811152,0.000058618807,0.000021442493,0.00016610092,0.0000012758095,0.000007649838,0.00014544794],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990089,0.0000076978085,0.00024822808,0.00033182683,0.00020274163,0.00020064064],"domain_scores_gemma":[0.9981927,0.00018710493,0.0003174952,0.00069180806,0.0005912745,0.000019612653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054869143,0.00012377671,0.00018392513,0.00011479209,0.00009529277,0.00006251957,0.002250404,0.000061676634,1.3413728e-7],"category_scores_gemma":[0.006517768,0.00008859184,0.00008948561,0.0007619991,0.0001050033,0.00013289954,0.0004457087,0.00009736394,2.9617016e-7],"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.00005940941,0.000324331,0.008385836,0.0008940827,0.00005445024,1.47473e-7,0.001833395,9.899455e-7,0.008791664,0.08004806,0.009296762,0.8903109],"study_design_scores_gemma":[0.00058432826,0.0007867903,0.005073501,0.0018654197,0.000084031584,0.0000075333537,0.00045342583,0.00033213547,0.82493097,0.15571226,0.009826821,0.0003428064],"about_ca_topic_score_codex":0.00002073771,"about_ca_topic_score_gemma":3.0057998e-7,"teacher_disagreement_score":0.88996804,"about_ca_system_score_codex":0.000029905184,"about_ca_system_score_gemma":0.000049566483,"threshold_uncertainty_score":0.78028476},"labels":[],"label_agreement":null},{"id":"W4414988709","doi":"10.1145/3763096","title":"Qualified Types with Boolean Algebras","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","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":"Type (biology); Stone's representation theorem for Boolean algebras; Two-element Boolean algebra; Complete Boolean algebra; Boolean algebra; Boolean expression; Algebra over a field; Domain (mathematical analysis)","score_opus":0.014188404250154546,"score_gpt":0.2647709369190902,"score_spread":0.25058253266893565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414988709","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.7162944,0.0057306164,0.02459331,0.036197253,0.002464862,0.0057921903,0.000004229377,0.004192989,0.20473017],"genre_scores_gemma":[0.9832661,0.00000488598,0.01344437,0.00031571783,0.000055826567,0.00005869204,6.138493e-7,0.0000136705,0.0028401106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998628,0.000015768672,0.0002506153,0.00039868747,0.00036420245,0.0003427073],"domain_scores_gemma":[0.9986798,0.000085842854,0.0002447835,0.0007383253,0.0002009511,0.00005025523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047683052,0.00019835315,0.000247261,0.0001317317,0.0001712411,0.00028047882,0.0030923577,0.000080755104,0.0000030504787],"category_scores_gemma":[0.00055874843,0.000114236034,0.00009858774,0.00076620997,0.00012258145,0.00021159193,0.00077995955,0.0001876466,0.000011233774],"study_design_candidate":"theoretical_or_conceptual","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.000032635333,0.00013210688,0.0098571,0.0002371283,0.00010328855,0.000002571207,0.0017696016,0.0000016764142,0.0011002814,0.8611976,0.002218513,0.1233475],"study_design_scores_gemma":[0.0040137586,0.002759946,0.016329695,0.0010827179,0.00036441133,0.00011738969,0.011756139,0.0004075957,0.43029416,0.26908186,0.26162794,0.0021644111],"about_ca_topic_score_codex":0.00007655188,"about_ca_topic_score_gemma":0.000011962895,"teacher_disagreement_score":0.59211576,"about_ca_system_score_codex":0.00003054516,"about_ca_system_score_gemma":0.000048752354,"threshold_uncertainty_score":0.5746422},"labels":[],"label_agreement":null},{"id":"W4415004623","doi":"10.1145/3763076","title":"HEMVM: A Heterogeneous Blockchain Framework for Interoperable Virtual Machines","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"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 Toronto","funders":"National Key Research and Development Program of China; Mitacs","keywords":"Interoperability; Database transaction; Virtual machine; Blockchain; Transaction processing; Overhead (engineering)","score_opus":0.009744680520254822,"score_gpt":0.27736576861723733,"score_spread":0.2676210880969825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415004623","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.8775191,0.0011200188,0.08882731,0.028970946,0.00035519607,0.0016972374,0.000009307078,0.0009065568,0.0005943608],"genre_scores_gemma":[0.8125007,0.000005325638,0.18628292,0.0005129881,0.00002938303,0.00031726132,4.0526086e-7,0.000009888602,0.00034114314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895245,0.00000665336,0.00023424292,0.00038786986,0.00013906557,0.0002797265],"domain_scores_gemma":[0.9986862,0.00017391496,0.00015333806,0.0007961404,0.0001613177,0.000029065573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031567138,0.00016314532,0.0002061641,0.00013582196,0.00024113219,0.000112088026,0.0037359037,0.00015243665,0.0000017462625],"category_scores_gemma":[0.0012373892,0.00011406342,0.00013049853,0.0005839641,0.00012423722,0.0000455152,0.0012858163,0.0002561991,0.0000015959017],"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.000017881555,0.00014883705,0.0005427548,0.00007601988,0.0000511059,2.9378688e-7,0.0006167301,0.000009658793,0.0017976544,0.8084558,0.00048947276,0.18779375],"study_design_scores_gemma":[0.0005745808,0.0005145319,0.0001441506,0.0004931292,0.000051243296,0.000022397671,0.0007938589,0.008253651,0.29596618,0.6776453,0.015166406,0.00037457593],"about_ca_topic_score_codex":0.000015888383,"about_ca_topic_score_gemma":0.000003848371,"teacher_disagreement_score":0.2941685,"about_ca_system_score_codex":0.00002692031,"about_ca_system_score_gemma":0.000019714069,"threshold_uncertainty_score":0.6942301},"labels":[],"label_agreement":null},{"id":"W4415006871","doi":"10.1145/3763110","title":"Tabby: A Synthesis-Aided Compiler for High-Performance Zero-Knowledge Proof Circuits","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Cryptography and Data Security","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 Toronto","funders":"Defense Advanced Research Projects Agency; Ethereum Foundation; Google; National Science Foundation","keywords":"Correctness; Compiler; Formal equivalence checking; Construct (python library); Equivalence (formal languages); Implementation; Proof assistant; Process (computing); High-level synthesis; Compiler construction","score_opus":0.015843559994084332,"score_gpt":0.2696909591242602,"score_spread":0.2538473991301759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415006871","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.98125374,0.00091648556,0.007913275,0.0028813058,0.0006154991,0.0021809167,0.00004019622,0.00052931317,0.0036692566],"genre_scores_gemma":[0.96671355,0.000010738093,0.03258069,0.00016415659,0.00004031419,0.00040126377,0.0000022416552,0.00001408485,0.00007296577],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984768,0.0000123483005,0.0003306196,0.00050144485,0.00025705903,0.00042173135],"domain_scores_gemma":[0.99820274,0.00033116038,0.0002437807,0.0008633207,0.00030464065,0.000054369706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006266906,0.000234109,0.00031411086,0.00022103173,0.00029299548,0.00022279691,0.0040294994,0.00010107986,0.0000023653986],"category_scores_gemma":[0.0014560745,0.00016855082,0.00015431146,0.0010211187,0.00014218093,0.00044042442,0.0011767677,0.00020245062,0.000003043696],"study_design_candidate":"bench_or_experimental","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.00006616099,0.0006515963,0.007930541,0.0014447783,0.00014626395,4.911109e-7,0.00202705,0.0000029119528,0.008695153,0.48373416,0.007932082,0.4873688],"study_design_scores_gemma":[0.0013712657,0.00057067844,0.021894611,0.0019530137,0.00014431459,0.000009595275,0.00063825294,0.00071128376,0.8908832,0.061403487,0.019688487,0.0007318189],"about_ca_topic_score_codex":0.000010690854,"about_ca_topic_score_gemma":0.000002614704,"teacher_disagreement_score":0.882188,"about_ca_system_score_codex":0.000033199256,"about_ca_system_score_gemma":0.000054832373,"threshold_uncertainty_score":0.74878794},"labels":[],"label_agreement":null},{"id":"W4415006878","doi":"10.1145/3763108","title":"Float Self-Tagging","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Plasma Diagnostics and Applications","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":"Université de Montréal","funders":"","keywords":"Heap (data structure); Bitwise operation; Register allocation; Compile time; Compiler; Floating point; Program transformation; Transformation (genetics)","score_opus":0.004563182870829506,"score_gpt":0.22913490657132446,"score_spread":0.22457172370049494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415006878","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.9761447,0.000209536,0.000016132395,0.0020659058,0.00012387382,0.00029966715,0.000004697377,0.0005520064,0.020583523],"genre_scores_gemma":[0.9857914,0.000034671473,0.013735215,0.00010926678,0.000036405865,0.00008956048,9.837066e-7,0.000016072987,0.00018645424],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994767,0.000001058746,0.00013046068,0.000114644914,0.00010377544,0.00017340544],"domain_scores_gemma":[0.9995663,0.00008949595,0.00003671516,0.00023351308,0.00005078728,0.000023199558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009329936,0.00010177099,0.00010516054,0.000068165435,0.00007681062,0.000054225406,0.00073683047,0.00004400466,0.0000017256381],"category_scores_gemma":[0.00041997572,0.00007744375,0.00005732619,0.00032473603,0.000025069132,0.000044044515,0.00018053138,0.00012832592,0.0000066497787],"study_design_candidate":"bench_or_experimental","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.00002239089,0.00063081516,0.023029534,0.002554441,0.000649422,0.0000028102954,0.003600853,0.0015445185,0.15081598,0.3313624,0.09179368,0.39399317],"study_design_scores_gemma":[0.0003746579,0.000035625537,0.0034824433,0.00056422513,0.00011834184,0.0000038264093,0.0011266266,0.0024770203,0.8530359,0.007926668,0.13054508,0.0003095832],"about_ca_topic_score_codex":0.0000037000063,"about_ca_topic_score_gemma":9.750032e-7,"teacher_disagreement_score":0.7022199,"about_ca_system_score_codex":0.000027927796,"about_ca_system_score_gemma":0.0000064477977,"threshold_uncertainty_score":0.31580645},"labels":[],"label_agreement":null},{"id":"W4415007091","doi":"10.1145/3763053","title":"Boosting Program Reduction with the Missing Piece of Syntax-Guided Transformations","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Debugging; Reduction (mathematics); Boosting (machine learning); Leverage (statistics); Program analysis; Program transformation; Key (lock); Abstract syntax tree; Minification","score_opus":0.01579920877483586,"score_gpt":0.2941947941011593,"score_spread":0.2783955853263234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415007091","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.8439472,0.0013799936,0.046791166,0.070590794,0.0003956854,0.00485758,0.0000046718765,0.017654866,0.014378072],"genre_scores_gemma":[0.6882117,0.0000028542959,0.31148914,0.00010189243,0.00001732454,0.00009455479,3.9519023e-7,0.000008380212,0.00007380305],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989362,0.000015540905,0.00028034177,0.0002326451,0.00030718825,0.00022808094],"domain_scores_gemma":[0.99856913,0.00021678422,0.00032472593,0.00055930094,0.00030571994,0.000024354289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006255131,0.00014722267,0.000172921,0.0001315772,0.0003009226,0.0001761595,0.0020030604,0.000051384817,3.1158e-7],"category_scores_gemma":[0.0014036536,0.00008122491,0.00008229107,0.0010334525,0.00017685443,0.00025659284,0.0003078535,0.00020480865,2.4529893e-7],"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.000021103255,0.00019145948,0.0020774312,0.00042878007,0.000060857292,4.4669474e-7,0.00392132,0.000015251637,0.0058674663,0.011427079,0.005854013,0.9701348],"study_design_scores_gemma":[0.0010965739,0.001435569,0.005925852,0.008223853,0.0003303032,0.00023029826,0.0037560104,0.0051955325,0.8992598,0.06701239,0.006689196,0.00084463874],"about_ca_topic_score_codex":0.000050339087,"about_ca_topic_score_gemma":8.142556e-7,"teacher_disagreement_score":0.96929014,"about_ca_system_score_codex":0.000030381254,"about_ca_system_score_gemma":0.00005217753,"threshold_uncertainty_score":0.3722218},"labels":[],"label_agreement":null},{"id":"W4415007625","doi":"10.1145/3763174","title":"AutoVerus: Automated Proof Generation for Rust Code","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Algorithms and Data Compression","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":"University of Toronto","funders":"","keywords":"Correctness; Mathematical proof; Debugging; Code (set theory); Proof of concept; Suite; Benchmark (surveying); Rust (programming language); Automated theorem proving","score_opus":0.020264518341811207,"score_gpt":0.30608110901859026,"score_spread":0.28581659067677906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415007625","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.6565502,0.003559729,0.2688667,0.038921095,0.0044299676,0.011770957,0.000198728,0.008548141,0.0071544563],"genre_scores_gemma":[0.50256157,0.00000756883,0.49527925,0.00050182414,0.00015152512,0.00028030854,0.000013353904,0.000018469007,0.0011861203],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899924,0.0000060827183,0.00021707792,0.0003351557,0.0002222823,0.00022016487],"domain_scores_gemma":[0.99896985,0.000062508894,0.00018625191,0.00054438424,0.00020840815,0.000028591627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003197208,0.00013129014,0.00015125117,0.000090630274,0.00021020483,0.00023225167,0.00221354,0.00006799896,0.0000011720797],"category_scores_gemma":[0.0008449892,0.00008665887,0.000079368634,0.00039534026,0.000040895364,0.00032271567,0.0009538286,0.000093125374,0.0000010906545],"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.00004727316,0.00037689446,0.0009941664,0.0005102969,0.00009479608,8.00859e-7,0.0014163852,0.000056028675,0.06628951,0.17179449,0.08059334,0.67782605],"study_design_scores_gemma":[0.0011700839,0.00036287415,0.0015896271,0.00066950114,0.0000583426,0.0000066641364,0.00039822003,0.34485388,0.5750922,0.0068063796,0.068589754,0.0004025074],"about_ca_topic_score_codex":0.00001396631,"about_ca_topic_score_gemma":0.000001781982,"teacher_disagreement_score":0.67742354,"about_ca_system_score_codex":0.000034745153,"about_ca_system_score_gemma":0.000040270923,"threshold_uncertainty_score":0.41133448},"labels":[],"label_agreement":null},{"id":"W4415007672","doi":"10.1145/3763149","title":"CoSSJIT: Combining Static Analysis and Speculation in JIT Compilers","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Static analysis; Compiler; Just-in-time compilation; Correctness; Dataflow; Heap (data structure); Call stack; Register allocation; Compile time; Abstract interpretation","score_opus":0.00994595358639701,"score_gpt":0.28211585247744103,"score_spread":0.27216989889104404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415007672","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.9365678,0.00023728321,0.056161948,0.0034356907,0.00006615029,0.000471784,9.598901e-7,0.0003754503,0.0026829722],"genre_scores_gemma":[0.835598,0.00000898366,0.1641605,0.0001353038,0.0000035223081,0.0000108328295,8.3775404e-7,0.0000032128048,0.00007879861],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992053,0.000014480202,0.00022139512,0.000244755,0.0001633568,0.00015070153],"domain_scores_gemma":[0.999326,0.00011142377,0.00016726668,0.00028743857,0.000087269385,0.000020607946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041383694,0.000097336546,0.00019016222,0.00039633395,0.00008375311,0.000149205,0.0010010655,0.000038195714,7.4415965e-7],"category_scores_gemma":[0.00046997768,0.00007608608,0.000055633587,0.0016394227,0.00005575406,0.00013257356,0.00054333475,0.000115330666,2.6160478e-7],"study_design_candidate":"observational","study_design_consensus":"observational","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.00003780098,0.00029033123,0.6242587,0.00032966695,0.00035329317,0.0000024919216,0.006404163,0.0043809963,0.0015533599,0.14704303,0.00094624714,0.2143999],"study_design_scores_gemma":[0.0017319123,0.00033164746,0.51454926,0.0012829677,0.0003296497,0.0000060182433,0.0022672524,0.38660112,0.04690195,0.044429693,0.0008287279,0.0007397898],"about_ca_topic_score_codex":0.000045872366,"about_ca_topic_score_gemma":0.0000069892817,"teacher_disagreement_score":0.38222012,"about_ca_system_score_codex":0.000029155624,"about_ca_system_score_gemma":0.000012921281,"threshold_uncertainty_score":0.31027},"labels":[],"label_agreement":null}]}