{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010427155,0.00014155518,0.982834,0.0002367709,0.00009506549,0.0001050885,0.00018868204,0.0032939038,0.0026778176],"genre_scores_gemma":[0.27151582,0.00037663183,0.718012,0.0005434918,0.00021499155,0.0003284479,0.0008384407,0.0018292625,0.0063408394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98586833,0.002582684,0.0012794934,0.0019722036,0.0064401855,0.0018570257],"domain_scores_gemma":[0.9791173,0.007578708,0.0016591629,0.00738555,0.0037986438,0.00046067158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013030532,0.0010124708,0.0020733303,0.0019791846,0.0021960398,0.0050172894,0.004110093,0.0018841783,0.003956106],"category_scores_gemma":[0.026145983,0.0017264698,0.004770067,0.0023196794,0.005399971,0.009119672,0.008132563,0.005190771,0.001972974],"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.0002425977,0.00016764554,0.0033122245,0.00068826706,0.00017222157,0.00034930106,0.0012568119,0.01598012,0.018465606,0.8479983,0.0057113073,0.10565555],"study_design_scores_gemma":[0.00016734215,0.00010390312,0.00089223223,0.00023562886,0.00028829352,0.0005807697,0.00030122016,0.08536505,0.06826938,0.82105154,0.022518203,0.00022635605],"about_ca_topic_score_codex":0.0045064543,"about_ca_topic_score_gemma":0.0054751993,"teacher_disagreement_score":0.013030532,"about_ca_system_score_codex":0.002212964,"about_ca_system_score_gemma":0.007591486,"threshold_uncertainty_score":0.068912864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006469809,0.00031115365,0.9674705,0.0025872397,0.0009917625,0.00020522563,0.00045077057,0.0034481895,0.0180653],"genre_scores_gemma":[0.21632503,0.0010690149,0.7441029,0.0056021702,0.0011171482,0.00078073976,0.0009969675,0.0033297224,0.026676428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938023,0.00079730625,0.00049717503,0.0013528739,0.0029116075,0.0006386612],"domain_scores_gemma":[0.98673135,0.0064241667,0.00039428784,0.0027416481,0.0031995196,0.00050901674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005710641,0.0011507105,0.0013138284,0.00152157,0.002080049,0.0034107717,0.0020538697,0.002068349,0.012454198],"category_scores_gemma":[0.020605456,0.0014978967,0.003963759,0.0011016474,0.0067242216,0.009402338,0.009122926,0.008711549,0.0047529866],"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.00014637917,0.00016726292,0.0012278862,0.0006405432,0.00007495599,0.0006018781,0.0009947785,0.0033086347,0.023701359,0.88474876,0.0186792,0.06570832],"study_design_scores_gemma":[0.00020685088,0.00015707088,0.0009182118,0.00023987892,0.00018331251,0.0010517917,0.00017125628,0.019848086,0.036796715,0.81214386,0.12813385,0.00014910282],"about_ca_topic_score_codex":0.0024785672,"about_ca_topic_score_gemma":0.002234793,"teacher_disagreement_score":0.012454198,"about_ca_system_score_codex":0.0018960724,"about_ca_system_score_gemma":0.0042000576,"threshold_uncertainty_score":0.041663468},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009870373,0.00033300722,0.88876116,0.0011626764,0.00035698668,0.00013516594,0.0018814146,0.07082032,0.026678918],"genre_scores_gemma":[0.18060142,0.0005353266,0.7748162,0.001719294,0.00054739736,0.0002467019,0.00742004,0.016683664,0.017429926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996258,0.0005444446,0.00028452615,0.00044083738,0.0021501137,0.00032211654],"domain_scores_gemma":[0.9926674,0.0018600728,0.00039117888,0.0027158624,0.0021056924,0.00025977654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003412938,0.00078687817,0.0006729862,0.0017350701,0.00080209004,0.0035756358,0.002413542,0.00086119235,0.016231941],"category_scores_gemma":[0.00942819,0.00070021517,0.001151103,0.0010927088,0.0019339886,0.0053058346,0.0031919945,0.0025528106,0.008663601],"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.0011711,0.00028618958,0.0089191,0.0006351889,0.00009647221,0.0004258608,0.000479101,0.02415611,0.049989026,0.12476344,0.24826247,0.54081607],"study_design_scores_gemma":[0.000214808,0.00023334115,0.003342469,0.00019943192,0.00009058882,0.0007212999,0.00025646083,0.41260964,0.13897054,0.0710546,0.37214413,0.00016266313],"about_ca_topic_score_codex":0.0031847155,"about_ca_topic_score_gemma":0.0044155936,"teacher_disagreement_score":0.016231941,"about_ca_system_score_codex":0.0013340114,"about_ca_system_score_gemma":0.0024101427,"threshold_uncertainty_score":0.05430132},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005581553,0.00014909719,0.9843322,0.0012592986,0.00007737702,0.00014096397,0.00038841693,0.0023137054,0.0057573495],"genre_scores_gemma":[0.28949377,0.00082809734,0.69280094,0.0011870897,0.00043785103,0.0008116449,0.0015236307,0.0012563769,0.011660411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953621,0.0013643886,0.0004535094,0.00076142093,0.0013967562,0.00066185556],"domain_scores_gemma":[0.99184763,0.00465412,0.0006006191,0.0013156515,0.0011508875,0.0004310226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00653951,0.001111188,0.0009022124,0.0027216244,0.0030690315,0.0056662774,0.004418548,0.003483211,0.0053479793],"category_scores_gemma":[0.012213545,0.0019692418,0.004499804,0.00257078,0.00578026,0.018366668,0.006119793,0.005153911,0.0016382999],"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.00005967221,0.000032934302,0.0003075269,0.000103159415,0.00002117674,0.0003246985,0.0009152183,0.010062852,0.0011838395,0.9773424,0.0018887353,0.0077577257],"study_design_scores_gemma":[0.00006751711,0.00005736763,0.0001396597,0.000080702666,0.00007005327,0.00024790698,0.00033829283,0.103505574,0.0033026948,0.8532084,0.038917437,0.000064413],"about_ca_topic_score_codex":0.013683428,"about_ca_topic_score_gemma":0.009083595,"teacher_disagreement_score":0.013683428,"about_ca_system_score_codex":0.003322049,"about_ca_system_score_gemma":0.003806423,"threshold_uncertainty_score":0.03458464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111796275,0.00062955276,0.82560474,0.00163544,0.0004253822,0.00018347152,0.00024334883,0.04656991,0.0129118385],"genre_scores_gemma":[0.50638384,0.0004946512,0.46138948,0.0014752919,0.00013794887,0.00018133355,0.0006483229,0.018299751,0.01098941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674976,0.0006906699,0.00026454957,0.0006624193,0.0011279943,0.0005047301],"domain_scores_gemma":[0.9869479,0.0026641502,0.0006994627,0.008094024,0.0012403956,0.00035401608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003438702,0.0011274312,0.00062973786,0.00058614323,0.000875993,0.0031573346,0.0026984916,0.0011369317,0.0036650456],"category_scores_gemma":[0.020777754,0.0012821808,0.0013310906,0.0005465632,0.0026926897,0.008073229,0.003669295,0.0045559322,0.0029013364],"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.002126983,0.000533346,0.035679486,0.0008842522,0.0002640977,0.000944652,0.0044617997,0.06324046,0.20614104,0.17658287,0.025091939,0.48404905],"study_design_scores_gemma":[0.00021512227,0.00069918815,0.0057760705,0.00055592996,0.00039830164,0.00091864227,0.000604837,0.39901572,0.281628,0.15057844,0.15923929,0.00037042156],"about_ca_topic_score_codex":0.0031807658,"about_ca_topic_score_gemma":0.003800867,"teacher_disagreement_score":0.0036650456,"about_ca_system_score_codex":0.0011125231,"about_ca_system_score_gemma":0.0035736486,"threshold_uncertainty_score":0.018185794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9728158,0.00061323383,0.013721131,0.003165048,0.000018055169,0.000034330656,0.00004088368,0.00007979933,0.009511758],"genre_scores_gemma":[0.9900517,0.0005365952,0.0074757957,0.00031733658,0.000014270037,0.000049723607,0.00003878902,0.00013394066,0.0013819755],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9867798,0.008307465,0.000590681,0.0009966824,0.0025677641,0.00075764366],"domain_scores_gemma":[0.93435514,0.049659684,0.007623679,0.0018507439,0.005223094,0.0012876047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014958063,0.00030527674,0.00023371117,0.002977469,0.0018051493,0.0059783435,0.0012408101,0.0011163093,0.00094364356],"category_scores_gemma":[0.04180615,0.00082627934,0.00032349385,0.001824724,0.0064989747,0.011855628,0.0037725826,0.0017969923,0.00022443179],"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.000057375677,0.00006718089,0.06603796,0.00023989234,0.000016177135,0.00077220605,0.86820066,0.000336739,0.007481238,0.020818032,0.0007889669,0.035183497],"study_design_scores_gemma":[0.000021195887,0.00016676086,0.21234831,0.0013705638,0.000069017595,0.0021662596,0.648507,0.007345257,0.004680371,0.02841665,0.09471467,0.00019390551],"about_ca_topic_score_codex":0.008047362,"about_ca_topic_score_gemma":0.007891876,"teacher_disagreement_score":0.014958063,"about_ca_system_score_codex":0.0033101658,"about_ca_system_score_gemma":0.0030408595,"threshold_uncertainty_score":0.07910675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014799099,0.00013340017,0.99317247,0.0007271205,0.00033456838,0.00008819467,0.00009742329,0.00095734454,0.0030095212],"genre_scores_gemma":[0.08125163,0.00040806335,0.90693426,0.0026788448,0.0007464403,0.0005610788,0.00034263864,0.0010612902,0.006015724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9839776,0.0029641644,0.0017019345,0.0034807087,0.0069801975,0.0008954198],"domain_scores_gemma":[0.97022027,0.01737424,0.00094879535,0.0048766052,0.005687931,0.000892276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010826892,0.0011181026,0.001777497,0.0023221779,0.0019204672,0.003750655,0.003948273,0.0030388462,0.005396087],"category_scores_gemma":[0.03787574,0.0013937617,0.0041273753,0.0012174456,0.0066089253,0.0089069335,0.0069569796,0.0113604665,0.0026667933],"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.00012232861,0.00010578788,0.0008302918,0.00036879044,0.00011771086,0.0005752259,0.00063793996,0.009477801,0.008054091,0.8811338,0.009317865,0.08925842],"study_design_scores_gemma":[0.0001168697,0.0001239531,0.00019381086,0.00016488878,0.0001384561,0.00078798743,0.000063457876,0.084556855,0.01701154,0.84948593,0.04723151,0.00012478417],"about_ca_topic_score_codex":0.0014023641,"about_ca_topic_score_gemma":0.001348867,"teacher_disagreement_score":0.010826892,"about_ca_system_score_codex":0.0017365126,"about_ca_system_score_gemma":0.002679776,"threshold_uncertainty_score":0.057258725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023176994,0.00033553195,0.9556727,0.0005391752,0.00007491294,0.0003921906,0.00017441931,0.0010498357,0.018584264],"genre_scores_gemma":[0.34997156,0.00048887334,0.6368597,0.00041830228,0.00006169312,0.0008463884,0.0005342734,0.0003297006,0.010489555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755305,0.00079476763,0.00021497758,0.0005149186,0.0006151477,0.0003071548],"domain_scores_gemma":[0.99759513,0.0018821781,0.00012926494,0.0001502023,0.00016741149,0.00007574927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017292522,0.0012831123,0.0009512305,0.00095720997,0.0008298308,0.0023300769,0.0013424634,0.0011203395,0.008235074],"category_scores_gemma":[0.00675634,0.0006575051,0.0020614746,0.00070152327,0.0027276897,0.0028229859,0.0021090184,0.0022962093,0.0011959255],"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.00016246499,0.00014638362,0.0004509195,0.00053010136,0.000066580375,0.00019965951,0.0006599389,0.112936035,0.006155251,0.8064868,0.001975705,0.07023017],"study_design_scores_gemma":[0.0001327246,0.0001185035,0.000098108976,0.000097834745,0.000057358895,0.000077508,0.00018222937,0.25061917,0.005858969,0.7337814,0.008943558,0.000032561347],"about_ca_topic_score_codex":0.002385544,"about_ca_topic_score_gemma":0.0032643264,"teacher_disagreement_score":0.008235074,"about_ca_system_score_codex":0.002458642,"about_ca_system_score_gemma":0.0020348858,"threshold_uncertainty_score":0.027549028},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014960506,0.00036561917,0.96044385,0.000974298,0.00013466773,0.00014975165,0.00021326914,0.00075832754,0.02199963],"genre_scores_gemma":[0.37924725,0.0006919321,0.60335314,0.0010457622,0.0003648688,0.00085910957,0.0008289074,0.0015188464,0.012090073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921704,0.002673876,0.00092801265,0.0015207807,0.0020034295,0.0007034772],"domain_scores_gemma":[0.9950948,0.0019195562,0.00042291175,0.0012314789,0.0011278023,0.0002035446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071338634,0.0011309261,0.0009760379,0.0029673765,0.0023305635,0.0045162775,0.0026836134,0.0025798918,0.006669307],"category_scores_gemma":[0.01051394,0.0013800557,0.003191418,0.0015273403,0.011684092,0.010745888,0.0058710664,0.0043923804,0.0011070389],"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.0000067826754,0.0000060699745,0.000058581474,0.000028882436,0.0000059455297,0.000044683256,0.0002662812,0.0008554899,0.0003356717,0.99544936,0.00030860008,0.0026336135],"study_design_scores_gemma":[0.00000871893,0.000011957963,0.00003378031,0.000023739101,0.00000996955,0.000046791207,0.00008348326,0.004254576,0.0006523231,0.9896522,0.005211861,0.0000105805375],"about_ca_topic_score_codex":0.0016348424,"about_ca_topic_score_gemma":0.0014166563,"teacher_disagreement_score":0.0071338634,"about_ca_system_score_codex":0.0021078154,"about_ca_system_score_gemma":0.0020382486,"threshold_uncertainty_score":0.037727892},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17244886,0.00023330007,0.801788,0.00088296307,0.00008711761,0.0002137275,0.0005115547,0.019495219,0.0043392903],"genre_scores_gemma":[0.5138955,0.0002607515,0.4754659,0.00036947016,0.000055864217,0.00022495788,0.0010480502,0.004077844,0.004601541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604475,0.0013186319,0.00023879422,0.00072636444,0.0013270631,0.00034446237],"domain_scores_gemma":[0.9772701,0.015640367,0.0024425085,0.002520267,0.0017266809,0.0004000947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004297529,0.0007921929,0.00053516676,0.0013122251,0.001740702,0.0018171931,0.0020135122,0.0013803915,0.002672795],"category_scores_gemma":[0.021894008,0.0014899088,0.0015846541,0.0010241459,0.002733507,0.0071911183,0.0040269606,0.0024633044,0.00078862655],"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.0016702992,0.0006182392,0.03611004,0.0016727103,0.00023342697,0.0029825699,0.008198855,0.13756417,0.07920463,0.3588916,0.022141147,0.3507123],"study_design_scores_gemma":[0.00016184332,0.00037256617,0.004397925,0.00022138548,0.00019005913,0.0007325835,0.001689155,0.6446346,0.091606915,0.21831176,0.037511226,0.00016998504],"about_ca_topic_score_codex":0.0038367948,"about_ca_topic_score_gemma":0.005251513,"teacher_disagreement_score":0.004297529,"about_ca_system_score_codex":0.0013227781,"about_ca_system_score_gemma":0.001905829,"threshold_uncertainty_score":0.022727728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14958139,0.0004219379,0.83940995,0.0012126365,0.000049741353,0.00010647342,0.00034731402,0.00083666365,0.008033928],"genre_scores_gemma":[0.94323874,0.00021858289,0.05390473,0.00018329066,0.000107833366,0.00013610409,0.00025316433,0.00018833752,0.001769329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99366426,0.0020641387,0.00032505605,0.0010108075,0.0023585472,0.00057720486],"domain_scores_gemma":[0.9594405,0.03020046,0.0035943964,0.0030090231,0.0029888388,0.00076676905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005858117,0.0007012275,0.00067694933,0.003202279,0.00077246677,0.0025430627,0.0014530027,0.0010349088,0.0025541517],"category_scores_gemma":[0.035869922,0.0004601903,0.0016181922,0.00091369863,0.0050890995,0.0043310206,0.002510397,0.0026258456,0.00019620004],"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.00017118258,0.00006624597,0.0026312731,0.00023996373,0.00013049414,0.0002288772,0.00047472966,0.26396352,0.00977144,0.7050799,0.00073522475,0.016507128],"study_design_scores_gemma":[0.000012717489,0.000057781304,0.0007119315,0.00003163963,0.00003269782,0.000051224855,0.000063017316,0.53418195,0.0046817306,0.45911166,0.0010349693,0.000028646407],"about_ca_topic_score_codex":0.0014746597,"about_ca_topic_score_gemma":0.0005574169,"teacher_disagreement_score":0.005858117,"about_ca_system_score_codex":0.0032221093,"about_ca_system_score_gemma":0.0011101597,"threshold_uncertainty_score":0.030981064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02934791,0.00013355254,0.9625984,0.00015093517,0.000038436254,0.00012286799,0.00023124013,0.0063450467,0.0010316968],"genre_scores_gemma":[0.46941614,0.00027464185,0.5253914,0.00024015579,0.0000549334,0.00042163042,0.000935503,0.0016299023,0.0016356014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924549,0.00211049,0.0006592619,0.0016584207,0.0024270893,0.0006898392],"domain_scores_gemma":[0.98560125,0.00795369,0.0011943659,0.0032734321,0.0016413797,0.00033591595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003969205,0.0019400128,0.0010973624,0.0020683035,0.001164535,0.0035641042,0.0020981908,0.0010101993,0.0035298746],"category_scores_gemma":[0.01725411,0.0013712184,0.0034412895,0.0014080026,0.0028794473,0.007178044,0.0048431708,0.0029218073,0.000637402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00088607543,0.00033414713,0.013862079,0.0011793057,0.00042051065,0.00058854494,0.001499653,0.50164664,0.05835079,0.19040126,0.0041399184,0.22669102],"study_design_scores_gemma":[0.00007677417,0.000120355464,0.00063592085,0.00006938953,0.000103609214,0.000096332675,0.000120547404,0.83227676,0.03223432,0.12909973,0.0050942516,0.00007205845],"about_ca_topic_score_codex":0.008296489,"about_ca_topic_score_gemma":0.0067284848,"teacher_disagreement_score":0.008296489,"about_ca_system_score_codex":0.0026446597,"about_ca_system_score_gemma":0.004900813,"threshold_uncertainty_score":0.020991445},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054254164,0.00017957244,0.98617053,0.0005701868,0.00023399074,0.000048558064,0.00020156665,0.0018627918,0.005307369],"genre_scores_gemma":[0.2233936,0.0009881668,0.75538236,0.0013530554,0.00038297064,0.00032947533,0.00054798013,0.002934321,0.014688115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767345,0.0004988533,0.00020995007,0.00042285782,0.00090608303,0.0002889436],"domain_scores_gemma":[0.9954163,0.0020719836,0.00026694126,0.0012583327,0.0007794887,0.00020693809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035177493,0.0005916342,0.0006517684,0.0008680885,0.0013855353,0.002969009,0.0020309223,0.0012595927,0.0047526527],"category_scores_gemma":[0.008549685,0.0012928039,0.0018356504,0.0009860548,0.0050829276,0.0077762045,0.0058617448,0.005055998,0.0012162883],"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.000042888354,0.000016784434,0.00045798783,0.00009352895,0.0000137106745,0.00020448913,0.00047147486,0.004303405,0.0026069642,0.9715333,0.0025903338,0.017665038],"study_design_scores_gemma":[0.00005659561,0.000049548216,0.00032601214,0.0001328323,0.00006602313,0.00042246,0.0001589978,0.05503565,0.012234717,0.77356154,0.15787874,0.00007695688],"about_ca_topic_score_codex":0.0038188668,"about_ca_topic_score_gemma":0.0032298567,"teacher_disagreement_score":0.0047526527,"about_ca_system_score_codex":0.0016439767,"about_ca_system_score_gemma":0.0031294283,"threshold_uncertainty_score":0.018603861},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016826674,0.00022041639,0.97202176,0.00046387283,0.00012263692,0.00007287919,0.00017914429,0.002445331,0.007647299],"genre_scores_gemma":[0.467359,0.00046259272,0.51208043,0.001304526,0.000295569,0.0004761881,0.00063107116,0.002956814,0.014433862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189526,0.0015439802,0.00068753003,0.0020049124,0.0031978393,0.0006703671],"domain_scores_gemma":[0.98341817,0.007464374,0.0011635339,0.0049552536,0.0026915167,0.00030715772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004701843,0.0008775381,0.0008212798,0.0013275316,0.0013192866,0.003573554,0.0025795726,0.0015498394,0.004529006],"category_scores_gemma":[0.026530342,0.0012926544,0.0028728559,0.0009864485,0.0054844404,0.009653895,0.0063844626,0.0056904084,0.0017734286],"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.00012073144,0.000036878853,0.0015785231,0.00020271497,0.000034148765,0.0002626486,0.00092510955,0.014708689,0.009039078,0.938142,0.0022823266,0.032666985],"study_design_scores_gemma":[0.00004512038,0.000071875744,0.00041987593,0.0001379524,0.00007238865,0.0004079373,0.00014697846,0.10899503,0.02176711,0.8384956,0.029346043,0.000094082905],"about_ca_topic_score_codex":0.0021906924,"about_ca_topic_score_gemma":0.0022456152,"teacher_disagreement_score":0.004701843,"about_ca_system_score_codex":0.0029172977,"about_ca_system_score_gemma":0.0025094992,"threshold_uncertainty_score":0.024865985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015007877,0.00027419685,0.97383595,0.00040558193,0.00012935304,0.00006275694,0.00019566422,0.0013409673,0.008747779],"genre_scores_gemma":[0.35357592,0.00031035778,0.62658775,0.0006857992,0.00015261616,0.0003277866,0.00038960902,0.0005987514,0.017371364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960484,0.00081710576,0.00040604244,0.00080999464,0.0014191677,0.00049923477],"domain_scores_gemma":[0.99621373,0.0011118172,0.0003150611,0.0014413651,0.0006662107,0.0002517445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038049927,0.0006370628,0.0007666686,0.0014890507,0.0014010406,0.0043371036,0.0030696793,0.0015041635,0.0072249686],"category_scores_gemma":[0.0056849583,0.0009578066,0.0016951446,0.0014143506,0.0041544205,0.008894521,0.0056569194,0.0035474321,0.0018632644],"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.00003341778,0.000018198081,0.0005243117,0.000056004126,0.000013201889,0.000112093585,0.00027388192,0.0019078348,0.0020391957,0.9826193,0.000588882,0.0118136825],"study_design_scores_gemma":[0.00006181289,0.00008703732,0.00043077974,0.000090602596,0.000081117105,0.0005998941,0.00017551414,0.06542558,0.012965253,0.8487902,0.07120508,0.00008711704],"about_ca_topic_score_codex":0.0014247178,"about_ca_topic_score_gemma":0.0018645924,"teacher_disagreement_score":0.0072249686,"about_ca_system_score_codex":0.0019367326,"about_ca_system_score_gemma":0.0022724818,"threshold_uncertainty_score":0.024169981},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049503734,0.00033445976,0.9724151,0.0017360955,0.000117883916,0.00013038435,0.00051899435,0.0009317919,0.018864904],"genre_scores_gemma":[0.3011384,0.0007896192,0.67312896,0.0028664398,0.0005848532,0.00045923257,0.0010351383,0.00028728228,0.019710092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572253,0.00093272893,0.0004085953,0.0010482633,0.0015511354,0.000336678],"domain_scores_gemma":[0.9966462,0.0016893843,0.0002906479,0.0004454617,0.00067492196,0.000253329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003768454,0.00080803275,0.00061524345,0.0016318006,0.0020917433,0.0033529769,0.0017842861,0.001273742,0.006932293],"category_scores_gemma":[0.005620138,0.0007946706,0.0019483718,0.0013635292,0.004275703,0.0075884084,0.004008688,0.0047076684,0.0015630777],"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.000036879945,0.000031980122,0.00015488052,0.00009104574,0.000019171308,0.00009301179,0.00015303757,0.0029620037,0.0010754494,0.9746568,0.0021315683,0.01859403],"study_design_scores_gemma":[0.00003204715,0.000030762036,0.000100582234,0.000034881396,0.000029946186,0.00020401952,0.000037352464,0.029144008,0.0021355702,0.9401916,0.028035164,0.000024077865],"about_ca_topic_score_codex":0.0021085297,"about_ca_topic_score_gemma":0.0017683762,"teacher_disagreement_score":0.006932293,"about_ca_system_score_codex":0.0022205294,"about_ca_system_score_gemma":0.0032550304,"threshold_uncertainty_score":0.023190796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31378844,0.0007566948,0.53740746,0.004261536,0.00086785486,0.00083694834,0.0011883473,0.015455299,0.1254374],"genre_scores_gemma":[0.59849066,0.00081501197,0.31888875,0.00073654286,0.00022735026,0.00034269594,0.001269671,0.0021368146,0.07709245],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9972568,0.0008102626,0.00017454327,0.00040028366,0.0010916927,0.0002664992],"domain_scores_gemma":[0.9909644,0.002608516,0.00063093734,0.0015367914,0.002873489,0.0013858388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004460553,0.0007093408,0.0002516475,0.0010807476,0.00074832106,0.0026566717,0.0011017381,0.0007622219,0.015139548],"category_scores_gemma":[0.014114662,0.00036094312,0.000454736,0.00070941314,0.0009178258,0.002700294,0.0018297109,0.0018267828,0.006564414],"study_design_candidate":"qualitative","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.00013164345,0.0014664832,0.008907548,0.00018404392,0.000018248886,0.0003061751,0.0055956766,0.0026513159,0.018527862,0.008022125,0.0636636,0.8905252],"study_design_scores_gemma":[0.00022541622,0.003502355,0.041418806,0.0005336683,0.00008200703,0.0051677553,0.0057556373,0.028305534,0.121026985,0.034415063,0.7592198,0.0003468535],"about_ca_topic_score_codex":0.0014851367,"about_ca_topic_score_gemma":0.0032055597,"teacher_disagreement_score":0.015139548,"about_ca_system_score_codex":0.0008212821,"about_ca_system_score_gemma":0.0013515746,"threshold_uncertainty_score":0.05064684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002344239,0.00013778519,0.9818625,0.00039203186,0.000032347176,0.000056944962,0.00013482633,0.012352124,0.0026872104],"genre_scores_gemma":[0.05595131,0.0004166983,0.9334447,0.00036262962,0.00007318547,0.00030897715,0.00075373834,0.005681903,0.0030067698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954952,0.0011810375,0.00038222197,0.00070465123,0.0018647056,0.0003721758],"domain_scores_gemma":[0.9901092,0.005191525,0.0005380745,0.0029081989,0.0010682775,0.00018464748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034028844,0.0016202042,0.0007301825,0.0010748386,0.000857707,0.0035734824,0.0031704698,0.0011875362,0.012111494],"category_scores_gemma":[0.018455854,0.0015834265,0.0014826024,0.0015659485,0.0029178953,0.005120094,0.0035955375,0.004482838,0.007018369],"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.0002810151,0.00023573417,0.0019214081,0.0007639062,0.000105480205,0.00025516475,0.00064721645,0.10083093,0.012135379,0.3781852,0.031422086,0.47321647],"study_design_scores_gemma":[0.00012481425,0.00007281059,0.00040279815,0.00023742142,0.00006720201,0.00018095071,0.00012619281,0.5161716,0.027594043,0.40901962,0.04594122,0.00006145644],"about_ca_topic_score_codex":0.0021575226,"about_ca_topic_score_gemma":0.0026090168,"teacher_disagreement_score":0.012111494,"about_ca_system_score_codex":0.00198415,"about_ca_system_score_gemma":0.003852936,"threshold_uncertainty_score":0.040516973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21782507,0.000668541,0.7541141,0.0031891845,0.00023737362,0.00030730353,0.0015079504,0.0060990043,0.016051507],"genre_scores_gemma":[0.80519503,0.0005711105,0.17969811,0.001150515,0.0001921032,0.0003348865,0.0022352824,0.001208165,0.009414724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955676,0.00048272763,0.00033564918,0.0012675555,0.0015239083,0.000822588],"domain_scores_gemma":[0.97377634,0.01774241,0.0018707953,0.0035332034,0.0023681172,0.0007091751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004293364,0.0009296457,0.00089035445,0.0011325458,0.002022497,0.005004701,0.0027668497,0.0015284852,0.002536303],"category_scores_gemma":[0.012806285,0.0012372808,0.0026070112,0.0008367299,0.0058806473,0.00811426,0.0034630417,0.0063554742,0.0005268606],"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.0006819357,0.00039926684,0.01073424,0.00081828696,0.0001382223,0.0010675467,0.0017950104,0.03033553,0.032020055,0.85283005,0.0076358947,0.06154393],"study_design_scores_gemma":[0.00019550604,0.00009873712,0.0025205906,0.000109629415,0.00018331321,0.00075624173,0.0003145393,0.18755136,0.08595837,0.7002353,0.021957088,0.000119281445],"about_ca_topic_score_codex":0.0109625645,"about_ca_topic_score_gemma":0.008204434,"teacher_disagreement_score":0.0109625645,"about_ca_system_score_codex":0.0042518526,"about_ca_system_score_gemma":0.006791215,"threshold_uncertainty_score":0.030849516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075308043,0.00011627099,0.96270514,0.00019057287,0.000045379307,0.000169167,0.00037441074,0.027604794,0.0012635669],"genre_scores_gemma":[0.41633302,0.00025981842,0.57306373,0.00038119973,0.00015687237,0.0006991625,0.0016786373,0.0036586327,0.003768903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98944175,0.002075784,0.0011869207,0.0016818317,0.0047692903,0.00084431784],"domain_scores_gemma":[0.9814866,0.0047081416,0.0019310659,0.008252989,0.0029029981,0.00071822596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007939357,0.001429335,0.0016036289,0.00161495,0.0011703762,0.0035983627,0.0049051335,0.0015881389,0.0032232718],"category_scores_gemma":[0.026706891,0.0016110804,0.00097005273,0.0012831405,0.0014622756,0.0065879025,0.006342374,0.0041840477,0.0023526554],"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.0028851146,0.0004775429,0.009560112,0.0006504755,0.00023224803,0.0007586075,0.0013043213,0.2045632,0.037337393,0.14320949,0.044345368,0.5546761],"study_design_scores_gemma":[0.0002510433,0.00023240196,0.00074286474,0.000043081607,0.00004583547,0.0003087847,0.000091836184,0.8999022,0.025118936,0.050790396,0.022374298,0.000098278295],"about_ca_topic_score_codex":0.003195612,"about_ca_topic_score_gemma":0.0020592306,"teacher_disagreement_score":0.007939357,"about_ca_system_score_codex":0.0015182868,"about_ca_system_score_gemma":0.0037220726,"threshold_uncertainty_score":0.041987836},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03883542,0.00012761392,0.953832,0.0004740062,0.0000649413,0.00013468077,0.0003608144,0.0031623552,0.0030082094],"genre_scores_gemma":[0.70318186,0.00020023207,0.29161477,0.00033296525,0.00008810896,0.00019892126,0.0008466474,0.00051695097,0.0030194623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943869,0.0014920118,0.00042382136,0.0011447063,0.0018306368,0.00072195136],"domain_scores_gemma":[0.9883482,0.0073655206,0.000859572,0.002042801,0.0010963662,0.00028754902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035806003,0.0006983911,0.000998655,0.00091646827,0.0009306539,0.0034525143,0.0029245995,0.00097210985,0.0043602786],"category_scores_gemma":[0.016961282,0.00076671975,0.002585257,0.0012949827,0.0044308384,0.01246383,0.0030729745,0.002905855,0.0009055017],"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.00069299754,0.00020728099,0.0021269445,0.00043612375,0.00015712364,0.0005244637,0.0009459231,0.1012222,0.016736135,0.79947805,0.002406097,0.07506673],"study_design_scores_gemma":[0.00007992701,0.00009364157,0.00022054248,0.000045904966,0.000078220386,0.00012485168,0.00013199018,0.3394962,0.026118098,0.62979186,0.0037609416,0.000057920945],"about_ca_topic_score_codex":0.0050106267,"about_ca_topic_score_gemma":0.0061343634,"teacher_disagreement_score":0.0050106267,"about_ca_system_score_codex":0.0019912736,"about_ca_system_score_gemma":0.0034797778,"threshold_uncertainty_score":0.018936276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036857214,0.002026767,0.96813923,0.0013852902,0.0003207114,0.00021365575,0.00017148217,0.0011289773,0.02292811],"genre_scores_gemma":[0.23748425,0.0035416656,0.7381712,0.0023491995,0.0009691627,0.0012435954,0.0008105712,0.0014532458,0.013977094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99045205,0.0035258743,0.00058025966,0.0015141316,0.0034012143,0.0005265241],"domain_scores_gemma":[0.98844403,0.0072307754,0.00042546817,0.0027936394,0.00090347417,0.0002026585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058762725,0.0012710752,0.0010907638,0.002346559,0.001879216,0.002771796,0.002379845,0.0017739419,0.0073975218],"category_scores_gemma":[0.015919264,0.0010092936,0.0026310745,0.0014821521,0.0070411586,0.00698473,0.004844044,0.008153969,0.0024159634],"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.000025901645,0.00002088513,0.00010083254,0.00017875357,0.000024089193,0.000059477246,0.00024939713,0.002957254,0.0015495155,0.9666817,0.00244739,0.025704756],"study_design_scores_gemma":[0.000021035577,0.00002586838,0.000080111015,0.000086018816,0.00002932591,0.000106737454,0.000049119906,0.009158088,0.002974414,0.92907214,0.058375984,0.000021085269],"about_ca_topic_score_codex":0.001271929,"about_ca_topic_score_gemma":0.0010556545,"teacher_disagreement_score":0.0073975218,"about_ca_system_score_codex":0.002539207,"about_ca_system_score_gemma":0.0020871547,"threshold_uncertainty_score":0.031077087},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027476832,0.004463881,0.89512974,0.007268141,0.0004586874,0.000081331185,0.00014336607,0.00082891574,0.064149074],"genre_scores_gemma":[0.7777974,0.002489914,0.19735605,0.0026056697,0.00069091,0.00021678253,0.00015272293,0.00035022062,0.01834029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753404,0.0008442309,0.000094074785,0.00045123673,0.0007073709,0.00036894626],"domain_scores_gemma":[0.99725324,0.0015037378,0.00024249627,0.0004655815,0.00036718935,0.00016768594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388313,0.00040531115,0.00043608947,0.0011669196,0.0022354438,0.0030977523,0.0012522956,0.0014670136,0.0027917323],"category_scores_gemma":[0.0044278186,0.00044134507,0.00080592575,0.0012109563,0.0086738495,0.010121532,0.0025888225,0.0058200727,0.00042093382],"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.000016796035,0.000005556776,0.00011140155,0.000016366777,0.0000036123404,0.000036270547,0.0003111892,0.00074550445,0.00018980083,0.992201,0.00051168114,0.0058507756],"study_design_scores_gemma":[0.00002050071,0.000024813125,0.00010204689,0.000033448734,0.000015230534,0.00006798832,0.00015076231,0.0068934984,0.001029904,0.9670475,0.024595665,0.000018660521],"about_ca_topic_score_codex":0.0039278353,"about_ca_topic_score_gemma":0.0026227816,"teacher_disagreement_score":0.0039278353,"about_ca_system_score_codex":0.0024201665,"about_ca_system_score_gemma":0.0019684713,"threshold_uncertainty_score":0.017919362},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034662962,0.00015414497,0.95626783,0.00026805638,0.00023487271,0.00027646622,0.0006323428,0.03433161,0.004368359],"genre_scores_gemma":[0.15089755,0.00054324383,0.8149471,0.0012075931,0.00046076023,0.0009877415,0.0023473317,0.0089796735,0.019628936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939839,0.0012122014,0.0008497175,0.0014805194,0.0018358992,0.00063778146],"domain_scores_gemma":[0.9885881,0.0032267217,0.00085009134,0.0052097603,0.0017488913,0.00037653334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009818728,0.001237546,0.0016199233,0.0028991424,0.00299721,0.0052316994,0.0040700235,0.0027958665,0.014365178],"category_scores_gemma":[0.014482289,0.0018584906,0.0031402644,0.0017759688,0.0058240853,0.00941114,0.0061598043,0.0041901693,0.00802481],"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.0015136033,0.000381381,0.009407309,0.0010496739,0.0002904458,0.0011367874,0.0016931824,0.028826032,0.028176729,0.6635998,0.057141896,0.20678325],"study_design_scores_gemma":[0.0005104637,0.00043179985,0.0025098028,0.0004491301,0.0007256166,0.0014499412,0.0002009935,0.19113994,0.09439847,0.37907273,0.3285301,0.00058106845],"about_ca_topic_score_codex":0.005193033,"about_ca_topic_score_gemma":0.005320938,"teacher_disagreement_score":0.014365178,"about_ca_system_score_codex":0.0030868058,"about_ca_system_score_gemma":0.0065253396,"threshold_uncertainty_score":0.05192703},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031591106,0.005004154,0.40521446,0.03306109,0.00482073,0.00021537823,0.0014575951,0.021394463,0.49724102],"genre_scores_gemma":[0.20419379,0.0064376206,0.4288818,0.012127631,0.0035990616,0.0005677169,0.0032730382,0.016256407,0.324663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99501014,0.0015308646,0.00039374502,0.00083564996,0.0019596196,0.00026997563],"domain_scores_gemma":[0.9895353,0.0023419647,0.00050961855,0.0018450948,0.0048442367,0.00092382304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00893559,0.0006161213,0.00045640313,0.0026233154,0.0027340243,0.0065456466,0.0022390403,0.0020505963,0.010785982],"category_scores_gemma":[0.020758962,0.0008244051,0.0009022265,0.0018449946,0.0043121176,0.009215271,0.0051362305,0.0054622325,0.011259405],"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.00021303525,0.000075956516,0.0011939642,0.00026314976,0.000039818886,0.00062012556,0.004590965,0.002610393,0.0032054244,0.67450464,0.0908862,0.2217963],"study_design_scores_gemma":[0.000012712354,0.00003635538,0.00044983265,0.00013341843,0.000012896324,0.00041877743,0.0002019835,0.0031416921,0.0035879489,0.039576236,0.9523772,0.000051055446],"about_ca_topic_score_codex":0.0022849306,"about_ca_topic_score_gemma":0.0013484181,"teacher_disagreement_score":0.010785982,"about_ca_system_score_codex":0.0051807696,"about_ca_system_score_gemma":0.0048646624,"threshold_uncertainty_score":0.04725647},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004081739,0.00038837583,0.9769875,0.00048588015,0.000299764,0.00008317592,0.00044698032,0.0067286715,0.010497904],"genre_scores_gemma":[0.1577408,0.0012502586,0.80301476,0.0011402668,0.0004903974,0.00062293274,0.0015878226,0.006341156,0.027811578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950958,0.0014576192,0.0006102406,0.00089193456,0.001534168,0.00041027679],"domain_scores_gemma":[0.99385494,0.002515023,0.00038539534,0.0020218997,0.000889963,0.0003326935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005498211,0.00088901335,0.0009087801,0.002071896,0.0015892304,0.005559942,0.0027854512,0.0014144974,0.012785715],"category_scores_gemma":[0.010188809,0.0017149077,0.0022291075,0.001287105,0.0039170943,0.00911114,0.0062868893,0.0037181496,0.005125623],"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.00006171172,0.000020531443,0.00054851756,0.00017828394,0.000036148733,0.00023029163,0.00084731274,0.002080991,0.0039299824,0.94685364,0.007498361,0.037714295],"study_design_scores_gemma":[0.00005977344,0.00006316339,0.00035946452,0.00016685006,0.000096126656,0.0005104657,0.00016726348,0.02134522,0.015635626,0.6012311,0.3602749,0.00009012661],"about_ca_topic_score_codex":0.0012254893,"about_ca_topic_score_gemma":0.0017437978,"teacher_disagreement_score":0.012785715,"about_ca_system_score_codex":0.0015967443,"about_ca_system_score_gemma":0.0018301168,"threshold_uncertainty_score":0.042772412},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037622293,0.0003459185,0.9814532,0.002735492,0.00018308069,0.00004884766,0.00022840781,0.0005423679,0.010700492],"genre_scores_gemma":[0.4158911,0.0012136057,0.55768937,0.0027637705,0.0011745745,0.00073050294,0.00067150785,0.0007838303,0.019081704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928611,0.0021691248,0.0005452453,0.0015084017,0.0023886827,0.0005273625],"domain_scores_gemma":[0.98923254,0.005809782,0.0008188493,0.0022954696,0.001338072,0.0005051784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007639281,0.00097291655,0.000989239,0.0022438543,0.0024111108,0.0063190097,0.0038915311,0.0028189393,0.009275609],"category_scores_gemma":[0.0132232765,0.0009876277,0.0028824059,0.0022368524,0.008112065,0.016180707,0.0046621277,0.0061776396,0.0020469967],"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.000004922973,0.0000065831628,0.00004233522,0.000014762168,0.000004006129,0.00002536379,0.00012249296,0.0009325614,0.00013850797,0.99620664,0.000347919,0.0021539258],"study_design_scores_gemma":[0.000008088731,0.0000065120416,0.000029218645,0.00001192489,0.0000066239722,0.000068151734,0.000031115786,0.008712841,0.00034124043,0.98410493,0.0066671227,0.000012117636],"about_ca_topic_score_codex":0.0018837049,"about_ca_topic_score_gemma":0.0012952812,"teacher_disagreement_score":0.009275609,"about_ca_system_score_codex":0.002858151,"about_ca_system_score_gemma":0.0022842763,"threshold_uncertainty_score":0.040400803},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06590188,0.00010072463,0.9238766,0.00015756665,0.000034959874,0.00020749588,0.0001356646,0.0070593385,0.002525717],"genre_scores_gemma":[0.52231705,0.00019371592,0.47139385,0.0001965349,0.000061125866,0.00025296927,0.0007460302,0.0018912477,0.0029473584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969505,0.0005340539,0.00016364825,0.0004329679,0.0014216523,0.00049717195],"domain_scores_gemma":[0.9947792,0.0026721656,0.00035898507,0.0012050754,0.0008705291,0.00011399032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018608831,0.0010794778,0.0007688408,0.0011393543,0.0007530553,0.0010779666,0.0014868404,0.0008839597,0.0026424623],"category_scores_gemma":[0.0077329725,0.00078088144,0.0022977928,0.00059131905,0.0014312923,0.0017173666,0.0026327292,0.002076556,0.0010676825],"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.0005487971,0.00036507376,0.0054113194,0.00087577425,0.00012130898,0.0013353263,0.001388329,0.15149611,0.23386118,0.058660526,0.0045530503,0.54138315],"study_design_scores_gemma":[0.00012600793,0.00039582796,0.002193367,0.00014719153,0.00014991823,0.000812032,0.0002688596,0.71931636,0.15844677,0.10487389,0.013148115,0.000121698096],"about_ca_topic_score_codex":0.0018301698,"about_ca_topic_score_gemma":0.0018359718,"teacher_disagreement_score":0.0026424623,"about_ca_system_score_codex":0.000670447,"about_ca_system_score_gemma":0.0017054772,"threshold_uncertainty_score":0.009841442},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017334387,0.00016090779,0.9770691,0.00034615299,0.000071170165,0.000059758415,0.00007239221,0.0023540817,0.0025320943],"genre_scores_gemma":[0.3359136,0.0004072864,0.65489423,0.0005542899,0.00011800398,0.00017789086,0.0002634061,0.0021080498,0.0055631767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99267673,0.0018697273,0.0008375609,0.0011867511,0.0025200224,0.000909185],"domain_scores_gemma":[0.98293155,0.0042799166,0.0011720882,0.008917807,0.002331574,0.00036711094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009468868,0.0010056874,0.0013509438,0.001478385,0.0015745942,0.0045791036,0.0034758516,0.0016553309,0.0021252474],"category_scores_gemma":[0.01873641,0.0017813051,0.0032950148,0.0014624846,0.0064435517,0.01255181,0.008909442,0.0059746946,0.0011054177],"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.00022154137,0.00004830851,0.002113353,0.0002581529,0.000070986775,0.00032275068,0.0024826336,0.025790371,0.015884575,0.88165206,0.002060591,0.06909466],"study_design_scores_gemma":[0.000109461194,0.00014177494,0.0004589095,0.00019091918,0.00020540266,0.00039304822,0.0003831841,0.09891029,0.031525705,0.82959807,0.037918773,0.00016443279],"about_ca_topic_score_codex":0.0035304269,"about_ca_topic_score_gemma":0.0038169376,"teacher_disagreement_score":0.009468868,"about_ca_system_score_codex":0.001941085,"about_ca_system_score_gemma":0.0033214695,"threshold_uncertainty_score":0.050076783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014652371,0.000057808586,0.9940223,0.00009393368,0.000050536364,0.000084884836,0.00019206875,0.0027259465,0.0013072911],"genre_scores_gemma":[0.09050003,0.0002803625,0.90130174,0.00037543202,0.000117849566,0.00033072886,0.0012215206,0.0018864177,0.003985938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914312,0.0017530565,0.00082488207,0.0015177475,0.0037396506,0.00073356315],"domain_scores_gemma":[0.98704356,0.005138839,0.0008607795,0.0043377155,0.0024640858,0.00015487995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007663372,0.0012707901,0.0013833387,0.0031363487,0.0013289833,0.0036504604,0.004017417,0.0022617092,0.010052805],"category_scores_gemma":[0.029548682,0.0015705834,0.0042379396,0.0018918,0.0033525245,0.0082086995,0.0046029277,0.0048722704,0.0028920867],"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.00029031365,0.000120543344,0.004161705,0.00073995785,0.00015567812,0.00029298206,0.0007657588,0.0482848,0.014678549,0.59987915,0.012236894,0.31839374],"study_design_scores_gemma":[0.00008282068,0.000075779426,0.0007438896,0.000328794,0.0001412791,0.00036886253,0.0001362931,0.34485266,0.04931065,0.53433555,0.06949696,0.00012646253],"about_ca_topic_score_codex":0.004496898,"about_ca_topic_score_gemma":0.0042889714,"teacher_disagreement_score":0.010052805,"about_ca_system_score_codex":0.0023483962,"about_ca_system_score_gemma":0.004218185,"threshold_uncertainty_score":0.040528238},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004694669,0.0000994204,0.9916835,0.00046547817,0.000058326194,0.00004365731,0.00006347021,0.0011500469,0.0017414106],"genre_scores_gemma":[0.1439195,0.00030862194,0.84742695,0.00058589445,0.00011410978,0.00023159373,0.00018392698,0.0010411482,0.0061882054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752194,0.0006566694,0.00019686203,0.0005486687,0.0007563425,0.00031953288],"domain_scores_gemma":[0.9938305,0.0040317685,0.00041660096,0.00089283485,0.00056851225,0.00025986024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072189304,0.00086563407,0.000824846,0.0010994797,0.0014828107,0.004558415,0.0031580403,0.0014716212,0.0057635084],"category_scores_gemma":[0.0129854,0.0011157506,0.0023251837,0.0009283923,0.0043081604,0.009571307,0.0048956,0.004507691,0.0008706159],"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.00009280931,0.00005100782,0.00077136647,0.00017625067,0.00004339522,0.00019738518,0.00086924055,0.0174911,0.00242051,0.9297481,0.003463136,0.044675726],"study_design_scores_gemma":[0.000081586586,0.000071636496,0.00016973355,0.00017111374,0.00007615607,0.00025700912,0.00027062005,0.12419035,0.013901435,0.80831504,0.0524183,0.00007710265],"about_ca_topic_score_codex":0.0036151079,"about_ca_topic_score_gemma":0.0043425863,"teacher_disagreement_score":0.0072189304,"about_ca_system_score_codex":0.0019900496,"about_ca_system_score_gemma":0.0034528163,"threshold_uncertainty_score":0.03817779},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009573717,0.00017100973,0.9702764,0.00033282393,0.00035612576,0.00012390674,0.00036993218,0.0056831366,0.013113028],"genre_scores_gemma":[0.29389626,0.0006727946,0.6685628,0.0011037973,0.00041402897,0.00041857717,0.0010692265,0.002948702,0.030913843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810433,0.00023467811,0.00019482049,0.00037524744,0.0008094175,0.0002814647],"domain_scores_gemma":[0.9977863,0.00068169174,0.00017370311,0.0006815796,0.00048019688,0.0001966074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002279234,0.00048996805,0.0005623673,0.0008543899,0.001393353,0.00304237,0.0015742097,0.00090810674,0.0057699927],"category_scores_gemma":[0.004425436,0.0009291937,0.0013100217,0.00065907417,0.003605833,0.0046039354,0.00472753,0.002651469,0.0015834355],"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.0001718862,0.00006676263,0.0012220757,0.00016351519,0.000024613824,0.0005500269,0.0006047493,0.008056502,0.011083085,0.9298398,0.007589336,0.040627714],"study_design_scores_gemma":[0.0002053346,0.00014215476,0.00095762446,0.00014917809,0.000143681,0.00080299674,0.00019672907,0.098728485,0.04095433,0.4839711,0.37360245,0.00014601284],"about_ca_topic_score_codex":0.0049045607,"about_ca_topic_score_gemma":0.0041419123,"teacher_disagreement_score":0.0057699927,"about_ca_system_score_codex":0.0016731237,"about_ca_system_score_gemma":0.0028320623,"threshold_uncertainty_score":0.019302547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014001296,0.0011437233,0.94044745,0.010683161,0.00071754516,0.00046339555,0.002092279,0.003828508,0.026622681],"genre_scores_gemma":[0.10899401,0.0006957844,0.87320626,0.0030790837,0.00037379822,0.0016639465,0.0023095089,0.0046669026,0.0050106887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.8526236,0.11310717,0.007616818,0.011274343,0.013832708,0.0015454048],"domain_scores_gemma":[0.6486421,0.24218497,0.01283214,0.07141099,0.022820728,0.0021090158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.09804514,0.0015059916,0.001449562,0.0047644023,0.0038882273,0.012925783,0.004053406,0.00313942,0.016963985],"category_scores_gemma":[0.45936185,0.002431911,0.0026025777,0.007732223,0.01005544,0.021773214,0.0073275636,0.006506177,0.008561156],"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.0004552044,0.00010743807,0.019796925,0.0014553377,0.00028212913,0.00023952391,0.006129579,0.008227619,0.0016745786,0.72589564,0.05791627,0.17781976],"study_design_scores_gemma":[0.00019660914,0.00017229962,0.0045581944,0.0011359121,0.00014489323,0.00073984923,0.0020257134,0.03814447,0.0037990029,0.73686343,0.21207458,0.00014503564],"about_ca_topic_score_codex":0.0033623385,"about_ca_topic_score_gemma":0.004937627,"teacher_disagreement_score":0.09804514,"about_ca_system_score_codex":0.0033189827,"about_ca_system_score_gemma":0.00778722,"threshold_uncertainty_score":0.51851845},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021999987,0.0001272081,0.96398103,0.00020878577,0.00006914826,0.00007677474,0.00026357677,0.011736021,0.0015375075],"genre_scores_gemma":[0.34225294,0.00025556516,0.6425981,0.00039260645,0.000091898975,0.00035647242,0.0010319308,0.010575953,0.0024446181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97267807,0.00793517,0.0028957424,0.003939299,0.011437155,0.0011145528],"domain_scores_gemma":[0.9315767,0.03338793,0.005732133,0.02313647,0.005683947,0.00048288854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015192452,0.0014594864,0.0014306061,0.0025897634,0.0013215716,0.0057041384,0.0039168396,0.0017856115,0.0026008354],"category_scores_gemma":[0.09171733,0.003016026,0.0040202225,0.0017316402,0.0045668944,0.011516788,0.006457078,0.004804736,0.001111701],"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.0013126688,0.00023717845,0.059910282,0.0017728374,0.0005406614,0.0009961831,0.0044169347,0.14170296,0.053487454,0.4013336,0.009353621,0.3249357],"study_design_scores_gemma":[0.00013546304,0.00020037903,0.005374055,0.00059753645,0.00035774984,0.0006351171,0.00061994453,0.5140387,0.13464224,0.29764578,0.04549333,0.00025968414],"about_ca_topic_score_codex":0.002963291,"about_ca_topic_score_gemma":0.002930508,"teacher_disagreement_score":0.015192452,"about_ca_system_score_codex":0.0025747323,"about_ca_system_score_gemma":0.004052038,"threshold_uncertainty_score":0.08034629},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015845552,0.000088691995,0.9752922,0.0003332446,0.00007468316,0.00007588863,0.0000430715,0.0019971817,0.006249535],"genre_scores_gemma":[0.48328376,0.0005811675,0.5004565,0.00082471,0.00017427304,0.00033346502,0.00025390272,0.002168923,0.011923316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972288,0.00062858826,0.00022843036,0.00047581192,0.0010518348,0.00038650952],"domain_scores_gemma":[0.99313676,0.0026259243,0.000501909,0.002584108,0.0009728694,0.00017852691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004092102,0.00070478604,0.0005803533,0.0008371151,0.001072295,0.0031937778,0.0019049938,0.0011005816,0.0031193811],"category_scores_gemma":[0.008858912,0.0008397079,0.0015094839,0.0004818157,0.0045945463,0.007510147,0.006198307,0.0034397168,0.0008039579],"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.00006646187,0.000051185147,0.0011077682,0.00019834243,0.000030815107,0.00034941325,0.0016163139,0.006886749,0.016015302,0.91561747,0.001889121,0.056171145],"study_design_scores_gemma":[0.00006732227,0.00012798351,0.00039932627,0.00018927819,0.00013063053,0.0005950296,0.00037054237,0.09070756,0.047165185,0.7806528,0.07951186,0.000082477425],"about_ca_topic_score_codex":0.0020357952,"about_ca_topic_score_gemma":0.0018631279,"teacher_disagreement_score":0.004092102,"about_ca_system_score_codex":0.00083081785,"about_ca_system_score_gemma":0.002571476,"threshold_uncertainty_score":0.021641314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8982088,0.0038744872,0.044282787,0.017355002,0.00020700795,0.00010531139,0.0008608329,0.0026190889,0.03248673],"genre_scores_gemma":[0.9635151,0.002269609,0.019579098,0.0034653011,0.00009602016,0.00013602701,0.0009056725,0.002179051,0.007854161],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9833333,0.0053529623,0.0008417261,0.0025970717,0.006870961,0.0010038303],"domain_scores_gemma":[0.8764629,0.060453337,0.025814507,0.015709369,0.019696368,0.0018635163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010642822,0.00044467064,0.00040550964,0.0038014825,0.0017751694,0.0040950044,0.0014912816,0.0015101251,0.002046274],"category_scores_gemma":[0.107233025,0.0009990128,0.00040268,0.0042106886,0.0056593157,0.010437243,0.003476636,0.0022965763,0.0015545512],"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.0001421769,0.000124158,0.22549278,0.0012862331,0.0000984301,0.0014339263,0.29428235,0.0010121306,0.010353592,0.032576196,0.028142868,0.40505508],"study_design_scores_gemma":[0.000058920115,0.00036370268,0.27497548,0.0023677659,0.00014462817,0.008272327,0.16173266,0.006653406,0.018399052,0.04660614,0.480016,0.00040992265],"about_ca_topic_score_codex":0.004593227,"about_ca_topic_score_gemma":0.0056083878,"teacher_disagreement_score":0.010642822,"about_ca_system_score_codex":0.001578135,"about_ca_system_score_gemma":0.0026634613,"threshold_uncertainty_score":0.05628532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021023843,0.00008171412,0.96968836,0.0002151417,0.00005737552,0.00003371084,0.000046621553,0.0039338684,0.0049194675],"genre_scores_gemma":[0.4097139,0.0002003593,0.57498723,0.00046783697,0.00007935616,0.00022550729,0.00014880857,0.0036325285,0.010544553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888664,0.00028858127,0.000091024616,0.00014963376,0.0004683578,0.00011584346],"domain_scores_gemma":[0.99744093,0.00086024916,0.00016435202,0.0011740798,0.00026824937,0.00009218821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015759524,0.0004455432,0.00038589985,0.00038620734,0.0006561827,0.0018962476,0.0019272685,0.00064091716,0.0037621846],"category_scores_gemma":[0.0040304367,0.00046042592,0.0006228161,0.0004785974,0.0027231716,0.003966405,0.0028790066,0.0022177505,0.0009025219],"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.0002377696,0.00008931695,0.0017355749,0.00022115353,0.00002318311,0.00026988806,0.0012919734,0.025758302,0.031120855,0.7945228,0.004684761,0.14004453],"study_design_scores_gemma":[0.00007150663,0.00013536446,0.00036811142,0.00007184122,0.000043780088,0.0003626504,0.00017299483,0.22787002,0.083838426,0.6356531,0.051338386,0.00007389415],"about_ca_topic_score_codex":0.00063576386,"about_ca_topic_score_gemma":0.0009404778,"teacher_disagreement_score":0.0037621846,"about_ca_system_score_codex":0.0006348054,"about_ca_system_score_gemma":0.00087658456,"threshold_uncertainty_score":0.012585759},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022233054,0.000054987515,0.96222144,0.00016954802,0.0000318663,0.000108483815,0.001520384,0.030916784,0.002753074],"genre_scores_gemma":[0.09559629,0.00040437558,0.8707596,0.00059786777,0.00006610933,0.0006122204,0.010471209,0.013475761,0.008016566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998396,0.0003075944,0.0001913945,0.00028937298,0.00069095317,0.00012477579],"domain_scores_gemma":[0.99684465,0.0016474843,0.00023157841,0.00068697176,0.00048695385,0.0001023076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019005012,0.0013895354,0.0005614619,0.0011856774,0.0006127613,0.00271485,0.0028614225,0.0010347984,0.010068738],"category_scores_gemma":[0.005636946,0.0011035033,0.0024177788,0.00082186895,0.0016527568,0.003521049,0.0023919279,0.0027237972,0.0041044895],"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.00042844034,0.00022769133,0.0037882165,0.0015567857,0.00015895392,0.0005798016,0.0013185185,0.09339957,0.029802468,0.54860616,0.09645029,0.22368306],"study_design_scores_gemma":[0.00013321645,0.00016313262,0.0007184201,0.00023571434,0.00007108185,0.0005689586,0.0002887036,0.45032638,0.046654537,0.27841845,0.22231394,0.00010741805],"about_ca_topic_score_codex":0.0034117785,"about_ca_topic_score_gemma":0.0069022593,"teacher_disagreement_score":0.010068738,"about_ca_system_score_codex":0.0009920001,"about_ca_system_score_gemma":0.0023158577,"threshold_uncertainty_score":0.0336833},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032728917,0.00007412656,0.9899783,0.00025091143,0.000033861834,0.00020086911,0.00044616003,0.0036121234,0.002130594],"genre_scores_gemma":[0.11345146,0.0003739993,0.8777628,0.00042591375,0.000050400235,0.0007277095,0.0021507575,0.0015813981,0.0034756337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98767895,0.003894396,0.001828631,0.00087290455,0.0048869946,0.0008382013],"domain_scores_gemma":[0.9833572,0.00921619,0.0012604214,0.0032644283,0.0026343293,0.00026753263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00958797,0.0012700732,0.0007874089,0.0022314112,0.0012619903,0.0033256032,0.0027772752,0.0020571952,0.0077344403],"category_scores_gemma":[0.025063137,0.0018800864,0.0031445636,0.0013882305,0.0028428556,0.0061916523,0.0048071607,0.0036161868,0.0027536913],"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.00027410855,0.00015452581,0.0016419096,0.000961801,0.00012519049,0.0011174273,0.0013577021,0.09277184,0.022991532,0.7688706,0.009314101,0.10041939],"study_design_scores_gemma":[0.00016698238,0.00014730045,0.00034915414,0.0005125031,0.00012486715,0.0007347288,0.00041328577,0.47140402,0.054896876,0.3521947,0.11892861,0.00012699886],"about_ca_topic_score_codex":0.0032690444,"about_ca_topic_score_gemma":0.0046276134,"teacher_disagreement_score":0.00958797,"about_ca_system_score_codex":0.0020217628,"about_ca_system_score_gemma":0.0043005496,"threshold_uncertainty_score":0.050706685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093195476,0.0000707874,0.8966444,0.00034434223,0.000042977663,0.00019558398,0.00025300577,0.006090515,0.0031628287],"genre_scores_gemma":[0.6974213,0.00007648972,0.29846874,0.00021823958,0.000037504295,0.00019508338,0.00037736658,0.00058611087,0.0026192146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924299,0.0015515287,0.00071445806,0.0015364611,0.002844486,0.00092319597],"domain_scores_gemma":[0.9766283,0.010802888,0.0020070886,0.007315458,0.0028736207,0.00037257545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004529309,0.0007066025,0.0007072755,0.00077960454,0.0010028592,0.0031495509,0.0034640837,0.0015933834,0.0028904001],"category_scores_gemma":[0.026148824,0.0009952015,0.0016687537,0.0007781561,0.003228738,0.006268744,0.0040554893,0.002261594,0.00065596047],"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.0010102318,0.00039188034,0.009945782,0.0008586655,0.00021430044,0.0008841248,0.002015511,0.13034701,0.080301814,0.5751089,0.00371253,0.1952092],"study_design_scores_gemma":[0.00019678398,0.000359012,0.0006441462,0.00008262955,0.00015514332,0.00054247305,0.00033443864,0.4590308,0.25756934,0.2727689,0.008229988,0.00008622789],"about_ca_topic_score_codex":0.0034857972,"about_ca_topic_score_gemma":0.0031874308,"teacher_disagreement_score":0.004529309,"about_ca_system_score_codex":0.0023149953,"about_ca_system_score_gemma":0.004732655,"threshold_uncertainty_score":0.023953557},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022463538,0.00008500565,0.9724371,0.00020563572,0.00004394916,0.000042217114,0.00007985085,0.002505746,0.0021369664],"genre_scores_gemma":[0.5143459,0.00023026024,0.4783644,0.00021820361,0.000059013186,0.00014998917,0.0002468742,0.0010866962,0.005298784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961708,0.0010902511,0.00032980065,0.00065154163,0.0013482552,0.00040939645],"domain_scores_gemma":[0.99130696,0.0037631271,0.00095298904,0.002781357,0.0009319684,0.0002637104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065590367,0.0007280112,0.0005651068,0.0017527863,0.0015782282,0.0033029672,0.0025251615,0.0015486688,0.0030078613],"category_scores_gemma":[0.013298524,0.00095135975,0.0016065952,0.0013360012,0.005310679,0.01127751,0.004715423,0.0027517225,0.00057310733],"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.00023039684,0.00006503948,0.003488292,0.0001883657,0.00004703563,0.00028867056,0.0023797206,0.02706293,0.0107946675,0.86162186,0.0016819076,0.092151165],"study_design_scores_gemma":[0.000063597574,0.00014449096,0.0011643001,0.00018530231,0.00016003242,0.00050832785,0.00053887616,0.2399377,0.04770176,0.68034744,0.02909271,0.00015540961],"about_ca_topic_score_codex":0.006414896,"about_ca_topic_score_gemma":0.0059117246,"teacher_disagreement_score":0.0065590367,"about_ca_system_score_codex":0.0021562644,"about_ca_system_score_gemma":0.0025362512,"threshold_uncertainty_score":0.034687877},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008442861,0.0004290162,0.98243135,0.0008006384,0.00007694016,0.00017757868,0.000048273992,0.003525256,0.004068099],"genre_scores_gemma":[0.21374115,0.00093556626,0.7802728,0.0005436521,0.00026244044,0.0003955459,0.00019871978,0.0012644414,0.002385779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9556458,0.01382493,0.0038368667,0.0044829864,0.020562224,0.0016471695],"domain_scores_gemma":[0.88511544,0.06237651,0.0041577956,0.04223631,0.0055183736,0.0005955667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025922226,0.0016237128,0.0019600424,0.0038524347,0.0014518885,0.007654279,0.0047202194,0.0022749677,0.0044418974],"category_scores_gemma":[0.08451847,0.0026354177,0.002876114,0.0030499683,0.007974611,0.01709066,0.011653802,0.007110591,0.0015319363],"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.0005607799,0.00035415246,0.0057074,0.0014311537,0.00038712338,0.00095620484,0.0016322427,0.053876292,0.03608255,0.49755064,0.0040001143,0.3974614],"study_design_scores_gemma":[0.00030476524,0.00030583495,0.0007985295,0.0005363298,0.00045152684,0.0011952303,0.00033152162,0.24488787,0.04800022,0.6782655,0.024734996,0.00018772282],"about_ca_topic_score_codex":0.001300164,"about_ca_topic_score_gemma":0.0010509233,"teacher_disagreement_score":0.025922226,"about_ca_system_score_codex":0.0022393195,"about_ca_system_score_gemma":0.003663881,"threshold_uncertainty_score":0.13709146},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3597583,0.00040732868,0.54971766,0.0007012903,0.00030978568,0.000669589,0.00074805226,0.08307887,0.004609177],"genre_scores_gemma":[0.55748004,0.0003687375,0.42224875,0.0006131803,0.00007670051,0.00034373964,0.0021087495,0.010927939,0.005832239],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950594,0.0013069214,0.00061185396,0.0008097987,0.0017981828,0.00041387163],"domain_scores_gemma":[0.97203547,0.009218945,0.0019079285,0.011549327,0.004920026,0.00036826858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172956,0.0014514523,0.00058925763,0.0014759676,0.0007876825,0.0017037783,0.0030244773,0.0010672652,0.0012879156],"category_scores_gemma":[0.031453792,0.0011597505,0.0013215484,0.0011618829,0.0007861325,0.002747366,0.0021689455,0.0020604695,0.0013446708],"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.00086716784,0.000810778,0.047125272,0.001041289,0.0001853237,0.00270766,0.006469895,0.023692869,0.18157394,0.01046037,0.019567853,0.7054976],"study_design_scores_gemma":[0.00028310795,0.00072618434,0.022569312,0.00039932577,0.00062432094,0.0024266692,0.0015047276,0.45505196,0.38461873,0.017187634,0.11431149,0.00029648782],"about_ca_topic_score_codex":0.0035028446,"about_ca_topic_score_gemma":0.0042410214,"teacher_disagreement_score":0.004172956,"about_ca_system_score_codex":0.00084792526,"about_ca_system_score_gemma":0.0026057952,"threshold_uncertainty_score":0.022068918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03374565,0.00004868214,0.9577965,0.00013969479,0.000054152406,0.0001175943,0.00015238283,0.005948857,0.001996459],"genre_scores_gemma":[0.53677696,0.00016141552,0.4579524,0.00027455742,0.00004358678,0.00034101965,0.0004670635,0.0014869962,0.0024959717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933501,0.0013807584,0.00047267054,0.0009189005,0.0031467914,0.0007307538],"domain_scores_gemma":[0.9883959,0.00500446,0.0013777176,0.0032319527,0.0017735382,0.00021640699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00579844,0.00062527513,0.0006741449,0.00089973916,0.0007324873,0.0017315206,0.0019169644,0.0010576643,0.0023024816],"category_scores_gemma":[0.014634959,0.00094817986,0.0022190255,0.0004694593,0.003482913,0.003653818,0.0036083146,0.0027146111,0.0006663793],"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.00058771716,0.00020214872,0.004816165,0.00088187173,0.00013146599,0.002726504,0.003062798,0.10428488,0.25559783,0.5092897,0.0044232192,0.11399569],"study_design_scores_gemma":[0.00024003311,0.00052885147,0.0012327244,0.00020590935,0.00014481552,0.0011243282,0.00033351683,0.4418731,0.35138085,0.16876143,0.0340092,0.0001652869],"about_ca_topic_score_codex":0.0014337335,"about_ca_topic_score_gemma":0.0014561262,"teacher_disagreement_score":0.00579844,"about_ca_system_score_codex":0.0010484183,"about_ca_system_score_gemma":0.0023872831,"threshold_uncertainty_score":0.030665457},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056231343,0.0001239884,0.98872656,0.0016342709,0.000039066847,0.00006713065,0.00007024391,0.00040379236,0.0033118406],"genre_scores_gemma":[0.35063836,0.00034247185,0.64269143,0.001098529,0.00023598691,0.0005037136,0.00032071833,0.00044718024,0.0037215548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9855656,0.006150609,0.0013138229,0.0024958812,0.0034284804,0.001045603],"domain_scores_gemma":[0.9800044,0.012102573,0.0013249312,0.0035992188,0.0021829284,0.0007860168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012960603,0.0010857546,0.0012939207,0.0022168716,0.0023237949,0.007582733,0.0038040045,0.0031987168,0.0038373345],"category_scores_gemma":[0.030914579,0.0013425753,0.0039676726,0.0018827297,0.013540993,0.020874191,0.008108831,0.007335361,0.0007611463],"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.000012648002,0.00002311026,0.00014612642,0.000039266317,0.000015838266,0.000057845642,0.000529174,0.003343848,0.00041262803,0.990146,0.00033534796,0.00493817],"study_design_scores_gemma":[0.000013492582,0.000016480486,0.00007910099,0.000023959696,0.000020665979,0.00007451977,0.000109060085,0.030933568,0.0010757067,0.9637802,0.0038534498,0.00001980826],"about_ca_topic_score_codex":0.006468284,"about_ca_topic_score_gemma":0.0043428605,"teacher_disagreement_score":0.012960603,"about_ca_system_score_codex":0.0040810695,"about_ca_system_score_gemma":0.0032825086,"threshold_uncertainty_score":0.06854302},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016365409,0.00021939106,0.96864027,0.0005474586,0.00011477025,0.00010217676,0.00010835236,0.0048566204,0.009045567],"genre_scores_gemma":[0.27883363,0.00025513992,0.7059716,0.0005651303,0.00010735641,0.00033124967,0.00019838015,0.0022195987,0.011517877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802905,0.00042129087,0.00011003999,0.00040555853,0.0005826253,0.0004514303],"domain_scores_gemma":[0.9981166,0.0005607071,0.00017680254,0.0008394397,0.00017087984,0.0001355843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034835038,0.0006192833,0.0007058595,0.00081773684,0.0012486267,0.003066433,0.002155133,0.0016633011,0.0060842684],"category_scores_gemma":[0.0056773163,0.001043047,0.0019675216,0.00051370007,0.0035042346,0.00637993,0.0046147974,0.0030634066,0.0015116488],"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.00014151771,0.00003780453,0.0016515389,0.00016494114,0.000031052583,0.00029608567,0.001306159,0.0057397815,0.0134736,0.9158812,0.003737395,0.05753894],"study_design_scores_gemma":[0.00005508124,0.00017547603,0.0010604766,0.00027183938,0.000070165486,0.00069805974,0.00031571233,0.096823804,0.03598647,0.71684146,0.14756584,0.00013562519],"about_ca_topic_score_codex":0.002427759,"about_ca_topic_score_gemma":0.0019598335,"teacher_disagreement_score":0.0060842684,"about_ca_system_score_codex":0.0015926356,"about_ca_system_score_gemma":0.002071967,"threshold_uncertainty_score":0.020353913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0569926,0.00025422152,0.9341004,0.00084029103,0.00007006102,0.00022754911,0.00042713256,0.0026367214,0.0044510276],"genre_scores_gemma":[0.27891853,0.00024497617,0.7153522,0.0004988638,0.00007891184,0.00015822916,0.0012681236,0.00050403277,0.0029761626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792695,0.00048527974,0.00016463043,0.00057378766,0.00052039983,0.00032896473],"domain_scores_gemma":[0.9938996,0.004574563,0.00043139682,0.00056292774,0.0004421973,0.00008929373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022204006,0.00091664423,0.0006267638,0.0009597327,0.00076091243,0.0016704027,0.0017662974,0.0010238191,0.0043750633],"category_scores_gemma":[0.007598279,0.00064346084,0.002358764,0.000937973,0.0018700449,0.0038084507,0.0023196826,0.0022756269,0.0006052522],"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.00044381912,0.0003662959,0.0048058545,0.0014799036,0.00024585237,0.00087779475,0.0009797133,0.23483746,0.026159458,0.44096947,0.00813388,0.28070056],"study_design_scores_gemma":[0.00015238301,0.00013318655,0.000439905,0.00010884841,0.00012744348,0.0002905323,0.00027387645,0.59507096,0.036106423,0.3582685,0.008976737,0.000051164927],"about_ca_topic_score_codex":0.006001977,"about_ca_topic_score_gemma":0.009994038,"teacher_disagreement_score":0.006001977,"about_ca_system_score_codex":0.0016150592,"about_ca_system_score_gemma":0.0029441463,"threshold_uncertainty_score":0.01463604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008889156,0.0005024016,0.9818118,0.0011627572,0.00008985858,0.000076789845,0.000116418574,0.001983092,0.0053676846],"genre_scores_gemma":[0.28407052,0.0015538994,0.7036898,0.0011351323,0.00024040391,0.00022962372,0.00034258777,0.0014129537,0.007325028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523747,0.0014380943,0.00042382276,0.00085561496,0.0015796787,0.00046527717],"domain_scores_gemma":[0.9898371,0.0052078804,0.00052905787,0.00334339,0.00068439974,0.00039817343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008588449,0.0010636704,0.0010938054,0.0025854548,0.0017089043,0.0064258617,0.003032306,0.0024658544,0.006103214],"category_scores_gemma":[0.015260426,0.001611421,0.002482227,0.0017904668,0.0101253865,0.019763904,0.009817996,0.005083207,0.0012678282],"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.00015481739,0.00005761851,0.0015878939,0.0002518289,0.000061989675,0.0002839376,0.0020234315,0.0122774225,0.0024194361,0.86735445,0.0039449716,0.10958221],"study_design_scores_gemma":[0.000041420306,0.000044441742,0.00032081624,0.00022982563,0.00010100256,0.00019533548,0.00035333616,0.061163418,0.0065586185,0.90122736,0.029701209,0.0000632527],"about_ca_topic_score_codex":0.0060923365,"about_ca_topic_score_gemma":0.005009859,"teacher_disagreement_score":0.008588449,"about_ca_system_score_codex":0.0018250358,"about_ca_system_score_gemma":0.0024619822,"threshold_uncertainty_score":0.045420587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074839457,0.0003566251,0.98137605,0.0017249845,0.00018843556,0.00009493207,0.000069499634,0.0013088943,0.007396607],"genre_scores_gemma":[0.2882688,0.00071743684,0.699267,0.0017218132,0.0005904247,0.00040645563,0.00018406229,0.0007781178,0.008065898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99241275,0.0023415457,0.0006784794,0.0012412121,0.0027186994,0.0006073909],"domain_scores_gemma":[0.9863805,0.007061228,0.0009149628,0.0036433516,0.0015609832,0.0004389826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008665153,0.0006763967,0.00059151946,0.0011808927,0.0014999534,0.0050566844,0.0031160377,0.0016779492,0.004240707],"category_scores_gemma":[0.020504361,0.0015273868,0.0025150413,0.0008903739,0.0065145995,0.009471522,0.0070313476,0.008150341,0.0010903614],"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.000030581286,0.00002115191,0.0002875517,0.000069375405,0.000016270309,0.000099368764,0.00047317453,0.002803405,0.0014496528,0.98126847,0.0010895331,0.012391435],"study_design_scores_gemma":[0.000049292375,0.000052569078,0.00018103958,0.00011923143,0.000055303062,0.00018416204,0.00009177587,0.033675477,0.0049966704,0.93380785,0.026731016,0.000055720917],"about_ca_topic_score_codex":0.0022794052,"about_ca_topic_score_gemma":0.002029988,"teacher_disagreement_score":0.008665153,"about_ca_system_score_codex":0.0031046073,"about_ca_system_score_gemma":0.0028972642,"threshold_uncertainty_score":0.045826316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.983997,0.00010542971,0.011994059,0.00020008856,0.000026870513,0.00031277348,0.00016119266,0.0013045422,0.0018981076],"genre_scores_gemma":[0.9510392,0.00018176595,0.04237068,0.00045678788,0.000021910537,0.000701504,0.00062578777,0.00043804865,0.004164306],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980531,0.0010110983,0.00013568017,0.0003899652,0.00021705216,0.00019319404],"domain_scores_gemma":[0.9740311,0.019481177,0.00072009105,0.0028149048,0.0014964482,0.0014562632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031427643,0.0011924527,0.00071739126,0.0005335435,0.000631989,0.0012069686,0.0014870295,0.0013368324,0.0069941585],"category_scores_gemma":[0.023377575,0.0006298934,0.00052650395,0.00030696305,0.0008283554,0.002979729,0.0018430576,0.0015074249,0.0024276783],"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.020339241,0.029762546,0.068345055,0.0026601728,0.0003443926,0.0030934415,0.07661224,0.0106211845,0.106479265,0.0045251753,0.03029163,0.6469256],"study_design_scores_gemma":[0.01084654,0.1159655,0.20208918,0.0011656876,0.00104724,0.0068458607,0.05019422,0.2618971,0.17015794,0.017180994,0.16131654,0.0012932046],"about_ca_topic_score_codex":0.0012409071,"about_ca_topic_score_gemma":0.0016099334,"teacher_disagreement_score":0.0069941585,"about_ca_system_score_codex":0.00028170834,"about_ca_system_score_gemma":0.00054706197,"threshold_uncertainty_score":0.023397803},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06268211,0.0001680682,0.9230271,0.0013559591,0.00010954914,0.00022108757,0.0002611568,0.0021175428,0.010057489],"genre_scores_gemma":[0.5381828,0.0002743245,0.45440546,0.0010196543,0.00014449167,0.000223811,0.0005073608,0.0005776027,0.00466452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923543,0.002157093,0.0004793513,0.001346774,0.0030259204,0.00063650665],"domain_scores_gemma":[0.9688775,0.019946013,0.0013287734,0.0055811084,0.0036027797,0.0006638326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008372769,0.00069965544,0.0007018339,0.0009950972,0.001572159,0.003101812,0.0019868095,0.0012114571,0.0045768917],"category_scores_gemma":[0.029174577,0.0008970517,0.0017896983,0.00073901145,0.0052902517,0.0100616915,0.008753535,0.0036104475,0.0007760789],"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.00020387843,0.00018195236,0.0031969165,0.00045980042,0.00012392084,0.00068439665,0.0021113083,0.011667111,0.02006271,0.89226556,0.0032401965,0.065802276],"study_design_scores_gemma":[0.000072169045,0.000092316,0.0005573229,0.000118557,0.00009155103,0.00045467028,0.00051089807,0.06997628,0.043668102,0.8688819,0.015514669,0.00006156601],"about_ca_topic_score_codex":0.0019963384,"about_ca_topic_score_gemma":0.0031861009,"teacher_disagreement_score":0.008372769,"about_ca_system_score_codex":0.0015484632,"about_ca_system_score_gemma":0.004051495,"threshold_uncertainty_score":0.044279933},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04971426,0.00013716136,0.9377701,0.0002850505,0.000079478734,0.00013316468,0.00027937963,0.0062219473,0.0053794314],"genre_scores_gemma":[0.40689245,0.00026782122,0.5832975,0.00026659382,0.000033269658,0.00029947323,0.00076892856,0.0026961563,0.0054778894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974784,0.00073004107,0.00019381242,0.0003302068,0.0010228257,0.0002446353],"domain_scores_gemma":[0.9947037,0.0023342664,0.0003784176,0.0017897963,0.000707705,0.0000861774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002694565,0.00054453337,0.00041858057,0.00073842646,0.00042072337,0.001047662,0.0010202398,0.00059820677,0.00393545],"category_scores_gemma":[0.008313777,0.00048515608,0.0008845183,0.0008142704,0.0015725797,0.0023037943,0.0015381185,0.0013993677,0.00080529245],"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.00042221774,0.00025429946,0.0064058034,0.00078481686,0.00013947085,0.0008505197,0.00085678464,0.28679594,0.10575464,0.23819797,0.009738687,0.34979877],"study_design_scores_gemma":[0.00012019345,0.00018140467,0.00071712054,0.000095570846,0.00008231654,0.00027496804,0.0002188803,0.6822994,0.13792153,0.13055883,0.047470648,0.000059179998],"about_ca_topic_score_codex":0.0015205482,"about_ca_topic_score_gemma":0.0024471483,"teacher_disagreement_score":0.00393545,"about_ca_system_score_codex":0.0008633881,"about_ca_system_score_gemma":0.0020681412,"threshold_uncertainty_score":0.014250398},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03139587,0.00022067424,0.9259797,0.00036042344,0.00013086853,0.00017769306,0.00031303606,0.03429244,0.0071293884],"genre_scores_gemma":[0.5727504,0.0003010795,0.40776005,0.0003588686,0.00006494129,0.00039215587,0.0014309025,0.007817263,0.009124431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978301,0.0007979316,0.00013699805,0.00024789732,0.00068903866,0.0002979868],"domain_scores_gemma":[0.99705637,0.0010667507,0.0002132167,0.0012015495,0.00025722128,0.00020490208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028531554,0.00047342925,0.0003474369,0.00035121085,0.00048344958,0.0013328146,0.001730746,0.0008412732,0.0052603483],"category_scores_gemma":[0.0068973815,0.00067353103,0.00051371625,0.00032724717,0.0013002804,0.003565015,0.003270687,0.0018202863,0.0012277741],"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.0018481413,0.00047642327,0.00820968,0.00080369407,0.00013928155,0.00086571084,0.001304712,0.20356046,0.057139784,0.35677952,0.048622515,0.32025006],"study_design_scores_gemma":[0.00023789513,0.00016048033,0.0007538491,0.000108972126,0.000020115991,0.00024425492,0.00007852786,0.75061136,0.041659325,0.10070212,0.1053574,0.000065675966],"about_ca_topic_score_codex":0.001558096,"about_ca_topic_score_gemma":0.0016142934,"teacher_disagreement_score":0.0052603483,"about_ca_system_score_codex":0.0008148507,"about_ca_system_score_gemma":0.0020729504,"threshold_uncertainty_score":0.017597616},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018963125,0.0005378596,0.95917195,0.0010395994,0.00013448721,0.00005429232,0.00013302208,0.0012894364,0.0186763],"genre_scores_gemma":[0.5816527,0.0009313952,0.40134034,0.0015318879,0.00038251388,0.00024042853,0.00045465434,0.0005300284,0.012936049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959751,0.0009871772,0.00033901902,0.00076887704,0.0014919285,0.0004378989],"domain_scores_gemma":[0.99607736,0.0021875624,0.00028476305,0.00059346016,0.00067065156,0.00018622345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030957297,0.0008297667,0.0005447696,0.0013804283,0.001648406,0.0031347792,0.0015553301,0.0011878014,0.004071506],"category_scores_gemma":[0.0059769014,0.0006524402,0.0018448734,0.001095473,0.005675403,0.008619043,0.0037792423,0.0035911582,0.0008246715],"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.000032009335,0.0000141758555,0.00008941202,0.00004888667,0.000007919256,0.00009020287,0.00025723476,0.003830567,0.001167061,0.98518085,0.00068189914,0.008599769],"study_design_scores_gemma":[0.000020731008,0.000017300374,0.000045359047,0.000028929382,0.000013463064,0.000056675293,0.00004234792,0.021907378,0.0019024942,0.9664351,0.00951224,0.000018135892],"about_ca_topic_score_codex":0.0038745038,"about_ca_topic_score_gemma":0.0026286307,"teacher_disagreement_score":0.004071506,"about_ca_system_score_codex":0.003467025,"about_ca_system_score_gemma":0.0023401903,"threshold_uncertainty_score":0.025155127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006005252,0.0000757099,0.987677,0.000372062,0.00007266868,0.000059721602,0.00006549759,0.0021982247,0.0034739692],"genre_scores_gemma":[0.2206352,0.00020909392,0.77186203,0.0005081755,0.000042943662,0.00023460548,0.00031154632,0.0014713285,0.004725119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99685043,0.0012210398,0.0002647507,0.00029554998,0.0010392382,0.00032897736],"domain_scores_gemma":[0.99537295,0.0023015232,0.00032834068,0.0013908424,0.0005103572,0.00009605968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003928001,0.0006849745,0.00038667113,0.00082594674,0.00092997396,0.0037024003,0.0020730984,0.0013646809,0.004119326],"category_scores_gemma":[0.011822732,0.0005327427,0.0013510198,0.0005497435,0.0034763918,0.0042908886,0.0026120362,0.0029359218,0.0008271773],"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.00012096757,0.00006382389,0.0011714135,0.0002749314,0.000024496634,0.00035773107,0.0011568791,0.04162013,0.007960535,0.87988424,0.0043820348,0.06298281],"study_design_scores_gemma":[0.000062929146,0.00016196529,0.0003556065,0.00042794447,0.00006342863,0.000438081,0.0003412826,0.27233148,0.03959531,0.533405,0.1527291,0.000087902175],"about_ca_topic_score_codex":0.0032683269,"about_ca_topic_score_gemma":0.0049684956,"teacher_disagreement_score":0.004119326,"about_ca_system_score_codex":0.0019631353,"about_ca_system_score_gemma":0.0029354668,"threshold_uncertainty_score":0.02077353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21246928,0.0027319868,0.70798117,0.010743607,0.00016528757,0.00015959956,0.0010454031,0.0013026963,0.0634009],"genre_scores_gemma":[0.83514017,0.0020616364,0.15615194,0.001395687,0.00030305394,0.00025437548,0.00067752966,0.0004218299,0.0035939368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9862787,0.005609553,0.0011901533,0.0019891642,0.0035332744,0.0013991112],"domain_scores_gemma":[0.9378139,0.053030662,0.0020116596,0.0051121116,0.0013976455,0.00063409226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013303192,0.0009738712,0.0014125744,0.003920056,0.0018114374,0.009309274,0.0028103057,0.0023962473,0.0054316455],"category_scores_gemma":[0.038641036,0.0010177037,0.003093457,0.0047318125,0.011876086,0.025546266,0.0062685832,0.0062627196,0.00052179146],"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.00013528188,0.000055650402,0.0017950583,0.00021314799,0.000053004944,0.00022929812,0.0009970696,0.015006065,0.003135044,0.95227027,0.00073426915,0.025375811],"study_design_scores_gemma":[0.000016150589,0.000031833908,0.00024059087,0.0000613576,0.000030907373,0.00016990125,0.00026204032,0.02626195,0.002078227,0.96823364,0.0025909552,0.000022481412],"about_ca_topic_score_codex":0.0012475246,"about_ca_topic_score_gemma":0.0009383887,"teacher_disagreement_score":0.013303192,"about_ca_system_score_codex":0.0022154956,"about_ca_system_score_gemma":0.0010541044,"threshold_uncertainty_score":0.07035482},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011162183,0.0001247822,0.9869768,0.00006554598,0.000014065293,0.00008635788,0.000026265803,0.00075903855,0.0007850346],"genre_scores_gemma":[0.21741278,0.0001978098,0.7806497,0.00014061974,0.000031886055,0.0001786715,0.00012909359,0.00034247868,0.00091691787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9862881,0.0049479865,0.0016376545,0.0019072604,0.0042615277,0.0009575059],"domain_scores_gemma":[0.96872586,0.021099834,0.0014080064,0.005883373,0.0024504226,0.00043248732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010659594,0.0008409519,0.0009589329,0.0016540105,0.001311468,0.002854044,0.0016803753,0.00085320906,0.0021860881],"category_scores_gemma":[0.03548984,0.0015251269,0.0023413796,0.0015278754,0.0040457617,0.007948222,0.0038781972,0.002889757,0.00073000503],"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.0006112182,0.00016358503,0.0049854736,0.00058209215,0.00021229453,0.00034989035,0.0017909544,0.08701764,0.024112362,0.62853193,0.0014213065,0.25022116],"study_design_scores_gemma":[0.00008984741,0.00018372113,0.0005872061,0.00014139363,0.00018397975,0.00024436478,0.00014095378,0.26924932,0.05115535,0.67021954,0.0077253096,0.00007898696],"about_ca_topic_score_codex":0.002817544,"about_ca_topic_score_gemma":0.0032188117,"teacher_disagreement_score":0.010659594,"about_ca_system_score_codex":0.0019595667,"about_ca_system_score_gemma":0.0041230875,"threshold_uncertainty_score":0.056373954},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007051299,0.000059148333,0.9861937,0.0001503681,0.000027558573,0.000060266288,0.00012005597,0.005386319,0.00095133175],"genre_scores_gemma":[0.21629883,0.000104627296,0.77724695,0.0003551943,0.000045703833,0.00024930126,0.00057189184,0.0024447248,0.0026827138],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687994,0.0010894078,0.00021145404,0.00059374946,0.00095877354,0.00026677016],"domain_scores_gemma":[0.98974437,0.0062655346,0.00037009426,0.0025172504,0.00092498556,0.00017769616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035386262,0.0009131313,0.0008432158,0.00084769254,0.0007024431,0.0014814226,0.0028529344,0.0015165211,0.0051929094],"category_scores_gemma":[0.018090418,0.0010423423,0.0015297286,0.0007291269,0.0023447804,0.003694425,0.003641792,0.0038196142,0.0018156638],"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.0005652127,0.00031109105,0.0045625754,0.00087008084,0.00015702502,0.00037639507,0.0010156659,0.24111463,0.026745267,0.27239215,0.015067453,0.43682238],"study_design_scores_gemma":[0.000044128068,0.00005709431,0.00015751441,0.000051933574,0.000043136642,0.00011649383,0.000049971764,0.7929521,0.015059828,0.18633832,0.005103501,0.000025939944],"about_ca_topic_score_codex":0.0019840053,"about_ca_topic_score_gemma":0.004740565,"teacher_disagreement_score":0.0051929094,"about_ca_system_score_codex":0.0011613833,"about_ca_system_score_gemma":0.0025509985,"threshold_uncertainty_score":0.01871425},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007952284,0.0001666816,0.97021043,0.0007176627,0.00016877335,0.000089313144,0.00032522916,0.007833812,0.012535771],"genre_scores_gemma":[0.32617635,0.00050080783,0.6384168,0.0019477854,0.00025101745,0.0006916891,0.00082126685,0.004032921,0.027161304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981558,0.0005207535,0.00014324232,0.00037576296,0.0005338715,0.0002705429],"domain_scores_gemma":[0.9981838,0.0007703944,0.00014801872,0.00048545,0.00029685607,0.00011546415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027962707,0.0005364648,0.0005271394,0.0008514711,0.001111594,0.0020021887,0.001766527,0.0011313565,0.008690762],"category_scores_gemma":[0.0036101649,0.0007352077,0.0015841955,0.00073178957,0.0034835883,0.0062353527,0.004011381,0.0032901587,0.0019901055],"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.00008937431,0.000028612094,0.0002488408,0.00012133872,0.00001290331,0.00013520702,0.000528455,0.0017021856,0.0031345792,0.9678666,0.0048596445,0.021272268],"study_design_scores_gemma":[0.00005921714,0.000118743315,0.0003887607,0.00011253771,0.000042373038,0.0005770567,0.00015959362,0.042520322,0.014086822,0.77412987,0.16770579,0.00009890831],"about_ca_topic_score_codex":0.0013053052,"about_ca_topic_score_gemma":0.0011908346,"teacher_disagreement_score":0.008690762,"about_ca_system_score_codex":0.00108073,"about_ca_system_score_gemma":0.0015289992,"threshold_uncertainty_score":0.029073536},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032999896,0.0012279805,0.9450559,0.0024132854,0.00013683658,0.00019623566,0.00013295279,0.007952049,0.009884835],"genre_scores_gemma":[0.26484323,0.00090539304,0.72413737,0.0014630647,0.00015625978,0.0004004718,0.00033479423,0.003849895,0.00390956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9875048,0.0036379264,0.0008495531,0.0023173927,0.004726996,0.0009633507],"domain_scores_gemma":[0.9657926,0.0178357,0.0021812292,0.0109289475,0.0028183733,0.00044304598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008714531,0.0016349832,0.0012750772,0.0018297848,0.0014423673,0.0034593758,0.0048400573,0.0016694258,0.0032298043],"category_scores_gemma":[0.030450627,0.0015244096,0.0024113194,0.0010404057,0.0065121255,0.008768667,0.00775985,0.0055490355,0.001119099],"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.0005299249,0.00041473983,0.004441574,0.0020986595,0.00021987839,0.0005417875,0.001690357,0.06674919,0.06369172,0.5121967,0.00911694,0.3383086],"study_design_scores_gemma":[0.00015806763,0.0006112027,0.001015372,0.0005570378,0.00028152563,0.0009823708,0.00034976122,0.22924426,0.07417994,0.6370975,0.055343427,0.00017944272],"about_ca_topic_score_codex":0.0014059332,"about_ca_topic_score_gemma":0.0026113235,"teacher_disagreement_score":0.008714531,"about_ca_system_score_codex":0.0019527375,"about_ca_system_score_gemma":0.0040500597,"threshold_uncertainty_score":0.046087384},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045206537,0.00011292368,0.87935346,0.00020597798,0.00012140642,0.00012518791,0.0010545393,0.1114556,0.0030502484],"genre_scores_gemma":[0.10537627,0.0002209116,0.85088015,0.0006213465,0.00009173248,0.00031360166,0.0034045589,0.028096719,0.010994631],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970113,0.00044303006,0.00033245306,0.0009353338,0.0009775606,0.00030026239],"domain_scores_gemma":[0.9960998,0.0013152666,0.00023757626,0.0015095255,0.0007141988,0.00012346233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025996591,0.0016754374,0.001245899,0.0017450957,0.0010084924,0.00343561,0.0042353706,0.002172055,0.015142094],"category_scores_gemma":[0.008863979,0.002150722,0.002998195,0.0018351524,0.0031316604,0.007132077,0.005786314,0.0032547752,0.009170741],"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.0011042119,0.00029323483,0.004604423,0.0010154933,0.00023298303,0.0012446071,0.0012495107,0.056154888,0.047796972,0.27890658,0.10749509,0.49990204],"study_design_scores_gemma":[0.0003138926,0.00020957629,0.0009339934,0.00019376948,0.0001971974,0.001503949,0.00024547067,0.39919233,0.15275015,0.28608614,0.1579397,0.00043379454],"about_ca_topic_score_codex":0.0054035443,"about_ca_topic_score_gemma":0.00646093,"teacher_disagreement_score":0.015142094,"about_ca_system_score_codex":0.0020204922,"about_ca_system_score_gemma":0.004815814,"threshold_uncertainty_score":0.050655305},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076489694,0.00034476558,0.91563743,0.00026781292,0.00006144297,0.00003951982,0.00012022608,0.004375132,0.0026639893],"genre_scores_gemma":[0.6813558,0.00022333187,0.3154939,0.00014888961,0.000053371692,0.000097683485,0.0003507052,0.00034340614,0.0019329523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996885,0.00007201336,0.000024603542,0.000074436044,0.0000972779,0.000043291726],"domain_scores_gemma":[0.9988808,0.00055787736,0.00010412243,0.00032676564,0.00010552948,0.000024990524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004299601,0.0003915508,0.000424565,0.0004131071,0.00035235865,0.00044903203,0.0007103914,0.00030665385,0.0021434817],"category_scores_gemma":[0.0038952723,0.00028006913,0.00037782284,0.00053277164,0.0005880921,0.0014274169,0.0007153684,0.0008225976,0.0004379483],"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.0003092291,0.000082604856,0.002028919,0.00010769297,0.000043924778,0.00014249732,0.00017388733,0.6344683,0.01999983,0.020899141,0.0038952923,0.31784865],"study_design_scores_gemma":[0.000010568146,0.000039038674,0.00010253677,0.0000048297456,0.000005785567,0.000019562114,0.000014039133,0.98220855,0.00819932,0.008317575,0.0010739948,0.0000041493586],"about_ca_topic_score_codex":0.004546448,"about_ca_topic_score_gemma":0.0090688765,"teacher_disagreement_score":0.004546448,"about_ca_system_score_codex":0.00047443868,"about_ca_system_score_gemma":0.0010884373,"threshold_uncertainty_score":0.009039938},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028670323,0.00028132604,0.9566492,0.0005137093,0.0002532853,0.00015006588,0.0006482355,0.030480416,0.008156809],"genre_scores_gemma":[0.12293216,0.000664487,0.8363511,0.0014093934,0.00030060977,0.0007064526,0.0026684133,0.02096955,0.0139978565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926272,0.0014250961,0.00065768167,0.00097073475,0.003696668,0.00062271557],"domain_scores_gemma":[0.9918337,0.0030192076,0.0006963525,0.0030969977,0.0011657818,0.00018793945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005530996,0.0013893507,0.0012469538,0.002048442,0.0014817091,0.0052527087,0.0042023137,0.0022516276,0.022969177],"category_scores_gemma":[0.023699805,0.0022284905,0.003618213,0.0014693877,0.004021586,0.013713514,0.006594471,0.005258026,0.00817977],"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.0006587445,0.00009058786,0.0026970222,0.00076154957,0.00007820438,0.00040031347,0.000833071,0.01987383,0.011543538,0.7636686,0.036877144,0.1625174],"study_design_scores_gemma":[0.00016742796,0.00022244554,0.0006250529,0.0006460555,0.00013084583,0.00064400706,0.0002084382,0.12324566,0.03822472,0.46407357,0.37158436,0.00022741771],"about_ca_topic_score_codex":0.004691685,"about_ca_topic_score_gemma":0.0050649196,"teacher_disagreement_score":0.022969177,"about_ca_system_score_codex":0.0030483347,"about_ca_system_score_gemma":0.0043961564,"threshold_uncertainty_score":0.076839566},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015467157,0.000121322366,0.9717063,0.000670458,0.00007728174,0.00006631625,0.000056359644,0.0022906198,0.009544245],"genre_scores_gemma":[0.37332815,0.0003861721,0.6129502,0.00055891846,0.00012038578,0.0003143215,0.00017193529,0.00115107,0.011018848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636626,0.0013875036,0.00019697762,0.0005636551,0.0012084434,0.00027721876],"domain_scores_gemma":[0.9934109,0.002679094,0.00035646893,0.0027842778,0.00059510296,0.00017414062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004511075,0.00043654095,0.00040641846,0.001253541,0.0012351348,0.0022211084,0.0024088544,0.0009438993,0.0046632187],"category_scores_gemma":[0.009485203,0.00071256893,0.0013333763,0.0005845262,0.0044996035,0.005095874,0.006609996,0.0027794496,0.0010883393],"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.00004373192,0.000038276234,0.0006190209,0.000101773876,0.000022763094,0.00031237304,0.00120757,0.00674683,0.0068521,0.9423972,0.001990316,0.039667998],"study_design_scores_gemma":[0.00007595086,0.00010930583,0.0004056958,0.00016460627,0.000064707114,0.0011771613,0.00040957725,0.074867226,0.029529015,0.78320575,0.10989864,0.00009236896],"about_ca_topic_score_codex":0.0008514686,"about_ca_topic_score_gemma":0.0011143363,"teacher_disagreement_score":0.0046632187,"about_ca_system_score_codex":0.00093615794,"about_ca_system_score_gemma":0.0017737597,"threshold_uncertainty_score":0.023857117},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025157785,0.00014894665,0.96766764,0.00020161728,0.000036096175,0.00013338626,0.00013452719,0.0037476502,0.0027723873],"genre_scores_gemma":[0.40467843,0.00021906348,0.59059364,0.00021084094,0.00003752226,0.00036842827,0.00068949925,0.0005439695,0.0026585255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985275,0.00043446044,0.00010493177,0.00048728354,0.00026560994,0.0001800978],"domain_scores_gemma":[0.9970716,0.0017923015,0.00022364469,0.0006330411,0.00022357047,0.000055771696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011451452,0.0007379681,0.00071328063,0.0007615964,0.0007809034,0.0009866063,0.0011643015,0.0011424077,0.004157298],"category_scores_gemma":[0.0058161616,0.0004332142,0.0018742131,0.0007847075,0.002008793,0.002624134,0.0018686712,0.0014342204,0.00094294874],"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.00031203634,0.00019226302,0.0018443015,0.0006523945,0.00007889559,0.0007944256,0.001140957,0.4006468,0.042747382,0.37701488,0.0039813556,0.17059438],"study_design_scores_gemma":[0.000029057264,0.00012347235,0.0002803404,0.000066182954,0.00004781545,0.00015946785,0.000086641485,0.6815243,0.020402858,0.29160482,0.005637262,0.000037819613],"about_ca_topic_score_codex":0.002344118,"about_ca_topic_score_gemma":0.0029652428,"teacher_disagreement_score":0.004157298,"about_ca_system_score_codex":0.0011720334,"about_ca_system_score_gemma":0.0016188872,"threshold_uncertainty_score":0.013907552},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41726717,0.0009164854,0.5445199,0.00767437,0.00020622762,0.00026562324,0.0013111319,0.0038326408,0.024006484],"genre_scores_gemma":[0.9375468,0.00040180288,0.05579814,0.00071542815,0.000387047,0.0001438513,0.0006996489,0.0005800371,0.0037273206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99384487,0.0010934367,0.00031487236,0.0016452881,0.0016292182,0.0014722086],"domain_scores_gemma":[0.9445589,0.046835992,0.0019922396,0.0038045307,0.0014840409,0.0013242385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044720555,0.00111262,0.0016676759,0.0018161001,0.0028534161,0.0050888993,0.0032342873,0.0021863366,0.0061585316],"category_scores_gemma":[0.028927801,0.0012099872,0.003924629,0.001551825,0.008235572,0.013240835,0.007182861,0.0081777,0.0008034548],"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.001428734,0.0004255719,0.0050218734,0.0008686826,0.00015707391,0.00058509555,0.0018385871,0.09809736,0.010299454,0.8220324,0.008941544,0.050303552],"study_design_scores_gemma":[0.00007875711,0.000089171015,0.0005811764,0.000047128633,0.00007831798,0.00014663546,0.00020012035,0.11179743,0.0060790423,0.87896717,0.001879292,0.00005579365],"about_ca_topic_score_codex":0.0022498854,"about_ca_topic_score_gemma":0.0022828358,"teacher_disagreement_score":0.0061585316,"about_ca_system_score_codex":0.0031566399,"about_ca_system_score_gemma":0.00241413,"threshold_uncertainty_score":0.023650825},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006661176,0.00018267069,0.94096583,0.00017859013,0.00019700486,0.0001194683,0.00034947798,0.047739424,0.003606359],"genre_scores_gemma":[0.15977447,0.00037058422,0.81182164,0.0006293737,0.00024130514,0.0004924195,0.0012657136,0.015646422,0.0097580645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782914,0.00029225383,0.00025269654,0.00047271783,0.0009279733,0.00022532619],"domain_scores_gemma":[0.9947725,0.001413128,0.00043158059,0.0022017672,0.00086954905,0.00031150575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027936618,0.0008340048,0.00069346995,0.0014380347,0.0007096434,0.0029957215,0.002452537,0.0008879881,0.0054634265],"category_scores_gemma":[0.012056732,0.0010611209,0.0012520071,0.0006907653,0.0020099566,0.004074874,0.003327192,0.0021448946,0.0019426524],"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.0007443992,0.00017336642,0.005430139,0.0007187429,0.00012368395,0.0008977631,0.00217102,0.0282716,0.05739166,0.52400815,0.036377635,0.34369183],"study_design_scores_gemma":[0.00022035338,0.00019531262,0.0016604555,0.0003591727,0.00020427088,0.0006435916,0.00016050738,0.20836121,0.15841791,0.1678751,0.46165207,0.0002499578],"about_ca_topic_score_codex":0.0029217477,"about_ca_topic_score_gemma":0.002901193,"teacher_disagreement_score":0.0054634265,"about_ca_system_score_codex":0.0012749673,"about_ca_system_score_gemma":0.002436858,"threshold_uncertainty_score":0.01827699},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045677174,0.00042800506,0.9427974,0.00028601915,0.000076501354,0.00009441099,0.0001982692,0.007568176,0.0028740643],"genre_scores_gemma":[0.63697726,0.00044219528,0.35812896,0.00040012025,0.00007346056,0.00023785564,0.0003989773,0.0012086624,0.0021325524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936845,0.0016262095,0.00044078013,0.00077679206,0.002854062,0.00061758835],"domain_scores_gemma":[0.98946077,0.004832441,0.0011941183,0.0032737167,0.0010597069,0.00017920797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002966647,0.0016607748,0.0011002393,0.0032726384,0.0009294642,0.0024905317,0.00195545,0.001022795,0.0019000337],"category_scores_gemma":[0.010319246,0.00097160565,0.0023991778,0.0015853799,0.0039917873,0.0055395127,0.0041208733,0.0027721557,0.00048084374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00061059487,0.00028831832,0.013684464,0.0011191315,0.00045261008,0.00056212646,0.0011833137,0.4140231,0.08880519,0.25071737,0.0056244764,0.22292931],"study_design_scores_gemma":[0.000043558033,0.00022057166,0.00089066115,0.00014048065,0.00022289749,0.00026043135,0.00011452583,0.75602746,0.081809536,0.15181582,0.00835733,0.00009665385],"about_ca_topic_score_codex":0.001943999,"about_ca_topic_score_gemma":0.0030947293,"teacher_disagreement_score":0.0032726384,"about_ca_system_score_codex":0.002293923,"about_ca_system_score_gemma":0.0028997753,"threshold_uncertainty_score":0.016643703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053858083,0.00019485196,0.9214406,0.0007246709,0.00040714152,0.00019880803,0.00030667763,0.008362662,0.014506494],"genre_scores_gemma":[0.646789,0.00021086105,0.3301634,0.0007504446,0.00021832653,0.0003111907,0.0004960557,0.0021411527,0.018919475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985669,0.00022805859,0.000081685284,0.00035990853,0.0004723893,0.00029118414],"domain_scores_gemma":[0.9971625,0.0007427555,0.00023388407,0.0011791983,0.0005485716,0.00013298483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022642617,0.00055616547,0.00051498704,0.00081740145,0.0017614614,0.002151369,0.0011711323,0.0015544277,0.0072414726],"category_scores_gemma":[0.0039156047,0.00044597153,0.0014046557,0.00036819858,0.0036842471,0.0025797188,0.0030772358,0.0022041143,0.0019274161],"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.0003844347,0.00016255309,0.003763302,0.0004234082,0.00007563632,0.0017239243,0.0017598185,0.011682006,0.0571305,0.8556746,0.008955047,0.058264695],"study_design_scores_gemma":[0.00017979332,0.0004841714,0.0026302978,0.00020129942,0.0002395667,0.0020646024,0.0002955434,0.08643315,0.13322876,0.59368086,0.1802924,0.00026969268],"about_ca_topic_score_codex":0.0024366272,"about_ca_topic_score_gemma":0.0020784105,"teacher_disagreement_score":0.0072414726,"about_ca_system_score_codex":0.0013156515,"about_ca_system_score_gemma":0.0023130642,"threshold_uncertainty_score":0.024225116},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002824766,0.00014737109,0.9040072,0.0003587888,0.000090752525,0.00022991165,0.011258008,0.0768127,0.004270581],"genre_scores_gemma":[0.05173205,0.0005725779,0.8813773,0.0009959618,0.000076324424,0.0010224577,0.028195383,0.02859245,0.0074354997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871707,0.0002958062,0.0002623646,0.00027526272,0.00035692612,0.000092597016],"domain_scores_gemma":[0.9965624,0.0019939204,0.00025014655,0.0006981908,0.00037247245,0.00012288414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002337748,0.0016109239,0.0009874932,0.002128734,0.0008908046,0.0031770938,0.0027445403,0.0016629131,0.01416006],"category_scores_gemma":[0.0064878208,0.002348946,0.002737839,0.0013848599,0.0017260342,0.0045774216,0.0031610574,0.0035497588,0.0064219595],"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.0005481912,0.00020091096,0.007263327,0.0024466258,0.00023608525,0.0010352456,0.0028410563,0.06251957,0.023067772,0.4392267,0.21430059,0.24631388],"study_design_scores_gemma":[0.00016513988,0.000092665825,0.00076511677,0.00030271735,0.00007150854,0.0010201144,0.00035123967,0.16361798,0.025181493,0.14954178,0.6587319,0.00015831958],"about_ca_topic_score_codex":0.0055210902,"about_ca_topic_score_gemma":0.011002524,"teacher_disagreement_score":0.01416006,"about_ca_system_score_codex":0.0016885189,"about_ca_system_score_gemma":0.0029149724,"threshold_uncertainty_score":0.047370136},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019274646,0.000051647377,0.9687709,0.0008275231,0.000099198376,0.00010438729,0.00011705136,0.0026651807,0.0080893515],"genre_scores_gemma":[0.54807335,0.00031121998,0.4359668,0.0011133372,0.000156289,0.00039601556,0.00025312311,0.0012639336,0.012465971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99497294,0.0017333407,0.00038354733,0.00068531843,0.0015362566,0.0006885481],"domain_scores_gemma":[0.9889136,0.0053578215,0.00048207698,0.003430083,0.0014724527,0.00034407913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006098403,0.0004928154,0.0005182262,0.0008350342,0.0014539078,0.0033201566,0.002871235,0.0014804623,0.008236518],"category_scores_gemma":[0.015436418,0.0011515114,0.0017012415,0.00072978286,0.0058113467,0.010304735,0.0077419532,0.00515509,0.0017732836],"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.00007070875,0.00005916609,0.00068503834,0.00014044183,0.000027311864,0.00019133139,0.0011485327,0.006711085,0.008405354,0.96249336,0.001777112,0.018290445],"study_design_scores_gemma":[0.00013719208,0.00015899859,0.0005311829,0.0001576874,0.00015348646,0.00039865266,0.00065481337,0.0805222,0.066223174,0.81127894,0.039644625,0.00013917297],"about_ca_topic_score_codex":0.003166098,"about_ca_topic_score_gemma":0.0037174309,"teacher_disagreement_score":0.008236518,"about_ca_system_score_codex":0.0019212936,"about_ca_system_score_gemma":0.005208498,"threshold_uncertainty_score":0.032251835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101791965,0.00059300335,0.9731119,0.0005930314,0.00017887718,0.00011560088,0.0001413093,0.0031379526,0.011949132],"genre_scores_gemma":[0.26052463,0.0017173997,0.705153,0.00087887136,0.00038895995,0.00041190692,0.0006107407,0.0072199553,0.023094606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99549663,0.00110715,0.0003558298,0.00086887425,0.001479684,0.0006918123],"domain_scores_gemma":[0.99045336,0.0038668888,0.00061760977,0.003257512,0.0015152502,0.00028940465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00569847,0.0011605639,0.001227808,0.001991357,0.0027501057,0.0065606027,0.002484385,0.0014518995,0.005731687],"category_scores_gemma":[0.013239906,0.0014409231,0.0022163517,0.0017105932,0.0074567394,0.016108382,0.0054936493,0.0037352305,0.0022316033],"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.00011519869,0.00002257186,0.0009974756,0.00016094724,0.000022242713,0.00017151724,0.0017154431,0.0063214516,0.0036688948,0.9323952,0.0033140648,0.051094994],"study_design_scores_gemma":[0.000049715945,0.000081657214,0.00039008522,0.00018795895,0.00010976354,0.00018548008,0.00039347383,0.025237732,0.025182003,0.8524095,0.09567071,0.00010189762],"about_ca_topic_score_codex":0.005478568,"about_ca_topic_score_gemma":0.004457311,"teacher_disagreement_score":0.0065606027,"about_ca_system_score_codex":0.0030704527,"about_ca_system_score_gemma":0.0035278325,"threshold_uncertainty_score":0.030136764},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06858705,0.00051963027,0.8779005,0.0003436563,0.00008873436,0.00040472415,0.0007499192,0.047999945,0.0034058678],"genre_scores_gemma":[0.45894527,0.00033823663,0.53104955,0.00028192205,0.0000409041,0.00042320887,0.0023253693,0.0025577927,0.0040377695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816054,0.0003001361,0.00011349905,0.00040273575,0.0007223434,0.00030068363],"domain_scores_gemma":[0.9979038,0.0008050128,0.00021151725,0.0006109617,0.00035396087,0.00011476537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009053236,0.0015838539,0.0010222611,0.00213737,0.0010047953,0.0015610802,0.0016575137,0.00079621194,0.0040247254],"category_scores_gemma":[0.0038056634,0.0009806416,0.0027844037,0.001138936,0.0014940753,0.0031877626,0.0020281833,0.0016096868,0.001122554],"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.0007422568,0.00073482,0.020510664,0.0011457291,0.00030957806,0.0007787725,0.00073607394,0.37159747,0.056035917,0.054117795,0.01477666,0.4785144],"study_design_scores_gemma":[0.00006783337,0.00014116778,0.0009823642,0.00003565756,0.00012819037,0.00011514232,0.000085875115,0.9506707,0.017094968,0.023175936,0.0074529024,0.000049389044],"about_ca_topic_score_codex":0.015413419,"about_ca_topic_score_gemma":0.020120263,"teacher_disagreement_score":0.015413419,"about_ca_system_score_codex":0.0015388818,"about_ca_system_score_gemma":0.0055802427,"threshold_uncertainty_score":0.030647457},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02830937,0.00087249366,0.84967256,0.00049700384,0.000420584,0.00019591906,0.00060421316,0.10539326,0.014034624],"genre_scores_gemma":[0.32776698,0.0012039429,0.5817069,0.0015808555,0.00029994,0.0005919646,0.0041468786,0.06068034,0.022022184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697244,0.0005035389,0.00028014748,0.00047131578,0.0012019068,0.0005706033],"domain_scores_gemma":[0.99312663,0.0013564677,0.0005423644,0.004042181,0.00068036397,0.00025192526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021435071,0.0014401273,0.0010755858,0.0011129768,0.0008666744,0.0031356406,0.00480519,0.001627532,0.010306992],"category_scores_gemma":[0.013324006,0.0016121684,0.002833548,0.0011672977,0.0029650172,0.007457431,0.0059303353,0.004424472,0.005348177],"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.0019385304,0.00045063326,0.014907121,0.0014712506,0.00044740664,0.0014304334,0.002612251,0.05509926,0.09645217,0.24853203,0.10572395,0.47093496],"study_design_scores_gemma":[0.00045024685,0.00056506635,0.0028794822,0.00052049226,0.00032539066,0.0019164758,0.00030802097,0.33624792,0.12816012,0.18092975,0.34720343,0.000493551],"about_ca_topic_score_codex":0.003066001,"about_ca_topic_score_gemma":0.0030361908,"teacher_disagreement_score":0.010306992,"about_ca_system_score_codex":0.0011914042,"about_ca_system_score_gemma":0.0029526998,"threshold_uncertainty_score":0.034480274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036607506,0.00048790462,0.9797902,0.0012209527,0.00010662188,0.000031114643,0.00028373938,0.0004859688,0.013932792],"genre_scores_gemma":[0.31855407,0.0018134955,0.6471762,0.0019755778,0.0006652132,0.0003601739,0.0011337531,0.00097217463,0.027349314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524325,0.0015136062,0.00025484245,0.0012495659,0.0014177811,0.00032099153],"domain_scores_gemma":[0.99188787,0.004574386,0.0007203368,0.001638127,0.0009076281,0.00027171258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004408338,0.0009222913,0.0009234115,0.0016808994,0.001614398,0.006155812,0.0018144378,0.0019381016,0.009535762],"category_scores_gemma":[0.01940367,0.0009494935,0.0021204262,0.0019803368,0.00473721,0.013954044,0.0034148681,0.0046068556,0.0019907192],"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.0000066933744,0.0000054300262,0.00009942553,0.00002598721,0.000008435484,0.000017057397,0.0000894651,0.0030068313,0.00013090757,0.9894985,0.0009376395,0.006173631],"study_design_scores_gemma":[0.0000029868204,0.000002237823,0.000024171972,0.000010383671,0.0000061065393,0.000020402884,0.000012385943,0.010209783,0.00016958138,0.9831182,0.0064176377,0.00000613911],"about_ca_topic_score_codex":0.004988263,"about_ca_topic_score_gemma":0.004896236,"teacher_disagreement_score":0.009535762,"about_ca_system_score_codex":0.0030926953,"about_ca_system_score_gemma":0.0028056763,"threshold_uncertainty_score":0.031900287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012366067,0.00036020993,0.97625387,0.00054331723,0.00010440454,0.00011678355,0.00016912157,0.0014477707,0.008638491],"genre_scores_gemma":[0.4110432,0.0012839757,0.5692017,0.0011180375,0.00041766357,0.0007706778,0.0009740789,0.0023899,0.012800748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9859321,0.0044567143,0.0011298878,0.0024964497,0.0049303956,0.0010545487],"domain_scores_gemma":[0.97738636,0.013771359,0.0011109696,0.0048141014,0.0025692892,0.0003480303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007600811,0.0010493146,0.0010429368,0.0015313618,0.0014577813,0.003361171,0.0024885125,0.0011241747,0.004427005],"category_scores_gemma":[0.02070291,0.0012164047,0.003808521,0.0011647359,0.005210455,0.008526946,0.0063997414,0.0063571967,0.0013670068],"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.00007964665,0.000058906466,0.00039159285,0.00031044352,0.00006590243,0.00022589232,0.0009710167,0.010911877,0.008952744,0.94429713,0.002151711,0.031583153],"study_design_scores_gemma":[0.000045156157,0.00007033372,0.00018397911,0.000092446375,0.00009922712,0.00024862785,0.00012264571,0.037589803,0.023951398,0.89254755,0.044990633,0.00005825101],"about_ca_topic_score_codex":0.0016250629,"about_ca_topic_score_gemma":0.0012995952,"teacher_disagreement_score":0.007600811,"about_ca_system_score_codex":0.002587183,"about_ca_system_score_gemma":0.0029701116,"threshold_uncertainty_score":0.040197432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070090126,0.00039975933,0.89933044,0.00044180546,0.0005399173,0.00020836799,0.0020991834,0.07534497,0.014626605],"genre_scores_gemma":[0.08178741,0.00033908873,0.8682598,0.0008869061,0.00016257666,0.000495581,0.0045976685,0.029656753,0.013814175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941613,0.0006921601,0.00068447075,0.0008286474,0.0030383188,0.00059518404],"domain_scores_gemma":[0.99349326,0.0015189032,0.00056773424,0.0031990607,0.0010559915,0.00016500057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027203655,0.0016389545,0.0012141186,0.0019773091,0.0014288655,0.0042731212,0.0043950942,0.0017984392,0.028966725],"category_scores_gemma":[0.009879911,0.0026612214,0.0030377498,0.0022681172,0.0025612365,0.0075329784,0.005039008,0.00383486,0.015183073],"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.0013720745,0.00040356925,0.0047104536,0.0016476241,0.00018377884,0.0010975298,0.000830636,0.03859393,0.027588565,0.41228497,0.13100831,0.38027853],"study_design_scores_gemma":[0.0002358588,0.00025064405,0.001006568,0.0005053817,0.0001606134,0.0011068193,0.00018995385,0.12492956,0.107949905,0.23727727,0.5260667,0.00032072756],"about_ca_topic_score_codex":0.0030736453,"about_ca_topic_score_gemma":0.004327027,"teacher_disagreement_score":0.028966725,"about_ca_system_score_codex":0.0017873163,"about_ca_system_score_gemma":0.0043713963,"threshold_uncertainty_score":0.096903324},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036986485,0.00040647943,0.7922774,0.0052708564,0.000594611,0.000152825,0.00036796014,0.0026435638,0.16129975],"genre_scores_gemma":[0.73471594,0.00067040045,0.19778268,0.0016152884,0.00031129073,0.0003394817,0.00033048325,0.00095744396,0.06327709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985266,0.00035430724,0.00009664999,0.00043126426,0.00037886505,0.00021233928],"domain_scores_gemma":[0.9988426,0.00036894064,0.000074706884,0.0004940407,0.00015024717,0.00006952327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014401294,0.0006111192,0.0005851466,0.0005531969,0.0020226394,0.0038364925,0.0012784353,0.0017281997,0.013673779],"category_scores_gemma":[0.003549671,0.00051253755,0.0017059848,0.00054996466,0.007098058,0.011326727,0.0037288244,0.0037144877,0.0037293844],"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.000011409267,0.000006406327,0.0000380821,0.000021747606,0.0000027737904,0.000018333189,0.00015130336,0.00032606933,0.00044303024,0.99419373,0.00065697334,0.004130168],"study_design_scores_gemma":[0.000007287075,0.000015428945,0.000031034626,0.00001358352,0.000006122899,0.000044552493,0.0000706738,0.0023510477,0.0015194254,0.97932774,0.016600594,0.000012540964],"about_ca_topic_score_codex":0.0017375677,"about_ca_topic_score_gemma":0.0015783673,"teacher_disagreement_score":0.013673779,"about_ca_system_score_codex":0.0013040022,"about_ca_system_score_gemma":0.0015028908,"threshold_uncertainty_score":0.045743346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038025733,0.00051793444,0.94602513,0.00066719827,0.00009464608,0.00018620228,0.00017322674,0.00078099704,0.013528926],"genre_scores_gemma":[0.6981272,0.00058245816,0.28944162,0.0007689137,0.0003635371,0.000499489,0.0006696803,0.00041416837,0.009132919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994693,0.0008640578,0.0003340588,0.0015796699,0.0019769173,0.0005523521],"domain_scores_gemma":[0.9916061,0.00454358,0.00052093674,0.0022500174,0.0007308949,0.00034845722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003021478,0.00077049725,0.0009897089,0.0021199954,0.0013896358,0.0026077244,0.0018472845,0.00091327785,0.009756427],"category_scores_gemma":[0.013415746,0.0006354786,0.0020925147,0.0015760341,0.005692297,0.008670574,0.0047754236,0.006330553,0.00080527936],"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.00006437091,0.000050057777,0.0003937832,0.00007131859,0.00001510508,0.000063841595,0.00040959957,0.014866523,0.0019107718,0.9627567,0.0006336281,0.018764345],"study_design_scores_gemma":[0.000027417538,0.0000337713,0.00020788252,0.000015490923,0.000016756298,0.000030622752,0.00008211009,0.051741503,0.0017160501,0.941582,0.0045330715,0.000013296078],"about_ca_topic_score_codex":0.0038807697,"about_ca_topic_score_gemma":0.0030227266,"teacher_disagreement_score":0.009756427,"about_ca_system_score_codex":0.0026997493,"about_ca_system_score_gemma":0.0013637579,"threshold_uncertainty_score":0.03263849},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04686134,0.0005116765,0.92522633,0.0035688188,0.00013197654,0.000052778163,0.00021863592,0.00045841394,0.022970019],"genre_scores_gemma":[0.79566556,0.00072709663,0.18872435,0.0011290367,0.00031395524,0.0003277855,0.00037485934,0.0002824836,0.012454886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977099,0.00088895386,0.00012320421,0.00041381808,0.0006427428,0.00022138598],"domain_scores_gemma":[0.995265,0.002645347,0.00049669127,0.0007019569,0.0005360949,0.00035504645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027776435,0.0006428227,0.0005490716,0.0018823094,0.0016946525,0.0037678524,0.0019399344,0.001989044,0.004745166],"category_scores_gemma":[0.0074656205,0.00048136536,0.0015441381,0.0017816628,0.005852127,0.0125978375,0.003524061,0.003259302,0.00062980637],"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.0000027563776,0.0000034724524,0.00005136195,0.000006046127,0.0000014301086,0.000015254056,0.0000993618,0.0008491565,0.00008432999,0.9978382,0.00016529381,0.0008834114],"study_design_scores_gemma":[0.0000026913847,0.0000039068814,0.000040071372,0.00000600758,0.0000028644724,0.000025118245,0.000050836345,0.009737386,0.0001428934,0.9880585,0.0019233571,0.0000064153396],"about_ca_topic_score_codex":0.0029010703,"about_ca_topic_score_gemma":0.002202015,"teacher_disagreement_score":0.004745166,"about_ca_system_score_codex":0.0032345422,"about_ca_system_score_gemma":0.0011195478,"threshold_uncertainty_score":0.023468316},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023859601,0.00021425851,0.9617959,0.0002749012,0.00007355337,0.0001393809,0.00025955882,0.011934396,0.0014483947],"genre_scores_gemma":[0.17105468,0.00025769512,0.82158476,0.00029214277,0.000036487298,0.00016392897,0.0012233458,0.0036054237,0.0017815363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99318415,0.001655924,0.0006189772,0.0010790429,0.0029985625,0.00046340068],"domain_scores_gemma":[0.98397344,0.0062877038,0.0013728547,0.006078336,0.0021348456,0.00015283507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005602782,0.0011690586,0.00080701936,0.0020316096,0.0008307247,0.0018403707,0.0031660965,0.0015660587,0.0026581364],"category_scores_gemma":[0.018038562,0.0008418979,0.0026817115,0.0011835683,0.002959042,0.003902124,0.0034977582,0.003152843,0.00083018234],"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.0006060414,0.00035967055,0.011568079,0.0020661105,0.00034750925,0.0014256237,0.002977626,0.09489054,0.10486075,0.14296728,0.011181267,0.6267495],"study_design_scores_gemma":[0.00017321929,0.0003116155,0.0022098154,0.00046418267,0.00035937288,0.001241181,0.0006194277,0.5051365,0.28072622,0.12748288,0.08108815,0.00018743625],"about_ca_topic_score_codex":0.003035879,"about_ca_topic_score_gemma":0.004248424,"teacher_disagreement_score":0.005602782,"about_ca_system_score_codex":0.0017810974,"about_ca_system_score_gemma":0.0032197759,"threshold_uncertainty_score":0.029630661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046945326,0.00014003846,0.981025,0.0004834618,0.00014640971,0.00017357261,0.00052644854,0.0048649916,0.007945539],"genre_scores_gemma":[0.35538432,0.0006027279,0.6141637,0.001379642,0.0004480905,0.0011511538,0.0012612946,0.0033136318,0.022295421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935231,0.0022294663,0.0007149416,0.001172404,0.0016896075,0.0006704838],"domain_scores_gemma":[0.9912948,0.0030131028,0.0008400649,0.0029573275,0.001290117,0.00060457777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00818049,0.0010902996,0.0010633112,0.00083842705,0.0018274174,0.0041711675,0.0035025098,0.0017647555,0.007181116],"category_scores_gemma":[0.00979947,0.0012446304,0.0017008261,0.0010525711,0.0036364654,0.010236304,0.0043771616,0.003766732,0.0023949472],"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.00014787975,0.000035907644,0.0005551708,0.00012266442,0.000022182352,0.00012478257,0.0009302794,0.0031782165,0.002701047,0.97102046,0.004133337,0.017028015],"study_design_scores_gemma":[0.0000898466,0.00011903512,0.0002957805,0.00013597829,0.00012594178,0.00049050763,0.0002744177,0.047491394,0.01907856,0.6921006,0.23968843,0.00010948243],"about_ca_topic_score_codex":0.002705717,"about_ca_topic_score_gemma":0.0022758662,"teacher_disagreement_score":0.00818049,"about_ca_system_score_codex":0.0015554264,"about_ca_system_score_gemma":0.0036728126,"threshold_uncertainty_score":0.043263078},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009061443,0.00010786024,0.97744536,0.00013507267,0.000060519982,0.000113945396,0.00020661535,0.010690908,0.0021782874],"genre_scores_gemma":[0.13355553,0.00011841275,0.86054254,0.00015949897,0.000055362547,0.00023885019,0.0008666551,0.002562634,0.0019005504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755764,0.0006777642,0.00023680388,0.0005120198,0.00084460835,0.00017121434],"domain_scores_gemma":[0.991302,0.005103288,0.00036549065,0.0020592208,0.0009907627,0.00017921814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031697059,0.0012765045,0.0009992237,0.0010147252,0.0005358239,0.0020172908,0.002584239,0.0009908543,0.007933197],"category_scores_gemma":[0.014883603,0.0006803157,0.001219407,0.0008509106,0.0012590789,0.0035029026,0.001814265,0.0018569193,0.002603844],"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.00094263454,0.00035538236,0.002690295,0.0006184941,0.000120133576,0.00035102837,0.0003969139,0.16181423,0.03069096,0.10040721,0.019461302,0.6821514],"study_design_scores_gemma":[0.000113817085,0.00009558099,0.0001428,0.00003031947,0.000023128237,0.00010365209,0.0000648564,0.9114978,0.029098766,0.048926137,0.00988342,0.00001977141],"about_ca_topic_score_codex":0.0010770581,"about_ca_topic_score_gemma":0.0015591683,"teacher_disagreement_score":0.007933197,"about_ca_system_score_codex":0.0009567601,"about_ca_system_score_gemma":0.002455393,"threshold_uncertainty_score":0.026539207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015589935,0.00058534084,0.8982455,0.0009862529,0.00026526581,0.00038474874,0.0024456365,0.07543015,0.0060671302],"genre_scores_gemma":[0.37157717,0.0006084921,0.5972393,0.0021861943,0.00024434726,0.0007113607,0.010144003,0.010850918,0.006438221],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98314166,0.005407745,0.0014773763,0.0019171116,0.006540702,0.0015154295],"domain_scores_gemma":[0.961682,0.024094708,0.0020420211,0.0082139345,0.0035751555,0.00039209516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011710518,0.0018719274,0.0012506043,0.002436852,0.0015735405,0.0048048254,0.006791669,0.0023485012,0.021040373],"category_scores_gemma":[0.041212615,0.0016620615,0.0035613873,0.0015990951,0.0053173024,0.011549072,0.008307191,0.004374546,0.0047462853],"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.002322327,0.00092810416,0.0115757575,0.003980674,0.0005976032,0.0016857402,0.00177014,0.15590896,0.051548723,0.27583328,0.10704402,0.38680458],"study_design_scores_gemma":[0.00057011726,0.00043264517,0.0010407327,0.00039894754,0.00019689428,0.0006966177,0.00036049073,0.70917183,0.08460478,0.15451467,0.04781914,0.000193142],"about_ca_topic_score_codex":0.009002251,"about_ca_topic_score_gemma":0.009964707,"teacher_disagreement_score":0.021040373,"about_ca_system_score_codex":0.0029976177,"about_ca_system_score_gemma":0.008106749,"threshold_uncertainty_score":0.070387065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03563557,0.00027116635,0.90790397,0.0015817106,0.0005652589,0.00037845707,0.0007750379,0.0077549852,0.045133792],"genre_scores_gemma":[0.50945556,0.00045334923,0.44118893,0.0016573917,0.0004694024,0.0005138218,0.0011883716,0.0038035468,0.041269623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748874,0.00056437036,0.00026879847,0.00057856395,0.0006379088,0.00046150284],"domain_scores_gemma":[0.9948679,0.0017153474,0.00032570565,0.001611911,0.0012800616,0.00019910955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006781371,0.00066222326,0.0007886356,0.0016000103,0.0025359702,0.0046436726,0.0018678256,0.001738265,0.012196792],"category_scores_gemma":[0.0069284537,0.0006548089,0.00147331,0.0008980574,0.0049629305,0.008109602,0.0033148495,0.00246609,0.0030833285],"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.000098942655,0.000029914658,0.0017437132,0.00013132874,0.000026900929,0.00029398358,0.0010684329,0.000935652,0.0059280167,0.95273554,0.0062849424,0.030722767],"study_design_scores_gemma":[0.00007700491,0.00016160522,0.0021477293,0.00020615937,0.00016196178,0.0009118043,0.00082348776,0.018935338,0.035150282,0.5696689,0.3715643,0.0001914523],"about_ca_topic_score_codex":0.004020435,"about_ca_topic_score_gemma":0.004525664,"teacher_disagreement_score":0.012196792,"about_ca_system_score_codex":0.00225627,"about_ca_system_score_gemma":0.0031490808,"threshold_uncertainty_score":0.0408023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010706273,0.00016855863,0.94654614,0.00036643445,0.00016305386,0.00010467101,0.00051085,0.035422165,0.0060119033],"genre_scores_gemma":[0.21111178,0.0005192444,0.73895127,0.0009948792,0.00022480935,0.0004865918,0.0022019292,0.020493098,0.02501636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823254,0.00034002797,0.00021000222,0.00039472402,0.0006283647,0.00019437837],"domain_scores_gemma":[0.9969849,0.000968791,0.0003504754,0.001247517,0.00031460993,0.00013373613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029714718,0.00069248327,0.0005831042,0.0006754037,0.00074077595,0.0017863588,0.002434433,0.00097249245,0.0056867534],"category_scores_gemma":[0.005684891,0.0010837734,0.0018044792,0.000712737,0.0023640594,0.0049569784,0.003527169,0.0021024924,0.002307551],"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.0010819328,0.00017555858,0.010308925,0.0007506332,0.00019242268,0.001341562,0.0023862503,0.028565057,0.046139445,0.5738496,0.060866486,0.27434212],"study_design_scores_gemma":[0.00025722588,0.00024039373,0.002245748,0.00034231937,0.00016151929,0.002033229,0.00021911114,0.13882942,0.064944856,0.27086475,0.51960945,0.0002519377],"about_ca_topic_score_codex":0.0030044816,"about_ca_topic_score_gemma":0.0029277548,"teacher_disagreement_score":0.0056867534,"about_ca_system_score_codex":0.0012795074,"about_ca_system_score_gemma":0.0019320429,"threshold_uncertainty_score":0.019024134},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16909966,0.00045515536,0.14802052,0.0005756186,0.00017234098,0.00034954865,0.0040716897,0.67272264,0.0045327903],"genre_scores_gemma":[0.6615663,0.00031396621,0.29406163,0.00075579755,0.000043662472,0.00035699148,0.011932253,0.01808441,0.012884946],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983706,0.00036280704,0.00014369898,0.00052452536,0.00047052198,0.00012794072],"domain_scores_gemma":[0.99505,0.0025090622,0.0005688918,0.001083319,0.00051137235,0.00027738692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018527127,0.0014468672,0.0006019085,0.001121522,0.0005513198,0.0009203794,0.0027502105,0.0010635372,0.008458891],"category_scores_gemma":[0.011796616,0.0007182306,0.0005741901,0.00061711797,0.000977674,0.0034487182,0.0028852993,0.001554242,0.0045894175],"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.0019990627,0.0009261215,0.02871657,0.0019327395,0.00013677825,0.0015611254,0.0042902133,0.018215349,0.042736493,0.003203007,0.124180555,0.77210194],"study_design_scores_gemma":[0.00061972346,0.0022084387,0.030912723,0.00043848436,0.00021590068,0.0025769866,0.0026584913,0.5059935,0.2667195,0.013860048,0.17342722,0.0003690701],"about_ca_topic_score_codex":0.002523351,"about_ca_topic_score_gemma":0.0039135837,"teacher_disagreement_score":0.008458891,"about_ca_system_score_codex":0.0007757277,"about_ca_system_score_gemma":0.0012825619,"threshold_uncertainty_score":0.028297782},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031550337,0.00066754426,0.95368373,0.00041735743,0.00015656966,0.00006260466,0.000060344442,0.0041855206,0.009215977],"genre_scores_gemma":[0.60445154,0.00057109975,0.38444906,0.00028575974,0.00027484208,0.00016584482,0.00014762548,0.0011078947,0.008546309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735165,0.00061129685,0.00016814271,0.00036259077,0.0009939418,0.0005123828],"domain_scores_gemma":[0.996804,0.00092334545,0.00044251783,0.0013596351,0.00030413023,0.00016646011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002293734,0.00058451813,0.0006736549,0.0010702168,0.0011762998,0.0032457027,0.0016232467,0.0010139081,0.0021297266],"category_scores_gemma":[0.006129671,0.0006475605,0.0011471463,0.0006484524,0.003526745,0.0044063027,0.004000525,0.0022351588,0.00066948956],"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.0003595131,0.00006500868,0.0019369713,0.00020056534,0.00005189076,0.00042489878,0.00082178315,0.05327506,0.018536592,0.8392556,0.0024229672,0.08264908],"study_design_scores_gemma":[0.00008249627,0.00016690184,0.0011314072,0.00019554372,0.00016684485,0.0005416794,0.00019329248,0.414492,0.05343762,0.48790902,0.041513633,0.0001695444],"about_ca_topic_score_codex":0.0018202151,"about_ca_topic_score_gemma":0.0022486516,"teacher_disagreement_score":0.0032457027,"about_ca_system_score_codex":0.0015941012,"about_ca_system_score_gemma":0.002802138,"threshold_uncertainty_score":0.0121305585},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014278561,0.000163614,0.90095353,0.0003402045,0.0003852242,0.00022090448,0.0016172333,0.06929653,0.0127441175],"genre_scores_gemma":[0.21334837,0.00025509173,0.7300268,0.0009808516,0.00023361297,0.0008552083,0.007830638,0.031694382,0.014775],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963367,0.00070760684,0.00039237647,0.0006314971,0.0015163852,0.00041541073],"domain_scores_gemma":[0.99525946,0.0014441342,0.00030425697,0.0016731678,0.0011987883,0.00012025171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019054653,0.0016944758,0.0007823581,0.0012135642,0.0007332119,0.0018294454,0.0021395802,0.001088863,0.023885803],"category_scores_gemma":[0.011751554,0.00096597907,0.0018412048,0.0010026863,0.0019909448,0.0038697128,0.005012284,0.002353366,0.008214493],"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.000979453,0.00038727163,0.004051105,0.0012918758,0.00014029474,0.00085114775,0.0012355313,0.06562177,0.030365624,0.30461943,0.120359346,0.47009715],"study_design_scores_gemma":[0.0003862084,0.0004729078,0.0009655372,0.00031928674,0.00006735739,0.00039215866,0.00041801084,0.40133312,0.10118609,0.3185058,0.17581192,0.00014165128],"about_ca_topic_score_codex":0.0030574198,"about_ca_topic_score_gemma":0.002955346,"teacher_disagreement_score":0.023885803,"about_ca_system_score_codex":0.0009650964,"about_ca_system_score_gemma":0.0021285403,"threshold_uncertainty_score":0.07990599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007168667,0.00002874821,0.98845994,0.00012649829,0.00003060482,0.000038374896,0.000052337135,0.0026489364,0.0014458991],"genre_scores_gemma":[0.26453558,0.00016075437,0.7298455,0.00022729748,0.000109337205,0.0002426203,0.00037472803,0.0018228794,0.0026812677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979924,0.0004882986,0.00015500841,0.00039713993,0.0007735863,0.00019358046],"domain_scores_gemma":[0.9941772,0.0038659319,0.00033030848,0.0011133958,0.00045475588,0.000058354875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023049584,0.0006723189,0.00070240936,0.0007842608,0.00075102504,0.0020360432,0.0013051591,0.00071243785,0.0034195986],"category_scores_gemma":[0.011094675,0.00069480424,0.002153823,0.00079664035,0.0018709644,0.0027078679,0.0018746397,0.002280953,0.0008404055],"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.00016317124,0.00014895911,0.002383148,0.00039808947,0.00010462835,0.000319344,0.00068987376,0.29314026,0.011834977,0.54105645,0.005052467,0.14470862],"study_design_scores_gemma":[0.00003344708,0.00003888868,0.00024321345,0.0000495234,0.000059390182,0.00011104576,0.000040499504,0.6842461,0.015134481,0.29305965,0.006954002,0.000029652118],"about_ca_topic_score_codex":0.0016634134,"about_ca_topic_score_gemma":0.0022128895,"teacher_disagreement_score":0.0034195986,"about_ca_system_score_codex":0.0012679663,"about_ca_system_score_gemma":0.0021595056,"threshold_uncertainty_score":0.012189925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039368384,0.000052660896,0.993601,0.00015168343,0.000029402174,0.00012131179,0.0000410758,0.0015167808,0.00054920645],"genre_scores_gemma":[0.14134945,0.0002691268,0.853807,0.00036213067,0.00007972165,0.0005237815,0.00043414297,0.0016626498,0.0015120691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95684165,0.02063904,0.0033648026,0.0039984323,0.012357605,0.002798443],"domain_scores_gemma":[0.9009984,0.057136934,0.006709515,0.02465438,0.009809126,0.0006916601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030779889,0.002012511,0.00159718,0.0023120786,0.0012429091,0.0071015805,0.0052157105,0.0037242465,0.0051617436],"category_scores_gemma":[0.09148731,0.0025618186,0.0043192157,0.0010156662,0.008627309,0.010790694,0.0072624683,0.007289019,0.002760144],"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.0004862031,0.00047992723,0.0040717735,0.0017959663,0.0003750217,0.0011830634,0.0033199773,0.17023993,0.044514395,0.65625226,0.003417532,0.11386397],"study_design_scores_gemma":[0.00027681433,0.00041035409,0.00047069186,0.00086631544,0.0002333199,0.00046259307,0.0004147963,0.49960822,0.11530297,0.358926,0.022862362,0.00016555189],"about_ca_topic_score_codex":0.0018398874,"about_ca_topic_score_gemma":0.0013754515,"teacher_disagreement_score":0.030779889,"about_ca_system_score_codex":0.0027698234,"about_ca_system_score_gemma":0.008251173,"threshold_uncertainty_score":0.16278154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036046654,0.00024867512,0.9439103,0.004018899,0.00016918445,0.00006118941,0.00022009111,0.0014015628,0.013923505],"genre_scores_gemma":[0.74187315,0.00040309268,0.2413843,0.0013517535,0.00022327184,0.0002257999,0.00026504658,0.0014822992,0.012791233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868566,0.0003550091,0.00006421598,0.00023519804,0.0004731376,0.000186878],"domain_scores_gemma":[0.9975101,0.0010306108,0.00010727632,0.0007655292,0.00044707765,0.00013936085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026838724,0.0005200055,0.0005320094,0.0010198589,0.001569682,0.002580569,0.0018644681,0.0016196272,0.005450608],"category_scores_gemma":[0.006684576,0.00063149346,0.0012685698,0.0007167032,0.004977863,0.0131371,0.0035649764,0.003163416,0.0007816837],"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.000044917004,0.000016553899,0.00021685992,0.00003644563,0.0000073091032,0.00008347852,0.00030646968,0.002532813,0.0014888903,0.98607826,0.0015204714,0.0076675126],"study_design_scores_gemma":[0.0000243524,0.000030511039,0.00013581086,0.000031407893,0.000024817886,0.00012834386,0.00021956889,0.043213658,0.0050192424,0.93380266,0.0173354,0.000034271976],"about_ca_topic_score_codex":0.0019161253,"about_ca_topic_score_gemma":0.0014402131,"teacher_disagreement_score":0.005450608,"about_ca_system_score_codex":0.0015004778,"about_ca_system_score_gemma":0.0011471852,"threshold_uncertainty_score":0.018234074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030971111,0.00013852998,0.99137676,0.0002953323,0.000058935297,0.00009570532,0.000104118044,0.0008718537,0.0039616846],"genre_scores_gemma":[0.20357,0.0006390452,0.7862735,0.0008315182,0.0002582402,0.0005612534,0.0006610174,0.00061742205,0.006588058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99139297,0.0020092197,0.0008519786,0.0016381181,0.002934881,0.0011729391],"domain_scores_gemma":[0.99155575,0.004679098,0.000808712,0.0014897957,0.0012517109,0.00021484801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074564884,0.0011090159,0.00072817324,0.0019966045,0.0013108687,0.004630384,0.003499153,0.0025276332,0.007429357],"category_scores_gemma":[0.012712535,0.001264272,0.0034935195,0.0012437984,0.007514588,0.007530077,0.0051058577,0.006056181,0.0022962955],"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.000027762011,0.00003660101,0.00012140724,0.00011907469,0.000018696088,0.000104819206,0.00029787514,0.0070998333,0.001764353,0.9766873,0.0005646632,0.013157599],"study_design_scores_gemma":[0.000064815096,0.00005947218,0.00009307323,0.000121458215,0.000047119465,0.0001386398,0.00009093895,0.051422726,0.007298677,0.92522866,0.015394284,0.000040123512],"about_ca_topic_score_codex":0.0020645603,"about_ca_topic_score_gemma":0.001435822,"teacher_disagreement_score":0.0074564884,"about_ca_system_score_codex":0.0027850422,"about_ca_system_score_gemma":0.0033216702,"threshold_uncertainty_score":0.039434135},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02055961,0.00016491588,0.9667135,0.00018747717,0.00013334678,0.000057101883,0.00012488516,0.004489788,0.0075694257],"genre_scores_gemma":[0.43738848,0.00033812106,0.5481884,0.00033857665,0.00015645185,0.00020128186,0.00030347065,0.0021450603,0.010940072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989491,0.0002959105,0.000091008435,0.00020221937,0.00033074888,0.0001311668],"domain_scores_gemma":[0.99734604,0.0009223598,0.00014386812,0.001135043,0.00034755393,0.00010516485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019136018,0.0003936767,0.00039333553,0.0007312504,0.00050557894,0.0014865899,0.000989426,0.00046718217,0.003701915],"category_scores_gemma":[0.0047606914,0.00044477024,0.0011753959,0.0005705487,0.0015831656,0.0027153534,0.0031920704,0.0013525446,0.0008367754],"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.00013023477,0.000052688498,0.0014951774,0.00022508258,0.000039749295,0.00031900493,0.0009751004,0.013965331,0.018824546,0.8536072,0.0036895627,0.10667626],"study_design_scores_gemma":[0.00008015902,0.00019977556,0.0012561308,0.00017842937,0.000117881646,0.00066623936,0.000113311304,0.13204087,0.057783887,0.67974836,0.12769598,0.00011895518],"about_ca_topic_score_codex":0.00044510385,"about_ca_topic_score_gemma":0.00073601987,"teacher_disagreement_score":0.003701915,"about_ca_system_score_codex":0.0005891372,"about_ca_system_score_gemma":0.0009426043,"threshold_uncertainty_score":0.012384176},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02728583,0.00064084353,0.78763455,0.008355685,0.0015355892,0.00017867054,0.0005868967,0.004080076,0.16970178],"genre_scores_gemma":[0.5565167,0.0010033891,0.31235725,0.0031675058,0.00033224595,0.00032536406,0.0007660482,0.003030642,0.12250081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984577,0.00033736738,0.00008248834,0.00037932047,0.00045411443,0.0002890571],"domain_scores_gemma":[0.99891174,0.0003442876,0.00005415637,0.00039206358,0.00019476883,0.0001029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012874196,0.0005675391,0.00047643934,0.0006362449,0.0022998324,0.0034771485,0.001439269,0.0016660992,0.03619413],"category_scores_gemma":[0.003844647,0.00069270405,0.0015248916,0.00051315635,0.0045892717,0.009394068,0.0028068854,0.003371994,0.013124576],"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.00005001369,0.000029973648,0.00017455942,0.0000886444,0.000010784299,0.00008817326,0.0008482205,0.0008779643,0.0036327865,0.97159475,0.005639326,0.01696476],"study_design_scores_gemma":[0.000021853408,0.000046726007,0.00009873592,0.00006720438,0.000018248222,0.00020842678,0.00055134983,0.00587654,0.0082842205,0.88168,0.10309015,0.000056492543],"about_ca_topic_score_codex":0.0023004045,"about_ca_topic_score_gemma":0.0018225515,"teacher_disagreement_score":0.03619413,"about_ca_system_score_codex":0.0011881397,"about_ca_system_score_gemma":0.0016088071,"threshold_uncertainty_score":0.12108135},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031972032,0.00004078531,0.9603825,0.0006922565,0.00006090919,0.00013973853,0.000048687216,0.002075736,0.0045873504],"genre_scores_gemma":[0.6923264,0.00013562915,0.29553866,0.0004906247,0.00012286408,0.00040342676,0.00015165411,0.0016257059,0.009204957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9882045,0.004614824,0.0009979462,0.0012453741,0.0035217672,0.0014157068],"domain_scores_gemma":[0.9611701,0.019625966,0.0024358707,0.011539132,0.004493482,0.0007354559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01585326,0.0006529743,0.00083867117,0.0007913249,0.0024268066,0.003278176,0.0024303,0.0026606508,0.0043423385],"category_scores_gemma":[0.047716886,0.0012678854,0.0013178613,0.00058823836,0.006693181,0.009774932,0.0060558915,0.0052331123,0.0009310321],"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.00022070362,0.00012206883,0.002667766,0.00015427239,0.000031767242,0.00047046042,0.0035356048,0.01632552,0.012710146,0.9394542,0.001897979,0.022409566],"study_design_scores_gemma":[0.00022705534,0.00021893592,0.0005694656,0.00018200582,0.000111567744,0.0005327437,0.0005480241,0.2819265,0.06413501,0.6128546,0.03854428,0.00014978473],"about_ca_topic_score_codex":0.0024371953,"about_ca_topic_score_gemma":0.0029119554,"teacher_disagreement_score":0.01585326,"about_ca_system_score_codex":0.0019579746,"about_ca_system_score_gemma":0.004548972,"threshold_uncertainty_score":0.083841026},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016062317,0.00022043214,0.9580942,0.00024963586,0.00025849993,0.0002977814,0.00020106917,0.00862137,0.015994791],"genre_scores_gemma":[0.39921194,0.000732523,0.5584833,0.00066530483,0.00040299952,0.00066852104,0.00053553877,0.003654153,0.035645686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600005,0.00053320604,0.00036696144,0.0006370118,0.0019713135,0.0004914682],"domain_scores_gemma":[0.9941818,0.0014661552,0.00047712933,0.002557059,0.0011113551,0.00020654137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004181257,0.00097417796,0.0008825366,0.0012902373,0.0013084543,0.0035609843,0.0023923388,0.0011570002,0.0110591985],"category_scores_gemma":[0.008734507,0.0007815009,0.0017945553,0.00086800294,0.0028941515,0.005989277,0.005421711,0.0023860761,0.001967416],"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.0004524769,0.0001883738,0.0026452253,0.0006066246,0.00010999962,0.0006774099,0.0012517618,0.010911581,0.025168758,0.80076903,0.008630841,0.14858806],"study_design_scores_gemma":[0.00024566404,0.0003281394,0.00082386367,0.00026167667,0.00036228335,0.0011904971,0.00029515073,0.07317974,0.11752937,0.43982646,0.36576483,0.00019228093],"about_ca_topic_score_codex":0.0012638055,"about_ca_topic_score_gemma":0.0013765366,"teacher_disagreement_score":0.0110591985,"about_ca_system_score_codex":0.001200233,"about_ca_system_score_gemma":0.0021323538,"threshold_uncertainty_score":0.036996663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018654998,0.0016652975,0.90075344,0.0038585719,0.0006367619,0.00011009075,0.00033701686,0.0022397938,0.07174401],"genre_scores_gemma":[0.40417793,0.0019479259,0.54859984,0.004211607,0.0009749671,0.00026552266,0.00058568694,0.0022129253,0.037023567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980089,0.00043794574,0.00017539067,0.0005879902,0.0005838299,0.00020599681],"domain_scores_gemma":[0.99727005,0.0010242156,0.0001120474,0.0007937257,0.0006394538,0.00016056538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002090942,0.0008443044,0.00062085467,0.0013283519,0.0015670336,0.0050083543,0.0015229848,0.0018333574,0.010289699],"category_scores_gemma":[0.005599234,0.00075727055,0.0014261126,0.00088776683,0.0070457445,0.011626137,0.0029070128,0.006875818,0.003234627],"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.000019803407,0.000025592879,0.0003619812,0.00006152594,0.0000065009917,0.00015531846,0.00062268175,0.00089601206,0.0020549507,0.9804582,0.003129205,0.012208236],"study_design_scores_gemma":[0.000007661373,0.000037091268,0.00018542593,0.000046878635,0.000011624365,0.0003099445,0.00014693769,0.0060610496,0.002541397,0.9364582,0.054168478,0.000025329822],"about_ca_topic_score_codex":0.0025248132,"about_ca_topic_score_gemma":0.0018366912,"teacher_disagreement_score":0.010289699,"about_ca_system_score_codex":0.0017061683,"about_ca_system_score_gemma":0.0013077615,"threshold_uncertainty_score":0.034422457},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01837534,0.001099064,0.9247258,0.0010216836,0.0006311251,0.00018317882,0.000827117,0.0033688382,0.049767934],"genre_scores_gemma":[0.40654352,0.0015755334,0.5333735,0.0017703653,0.00083147915,0.00075033284,0.0012332796,0.0020594138,0.05186261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976513,0.0005553681,0.00028440525,0.00052195915,0.00061541656,0.00037162358],"domain_scores_gemma":[0.99676347,0.0010942913,0.0002978102,0.0009530917,0.00073434436,0.00015701415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033216197,0.0011515185,0.0005902807,0.0019402972,0.0014784724,0.004612514,0.0018824688,0.0014590027,0.009408798],"category_scores_gemma":[0.0046310853,0.0008491206,0.0015462819,0.0012060491,0.0050462615,0.011021546,0.0032172885,0.0031899756,0.0035958316],"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.0000482759,0.000019106885,0.00029496325,0.000118523865,0.000012348009,0.00011402939,0.00043441475,0.00053467415,0.0021602088,0.9738767,0.0026241883,0.019762477],"study_design_scores_gemma":[0.00004080014,0.000099723686,0.00048603694,0.00017414227,0.000075819924,0.00095220056,0.00031563223,0.008388424,0.013109853,0.7162165,0.2600512,0.00008967394],"about_ca_topic_score_codex":0.00095957227,"about_ca_topic_score_gemma":0.0011064969,"teacher_disagreement_score":0.009408798,"about_ca_system_score_codex":0.0016371196,"about_ca_system_score_gemma":0.0012513108,"threshold_uncertainty_score":0.031475604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7388953,0.0006333527,0.23396745,0.0015110357,0.00015630838,0.00025807702,0.0012251119,0.016422693,0.006930661],"genre_scores_gemma":[0.9166662,0.00016544154,0.07968332,0.00015110098,0.000045617773,0.00016146366,0.00089503493,0.0010545063,0.0011773447],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99668604,0.0010425488,0.00017588364,0.0007665698,0.001153849,0.00017521699],"domain_scores_gemma":[0.97061443,0.016456997,0.0033766532,0.0049869,0.0035230143,0.0010420041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045544207,0.0010330087,0.00047695462,0.0029751372,0.000641384,0.0027121892,0.0016244721,0.00074674527,0.0020564965],"category_scores_gemma":[0.04990743,0.0006156443,0.00038102502,0.0012505006,0.0009982684,0.005641042,0.0032086358,0.0011623047,0.00056623475],"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.0021822585,0.0006620502,0.1686568,0.00088100316,0.00042381595,0.00094050233,0.020839617,0.02566524,0.058630593,0.010173432,0.0150454,0.69589925],"study_design_scores_gemma":[0.00021458683,0.0017202363,0.23981576,0.00030849595,0.0002582213,0.0017116581,0.01526983,0.55290616,0.06407982,0.076393,0.046838365,0.00048396736],"about_ca_topic_score_codex":0.0028376265,"about_ca_topic_score_gemma":0.0039482936,"teacher_disagreement_score":0.0045544207,"about_ca_system_score_codex":0.00060959306,"about_ca_system_score_gemma":0.0006278384,"threshold_uncertainty_score":0.024086356},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063247564,0.0006411479,0.5066612,0.0005759272,0.0003756794,0.00022942932,0.0062184427,0.47576603,0.003207322],"genre_scores_gemma":[0.10662292,0.00059073156,0.80132484,0.0019082975,0.00028161687,0.0006122454,0.028312527,0.053234488,0.0071123745],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920691,0.0012895995,0.00063524116,0.0019523801,0.0034867302,0.00056694524],"domain_scores_gemma":[0.9886413,0.0033083323,0.0010149612,0.004482885,0.002053027,0.0004994506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005758147,0.0029931704,0.0018379381,0.003812371,0.0020568615,0.0045137336,0.007139246,0.0021439723,0.014692013],"category_scores_gemma":[0.027341746,0.0028874113,0.0047806613,0.0033046096,0.0024744233,0.010513926,0.0068438197,0.004983142,0.0124596935],"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.0010218387,0.000323773,0.028042715,0.0017623315,0.00054034806,0.00047280805,0.0010006751,0.02081537,0.017751418,0.032166995,0.34101355,0.5550881],"study_design_scores_gemma":[0.0002611731,0.00020787586,0.007287615,0.00033264846,0.00019515654,0.0008450835,0.00029334656,0.6451103,0.03870871,0.10756106,0.19874074,0.00045627283],"about_ca_topic_score_codex":0.0129595185,"about_ca_topic_score_gemma":0.021567002,"teacher_disagreement_score":0.014692013,"about_ca_system_score_codex":0.0022961043,"about_ca_system_score_gemma":0.007270411,"threshold_uncertainty_score":0.049149692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03484191,0.00046623033,0.89277697,0.0004803867,0.0005185891,0.0004437644,0.0009467028,0.030666357,0.03885913],"genre_scores_gemma":[0.5455329,0.00061843114,0.38222232,0.0010932832,0.00028714715,0.00055564486,0.0017910879,0.015419917,0.052479237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984509,0.00024916066,0.00014715223,0.00032645807,0.0006045272,0.00022183117],"domain_scores_gemma":[0.9962513,0.0012301414,0.00029147268,0.0015054733,0.00064375123,0.00007792849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015907465,0.0010378823,0.00072422065,0.0012663305,0.0008590054,0.00295993,0.0016226163,0.0009495649,0.015732406],"category_scores_gemma":[0.006628203,0.000739462,0.0013574712,0.00073035195,0.0017399093,0.0045831134,0.003799959,0.0016668648,0.004159081],"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.0008023568,0.00034915784,0.0078532845,0.0015182239,0.0001958682,0.0017259523,0.0023313859,0.014197803,0.060887694,0.4679221,0.040881738,0.4013345],"study_design_scores_gemma":[0.00021569665,0.0003009017,0.0019325605,0.0005834801,0.00048940856,0.001279189,0.0007622914,0.070936844,0.21200725,0.3091837,0.4020741,0.00023454368],"about_ca_topic_score_codex":0.0011753747,"about_ca_topic_score_gemma":0.0019309288,"teacher_disagreement_score":0.015732406,"about_ca_system_score_codex":0.00071533705,"about_ca_system_score_gemma":0.0012887359,"threshold_uncertainty_score":0.052630126},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003563582,0.00035384166,0.9838086,0.0007535265,0.00014906705,0.00008983291,0.00014531094,0.008015037,0.0031212606],"genre_scores_gemma":[0.12201555,0.0010007132,0.85389113,0.0012805513,0.00032354225,0.00046755865,0.00088961225,0.009341658,0.010789562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98269135,0.0038609013,0.0014369927,0.0031456149,0.007704358,0.0011607219],"domain_scores_gemma":[0.9465471,0.0089938855,0.002648629,0.03706618,0.0040551876,0.0006890562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014434131,0.0029058605,0.0020382216,0.003995607,0.0017933301,0.009267816,0.007256214,0.003385689,0.005964152],"category_scores_gemma":[0.040556636,0.002071349,0.0030732492,0.0035239442,0.009153637,0.020163225,0.010782528,0.0082704555,0.0063852975],"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.000922836,0.0001854271,0.0024458366,0.00068266207,0.00024991026,0.00040477296,0.0025263615,0.022894977,0.02704951,0.53572726,0.016736424,0.390174],"study_design_scores_gemma":[0.00018078063,0.00037637158,0.00091168436,0.0005775532,0.00036150333,0.00082098675,0.00041050962,0.10235945,0.09306843,0.6535676,0.14693911,0.00042609868],"about_ca_topic_score_codex":0.0029036314,"about_ca_topic_score_gemma":0.0016295623,"teacher_disagreement_score":0.014434131,"about_ca_system_score_codex":0.0021652046,"about_ca_system_score_gemma":0.0045851762,"threshold_uncertainty_score":0.07633591},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010963749,0.00021084421,0.9661065,0.0019253092,0.000112788446,0.00013084986,0.0003308086,0.00078566023,0.0194335],"genre_scores_gemma":[0.52255857,0.0005074151,0.46045986,0.0025513605,0.0003591805,0.000581207,0.000673982,0.00036293577,0.011945398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940895,0.0022142793,0.00045623953,0.0011287499,0.0015004697,0.0006107591],"domain_scores_gemma":[0.9926732,0.0046378304,0.0005077674,0.0009521308,0.00090210093,0.0003269172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072317813,0.0007955768,0.0005940755,0.0018922602,0.0019994646,0.004010438,0.0023424816,0.0017833929,0.0063850344],"category_scores_gemma":[0.013131996,0.0006541693,0.0021843142,0.0012702649,0.0067537935,0.008059536,0.003945536,0.0046991236,0.00091804273],"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.000020748928,0.000012380514,0.00015801677,0.000029102493,0.000007999896,0.00005809,0.000115462535,0.0034260554,0.00037988005,0.9904937,0.0005796264,0.004718916],"study_design_scores_gemma":[0.000019799752,0.000020696287,0.00006665887,0.00003201147,0.00001962088,0.00005903644,0.00004249045,0.035659257,0.0013023515,0.9567988,0.005959263,0.00002002986],"about_ca_topic_score_codex":0.0032850448,"about_ca_topic_score_gemma":0.0035308392,"teacher_disagreement_score":0.0072317813,"about_ca_system_score_codex":0.0036549328,"about_ca_system_score_gemma":0.0023580606,"threshold_uncertainty_score":0.038245797},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077577992,0.00018609663,0.9865899,0.00028067475,0.000030125233,0.00004622029,0.00012954915,0.001632176,0.0033473729],"genre_scores_gemma":[0.26985022,0.0005168689,0.7232212,0.00038755912,0.00012922414,0.00019293583,0.0005233428,0.0014332231,0.0037454667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971987,0.00083328714,0.00020575362,0.000484486,0.0010630471,0.00021467403],"domain_scores_gemma":[0.9958605,0.0023536598,0.00030044743,0.0009906094,0.0004410016,0.00005367654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016817653,0.00074878545,0.00043058398,0.0012003194,0.0009483312,0.0023705708,0.0013682826,0.00063239934,0.0068780133],"category_scores_gemma":[0.007943013,0.000500045,0.0017055618,0.0014468079,0.002605623,0.0055038948,0.0018436542,0.002913383,0.0012473518],"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.000121919766,0.000081041835,0.00093642814,0.0003294585,0.000054486125,0.00010177338,0.0005719976,0.07534192,0.014063017,0.7860166,0.0033650112,0.119016394],"study_design_scores_gemma":[0.000023199633,0.00007053918,0.00033575125,0.000062249426,0.000076716475,0.000073988194,0.00015634019,0.39022318,0.028729172,0.5609616,0.019244319,0.000043034],"about_ca_topic_score_codex":0.00302262,"about_ca_topic_score_gemma":0.0042243223,"teacher_disagreement_score":0.0068780133,"about_ca_system_score_codex":0.0020614355,"about_ca_system_score_gemma":0.0017444296,"threshold_uncertainty_score":0.02300924},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088978163,0.00015647669,0.99094826,0.00079803565,0.0000904386,0.000065120665,0.00008231042,0.003708976,0.003260505],"genre_scores_gemma":[0.10698896,0.0010840781,0.87509763,0.00213972,0.00065801776,0.0005598477,0.0005605224,0.0034208237,0.0094904825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9881153,0.0042504426,0.00060298404,0.0017550106,0.0042231428,0.0010531198],"domain_scores_gemma":[0.98431915,0.0083188,0.0009449034,0.004029902,0.0014599327,0.0009272726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013264092,0.0014341451,0.00139649,0.0027891768,0.002314363,0.0062360265,0.005929459,0.002206978,0.0147015955],"category_scores_gemma":[0.024101682,0.002438704,0.004080546,0.002005363,0.008081175,0.0148574915,0.013509411,0.010470657,0.0040625157],"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.00014526535,0.00008568801,0.0004308456,0.0002686374,0.000077533165,0.00023179624,0.0006986708,0.01002104,0.0024827584,0.9277569,0.009854783,0.047946084],"study_design_scores_gemma":[0.000095075295,0.000063480555,0.00016229633,0.00016264402,0.00009021675,0.00024196407,0.00007214766,0.06594011,0.0049989456,0.84901845,0.079069145,0.00008549789],"about_ca_topic_score_codex":0.0046545556,"about_ca_topic_score_gemma":0.004997277,"teacher_disagreement_score":0.0147015955,"about_ca_system_score_codex":0.002933883,"about_ca_system_score_gemma":0.0046453704,"threshold_uncertainty_score":0.07014805},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023453333,0.0002678415,0.99009854,0.00049668143,0.000109014,0.000032313572,0.00008268244,0.00040457753,0.0061629023],"genre_scores_gemma":[0.20155708,0.0007081715,0.7852067,0.0013209368,0.0005531949,0.0004453812,0.00033653688,0.0006710635,0.009201021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577147,0.0012358767,0.0003529989,0.0007366979,0.0015526961,0.00035019507],"domain_scores_gemma":[0.9944008,0.0024069878,0.00029661538,0.0018921334,0.00077553047,0.0002279638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069842427,0.00088022125,0.00083133805,0.0022434283,0.0017008268,0.004157294,0.0036982412,0.0018169553,0.005174585],"category_scores_gemma":[0.009222873,0.0013610629,0.0035924949,0.0016300994,0.0064500426,0.012788604,0.0058128457,0.007878361,0.0015362332],"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.00000846498,0.000008077126,0.00008971333,0.000037079593,0.000008558509,0.000027211077,0.0001296342,0.00097439653,0.000478613,0.99297935,0.0004220715,0.0048368587],"study_design_scores_gemma":[0.000016974322,0.000020782149,0.00008737887,0.000070797476,0.000034543973,0.000106384956,0.00004402519,0.022757038,0.0022593925,0.9562507,0.018325279,0.00002665281],"about_ca_topic_score_codex":0.001080341,"about_ca_topic_score_gemma":0.0010813783,"teacher_disagreement_score":0.0069842427,"about_ca_system_score_codex":0.0027804251,"about_ca_system_score_gemma":0.0018049593,"threshold_uncertainty_score":0.0369367},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027060395,0.00013946605,0.9797086,0.000109695146,0.00006144386,0.00017015633,0.00018400287,0.0148141,0.0021065085],"genre_scores_gemma":[0.049206078,0.0001493044,0.9439449,0.00017865119,0.000042246425,0.00032589812,0.0010774323,0.0023508028,0.0027246107],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984376,0.00020830824,0.00014006777,0.000327778,0.0006660672,0.00022020144],"domain_scores_gemma":[0.9970464,0.0012825613,0.00016050304,0.0007280969,0.0006877074,0.000094749375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017030864,0.0021333524,0.001041251,0.00245549,0.0010661148,0.0021964961,0.0032923315,0.0016146271,0.009282737],"category_scores_gemma":[0.007922081,0.0010031812,0.0022004189,0.0012625295,0.0017231758,0.003306691,0.004502345,0.0026655723,0.0045746784],"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.0005063084,0.00018034405,0.0030968923,0.00069219794,0.00013455936,0.00040269838,0.000532449,0.07520683,0.023652311,0.06504758,0.033679985,0.79686785],"study_design_scores_gemma":[0.00021775639,0.00021121981,0.00054559286,0.00017710711,0.00008681407,0.00048352848,0.00019748269,0.80829084,0.036818143,0.0984377,0.05441203,0.0001217489],"about_ca_topic_score_codex":0.003621381,"about_ca_topic_score_gemma":0.0060111955,"teacher_disagreement_score":0.009282737,"about_ca_system_score_codex":0.0014540808,"about_ca_system_score_gemma":0.003471578,"threshold_uncertainty_score":0.031053841},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042175915,0.00019360898,0.9281917,0.0005167627,0.00029842104,0.00020893753,0.00037162518,0.0059628286,0.022080118],"genre_scores_gemma":[0.60743403,0.00031172342,0.37235567,0.00066763273,0.00015445017,0.00025514653,0.00059042434,0.0023270415,0.015903875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953864,0.000659781,0.00035176304,0.00067299424,0.002084312,0.0008447866],"domain_scores_gemma":[0.9933982,0.0014096531,0.0003319921,0.0032674796,0.0014012412,0.00019146549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036233393,0.0006200277,0.00062984234,0.0010747961,0.0015118653,0.0032378987,0.0021199146,0.0008153217,0.0042411806],"category_scores_gemma":[0.00956762,0.00057492807,0.0016269874,0.0011014978,0.0028813535,0.005022329,0.003567891,0.0031572643,0.0012159739],"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.00026689534,0.0001652324,0.0013958806,0.00024271011,0.000045485995,0.00043012534,0.00083061925,0.02489136,0.021508494,0.8437903,0.00826942,0.09816348],"study_design_scores_gemma":[0.000089833804,0.00017047458,0.0008578364,0.00015033945,0.00016216628,0.00058643805,0.0005029811,0.18105738,0.09262901,0.65795064,0.06571167,0.00013126903],"about_ca_topic_score_codex":0.0033603006,"about_ca_topic_score_gemma":0.0036405567,"teacher_disagreement_score":0.0042411806,"about_ca_system_score_codex":0.0017026934,"about_ca_system_score_gemma":0.0033839906,"threshold_uncertainty_score":0.019162238},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022991607,0.00051262736,0.93780965,0.001301927,0.0005301378,0.00016078285,0.00027832735,0.015779948,0.020634988],"genre_scores_gemma":[0.27383158,0.0009306129,0.688439,0.001056433,0.0003212086,0.00028808307,0.0008946669,0.006290039,0.02794844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930895,0.0017433375,0.00031925028,0.0008962643,0.0034191306,0.0005325714],"domain_scores_gemma":[0.98550946,0.004211933,0.0005905706,0.0068959887,0.0025038002,0.0002882964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047177156,0.0006856557,0.0007390938,0.0011616582,0.0011883163,0.004082909,0.001670868,0.0011581111,0.009358573],"category_scores_gemma":[0.019377496,0.0011173455,0.0014449353,0.0008537296,0.002727962,0.0046317577,0.0026945996,0.003402931,0.002966667],"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.00027024225,0.00015398923,0.0018207156,0.00037196052,0.000080931924,0.0004403345,0.0004624722,0.03174403,0.020609979,0.77028084,0.019934632,0.1538299],"study_design_scores_gemma":[0.0002563582,0.00027969337,0.0008029372,0.00035678374,0.00013108803,0.0010947912,0.00021963038,0.23738387,0.105544366,0.34034565,0.31345052,0.00013429872],"about_ca_topic_score_codex":0.0022695528,"about_ca_topic_score_gemma":0.0029978002,"teacher_disagreement_score":0.009358573,"about_ca_system_score_codex":0.0018228585,"about_ca_system_score_gemma":0.0043107625,"threshold_uncertainty_score":0.031307578},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01346855,0.00041859446,0.94369215,0.0005222157,0.000072267314,0.00019871682,0.0011015651,0.03663366,0.0038922615],"genre_scores_gemma":[0.2526618,0.00047441712,0.7371307,0.00048392641,0.00006632185,0.0002769373,0.003505202,0.002719397,0.0026812954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961713,0.00087563,0.0003080932,0.00061151455,0.0016788159,0.0003547538],"domain_scores_gemma":[0.9936451,0.0036312118,0.00050873525,0.0015495401,0.00054731313,0.00011808222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002289125,0.0017441731,0.0012719065,0.0021196958,0.00082712254,0.0032848264,0.0048072585,0.0014867972,0.009628276],"category_scores_gemma":[0.01495524,0.000977982,0.002526554,0.0021603054,0.0027768274,0.0068112696,0.0047357576,0.0023180246,0.0020067797],"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.0011793309,0.00047698012,0.006965239,0.0025650712,0.00043306532,0.00095808454,0.001231179,0.32265678,0.023352401,0.16780418,0.03811178,0.43426582],"study_design_scores_gemma":[0.0001535137,0.00013415048,0.00023387538,0.00009302174,0.00012039331,0.00028220494,0.00020385787,0.8994199,0.015524197,0.07122217,0.012562841,0.00004989362],"about_ca_topic_score_codex":0.007738752,"about_ca_topic_score_gemma":0.0147199035,"teacher_disagreement_score":0.009628276,"about_ca_system_score_codex":0.0017051176,"about_ca_system_score_gemma":0.004187498,"threshold_uncertainty_score":0.032209754},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023018543,0.00021914115,0.96154404,0.00072117854,0.00017471722,0.00013070513,0.0002364499,0.0042284657,0.009726797],"genre_scores_gemma":[0.5149395,0.00045392502,0.44735846,0.001347951,0.00058644835,0.00047198482,0.0005395574,0.0023765105,0.03192568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952223,0.0011411404,0.0004243611,0.0009321491,0.0015551813,0.0007248924],"domain_scores_gemma":[0.9942725,0.002281585,0.00039106887,0.002062061,0.00074430276,0.00024851275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006561629,0.0010377641,0.001256013,0.0014315329,0.002267072,0.0049107433,0.0023519413,0.0017160738,0.0067979437],"category_scores_gemma":[0.0069995685,0.0011016269,0.0026840053,0.0013071414,0.005116054,0.0117763,0.007528392,0.004407815,0.0013346035],"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.00024132174,0.00005492442,0.0014474267,0.00017564838,0.00004292008,0.00027295863,0.0007703271,0.0043237056,0.0056839003,0.9575666,0.0032814438,0.026138853],"study_design_scores_gemma":[0.00012177478,0.00023408925,0.0007192247,0.00016562348,0.00022356006,0.0009812124,0.00037512084,0.07086697,0.033182845,0.7595188,0.13346413,0.00014666293],"about_ca_topic_score_codex":0.0023286685,"about_ca_topic_score_gemma":0.0028314644,"teacher_disagreement_score":0.0067979437,"about_ca_system_score_codex":0.0020643303,"about_ca_system_score_gemma":0.0027346849,"threshold_uncertainty_score":0.034701586},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002423652,0.0002662113,0.9870576,0.0007782645,0.00016299236,0.0000735051,0.00014843667,0.0029819647,0.0061072144],"genre_scores_gemma":[0.111881085,0.0007784532,0.87582105,0.0011858566,0.00027227507,0.00032208912,0.00043965838,0.0021381604,0.0071614217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98038745,0.006542588,0.002420857,0.0023513457,0.007022055,0.0012755962],"domain_scores_gemma":[0.9667514,0.013571216,0.0014918623,0.013940714,0.0037318496,0.00051291427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016479371,0.0011481335,0.0011948318,0.002523214,0.0023628655,0.009769431,0.004730167,0.0032244697,0.010849487],"category_scores_gemma":[0.04724587,0.0024002874,0.00381987,0.0026240442,0.0075165085,0.0190971,0.010231218,0.0088623455,0.005725757],"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.000066222034,0.00002627236,0.0006040085,0.00020332796,0.000037486414,0.00007756683,0.00068540254,0.0028171027,0.0019832782,0.9433779,0.0038903854,0.046230905],"study_design_scores_gemma":[0.00004051493,0.000040170667,0.00012779879,0.0002589292,0.00007582667,0.00025539254,0.00021278551,0.022163648,0.008873376,0.87566113,0.092212684,0.00007761064],"about_ca_topic_score_codex":0.002108355,"about_ca_topic_score_gemma":0.0021407572,"teacher_disagreement_score":0.016479371,"about_ca_system_score_codex":0.0028718493,"about_ca_system_score_gemma":0.0047194418,"threshold_uncertainty_score":0.0871523},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013162083,0.000111630965,0.95326185,0.0006303834,0.00006685627,0.00029067698,0.0005939335,0.028782882,0.0030996865],"genre_scores_gemma":[0.31336126,0.00027402968,0.67457867,0.001183885,0.00008317533,0.000330133,0.0022756031,0.004074809,0.0038383177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98859954,0.0032594735,0.0010658978,0.002580618,0.0034791513,0.0010152048],"domain_scores_gemma":[0.9817046,0.010427472,0.0013575961,0.0045990394,0.0016116826,0.00029952702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069223507,0.0013556328,0.0010456055,0.003049393,0.0016425609,0.00430327,0.0050619817,0.0021138135,0.0062966356],"category_scores_gemma":[0.021447467,0.0015894701,0.002648011,0.0019901206,0.005283852,0.013778917,0.005947372,0.004495178,0.0014691708],"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.0015428092,0.0005637735,0.007893685,0.0011038127,0.0003114813,0.0018360956,0.003287883,0.052036006,0.03722276,0.61576957,0.028419849,0.2500123],"study_design_scores_gemma":[0.00018909498,0.00040954963,0.001679207,0.0002882058,0.0003148519,0.0012558976,0.0008763925,0.4154043,0.1424712,0.36603376,0.07085886,0.00021874423],"about_ca_topic_score_codex":0.009688966,"about_ca_topic_score_gemma":0.008985458,"teacher_disagreement_score":0.009688966,"about_ca_system_score_codex":0.002888666,"about_ca_system_score_gemma":0.0040494446,"threshold_uncertainty_score":0.036609292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03704958,0.0027166544,0.9052364,0.0028272076,0.00027644515,0.00011127494,0.00042367104,0.00096415624,0.050394632],"genre_scores_gemma":[0.6682869,0.0027837823,0.3023424,0.0013329133,0.00038553865,0.0005187084,0.0004921248,0.0008825648,0.022975028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951703,0.001841468,0.0004319216,0.00092117,0.0011393126,0.0004957938],"domain_scores_gemma":[0.99537575,0.0020236906,0.00042719458,0.0013205694,0.00062934635,0.00022345579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005386013,0.00060051435,0.0007763107,0.002476352,0.002608961,0.008170866,0.002084241,0.0024701639,0.004753309],"category_scores_gemma":[0.009745376,0.0011034991,0.0014860781,0.0026507315,0.00996016,0.030015403,0.0059802816,0.0035738307,0.0009883892],"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.0000034431994,0.0000011471601,0.000048271806,0.000009589119,0.0000025378151,0.000014114545,0.00030960774,0.0002690968,0.0000713422,0.9976584,0.00015924708,0.0014532248],"study_design_scores_gemma":[0.0000056614335,0.0000052568043,0.00005108062,0.000030975345,0.000009978096,0.000040255625,0.00021655283,0.0016198909,0.0004597554,0.9794166,0.018132547,0.000011492431],"about_ca_topic_score_codex":0.0024134698,"about_ca_topic_score_gemma":0.001781941,"teacher_disagreement_score":0.008170866,"about_ca_system_score_codex":0.0026544288,"about_ca_system_score_gemma":0.0011711306,"threshold_uncertainty_score":0.028484285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039768573,0.00007981696,0.99192494,0.00018035177,0.00007579024,0.000032622724,0.000028742628,0.0011834255,0.0025174825],"genre_scores_gemma":[0.30525762,0.00050884526,0.68384105,0.00051362126,0.00037046953,0.00025980352,0.00018621121,0.0012619637,0.007800408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965346,0.00096309505,0.00030761736,0.00047766409,0.0013112777,0.00040577236],"domain_scores_gemma":[0.9957838,0.0018479723,0.0002840852,0.0009876929,0.00082348805,0.00027307286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055749505,0.000895079,0.000655245,0.0012214663,0.0011569925,0.0029367649,0.0020252543,0.0010230108,0.0036170634],"category_scores_gemma":[0.00891579,0.00094856566,0.001870879,0.0010598409,0.004509739,0.0061977874,0.00397841,0.002646064,0.000883212],"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.00009342303,0.00003671882,0.0005390029,0.000135994,0.000030587547,0.00028991036,0.000985128,0.012660131,0.0049633277,0.9308075,0.0016455803,0.04781275],"study_design_scores_gemma":[0.000045540393,0.000098063116,0.00019599787,0.00011162649,0.00006595593,0.00034813042,0.0001524075,0.1229912,0.01020851,0.81202817,0.053683758,0.00007068565],"about_ca_topic_score_codex":0.0029973483,"about_ca_topic_score_gemma":0.0022686364,"teacher_disagreement_score":0.0055749505,"about_ca_system_score_codex":0.0013872056,"about_ca_system_score_gemma":0.0023991822,"threshold_uncertainty_score":0.029483557},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043868963,0.000054284636,0.98990685,0.00013138718,0.000046502613,0.000042785057,0.000082122744,0.0030752907,0.0022740022],"genre_scores_gemma":[0.15795863,0.00020855087,0.8358628,0.00029118895,0.00010548715,0.00027734414,0.0004968532,0.001985632,0.0028136023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970595,0.00070200337,0.00020827462,0.0006104127,0.0012152625,0.00020459188],"domain_scores_gemma":[0.9935974,0.0034226396,0.00027780762,0.0019334919,0.0006787687,0.00008993042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026623749,0.0009163395,0.0008004344,0.0014359074,0.0006858253,0.0018238106,0.001486401,0.0007861722,0.0054294146],"category_scores_gemma":[0.01421345,0.0007430122,0.0017188126,0.00096519705,0.0017951482,0.0033239378,0.0021414836,0.0021590116,0.001627814],"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.00011643601,0.00012538416,0.0023409156,0.00043818643,0.000093117815,0.00034296844,0.0005731154,0.18683812,0.009986245,0.49923494,0.006854033,0.2930564],"study_design_scores_gemma":[0.000027820319,0.000053039155,0.00023043685,0.00008492478,0.000051912586,0.00020897671,0.000052015464,0.5542957,0.013785567,0.4116209,0.01955131,0.00003737334],"about_ca_topic_score_codex":0.0013339657,"about_ca_topic_score_gemma":0.0015484182,"teacher_disagreement_score":0.0054294146,"about_ca_system_score_codex":0.00081663847,"about_ca_system_score_gemma":0.0016480334,"threshold_uncertainty_score":0.018163204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019888447,0.000092036316,0.97024417,0.00015869226,0.000085545944,0.00012284875,0.00026278436,0.025377937,0.0016671665],"genre_scores_gemma":[0.116336085,0.0002528303,0.86547834,0.00046798866,0.00014027374,0.00050710165,0.001396695,0.008677332,0.0067434143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944958,0.0009908447,0.0006549727,0.0009675776,0.0024660255,0.00042477844],"domain_scores_gemma":[0.9913346,0.0033625858,0.0005773035,0.0029549543,0.00149007,0.00028053258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037316636,0.00086046883,0.00080158276,0.0012326315,0.00076544436,0.0032572313,0.0037829392,0.0016860106,0.0146481125],"category_scores_gemma":[0.018956954,0.0014342285,0.0025687842,0.00064652145,0.002341482,0.00504596,0.0049400735,0.0036708624,0.0076224],"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.00087381015,0.00036146428,0.0036188131,0.0020171532,0.0003077113,0.0014201788,0.0013735603,0.03895302,0.055257708,0.5295151,0.045703262,0.32059824],"study_design_scores_gemma":[0.0005545289,0.00040550804,0.0008165008,0.0005897182,0.0002981765,0.0018390914,0.00013383247,0.36610943,0.11141999,0.21406506,0.3035025,0.00026569708],"about_ca_topic_score_codex":0.0022053332,"about_ca_topic_score_gemma":0.0013876712,"teacher_disagreement_score":0.0146481125,"about_ca_system_score_codex":0.0016463829,"about_ca_system_score_gemma":0.00415404,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009110161,0.00006837872,0.9842763,0.00017073621,0.000058117723,0.000057028363,0.00004456104,0.001312656,0.0049020373],"genre_scores_gemma":[0.26492494,0.00023960463,0.71378565,0.00030722216,0.000088105786,0.00029480053,0.00013868866,0.0011959752,0.01902509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982139,0.00045956863,0.00016100483,0.00035646942,0.00057086267,0.00023827446],"domain_scores_gemma":[0.997519,0.0010446458,0.00019282951,0.00077680364,0.0003303812,0.00013630149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034255725,0.0005342517,0.00059736613,0.0007588262,0.0011340593,0.002455858,0.0020538257,0.00093202974,0.005256983],"category_scores_gemma":[0.004047483,0.0009449152,0.002041104,0.00093893375,0.0029774904,0.0048313397,0.0038516421,0.002280413,0.0010941097],"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.000073907104,0.000035074096,0.0005039841,0.000069065616,0.000022126293,0.00021670651,0.0005790903,0.005206967,0.0057533504,0.95863354,0.0010529768,0.027853228],"study_design_scores_gemma":[0.00006162795,0.00011613287,0.00027934276,0.00006752788,0.0000951173,0.00039817332,0.00015220573,0.081216805,0.021144759,0.8454143,0.050981827,0.00007224055],"about_ca_topic_score_codex":0.0012182768,"about_ca_topic_score_gemma":0.0019793315,"teacher_disagreement_score":0.005256983,"about_ca_system_score_codex":0.001031088,"about_ca_system_score_gemma":0.0016121377,"threshold_uncertainty_score":0.018116355},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008254016,0.00012798983,0.9624672,0.00012045188,0.00007895187,0.00014665573,0.0003801541,0.027247438,0.0011771498],"genre_scores_gemma":[0.20753734,0.0002448935,0.7816236,0.00043207646,0.000110098605,0.00027740045,0.0018113853,0.0045901053,0.003373134],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877901,0.0032740696,0.0015824109,0.0018766092,0.0045316406,0.0009452116],"domain_scores_gemma":[0.9738937,0.008919086,0.0020136817,0.010124259,0.004669607,0.0003796369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0108441105,0.0012053571,0.0012776533,0.0030617176,0.0013394124,0.002927006,0.0045210156,0.0018714267,0.006241525],"category_scores_gemma":[0.03480679,0.0018312914,0.0023007484,0.0018619524,0.002600964,0.007523053,0.0040282668,0.003560707,0.0023889556],"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.0021019694,0.0003981895,0.014605293,0.0013041423,0.00027721786,0.0005944912,0.0010546611,0.10238343,0.06727794,0.1501364,0.025471184,0.634395],"study_design_scores_gemma":[0.0004264733,0.00059706107,0.0032525887,0.00037995094,0.00029891255,0.00095208717,0.00017620022,0.7058197,0.12472703,0.106702775,0.056325704,0.00034159192],"about_ca_topic_score_codex":0.0072783753,"about_ca_topic_score_gemma":0.005776288,"teacher_disagreement_score":0.0108441105,"about_ca_system_score_codex":0.002248353,"about_ca_system_score_gemma":0.0051440434,"threshold_uncertainty_score":0.0573498},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23148306,0.0010395664,0.65521294,0.000618005,0.0004864461,0.00040710295,0.0008498805,0.090049684,0.019853367],"genre_scores_gemma":[0.8061494,0.00032356157,0.16357043,0.0006880879,0.00016851757,0.00027377866,0.0010235646,0.010923601,0.016878968],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666685,0.0005964331,0.00040234366,0.00050399743,0.0013349261,0.00049539306],"domain_scores_gemma":[0.9842584,0.0042017032,0.0012724501,0.007959933,0.0018994214,0.00040815902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024251116,0.0010983307,0.0008984978,0.0011505575,0.00075187365,0.0029247843,0.0031027852,0.0008874392,0.008256423],"category_scores_gemma":[0.012235217,0.0008624052,0.0010732582,0.000780263,0.001672759,0.0051954766,0.0038644704,0.0018947005,0.0028895468],"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.003219119,0.0008535467,0.033494666,0.0018847084,0.00021761238,0.0018592554,0.0021831903,0.016741436,0.19606146,0.14939502,0.029923132,0.5641668],"study_design_scores_gemma":[0.00071671885,0.0014755215,0.009500167,0.00053785526,0.0006571261,0.002625305,0.0006703277,0.18700911,0.49838316,0.12901405,0.16894302,0.00046758898],"about_ca_topic_score_codex":0.0006484641,"about_ca_topic_score_gemma":0.0011337115,"teacher_disagreement_score":0.008256423,"about_ca_system_score_codex":0.00075354346,"about_ca_system_score_gemma":0.0018666434,"threshold_uncertainty_score":0.027620554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014333229,0.00008767582,0.97237384,0.00028500933,0.0001135667,0.00031559213,0.00018963024,0.00809368,0.0042078476],"genre_scores_gemma":[0.1921308,0.00034645185,0.7958923,0.00031076928,0.00005143848,0.0010337352,0.0007452024,0.0035923638,0.005896917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97973675,0.007339109,0.0024082172,0.0017829351,0.00789353,0.0008394877],"domain_scores_gemma":[0.95089895,0.017736375,0.0044515776,0.01995615,0.0066489056,0.0003080483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010784008,0.0013132847,0.0008189958,0.0019500878,0.00096888107,0.0064593204,0.0028192406,0.0024444598,0.0100414185],"category_scores_gemma":[0.06727486,0.0017921993,0.001690862,0.0011625489,0.0033758518,0.006404376,0.0039966092,0.0033239282,0.002195815],"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.0005830546,0.0005757029,0.007892069,0.0020080958,0.00024216683,0.0016215581,0.0045144064,0.12922062,0.034116376,0.42232174,0.0070352983,0.389869],"study_design_scores_gemma":[0.0004642275,0.0005304783,0.0014781173,0.0012763354,0.00028546437,0.00085250905,0.0011124647,0.42903522,0.1434738,0.30327845,0.11794561,0.0002673564],"about_ca_topic_score_codex":0.0025536935,"about_ca_topic_score_gemma":0.002161457,"teacher_disagreement_score":0.010784008,"about_ca_system_score_codex":0.0023495527,"about_ca_system_score_gemma":0.005990205,"threshold_uncertainty_score":0.05703199},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007204071,0.00011081785,0.97782063,0.00010998252,0.000029637971,0.00006782679,0.0001179471,0.012975617,0.0015634657],"genre_scores_gemma":[0.238777,0.00019483407,0.75192213,0.00030313816,0.00007602879,0.00027767717,0.00076671096,0.0049417657,0.0027406707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956864,0.0011748079,0.00046559586,0.00075264677,0.0015077568,0.00041277602],"domain_scores_gemma":[0.993437,0.0028230068,0.00060422183,0.0022105393,0.0008301104,0.0000951274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033504618,0.001496644,0.00088763284,0.0016306249,0.00058113236,0.0027862925,0.0024968004,0.00096979534,0.0044839038],"category_scores_gemma":[0.012097678,0.0009117051,0.0023801327,0.0007917899,0.002433223,0.004207561,0.0031874853,0.0027612112,0.0019166514],"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.00067278196,0.00025805156,0.007845436,0.001289802,0.00014453469,0.00048232015,0.0016496441,0.16202995,0.061108924,0.32176074,0.00895273,0.43380514],"study_design_scores_gemma":[0.000099714394,0.0003162372,0.00086945546,0.00024172678,0.00014722842,0.00036399422,0.00018149325,0.6276998,0.11002598,0.22741981,0.032511428,0.00012317547],"about_ca_topic_score_codex":0.00146791,"about_ca_topic_score_gemma":0.0020499728,"teacher_disagreement_score":0.0044839038,"about_ca_system_score_codex":0.0014809086,"about_ca_system_score_gemma":0.002130571,"threshold_uncertainty_score":0.01771915},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001494753,0.000072378214,0.9871565,0.00014607127,0.00004348024,0.00012296131,0.00025842403,0.00839202,0.002313428],"genre_scores_gemma":[0.0612703,0.0003410889,0.9235035,0.000748427,0.00008363695,0.00076691154,0.00179128,0.003843088,0.007651809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980202,0.00035000953,0.0002422915,0.00042730971,0.0007315307,0.00022861555],"domain_scores_gemma":[0.9983444,0.0005198009,0.00016718959,0.0004455516,0.00040088364,0.00012219074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036392221,0.00092447497,0.0006087451,0.0012213856,0.00087710255,0.0033914398,0.0037895076,0.001119005,0.006528843],"category_scores_gemma":[0.005403173,0.001353343,0.0014799125,0.0010459966,0.002103398,0.006946436,0.0038403377,0.0027959263,0.0022888593],"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.0007058092,0.0002784007,0.0026486493,0.001340161,0.00014957572,0.00065302337,0.0015979746,0.050863355,0.029920537,0.5894438,0.042262115,0.2801367],"study_design_scores_gemma":[0.00019899991,0.00031352375,0.00059816125,0.00050677784,0.00023416946,0.0010205687,0.00030263158,0.2638551,0.06422323,0.18372555,0.48485896,0.00016227555],"about_ca_topic_score_codex":0.0027499318,"about_ca_topic_score_gemma":0.0030529073,"teacher_disagreement_score":0.006528843,"about_ca_system_score_codex":0.0019546805,"about_ca_system_score_gemma":0.003014955,"threshold_uncertainty_score":0.021841168},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151788825,0.00011503957,0.9651176,0.00048520544,0.000049277296,0.00011516294,0.0008186331,0.003512784,0.014607387],"genre_scores_gemma":[0.45825273,0.0005823582,0.5177893,0.00043756995,0.00009933265,0.00061321066,0.0014979078,0.0026519403,0.018075649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988262,0.00025738857,0.00006983351,0.00025866297,0.0004100413,0.00017785328],"domain_scores_gemma":[0.9979221,0.00070199656,0.00020222194,0.00081700424,0.000263027,0.000093689065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011894612,0.00089554524,0.00048159118,0.0014427684,0.00081807154,0.0026118648,0.0027645403,0.0016284923,0.0070454977],"category_scores_gemma":[0.0045600794,0.0008419429,0.0017569052,0.0011370752,0.0035775495,0.006139369,0.0021025513,0.0022466541,0.0014674048],"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.000057565598,0.000022920363,0.00046971865,0.00008215938,0.000012602096,0.00020591966,0.0003442346,0.09715415,0.0014680235,0.8869682,0.0021456112,0.011068798],"study_design_scores_gemma":[0.00004173498,0.000043573516,0.00020757661,0.00007378711,0.000040074945,0.00021922695,0.000090043686,0.35929582,0.0048615336,0.5849295,0.05015111,0.00004605174],"about_ca_topic_score_codex":0.0076896846,"about_ca_topic_score_gemma":0.007394581,"teacher_disagreement_score":0.0076896846,"about_ca_system_score_codex":0.0014808155,"about_ca_system_score_gemma":0.0024679077,"threshold_uncertainty_score":0.023569584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018584179,0.00006711194,0.97809863,0.00013633232,0.000013178338,0.000045797893,0.000026580967,0.000771762,0.002256345],"genre_scores_gemma":[0.4438442,0.00022548741,0.55202144,0.00016391283,0.00004865962,0.00026778417,0.00019376921,0.0005312566,0.0027034467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721706,0.0009737871,0.00015096793,0.00056560466,0.0008569032,0.00023569402],"domain_scores_gemma":[0.9900739,0.006138937,0.00057079067,0.0023575574,0.000698777,0.00015998672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034355593,0.00062500255,0.00050163764,0.000653406,0.000875892,0.001935098,0.0018265862,0.000967332,0.003689437],"category_scores_gemma":[0.011246799,0.0006347776,0.0011753506,0.00063388195,0.0055625085,0.007438308,0.0031117792,0.00276215,0.00064449373],"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.00009456359,0.000049524508,0.0010061477,0.000119754775,0.000020419006,0.00015516512,0.0005913529,0.02722711,0.00612,0.91081196,0.00069266924,0.053111356],"study_design_scores_gemma":[0.000030043093,0.00011032348,0.00021944108,0.000049786384,0.000044738426,0.00023691759,0.000106134714,0.218098,0.022977836,0.74510926,0.012980479,0.00003706209],"about_ca_topic_score_codex":0.0011670447,"about_ca_topic_score_gemma":0.0010119452,"teacher_disagreement_score":0.003689437,"about_ca_system_score_codex":0.0009020456,"about_ca_system_score_gemma":0.001511751,"threshold_uncertainty_score":0.018169165},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004888477,0.00033714052,0.98305976,0.00058453664,0.00027935195,0.00009632423,0.00013202247,0.0008581118,0.009764225],"genre_scores_gemma":[0.16210951,0.00091887545,0.8198081,0.0010754751,0.00048118317,0.00034158697,0.00041429346,0.00052193325,0.014329026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953329,0.0011446981,0.0005458758,0.00066151907,0.0018351423,0.00047983613],"domain_scores_gemma":[0.996316,0.0009705122,0.00038686473,0.0010474043,0.0009853271,0.00029397034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006293354,0.0006009463,0.0007372434,0.0019041001,0.0017545293,0.005542561,0.0022131454,0.0012935983,0.0067732055],"category_scores_gemma":[0.0072122565,0.0007667658,0.002490135,0.001709146,0.0042504417,0.0128571605,0.0037844307,0.0030774903,0.0022759896],"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.000019482064,0.000010426088,0.00020319934,0.000043763222,0.0000081426915,0.00003495316,0.000173257,0.00096376834,0.00088861294,0.9865676,0.0010223966,0.01006435],"study_design_scores_gemma":[0.00004930412,0.0000618158,0.00016066877,0.000087648914,0.00004722392,0.0001681915,0.00011531521,0.019528186,0.0046532284,0.8744105,0.10065158,0.00006628833],"about_ca_topic_score_codex":0.0024632483,"about_ca_topic_score_gemma":0.0025204085,"teacher_disagreement_score":0.0067732055,"about_ca_system_score_codex":0.0022414215,"about_ca_system_score_gemma":0.0025429064,"threshold_uncertainty_score":0.033282876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014499227,0.00028753266,0.96787995,0.00030715563,0.000097908334,0.00027256587,0.00024312592,0.0100046955,0.00640787],"genre_scores_gemma":[0.49149314,0.0007199997,0.48936257,0.00028048785,0.00011502035,0.00081128033,0.0018100169,0.0022926126,0.013114946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978058,0.00078281283,0.00015780992,0.00023889406,0.0006621602,0.00035247445],"domain_scores_gemma":[0.99813986,0.00051973184,0.00013318223,0.00080319424,0.00017356178,0.00023041008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004048533,0.0005722356,0.0006320378,0.0007843901,0.0011152969,0.0024095743,0.0027997154,0.0011625877,0.0073193717],"category_scores_gemma":[0.004723841,0.0007079314,0.00072924816,0.00072257227,0.0012794086,0.0049375514,0.005022477,0.0019186,0.0015347565],"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.0008571884,0.0003340269,0.0031441487,0.0004973774,0.0001485153,0.0008814809,0.00092663616,0.1685734,0.026658526,0.56030905,0.01933039,0.21833925],"study_design_scores_gemma":[0.00023599894,0.00019224767,0.00046417906,0.000126728,0.00003551984,0.00030385135,0.00013809363,0.6572921,0.016491817,0.21981841,0.10480661,0.00009447437],"about_ca_topic_score_codex":0.0031348104,"about_ca_topic_score_gemma":0.0037131344,"teacher_disagreement_score":0.0073193717,"about_ca_system_score_codex":0.0011934583,"about_ca_system_score_gemma":0.0026488372,"threshold_uncertainty_score":0.024485707},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010411415,0.00025283688,0.9512922,0.00020651933,0.00009832281,0.00014031993,0.00074288546,0.031832747,0.0050226734],"genre_scores_gemma":[0.16165763,0.00038190978,0.82346916,0.00029526703,0.000044890516,0.00040598676,0.002138001,0.0068833004,0.00472375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999146,0.00020390058,0.00007901723,0.00010784812,0.0003476453,0.000115603776],"domain_scores_gemma":[0.9977748,0.0012606552,0.00013663321,0.0003970181,0.0003825023,0.000048353653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011265224,0.0008656827,0.00054297573,0.0007754501,0.00043407278,0.0014954887,0.0013913296,0.0007742735,0.010149349],"category_scores_gemma":[0.0051282616,0.0007433447,0.000825477,0.0005889744,0.0007600873,0.00189225,0.0014437168,0.0013089883,0.0031378847],"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.0010230449,0.00025305443,0.0022724955,0.0016930195,0.0001460636,0.00068981317,0.000575214,0.19855848,0.09030319,0.18295252,0.07070917,0.450824],"study_design_scores_gemma":[0.00039292526,0.0002726902,0.00043267763,0.00021806396,0.000082859355,0.00045614655,0.00012474836,0.73063403,0.1109247,0.07828672,0.078095324,0.00007909821],"about_ca_topic_score_codex":0.0009866247,"about_ca_topic_score_gemma":0.0016838498,"teacher_disagreement_score":0.010149349,"about_ca_system_score_codex":0.0007113327,"about_ca_system_score_gemma":0.0024857537,"threshold_uncertainty_score":0.03395301},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114659995,0.00087971997,0.78416044,0.00034712633,0.00090706337,0.00042576785,0.0015164154,0.050214637,0.0468889],"genre_scores_gemma":[0.5259335,0.0006367167,0.36166558,0.0013208321,0.00019947003,0.00052242144,0.0038733587,0.015471221,0.090376966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988254,0.0001384666,0.00015419409,0.00025569898,0.0004429114,0.00018332824],"domain_scores_gemma":[0.99556845,0.0007207084,0.0004389889,0.0023271344,0.00085560203,0.000089162706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009972284,0.00069637335,0.0005118928,0.0008553365,0.00060959306,0.0016435784,0.0020320565,0.0006337327,0.01003208],"category_scores_gemma":[0.004077253,0.0006467254,0.0005882599,0.0009323161,0.00094739604,0.0027713412,0.0023847453,0.0009586931,0.005058875],"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.0017307061,0.00022576602,0.014251781,0.001183804,0.00011076254,0.0008339457,0.0020640257,0.013275424,0.12123615,0.1945062,0.051490374,0.5990912],"study_design_scores_gemma":[0.00011538639,0.00041921853,0.003892641,0.00028457356,0.00014173928,0.0013127368,0.00028620326,0.05122551,0.3052579,0.04717816,0.5896606,0.00022526523],"about_ca_topic_score_codex":0.0012544368,"about_ca_topic_score_gemma":0.001790882,"teacher_disagreement_score":0.01003208,"about_ca_system_score_codex":0.00082478975,"about_ca_system_score_gemma":0.001445943,"threshold_uncertainty_score":0.033560693},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057258133,0.0008424531,0.8628424,0.0007644774,0.00014695074,0.00034398155,0.00040750497,0.068768926,0.008625103],"genre_scores_gemma":[0.2826532,0.00050300674,0.6992985,0.0009260749,0.00008844716,0.00040486007,0.0019289427,0.008626326,0.00557065],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959422,0.00085070083,0.00029008408,0.00074426836,0.0018419492,0.00033082676],"domain_scores_gemma":[0.9936783,0.001963788,0.000424145,0.0026259231,0.0011863052,0.00012145088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016799681,0.0017550805,0.0009069817,0.00196167,0.000577136,0.0015369955,0.0034963524,0.00090035703,0.003866569],"category_scores_gemma":[0.009049305,0.000738157,0.001872412,0.0015286424,0.0021810876,0.00385475,0.0028214937,0.0027381682,0.0020488258],"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.0007299621,0.0005874992,0.007823786,0.0012227586,0.00021042768,0.00048689698,0.0008755303,0.043559965,0.109104864,0.059512176,0.02920133,0.7466848],"study_design_scores_gemma":[0.00042296157,0.00092301314,0.002794931,0.00016247664,0.00036921527,0.0014237267,0.0004066282,0.544855,0.2818308,0.06728446,0.099280186,0.00024663037],"about_ca_topic_score_codex":0.002350986,"about_ca_topic_score_gemma":0.0036426783,"teacher_disagreement_score":0.003866569,"about_ca_system_score_codex":0.00089320214,"about_ca_system_score_gemma":0.00281316,"threshold_uncertainty_score":0.012934983},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014540714,0.00040844857,0.90458167,0.00040807071,0.00009837454,0.00029264507,0.00092291244,0.07282961,0.0059175296],"genre_scores_gemma":[0.18074346,0.00038668676,0.80054253,0.00033306284,0.00004715104,0.00034718655,0.003072695,0.011213172,0.0033140809],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99623317,0.00146582,0.00022884303,0.00045035357,0.0014135721,0.00020824217],"domain_scores_gemma":[0.9842461,0.009826516,0.0006828907,0.003444162,0.001592206,0.00020821745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038970136,0.0010533545,0.0005557426,0.0018589381,0.00061843864,0.0016602854,0.00224407,0.0010024952,0.0130175315],"category_scores_gemma":[0.020270675,0.0008879031,0.001401471,0.0007778654,0.0018635445,0.0025494145,0.0031280003,0.001526603,0.0030707724],"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.00064120616,0.00038858384,0.003768337,0.002243288,0.0002098857,0.0009840003,0.0010223459,0.09939758,0.046131294,0.12620775,0.06466213,0.65434355],"study_design_scores_gemma":[0.00040235,0.00033805482,0.0009084113,0.00041432364,0.00006714062,0.0011252591,0.00019202047,0.7176665,0.092020415,0.10290837,0.08385533,0.00010182882],"about_ca_topic_score_codex":0.001570941,"about_ca_topic_score_gemma":0.0020706651,"teacher_disagreement_score":0.0130175315,"about_ca_system_score_codex":0.0009082966,"about_ca_system_score_gemma":0.002491988,"threshold_uncertainty_score":0.043547988},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093889646,0.0011007416,0.8435974,0.0010025175,0.0004536521,0.00013609965,0.000248959,0.048879758,0.010691151],"genre_scores_gemma":[0.52047735,0.0004488714,0.4679156,0.0005083799,0.0002441633,0.00014941354,0.0006819887,0.0044934493,0.005080855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743724,0.00055560144,0.00016198464,0.00036963943,0.0011378303,0.00033774943],"domain_scores_gemma":[0.9967127,0.0009927192,0.0003094016,0.0012147713,0.0006286855,0.0001417671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023812526,0.0012175553,0.0006127406,0.001082211,0.0005847778,0.0017597267,0.0012115949,0.0006749475,0.0029313092],"category_scores_gemma":[0.0046694265,0.0007803504,0.00083901046,0.00092498946,0.001694346,0.0030867823,0.0024429592,0.0014921892,0.0011039427],"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.0013077001,0.00052154314,0.016613742,0.00073104264,0.00023490378,0.00081364304,0.00095771067,0.14783226,0.13696487,0.063319504,0.026623994,0.6040791],"study_design_scores_gemma":[0.0001993896,0.00042882987,0.0024282404,0.00013840348,0.00016201171,0.0004012908,0.00015202243,0.7877215,0.12241242,0.045353975,0.04045654,0.00014534483],"about_ca_topic_score_codex":0.0030857876,"about_ca_topic_score_gemma":0.0036734059,"teacher_disagreement_score":0.0030857876,"about_ca_system_score_codex":0.0007375611,"about_ca_system_score_gemma":0.0024653652,"threshold_uncertainty_score":0.012593389},"labels":[],"label_agreement":null}]}