{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":133,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":133,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"7d44f54137f2","filters":{"venue":"Proceedings of the ACM on Programming Languages"}},"results":[{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Annabelle McIver","is_ca":false},{"name":"Carroll Morgan","is_ca":false},{"name":"Benjamin Lucien Kaminski","is_ca":false},{"name":"Joost-Pieter Katoen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02387605539249461,"gpt":0.2929920630576812,"spread":0.2691160076651866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01082689,0.001118103,0.001777497,0.002322178,0.001920467,0.003750655,0.003948273,0.003038846,0.005396087],"category_scores_gemma":[0.03787574,0.001393762,0.004127375,0.001217446,0.006608925,0.008906933,0.00695698,0.01136047,0.002666793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001736513,"about_ca_system_score_gemma":0.002679776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001402364,"about_ca_topic_score_gemma":0.001348867,"domain_scores_codex":[0.9839776,0.002964164,0.001701934,0.003480709,0.006980198,0.0008954198],"domain_scores_gemma":[0.9702203,0.01737424,0.0009487954,0.004876605,0.005687931,0.000892276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001223286,0.0001057879,0.0008302918,0.0003687904,0.0001177109,0.0005752259,0.00063794,0.009477801,0.008054091,0.8811338,0.009317865,0.08925842],"study_design_scores_gemma":[0.0001168697,0.0001239531,0.0001938109,0.0001648888,0.0001384561,0.0007879874,0.00006345788,0.08455686,0.01701154,0.8494859,0.04723151,0.0001247842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00147991,0.0001334002,0.9931725,0.0007271205,0.0003345684,0.00008819467,0.00009742329,0.0009573445,0.003009521],"genre_scores_gemma":[0.08125163,0.0004080634,0.9069343,0.002678845,0.0007464403,0.0005610788,0.0003426386,0.00106129,0.006015724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01082689,"threshold_uncertainty_score":0.05725873,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vytautas Astrauskas","is_ca":false},{"name":"Christoph Matheja","is_ca":false},{"name":"Federico Poli","is_ca":false},{"name":"Péter Müller","is_ca":false},{"name":"Alexander J. Summers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02775053370188831,"gpt":0.246189855091322,"spread":0.2184393213894337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01064282,0.0004446706,0.0004055096,0.003801482,0.001775169,0.004095004,0.001491282,0.001510125,0.002046274],"category_scores_gemma":[0.107233,0.0009990128,0.00040268,0.004210689,0.005659316,0.01043724,0.003476636,0.002296576,0.001554551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001578135,"about_ca_system_score_gemma":0.002663461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004593227,"about_ca_topic_score_gemma":0.005608388,"domain_scores_codex":[0.9833333,0.005352962,0.0008417261,0.002597072,0.006870961,0.00100383],"domain_scores_gemma":[0.8764629,0.06045334,0.02581451,0.01570937,0.01969637,0.001863516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001421769,0.000124158,0.2254928,0.001286233,0.0000984301,0.001433926,0.2942823,0.001012131,0.01035359,0.0325762,0.02814287,0.4050551],"study_design_scores_gemma":[0.00005892012,0.0003637027,0.2749755,0.002367766,0.0001446282,0.008272327,0.1617327,0.006653406,0.01839905,0.04660614,0.480016,0.0004099226],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8982088,0.003874487,0.04428279,0.017355,0.0002070079,0.0001053114,0.0008608329,0.002619089,0.03248673],"genre_scores_gemma":[0.9635151,0.002269609,0.0195791,0.003465301,0.00009602016,0.000136027,0.0009056725,0.002179051,0.007854161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01064282,"threshold_uncertainty_score":0.05628532,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Johannes Späth","is_ca":false},{"name":"Karim Ali","is_ca":true},{"name":"Eric Bodden","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01762344739751871,"gpt":0.2833335576704017,"spread":0.265710110272883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003969205,0.001940013,0.001097362,0.002068304,0.001164535,0.003564104,0.002098191,0.001010199,0.003529875],"category_scores_gemma":[0.01725411,0.001371218,0.00344129,0.001408003,0.002879447,0.007178044,0.004843171,0.002921807,0.000637402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00264466,"about_ca_system_score_gemma":0.004900813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008296489,"about_ca_topic_score_gemma":0.006728485,"domain_scores_codex":[0.9924549,0.00211049,0.0006592619,0.001658421,0.002427089,0.0006898392],"domain_scores_gemma":[0.9856012,0.00795369,0.001194366,0.003273432,0.00164138,0.0003359159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008860754,0.0003341471,0.01386208,0.001179306,0.0004205107,0.0005885449,0.001499653,0.5016466,0.05835079,0.1904013,0.004139918,0.226691],"study_design_scores_gemma":[0.00007677417,0.0001203555,0.0006359208,0.00006938953,0.0001036092,0.00009633267,0.0001205474,0.8322768,0.03223432,0.1290997,0.005094252,0.00007205845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02934791,0.0001335525,0.9625984,0.0001509352,0.00003843625,0.000122868,0.0002312401,0.006345047,0.001031697],"genre_scores_gemma":[0.4694161,0.0002746418,0.5253914,0.0002401558,0.0000549334,0.0004216304,0.000935503,0.001629902,0.001635601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008296489,"threshold_uncertainty_score":0.02099144,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Davood Mazinanian","is_ca":true},{"name":"Ameya Ketkar","is_ca":false},{"name":"Nikolaos Tsantalis","is_ca":true},{"name":"Danny Dig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1616311306775965,"gpt":0.3304427533680927,"spread":0.1688116226904962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01495806,0.0003052767,0.0002337112,0.002977469,0.001805149,0.005978344,0.00124081,0.001116309,0.0009436436],"category_scores_gemma":[0.04180615,0.0008262793,0.0003234938,0.001824724,0.006498975,0.01185563,0.003772583,0.001796992,0.0002244318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003310166,"about_ca_system_score_gemma":0.003040859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008047362,"about_ca_topic_score_gemma":0.007891876,"domain_scores_codex":[0.9867798,0.008307465,0.000590681,0.0009966824,0.002567764,0.0007576437],"domain_scores_gemma":[0.9343551,0.04965968,0.007623679,0.001850744,0.005223094,0.001287605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"observational","study_design_scores_codex":[0.00005737568,0.00006718089,0.06603796,0.0002398923,0.00001617713,0.0007722061,0.8682007,0.000336739,0.007481238,0.02081803,0.0007889669,0.0351835],"study_design_scores_gemma":[0.00002119589,0.0001667609,0.2123483,0.001370564,0.00006901759,0.00216626,0.648507,0.007345257,0.004680371,0.02841665,0.09471467,0.0001939055],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9728158,0.0006132338,0.01372113,0.003165048,0.00001805517,0.00003433066,0.00004088368,0.00007979933,0.009511758],"genre_scores_gemma":[0.9900517,0.0005365952,0.007475796,0.0003173366,0.00001427004,0.00004972361,0.00003878902,0.0001339407,0.001381975],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01495806,"threshold_uncertainty_score":0.07910675,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Ralf Jung","is_ca":false},{"name":"Rodolphe Lepigre","is_ca":false},{"name":"G. Parthasarathy","is_ca":false},{"name":"Marianna Rapoport","is_ca":true},{"name":"Amin Timany","is_ca":false},{"name":"Derek Dreyer","is_ca":false},{"name":"Bart Jacobs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00815648363780745,"gpt":0.2676606539177327,"spread":0.2595041702799252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388313,0.0004053111,0.0004360895,0.00116692,0.002235444,0.003097752,0.001252296,0.001467014,0.002791732],"category_scores_gemma":[0.004427819,0.0004413451,0.0008059258,0.001210956,0.00867385,0.01012153,0.002588823,0.005820073,0.0004209338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002420167,"about_ca_system_score_gemma":0.001968471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003927835,"about_ca_topic_score_gemma":0.002622782,"domain_scores_codex":[0.997534,0.0008442309,0.00009407479,0.0004512367,0.0007073709,0.0003689463],"domain_scores_gemma":[0.9972532,0.001503738,0.0002424963,0.0004655815,0.0003671894,0.0001676859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001679604,0.000005556776,0.0001114015,0.00001636678,0.00000361234,0.00003627055,0.0003111892,0.0007455045,0.0001898008,0.992201,0.0005116811,0.005850776],"study_design_scores_gemma":[0.00002050071,0.00002481313,0.0001020469,0.00003344873,0.00001523053,0.00006798832,0.0001507623,0.006893498,0.001029904,0.9670475,0.02459566,0.00001866052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02747683,0.004463881,0.8951297,0.007268141,0.0004586874,0.00008133119,0.0001433661,0.0008289157,0.06414907],"genre_scores_gemma":[0.7777974,0.002489914,0.197356,0.00260567,0.00069091,0.0002167825,0.0001527229,0.0003502206,0.01834029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003927835,"threshold_uncertainty_score":0.01791936,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Magnus Madsen","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Frank Tip","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04014316125137894,"gpt":0.2973735126818726,"spread":0.2572303514304937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00653951,0.001111188,0.0009022124,0.002721624,0.003069032,0.005666277,0.004418548,0.003483211,0.005347979],"category_scores_gemma":[0.01221354,0.001969242,0.004499804,0.00257078,0.00578026,0.01836667,0.006119793,0.005153911,0.0016383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003322049,"about_ca_system_score_gemma":0.003806423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01368343,"about_ca_topic_score_gemma":0.009083595,"domain_scores_codex":[0.9953621,0.001364389,0.0004535094,0.0007614209,0.001396756,0.0006618556],"domain_scores_gemma":[0.9918476,0.00465412,0.0006006191,0.001315651,0.001150887,0.0004310226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005967221,0.0000329343,0.0003075269,0.0001031594,0.00002117674,0.0003246985,0.0009152183,0.01006285,0.00118384,0.9773424,0.001888735,0.007757726],"study_design_scores_gemma":[0.00006751711,0.00005736763,0.0001396597,0.00008070267,0.00007005327,0.000247907,0.0003382928,0.1035056,0.003302695,0.8532084,0.03891744,0.000064413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005581553,0.0001490972,0.9843322,0.001259299,0.00007737702,0.000140964,0.0003884169,0.002313705,0.00575735],"genre_scores_gemma":[0.2894938,0.0008280973,0.6928009,0.00118709,0.000437851,0.0008116449,0.001523631,0.001256377,0.01166041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01368343,"threshold_uncertainty_score":0.03458464,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Zachary Kincaid","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04933114638016753,"gpt":0.3478667795385895,"spread":0.2985356331584219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729252,0.001283112,0.0009512305,0.00095721,0.0008298308,0.002330077,0.001342463,0.001120339,0.008235074],"category_scores_gemma":[0.00675634,0.0006575051,0.002061475,0.0007015233,0.00272769,0.002822986,0.002109018,0.002296209,0.001195926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002458642,"about_ca_system_score_gemma":0.002034886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002385544,"about_ca_topic_score_gemma":0.003264326,"domain_scores_codex":[0.9975531,0.0007947676,0.0002149776,0.0005149186,0.0006151477,0.0003071548],"domain_scores_gemma":[0.9975951,0.001882178,0.0001292649,0.0001502023,0.0001674115,0.00007574927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000162465,0.0001463836,0.0004509195,0.0005301014,0.00006658037,0.0001996595,0.0006599389,0.112936,0.006155251,0.8064868,0.001975705,0.07023017],"study_design_scores_gemma":[0.0001327246,0.0001185035,0.00009810898,0.00009783475,0.00005735889,0.000077508,0.0001822294,0.2506192,0.005858969,0.7337814,0.008943558,0.00003256135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02317699,0.0003355319,0.9556727,0.0005391752,0.00007491294,0.0003921906,0.0001744193,0.001049836,0.01858426],"genre_scores_gemma":[0.3499716,0.0004888733,0.6368597,0.0004183023,0.00006169312,0.0008463884,0.0005342734,0.0003297006,0.01048956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008235074,"threshold_uncertainty_score":0.02754903,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Python (programming language); Programming language; Computer science; Software engineering","authors":[{"name":"Jialu Zhang","is_ca":true},{"name":"José Cambronero","is_ca":false},{"name":"Sumit Gulwani","is_ca":false},{"name":"Vu Le","is_ca":false},{"name":"Ružica Piskač","is_ca":false},{"name":"Gustavo Soares","is_ca":false},{"name":"Gust Verbruggen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02296471450013041,"gpt":0.3016022634851895,"spread":0.2786375489850591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001852713,0.001446867,0.0006019085,0.001121522,0.0005513198,0.0009203794,0.00275021,0.001063537,0.008458891],"category_scores_gemma":[0.01179662,0.0007182306,0.0005741901,0.000617118,0.000977674,0.003448718,0.002885299,0.001554242,0.004589417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007757277,"about_ca_system_score_gemma":0.001282562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002523351,"about_ca_topic_score_gemma":0.003913584,"domain_scores_codex":[0.9983706,0.000362807,0.000143699,0.0005245254,0.000470522,0.0001279407],"domain_scores_gemma":[0.99505,0.002509062,0.0005688918,0.001083319,0.0005113723,0.0002773869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001999063,0.0009261215,0.02871657,0.00193274,0.0001367783,0.001561125,0.004290213,0.01821535,0.04273649,0.003203007,0.1241806,0.7721019],"study_design_scores_gemma":[0.0006197235,0.002208439,0.03091272,0.0004384844,0.0002159007,0.002576987,0.002658491,0.5059935,0.2667195,0.01386005,0.1734272,0.0003690701],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"software","genre_gemma":"empirical","genre_scores_codex":[0.1690997,0.0004551554,0.1480205,0.0005756186,0.000172341,0.0003495486,0.00407169,0.6727226,0.00453279],"genre_scores_gemma":[0.6615663,0.0003139662,0.2940616,0.0007557975,0.00004366247,0.0003569915,0.01193225,0.01808441,0.01288495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008458891,"threshold_uncertainty_score":0.02829778,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Gregor Richards","is_ca":true},{"name":"Ellen Arteca","is_ca":true},{"name":"Alexi Turcotte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03571118779894979,"gpt":0.3085080125902429,"spread":0.2727968247912931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003438702,0.001127431,0.0006297379,0.0005861432,0.000875993,0.003157335,0.002698492,0.001136932,0.003665046],"category_scores_gemma":[0.02077775,0.001282181,0.001331091,0.0005465632,0.00269269,0.008073229,0.003669295,0.004555932,0.002901336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001112523,"about_ca_system_score_gemma":0.003573649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003180766,"about_ca_topic_score_gemma":0.003800867,"domain_scores_codex":[0.9967498,0.0006906699,0.0002645496,0.0006624193,0.001127994,0.0005047301],"domain_scores_gemma":[0.9869479,0.00266415,0.0006994627,0.008094024,0.001240396,0.0003540161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002126983,0.000533346,0.03567949,0.0008842522,0.0002640977,0.000944652,0.0044618,0.06324046,0.206141,0.1765829,0.02509194,0.4840491],"study_design_scores_gemma":[0.0002151223,0.0006991882,0.005776071,0.00055593,0.0003983016,0.0009186423,0.000604837,0.3990157,0.281628,0.1505784,0.1592393,0.0003704216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1117963,0.0006295528,0.8256047,0.00163544,0.0004253822,0.0001834715,0.0002433488,0.04656991,0.01291184],"genre_scores_gemma":[0.5063838,0.0004946512,0.4613895,0.001475292,0.0001379489,0.0001813336,0.0006483229,0.01829975,0.01098941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003665046,"threshold_uncertainty_score":0.01818579,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01116509791335096,"gpt":0.2304979998718409,"spread":0.21933290195849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035806,0.0006983911,0.000998655,0.0009164683,0.0009306539,0.003452514,0.002924599,0.0009721098,0.004360279],"category_scores_gemma":[0.01696128,0.0007667197,0.002585257,0.001294983,0.004430838,0.01246383,0.003072975,0.002905855,0.0009055017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001991274,"about_ca_system_score_gemma":0.003479778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005010627,"about_ca_topic_score_gemma":0.006134363,"domain_scores_codex":[0.9943869,0.001492012,0.0004238214,0.001144706,0.001830637,0.0007219514],"domain_scores_gemma":[0.9883482,0.007365521,0.000859572,0.002042801,0.001096366,0.000287549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006929975,0.000207281,0.002126944,0.0004361238,0.0001571236,0.0005244637,0.0009459231,0.1012222,0.01673613,0.7994781,0.002406097,0.07506673],"study_design_scores_gemma":[0.00007992701,0.00009364157,0.0002205425,0.00004590497,0.00007822039,0.0001248517,0.0001319902,0.3394962,0.0261181,0.6297919,0.003760942,0.00005792094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03883542,0.0001276139,0.953832,0.0004740062,0.0000649413,0.0001346808,0.0003608144,0.003162355,0.003008209],"genre_scores_gemma":[0.7031819,0.0002002321,0.2916148,0.0003329653,0.00008810896,0.0001989213,0.0008466474,0.000516951,0.003019462],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005010627,"threshold_uncertainty_score":0.01893628,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01339409823796038,"gpt":0.2773575639649273,"spread":0.2639634657269669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003768454,0.0008080328,0.0006152435,0.001631801,0.002091743,0.003352977,0.001784286,0.001273742,0.006932293],"category_scores_gemma":[0.005620138,0.0007946706,0.001948372,0.001363529,0.004275703,0.007588408,0.004008688,0.004707668,0.001563078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002220529,"about_ca_system_score_gemma":0.00325503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00210853,"about_ca_topic_score_gemma":0.001768376,"domain_scores_codex":[0.9957225,0.0009327289,0.0004085953,0.001048263,0.001551135,0.000336678],"domain_scores_gemma":[0.9966462,0.001689384,0.0002906479,0.0004454617,0.000674922,0.000253329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003687994,0.00003198012,0.0001548805,0.00009104574,0.00001917131,0.00009301179,0.0001530376,0.002962004,0.001075449,0.9746568,0.002131568,0.01859403],"study_design_scores_gemma":[0.00003204715,0.00003076204,0.0001005822,0.0000348814,0.00002994619,0.0002040195,0.00003735246,0.02914401,0.00213557,0.9401916,0.02803516,0.00002407786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004950373,0.0003344598,0.9724151,0.001736096,0.0001178839,0.0001303843,0.0005189943,0.0009317919,0.0188649],"genre_scores_gemma":[0.3011384,0.0007896192,0.673129,0.00286644,0.0005848532,0.0004592326,0.001035138,0.0002872823,0.01971009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006932293,"threshold_uncertainty_score":0.0231908,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nico Lehmann","is_ca":false},{"name":"Adam T. Geller","is_ca":true},{"name":"Niki Vazou","is_ca":false},{"name":"Ranjit Jhala","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02614794403722743,"gpt":0.2819619222959308,"spread":0.2558139782587033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005530996,0.001389351,0.001246954,0.002048442,0.001481709,0.005252709,0.004202314,0.002251628,0.02296918],"category_scores_gemma":[0.02369981,0.002228491,0.003618213,0.001469388,0.004021586,0.01371351,0.006594471,0.005258026,0.00817977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003048335,"about_ca_system_score_gemma":0.004396156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004691685,"about_ca_topic_score_gemma":0.00506492,"domain_scores_codex":[0.9926272,0.001425096,0.0006576817,0.0009707347,0.003696668,0.0006227156],"domain_scores_gemma":[0.9918337,0.003019208,0.0006963525,0.003096998,0.001165782,0.0001879395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006587445,0.00009058786,0.002697022,0.0007615496,0.00007820438,0.0004003135,0.000833071,0.01987383,0.01154354,0.7636686,0.03687714,0.1625174],"study_design_scores_gemma":[0.000167428,0.0002224455,0.0006250529,0.0006460555,0.0001308458,0.0006440071,0.0002084382,0.1232457,0.03822472,0.4640736,0.3715844,0.0002274177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002867032,0.000281326,0.9566492,0.0005137093,0.0002532853,0.0001500659,0.0006482355,0.03048042,0.008156809],"genre_scores_gemma":[0.1229322,0.000664487,0.8363511,0.001409393,0.0003006098,0.0007064526,0.002668413,0.02096955,0.01399786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02296918,"threshold_uncertainty_score":0.07683957,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01364223519066183,"gpt":0.2654272453488792,"spread":0.2517850101582174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005858117,0.0007012275,0.0006769493,0.003202279,0.0007724668,0.002543063,0.001453003,0.001034909,0.002554152],"category_scores_gemma":[0.03586992,0.0004601903,0.001618192,0.0009136986,0.0050891,0.004331021,0.002510397,0.002625846,0.0001962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003222109,"about_ca_system_score_gemma":0.00111016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00147466,"about_ca_topic_score_gemma":0.0005574169,"domain_scores_codex":[0.9936643,0.002064139,0.0003250561,0.001010807,0.002358547,0.0005772049],"domain_scores_gemma":[0.9594405,0.03020046,0.003594396,0.003009023,0.002988839,0.0007667691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001711826,0.00006624597,0.002631273,0.0002399637,0.0001304941,0.0002288772,0.0004747297,0.2639635,0.00977144,0.7050799,0.0007352247,0.01650713],"study_design_scores_gemma":[0.00001271749,0.0000577813,0.0007119315,0.00003163963,0.00003269782,0.00005122486,0.00006301732,0.534182,0.004681731,0.4591117,0.001034969,0.00002864641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1495814,0.0004219379,0.8394099,0.001212636,0.00004974135,0.0001064734,0.000347314,0.0008366636,0.008033928],"genre_scores_gemma":[0.9432387,0.0002185829,0.05390473,0.0001832907,0.0001078334,0.0001361041,0.0002531643,0.0001883375,0.001769329],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005858117,"threshold_uncertainty_score":0.03098106,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Junyoung Jang","is_ca":true},{"name":"Samuel Gélineau","is_ca":true},{"name":"Stefan Monnier","is_ca":true},{"name":"Brigitte Pientka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02638656077483974,"gpt":0.2626384689665354,"spread":0.2362519081916957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003483504,0.0006192833,0.0007058595,0.0008177368,0.001248627,0.003066433,0.002155133,0.001663301,0.006084268],"category_scores_gemma":[0.005677316,0.001043047,0.001967522,0.0005137001,0.003504235,0.00637993,0.004614797,0.003063407,0.001511649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001592636,"about_ca_system_score_gemma":0.002071967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002427759,"about_ca_topic_score_gemma":0.001959834,"domain_scores_codex":[0.9980291,0.0004212909,0.00011004,0.0004055585,0.0005826253,0.0004514303],"domain_scores_gemma":[0.9981166,0.0005607071,0.0001768025,0.0008394397,0.0001708798,0.0001355843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001415177,0.00003780453,0.001651539,0.0001649411,0.00003105258,0.0002960857,0.001306159,0.005739782,0.0134736,0.9158812,0.003737395,0.05753894],"study_design_scores_gemma":[0.00005508124,0.000175476,0.001060477,0.0002718394,0.00007016549,0.0006980597,0.0003157123,0.0968238,0.03598647,0.7168415,0.1475658,0.0001356252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01636541,0.0002193911,0.9686403,0.0005474586,0.0001147702,0.0001021768,0.0001083524,0.00485662,0.009045567],"genre_scores_gemma":[0.2788336,0.0002551399,0.7059716,0.0005651303,0.0001073564,0.0003312497,0.0001983801,0.002219599,0.01151788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006084268,"threshold_uncertainty_score":0.02035391,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hari Govind V K","is_ca":true},{"name":"Sharon Shoham","is_ca":false},{"name":"Arie Gurfinkel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03735519205231355,"gpt":0.2969661613641396,"spread":0.259610969311826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002220401,0.0009166442,0.0006267638,0.0009597327,0.0007609124,0.001670403,0.001766297,0.001023819,0.004375063],"category_scores_gemma":[0.007598279,0.0006434608,0.002358764,0.000937973,0.001870045,0.003808451,0.002319683,0.002275627,0.0006052522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001615059,"about_ca_system_score_gemma":0.002944146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006001977,"about_ca_topic_score_gemma":0.009994038,"domain_scores_codex":[0.997927,0.0004852797,0.0001646304,0.0005737877,0.0005203998,0.0003289647],"domain_scores_gemma":[0.9938996,0.004574563,0.0004313968,0.0005629277,0.0004421973,0.00008929373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004438191,0.0003662959,0.004805855,0.001479904,0.0002458524,0.0008777948,0.0009797133,0.2348375,0.02615946,0.4409695,0.00813388,0.2807006],"study_design_scores_gemma":[0.000152383,0.0001331865,0.000439905,0.0001088484,0.0001274435,0.0002905323,0.0002738764,0.595071,0.03610642,0.3582685,0.008976737,0.00005116493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0569926,0.0002542215,0.9341004,0.000840291,0.00007006102,0.0002275491,0.0004271326,0.002636721,0.004451028],"genre_scores_gemma":[0.2789185,0.0002449762,0.7153522,0.0004988638,0.00007891184,0.0001582292,0.001268124,0.0005040328,0.002976163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006001977,"threshold_uncertainty_score":0.01463604,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Johannes Späth","is_ca":false},{"name":"Karim Ali","is_ca":true},{"name":"Eric Bodden","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02093102351995533,"gpt":0.2932984388493426,"spread":0.2723674153293873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003412938,0.0007868782,0.0006729862,0.00173507,0.00080209,0.003575636,0.002413542,0.0008611924,0.01623194],"category_scores_gemma":[0.00942819,0.0007002152,0.001151103,0.001092709,0.001933989,0.005305835,0.003191995,0.002552811,0.008663601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001334011,"about_ca_system_score_gemma":0.002410143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003184716,"about_ca_topic_score_gemma":0.004415594,"domain_scores_codex":[0.996258,0.0005444446,0.0002845261,0.0004408374,0.002150114,0.0003221165],"domain_scores_gemma":[0.9926674,0.001860073,0.0003911789,0.002715862,0.002105692,0.0002597765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0011711,0.0002861896,0.0089191,0.0006351889,0.00009647221,0.0004258608,0.000479101,0.02415611,0.04998903,0.1247634,0.2482625,0.5408161],"study_design_scores_gemma":[0.000214808,0.0002333412,0.003342469,0.0001994319,0.00009058882,0.0007212999,0.0002564608,0.4126096,0.1389705,0.0710546,0.3721441,0.0001626631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009870373,0.0003330072,0.8887612,0.001162676,0.0003569867,0.0001351659,0.001881415,0.07082032,0.02667892],"genre_scores_gemma":[0.1806014,0.0005353266,0.7748162,0.001719294,0.0005473974,0.0002467019,0.00742004,0.01668366,0.01742993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01623194,"threshold_uncertainty_score":0.05430132,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01054795506004988,"gpt":0.2443345785145934,"spread":0.2337866234545435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007133863,0.001130926,0.0009760379,0.002967376,0.002330563,0.004516277,0.002683613,0.002579892,0.006669307],"category_scores_gemma":[0.01051394,0.001380056,0.003191418,0.00152734,0.01168409,0.01074589,0.005871066,0.00439238,0.001107039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002107815,"about_ca_system_score_gemma":0.002038249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001634842,"about_ca_topic_score_gemma":0.001416656,"domain_scores_codex":[0.9921704,0.002673876,0.0009280127,0.001520781,0.002003429,0.0007034772],"domain_scores_gemma":[0.9950948,0.001919556,0.0004229117,0.001231479,0.001127802,0.0002035446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006782675,0.000006069974,0.00005858147,0.00002888244,0.00000594553,0.00004468326,0.0002662812,0.0008554899,0.0003356717,0.9954494,0.0003086001,0.002633614],"study_design_scores_gemma":[0.00000871893,0.00001195796,0.00003378031,0.0000237391,0.00000996955,0.00004679121,0.00008348326,0.004254576,0.0006523231,0.9896522,0.005211861,0.00001058054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01496051,0.0003656192,0.9604439,0.000974298,0.0001346677,0.0001497516,0.0002132691,0.0007583275,0.02199963],"genre_scores_gemma":[0.3792472,0.0006919321,0.6033531,0.001045762,0.0003648688,0.0008591096,0.0008289074,0.001518846,0.01209007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007133863,"threshold_uncertainty_score":0.03772789,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jonathan Immanuel Brachthäuser","is_ca":false},{"name":"Philipp Schuster","is_ca":false},{"name":"Edward Lee","is_ca":true},{"name":"Aleksander Boruch-Gruszecki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01065062732676612,"gpt":0.2381885877176644,"spread":0.2275379603908982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008588449,0.00106367,0.001093805,0.002585455,0.001708904,0.006425862,0.003032306,0.002465854,0.006103214],"category_scores_gemma":[0.01526043,0.001611421,0.002482227,0.001790467,0.01012539,0.0197639,0.009817996,0.005083207,0.001267828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001825036,"about_ca_system_score_gemma":0.002461982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006092336,"about_ca_topic_score_gemma":0.005009859,"domain_scores_codex":[0.9952375,0.001438094,0.0004238228,0.000855615,0.001579679,0.0004652772],"domain_scores_gemma":[0.9898371,0.00520788,0.0005290579,0.00334339,0.0006843997,0.0003981734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001548174,0.00005761851,0.001587894,0.0002518289,0.00006198967,0.0002839376,0.002023431,0.01227742,0.002419436,0.8673545,0.003944972,0.1095822],"study_design_scores_gemma":[0.00004142031,0.00004444174,0.0003208162,0.0002298256,0.0001010026,0.0001953355,0.0003533362,0.06116342,0.006558619,0.9012274,0.02970121,0.0000632527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008889156,0.0005024016,0.9818118,0.001162757,0.00008985858,0.00007678985,0.0001164186,0.001983092,0.005367685],"genre_scores_gemma":[0.2840705,0.001553899,0.7036898,0.001135132,0.0002404039,0.0002296237,0.0003425878,0.001412954,0.007325028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008588449,"threshold_uncertainty_score":0.04542059,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Fabian Wolff","is_ca":false},{"name":"Aurel Bílý","is_ca":false},{"name":"Christoph Matheja","is_ca":false},{"name":"Péter Müller","is_ca":false},{"name":"Alexander J. Summers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01992079449776948,"gpt":0.2566667467240086,"spread":0.2367459522262391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00579844,0.0006252751,0.0006741449,0.0008997392,0.0007324873,0.001731521,0.001916964,0.001057664,0.002302482],"category_scores_gemma":[0.01463496,0.0009481799,0.002219026,0.0004694593,0.003482913,0.003653818,0.003608315,0.002714611,0.0006663793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001048418,"about_ca_system_score_gemma":0.002387283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001433734,"about_ca_topic_score_gemma":0.001456126,"domain_scores_codex":[0.9933501,0.001380758,0.0004726705,0.0009189005,0.003146791,0.0007307538],"domain_scores_gemma":[0.9883959,0.00500446,0.001377718,0.003231953,0.001773538,0.000216407],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005877172,0.0002021487,0.004816165,0.0008818717,0.000131466,0.002726504,0.003062798,0.1042849,0.2555978,0.5092897,0.004423219,0.1139957],"study_design_scores_gemma":[0.0002400331,0.0005288515,0.001232724,0.0002059094,0.0001448155,0.001124328,0.0003335168,0.4418731,0.3513809,0.1687614,0.0340092,0.0001652869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03374565,0.00004868214,0.9577965,0.0001396948,0.00005415241,0.0001175943,0.0001523828,0.005948857,0.001996459],"genre_scores_gemma":[0.536777,0.0001614155,0.4579524,0.0002745574,0.00004358678,0.0003410197,0.0004670635,0.001486996,0.002495972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00579844,"threshold_uncertainty_score":0.03066546,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Saba Alimadadi","is_ca":false},{"name":"Di Zhong","is_ca":false},{"name":"Magnus Madsen","is_ca":false},{"name":"Frank Tip","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02472228605236087,"gpt":0.2683616435545759,"spread":0.243639357502215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004297529,0.0007921929,0.0005351668,0.001312225,0.001740702,0.001817193,0.002013512,0.001380392,0.002672795],"category_scores_gemma":[0.02189401,0.001489909,0.001584654,0.001024146,0.002733507,0.007191118,0.004026961,0.002463304,0.0007886266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322778,"about_ca_system_score_gemma":0.001905829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003836795,"about_ca_topic_score_gemma":0.005251513,"domain_scores_codex":[0.9960448,0.001318632,0.0002387942,0.0007263644,0.001327063,0.0003444624],"domain_scores_gemma":[0.9772701,0.01564037,0.002442508,0.002520267,0.001726681,0.0004000947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001670299,0.0006182392,0.03611004,0.00167271,0.000233427,0.00298257,0.008198855,0.1375642,0.07920463,0.3588916,0.02214115,0.3507123],"study_design_scores_gemma":[0.0001618433,0.0003725662,0.004397925,0.0002213855,0.0001900591,0.0007325835,0.001689155,0.6446346,0.09160691,0.2183118,0.03751123,0.000169985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1724489,0.0002333001,0.801788,0.0008829631,0.00008711761,0.0002137275,0.0005115547,0.01949522,0.00433929],"genre_scores_gemma":[0.5138955,0.0002607515,0.4754659,0.0003694702,0.00005586422,0.0002249579,0.00104805,0.004077844,0.004601541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004297529,"threshold_uncertainty_score":0.02272773,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Magnus Madsen","is_ca":false},{"name":"Ondřej Lhoták","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02901148210914946,"gpt":0.2599340150096806,"spread":0.2309225329005311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00721893,0.0008656341,0.000824846,0.00109948,0.001482811,0.004558415,0.00315804,0.001471621,0.005763508],"category_scores_gemma":[0.0129854,0.001115751,0.002325184,0.0009283923,0.00430816,0.009571307,0.0048956,0.004507691,0.0008706159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00199005,"about_ca_system_score_gemma":0.003452816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003615108,"about_ca_topic_score_gemma":0.004342586,"domain_scores_codex":[0.9975219,0.0006566694,0.000196862,0.0005486687,0.0007563425,0.0003195329],"domain_scores_gemma":[0.9938305,0.004031769,0.000416601,0.0008928349,0.0005685122,0.0002598602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009280931,0.00005100782,0.0007713665,0.0001762507,0.00004339522,0.0001973852,0.0008692406,0.0174911,0.00242051,0.9297481,0.003463136,0.04467573],"study_design_scores_gemma":[0.00008158659,0.0000716365,0.0001697336,0.0001711137,0.00007615607,0.0002570091,0.00027062,0.1241904,0.01390143,0.808315,0.0524183,0.00007710265],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004694669,0.0000994204,0.9916835,0.0004654782,0.00005832619,0.00004365731,0.00006347021,0.001150047,0.001741411],"genre_scores_gemma":[0.1439195,0.0003086219,0.847427,0.0005858944,0.0001141098,0.0002315937,0.000183927,0.001041148,0.006188205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00721893,"threshold_uncertainty_score":0.03817779,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Anthony Vandikas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01574506963475064,"gpt":0.2756575389875628,"spread":0.2599124693528121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005876272,0.001271075,0.001090764,0.002346559,0.001879216,0.002771796,0.002379845,0.001773942,0.007397522],"category_scores_gemma":[0.01591926,0.001009294,0.002631075,0.001482152,0.007041159,0.00698473,0.004844044,0.008153969,0.002415963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002539207,"about_ca_system_score_gemma":0.002087155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271929,"about_ca_topic_score_gemma":0.001055654,"domain_scores_codex":[0.9904521,0.003525874,0.0005802597,0.001514132,0.003401214,0.0005265241],"domain_scores_gemma":[0.988444,0.007230775,0.0004254682,0.002793639,0.0009034742,0.0002026585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002590165,0.00002088513,0.0001008325,0.0001787536,0.00002408919,0.00005947725,0.0002493971,0.002957254,0.001549516,0.9666817,0.00244739,0.02570476],"study_design_scores_gemma":[0.00002103558,0.00002586838,0.00008011101,0.00008601882,0.00002932591,0.0001067375,0.00004911991,0.009158088,0.002974414,0.9290721,0.05837598,0.00002108527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003685721,0.002026767,0.9681392,0.00138529,0.0003207114,0.0002136557,0.0001714822,0.001128977,0.02292811],"genre_scores_gemma":[0.2374842,0.003541666,0.7381712,0.002349199,0.0009691627,0.001243595,0.0008105712,0.001453246,0.01397709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007397522,"threshold_uncertainty_score":0.03107709,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Satyajit Gokhale","is_ca":false},{"name":"Alexi Turcotte","is_ca":false},{"name":"Frank Tip","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01151072275506789,"gpt":0.2595552192948807,"spread":0.2480444965398128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172956,0.001451452,0.0005892576,0.001475968,0.0007876825,0.001703778,0.003024477,0.001067265,0.001287916],"category_scores_gemma":[0.03145379,0.001159751,0.001321548,0.001161883,0.0007861325,0.002747366,0.002168946,0.002060469,0.001344671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008479253,"about_ca_system_score_gemma":0.002605795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003502845,"about_ca_topic_score_gemma":0.004241021,"domain_scores_codex":[0.9950594,0.001306921,0.000611854,0.0008097987,0.001798183,0.0004138716],"domain_scores_gemma":[0.9720355,0.009218945,0.001907928,0.01154933,0.004920026,0.0003682686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008671678,0.000810778,0.04712527,0.001041289,0.0001853237,0.00270766,0.006469895,0.02369287,0.1815739,0.01046037,0.01956785,0.7054976],"study_design_scores_gemma":[0.0002831079,0.0007261843,0.02256931,0.0003993258,0.0006243209,0.002426669,0.001504728,0.455052,0.3846187,0.01718763,0.1143115,0.0002964878],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3597583,0.0004073287,0.5497177,0.0007012903,0.0003097857,0.000669589,0.0007480523,0.08307887,0.004609177],"genre_scores_gemma":[0.55748,0.0003687375,0.4222488,0.0006131803,0.00007670051,0.0003437396,0.002108749,0.01092794,0.005832239],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004172956,"threshold_uncertainty_score":0.02206892,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yuyan Bao","is_ca":true},{"name":"Guannan Wei","is_ca":false},{"name":"Oliver Bračevac","is_ca":false},{"name":"Yuxuan Jiang","is_ca":false},{"name":"Qiyang He","is_ca":false},{"name":"Tiark Rompf","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04358175016620899,"gpt":0.2868284587584339,"spread":0.2432467085922249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006559037,0.0007280112,0.0005651068,0.001752786,0.001578228,0.003302967,0.002525161,0.001548669,0.003007861],"category_scores_gemma":[0.01329852,0.0009513597,0.001606595,0.001336001,0.005310679,0.01127751,0.004715423,0.002751722,0.0005731073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002156264,"about_ca_system_score_gemma":0.002536251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006414896,"about_ca_topic_score_gemma":0.005911725,"domain_scores_codex":[0.9961708,0.001090251,0.0003298006,0.0006515416,0.001348255,0.0004093965],"domain_scores_gemma":[0.991307,0.003763127,0.000952989,0.002781357,0.0009319684,0.0002637104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002303968,0.00006503948,0.003488292,0.0001883657,0.00004703563,0.0002886706,0.002379721,0.02706293,0.01079467,0.8616219,0.001681908,0.09215117],"study_design_scores_gemma":[0.00006359757,0.000144491,0.0011643,0.0001853023,0.0001600324,0.0005083279,0.0005388762,0.2399377,0.04770176,0.6803474,0.02909271,0.0001554096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02246354,0.00008500565,0.9724371,0.0002056357,0.00004394916,0.00004221711,0.00007985085,0.002505746,0.002136966],"genre_scores_gemma":[0.5143459,0.0002302602,0.4783644,0.0002182036,0.00005901319,0.0001499892,0.0002468742,0.001086696,0.005298784],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006559037,"threshold_uncertainty_score":0.03468788,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Zhenyang Xu","is_ca":true},{"name":"Yongqiang Tian","is_ca":true},{"name":"Mengxiao Zhang","is_ca":true},{"name":"Gaosen Zhao","is_ca":true},{"name":"Yu Jiang","is_ca":false},{"name":"C. P. Sun","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02725027826828869,"gpt":0.3119918759498543,"spread":0.2847415976815656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008714531,0.001634983,0.001275077,0.001829785,0.001442367,0.003459376,0.004840057,0.001669426,0.003229804],"category_scores_gemma":[0.03045063,0.00152441,0.002411319,0.001040406,0.006512125,0.008768667,0.00775985,0.005549036,0.001119099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001952737,"about_ca_system_score_gemma":0.00405006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001405933,"about_ca_topic_score_gemma":0.002611323,"domain_scores_codex":[0.9875048,0.003637926,0.0008495531,0.002317393,0.004726996,0.0009633507],"domain_scores_gemma":[0.9657926,0.0178357,0.002181229,0.01092895,0.002818373,0.000443046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005299249,0.0004147398,0.004441574,0.00209866,0.0002198784,0.0005417875,0.001690357,0.06674919,0.06369172,0.5121967,0.00911694,0.3383086],"study_design_scores_gemma":[0.0001580676,0.0006112027,0.001015372,0.0005570378,0.0002815256,0.0009823708,0.0003497612,0.2292443,0.07417994,0.6370975,0.05534343,0.0001794427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0329999,0.00122798,0.9450559,0.002413285,0.0001368366,0.0001962357,0.0001329528,0.007952049,0.009884835],"genre_scores_gemma":[0.2648432,0.000905393,0.7241374,0.001463065,0.0001562598,0.0004004718,0.0003347942,0.003849895,0.00390956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008714531,"threshold_uncertainty_score":0.04608738,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yizhou Zhang","is_ca":true},{"name":"Nada Amin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01557696947963156,"gpt":0.2556624228237966,"spread":0.2400854533441651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0129606,0.001085755,0.001293921,0.002216872,0.002323795,0.007582733,0.003804005,0.003198717,0.003837334],"category_scores_gemma":[0.03091458,0.001342575,0.003967673,0.00188273,0.01354099,0.02087419,0.008108831,0.007335361,0.0007611463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004081069,"about_ca_system_score_gemma":0.003282509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006468284,"about_ca_topic_score_gemma":0.004342861,"domain_scores_codex":[0.9855656,0.006150609,0.001313823,0.002495881,0.00342848,0.001045603],"domain_scores_gemma":[0.9800044,0.01210257,0.001324931,0.003599219,0.002182928,0.0007860168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000012648,0.00002311026,0.0001461264,0.00003926632,0.00001583827,0.00005784564,0.000529174,0.003343848,0.000412628,0.990146,0.000335348,0.00493817],"study_design_scores_gemma":[0.00001349258,0.00001648049,0.00007910099,0.0000239597,0.00002066598,0.00007451977,0.0001090601,0.03093357,0.001075707,0.9637802,0.00385345,0.00001980826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005623134,0.0001239884,0.9887266,0.001634271,0.00003906685,0.00006713065,0.00007024391,0.0004037924,0.003311841],"genre_scores_gemma":[0.3506384,0.0003424718,0.6426914,0.001098529,0.0002359869,0.0005037136,0.0003207183,0.0004471802,0.003721555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0129606,"threshold_uncertainty_score":0.06854302,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01674766759670279,"gpt":0.2576217341192946,"spread":0.2408740665225918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004701843,0.0008775381,0.0008212798,0.001327532,0.001319287,0.003573554,0.002579573,0.001549839,0.004529006],"category_scores_gemma":[0.02653034,0.001292654,0.002872856,0.0009864485,0.00548444,0.009653895,0.006384463,0.005690408,0.001773429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002917298,"about_ca_system_score_gemma":0.002509499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002190692,"about_ca_topic_score_gemma":0.002245615,"domain_scores_codex":[0.9918953,0.00154398,0.00068753,0.002004912,0.003197839,0.0006703671],"domain_scores_gemma":[0.9834182,0.007464374,0.001163534,0.004955254,0.002691517,0.0003071577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001207314,0.00003687885,0.001578523,0.000202715,0.00003414876,0.0002626486,0.0009251095,0.01470869,0.009039078,0.938142,0.002282327,0.03266698],"study_design_scores_gemma":[0.00004512038,0.00007187574,0.0004198759,0.0001379524,0.00007238865,0.0004079373,0.0001469785,0.108995,0.02176711,0.8384956,0.02934604,0.0000940829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01682667,0.0002204164,0.9720218,0.0004638728,0.0001226369,0.00007287919,0.0001791443,0.002445331,0.007647299],"genre_scores_gemma":[0.467359,0.0004625927,0.5120804,0.001304526,0.000295569,0.0004761881,0.0006310712,0.002956814,0.01443386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004701843,"threshold_uncertainty_score":0.02486598,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"L.R. Wilkinson","is_ca":true},{"name":"Kazem Cheshmi","is_ca":true},{"name":"Maryam Mehri Dehnavi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03091620688502481,"gpt":0.3061650761552651,"spread":0.2752488692702402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004299601,0.0003915508,0.000424565,0.0004131071,0.0003523586,0.000449032,0.0007103914,0.0003066538,0.002143482],"category_scores_gemma":[0.003895272,0.0002800691,0.0003778228,0.0005327716,0.0005880921,0.001427417,0.0007153684,0.0008225976,0.0004379483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004744387,"about_ca_system_score_gemma":0.001088437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004546448,"about_ca_topic_score_gemma":0.009068877,"domain_scores_codex":[0.9996885,0.00007201336,0.00002460354,0.00007443604,0.0000972779,0.00004329173],"domain_scores_gemma":[0.9988808,0.0005578774,0.0001041224,0.0003267656,0.0001055295,0.00002499052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003092291,0.00008260486,0.002028919,0.000107693,0.00004392478,0.0001424973,0.0001738873,0.6344683,0.01999983,0.02089914,0.003895292,0.3178487],"study_design_scores_gemma":[0.00001056815,0.00003903867,0.0001025368,0.000004829746,0.000005785567,0.00001956211,0.00001403913,0.9822085,0.00819932,0.008317575,0.001073995,0.000004149359],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07648969,0.0003447656,0.9156374,0.0002678129,0.00006144297,0.00003951982,0.0001202261,0.004375132,0.002663989],"genre_scores_gemma":[0.6813558,0.0002233319,0.3154939,0.0001488896,0.00005337169,0.00009768349,0.0003507052,0.0003434061,0.001932952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004546448,"threshold_uncertainty_score":0.009039938,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Peng Fu","is_ca":true},{"name":"Kohei Kishida","is_ca":false},{"name":"Neil J. Ross","is_ca":true},{"name":"Peter Selinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008028892670940677,"gpt":0.2529775552903836,"spread":0.2449486626194429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002796271,0.0005364648,0.0005271394,0.0008514711,0.001111594,0.002002189,0.001766527,0.001131356,0.008690762],"category_scores_gemma":[0.003610165,0.0007352077,0.001584196,0.0007317896,0.003483588,0.006235353,0.004011381,0.003290159,0.001990105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00108073,"about_ca_system_score_gemma":0.001528999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001305305,"about_ca_topic_score_gemma":0.001190835,"domain_scores_codex":[0.9981558,0.0005207535,0.0001432423,0.000375763,0.0005338715,0.0002705429],"domain_scores_gemma":[0.9981838,0.0007703944,0.0001480187,0.00048545,0.0002968561,0.0001154642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008937431,0.00002861209,0.0002488408,0.0001213387,0.00001290331,0.000135207,0.000528455,0.001702186,0.003134579,0.9678666,0.004859644,0.02127227],"study_design_scores_gemma":[0.00005921714,0.0001187433,0.0003887607,0.0001125377,0.00004237304,0.0005770567,0.0001595936,0.04252032,0.01408682,0.7741299,0.1677058,0.00009890831],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007952284,0.0001666816,0.9702104,0.0007176627,0.0001687733,0.00008931314,0.0003252292,0.007833812,0.01253577],"genre_scores_gemma":[0.3261763,0.0005008078,0.6384168,0.001947785,0.0002510175,0.0006916891,0.0008212668,0.004032921,0.0271613],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008690762,"threshold_uncertainty_score":0.02907354,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Computer science; Functional programming; Grading (engineering); Programming language; Computer programming; Code (set theory); Multimedia; Software engineering; Mathematics education; Psychology","authors":[{"name":"Aliya Hameer","is_ca":true},{"name":"Brigitte Pientka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02009138487233451,"gpt":0.2914121183470974,"spread":0.2713207334747629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004460553,0.0007093408,0.0002516475,0.001080748,0.0007483211,0.002656672,0.001101738,0.0007622219,0.01513955],"category_scores_gemma":[0.01411466,0.0003609431,0.000454736,0.0007094131,0.0009178258,0.002700294,0.001829711,0.001826783,0.006564414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008212821,"about_ca_system_score_gemma":0.001351575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001485137,"about_ca_topic_score_gemma":0.00320556,"domain_scores_codex":[0.9972568,0.0008102626,0.0001745433,0.0004002837,0.001091693,0.0002664992],"domain_scores_gemma":[0.9909644,0.002608516,0.0006309373,0.001536791,0.002873489,0.001385839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"qualitative","study_design_scores_codex":[0.0001316435,0.001466483,0.008907548,0.0001840439,0.00001824889,0.0003061751,0.005595677,0.002651316,0.01852786,0.008022125,0.0636636,0.8905252],"study_design_scores_gemma":[0.0002254162,0.003502355,0.04141881,0.0005336683,0.00008200703,0.005167755,0.005755637,0.02830553,0.121027,0.03441506,0.7592198,0.0003468535],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3137884,0.0007566948,0.5374075,0.004261536,0.0008678549,0.0008369483,0.001188347,0.0154553,0.1254374],"genre_scores_gemma":[0.5984907,0.000815012,0.3188888,0.0007365429,0.0002273503,0.0003426959,0.001269671,0.002136815,0.07709245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01513955,"threshold_uncertainty_score":0.05064684,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yanju Chen","is_ca":false},{"name":"Yuepeng Wang","is_ca":true},{"name":"Maruth Goyal","is_ca":false},{"name":"James Dong","is_ca":false},{"name":"Yu Feng","is_ca":false},{"name":"Işıl Dillig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02422023960366824,"gpt":0.2686186862813404,"spread":0.2443984466776722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002694565,0.0005445334,0.0004185806,0.0007384265,0.0004207234,0.001047662,0.00102024,0.0005982068,0.00393545],"category_scores_gemma":[0.008313777,0.0004851561,0.0008845183,0.0008142704,0.00157258,0.002303794,0.001538118,0.001399368,0.0008052925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008633881,"about_ca_system_score_gemma":0.002068141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001520548,"about_ca_topic_score_gemma":0.002447148,"domain_scores_codex":[0.9974784,0.0007300411,0.0001938124,0.0003302068,0.001022826,0.0002446353],"domain_scores_gemma":[0.9947037,0.002334266,0.0003784176,0.001789796,0.000707705,0.0000861774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004222177,0.0002542995,0.006405803,0.0007848169,0.0001394709,0.0008505197,0.0008567846,0.2867959,0.1057546,0.238198,0.009738687,0.3497988],"study_design_scores_gemma":[0.0001201935,0.0001814047,0.0007171205,0.00009557085,0.00008231654,0.000274968,0.0002188803,0.6822994,0.1379215,0.1305588,0.04747065,0.00005918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04971426,0.0001371614,0.9377701,0.0002850505,0.00007947873,0.0001331647,0.0002793796,0.006221947,0.005379431],"genre_scores_gemma":[0.4068924,0.0002678212,0.5832975,0.0002665938,0.00003326966,0.0002994732,0.0007689286,0.002696156,0.005477889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00393545,"threshold_uncertainty_score":0.0142504,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Bert Lindenhovius","is_ca":false},{"name":"Michael Mislove","is_ca":false},{"name":"Vladimir Zamdzhiev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0176829230882769,"gpt":0.2565652080810734,"spread":0.2388822849927965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003804993,0.0006370628,0.0007666686,0.001489051,0.001401041,0.004337104,0.003069679,0.001504163,0.007224969],"category_scores_gemma":[0.005684958,0.0009578066,0.001695145,0.001414351,0.00415442,0.008894521,0.005656919,0.003547432,0.001863264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001936733,"about_ca_system_score_gemma":0.002272482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001424718,"about_ca_topic_score_gemma":0.001864592,"domain_scores_codex":[0.9960484,0.0008171058,0.0004060424,0.0008099946,0.001419168,0.0004992348],"domain_scores_gemma":[0.9962137,0.001111817,0.0003150611,0.001441365,0.0006662107,0.0002517445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003341778,0.00001819808,0.0005243117,0.00005600413,0.00001320189,0.0001120936,0.0002738819,0.001907835,0.002039196,0.9826193,0.000588882,0.01181368],"study_design_scores_gemma":[0.00006181289,0.00008703732,0.0004307797,0.0000906026,0.0000811171,0.0005998941,0.0001755141,0.06542558,0.01296525,0.8487902,0.07120508,0.00008711704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01500788,0.0002741968,0.9738359,0.0004055819,0.000129353,0.00006275694,0.0001956642,0.001340967,0.008747779],"genre_scores_gemma":[0.3535759,0.0003103578,0.6265877,0.0006857992,0.0001526162,0.0003277866,0.000389609,0.0005987514,0.01737136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007224969,"threshold_uncertainty_score":0.02416998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Emanuele D’Osualdo","is_ca":false},{"name":"Azadeh Farzan","is_ca":true},{"name":"Derek Dreyer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01487824833160079,"gpt":0.2438954345114393,"spread":0.2290171861798385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008372769,0.0006996554,0.0007018339,0.0009950972,0.001572159,0.003101812,0.00198681,0.001211457,0.004576892],"category_scores_gemma":[0.02917458,0.0008970517,0.001789698,0.0007390114,0.005290252,0.01006169,0.008753535,0.003610448,0.0007760789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001548463,"about_ca_system_score_gemma":0.004051495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001996338,"about_ca_topic_score_gemma":0.003186101,"domain_scores_codex":[0.9923543,0.002157093,0.0004793513,0.001346774,0.00302592,0.0006365067],"domain_scores_gemma":[0.9688775,0.01994601,0.001328773,0.005581108,0.00360278,0.0006638326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002038784,0.0001819524,0.003196917,0.0004598004,0.0001239208,0.0006843967,0.002111308,0.01166711,0.02006271,0.8922656,0.003240196,0.06580228],"study_design_scores_gemma":[0.00007216904,0.000092316,0.0005573229,0.000118557,0.00009155103,0.0004546703,0.0005108981,0.06997628,0.0436681,0.8688819,0.01551467,0.00006156601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06268211,0.0001680682,0.9230271,0.001355959,0.0001095491,0.0002210876,0.0002611568,0.002117543,0.01005749],"genre_scores_gemma":[0.5381828,0.0002743245,0.4544055,0.001019654,0.0001444917,0.000223811,0.0005073608,0.0005776027,0.00466452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008372769,"threshold_uncertainty_score":0.04427993,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ningning Xie","is_ca":true},{"name":"Leo White","is_ca":false},{"name":"Olivier Nicole","is_ca":false},{"name":"Jeremy Yallop","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02040742840754789,"gpt":0.2696716763260416,"spread":0.2492642479184937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002793662,0.0008340048,0.0006934699,0.001438035,0.0007096434,0.002995722,0.002452537,0.0008879881,0.005463426],"category_scores_gemma":[0.01205673,0.001061121,0.001252007,0.0006907653,0.002009957,0.004074874,0.003327192,0.002144895,0.001942652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001274967,"about_ca_system_score_gemma":0.002436858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002921748,"about_ca_topic_score_gemma":0.002901193,"domain_scores_codex":[0.9978291,0.0002922538,0.0002526965,0.0004727178,0.0009279733,0.0002253262],"domain_scores_gemma":[0.9947725,0.001413128,0.0004315806,0.002201767,0.0008695491,0.0003115057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007443992,0.0001733664,0.005430139,0.0007187429,0.0001236839,0.0008977631,0.00217102,0.0282716,0.05739166,0.5240082,0.03637763,0.3436918],"study_design_scores_gemma":[0.0002203534,0.0001953126,0.001660455,0.0003591727,0.0002042709,0.0006435916,0.0001605074,0.2083612,0.1584179,0.1678751,0.4616521,0.0002499578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006661176,0.0001826707,0.9409658,0.0001785901,0.0001970049,0.0001194683,0.000349478,0.04773942,0.003606359],"genre_scores_gemma":[0.1597745,0.0003705842,0.8118216,0.0006293737,0.0002413051,0.0004924195,0.001265714,0.01564642,0.009758065],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005463426,"threshold_uncertainty_score":0.01827699,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yuxiang Lei","is_ca":false},{"name":"Yulei Sui","is_ca":false},{"name":"Shin Hwei Tan","is_ca":true},{"name":"Qirun Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02819721448245871,"gpt":0.308115621640343,"spread":0.2799184071578843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001145145,0.0007379681,0.0007132806,0.0007615964,0.0007809034,0.0009866063,0.001164302,0.001142408,0.004157298],"category_scores_gemma":[0.005816162,0.0004332142,0.001874213,0.0007847075,0.002008793,0.002624134,0.001868671,0.00143422,0.0009429487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001172033,"about_ca_system_score_gemma":0.001618887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002344118,"about_ca_topic_score_gemma":0.002965243,"domain_scores_codex":[0.9985275,0.0004344604,0.0001049318,0.0004872835,0.0002656099,0.0001800978],"domain_scores_gemma":[0.9970716,0.001792302,0.0002236447,0.0006330411,0.0002235705,0.0000557717],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003120363,0.000192263,0.001844301,0.0006523945,0.00007889559,0.0007944256,0.001140957,0.4006468,0.04274738,0.3770149,0.003981356,0.1705944],"study_design_scores_gemma":[0.00002905726,0.0001234723,0.0002803404,0.00006618295,0.00004781545,0.0001594678,0.00008664148,0.6815243,0.02040286,0.2916048,0.005637262,0.00003781961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02515779,0.0001489467,0.9676676,0.0002016173,0.00003609617,0.0001333863,0.0001345272,0.00374765,0.002772387],"genre_scores_gemma":[0.4046784,0.0002190635,0.5905936,0.0002108409,0.00003752226,0.0003684283,0.0006894993,0.0005439695,0.002658525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004157298,"threshold_uncertainty_score":0.01390755,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shankara Pailoor","is_ca":false},{"name":"Yuepeng Wang","is_ca":true},{"name":"Işıl Dillig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05658574870714718,"gpt":0.3466633917731691,"spread":0.2900776430660219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005602782,0.001169059,0.0008070194,0.00203161,0.0008307247,0.001840371,0.003166097,0.001566059,0.002658136],"category_scores_gemma":[0.01803856,0.0008418979,0.002681711,0.001183568,0.002959042,0.003902124,0.003497758,0.003152843,0.0008301823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001781097,"about_ca_system_score_gemma":0.003219776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003035879,"about_ca_topic_score_gemma":0.004248424,"domain_scores_codex":[0.9931841,0.001655924,0.0006189772,0.001079043,0.002998563,0.0004634007],"domain_scores_gemma":[0.9839734,0.006287704,0.001372855,0.006078336,0.002134846,0.0001528351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006060414,0.0003596706,0.01156808,0.00206611,0.0003475093,0.001425624,0.002977626,0.09489054,0.1048608,0.1429673,0.01118127,0.6267495],"study_design_scores_gemma":[0.0001732193,0.0003116155,0.002209815,0.0004641827,0.0003593729,0.001241181,0.0006194277,0.5051365,0.2807262,0.1274829,0.08108815,0.0001874362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0238596,0.0002142585,0.9617959,0.0002749012,0.00007355337,0.0001393809,0.0002595588,0.0119344,0.001448395],"genre_scores_gemma":[0.1710547,0.0002576951,0.8215848,0.0002921428,0.0000364873,0.000163929,0.001223346,0.003605424,0.001781536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005602782,"threshold_uncertainty_score":0.02963066,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yizhou Zhang","is_ca":true},{"name":"Guido Salvaneschi","is_ca":false},{"name":"Andrew C. Myers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02022218492803879,"gpt":0.2471101335392914,"spread":0.2268879486112526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004092102,0.000704786,0.0005803533,0.0008371151,0.001072295,0.003193778,0.001904994,0.001100582,0.003119381],"category_scores_gemma":[0.008858912,0.0008397079,0.001509484,0.0004818157,0.004594546,0.007510147,0.006198307,0.003439717,0.0008039579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008308179,"about_ca_system_score_gemma":0.002571476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002035795,"about_ca_topic_score_gemma":0.001863128,"domain_scores_codex":[0.9972288,0.0006285883,0.0002284304,0.0004758119,0.001051835,0.0003865095],"domain_scores_gemma":[0.9931368,0.002625924,0.000501909,0.002584108,0.0009728694,0.0001785269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006646187,0.00005118515,0.001107768,0.0001983424,0.00003081511,0.0003494133,0.001616314,0.006886749,0.0160153,0.9156175,0.001889121,0.05617115],"study_design_scores_gemma":[0.00006732227,0.0001279835,0.0003993263,0.0001892782,0.0001306305,0.0005950296,0.0003705424,0.09070756,0.04716519,0.7806528,0.07951186,0.00008247743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01584555,0.000088692,0.9752922,0.0003332446,0.00007468316,0.00007588863,0.0000430715,0.001997182,0.006249535],"genre_scores_gemma":[0.4832838,0.0005811675,0.5004565,0.00082471,0.000174273,0.000333465,0.0002539027,0.002168923,0.01192332],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004092102,"threshold_uncertainty_score":0.02164131,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Dominik Klumpp","is_ca":false},{"name":"Andreas Podelski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05947782296464332,"gpt":0.3218947002246022,"spread":0.2624168772599589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01065959,0.0008409519,0.0009589329,0.00165401,0.001311468,0.002854044,0.001680375,0.0008532091,0.002186088],"category_scores_gemma":[0.03548984,0.001525127,0.00234138,0.001527875,0.004045762,0.007948222,0.003878197,0.002889757,0.000730005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001959567,"about_ca_system_score_gemma":0.004123088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002817544,"about_ca_topic_score_gemma":0.003218812,"domain_scores_codex":[0.9862881,0.004947986,0.001637654,0.00190726,0.004261528,0.0009575059],"domain_scores_gemma":[0.9687259,0.02109983,0.001408006,0.005883373,0.002450423,0.0004324873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006112182,0.000163585,0.004985474,0.0005820922,0.0002122945,0.0003498904,0.001790954,0.08701764,0.02411236,0.6285319,0.001421307,0.2502212],"study_design_scores_gemma":[0.00008984741,0.0001837211,0.0005872061,0.0001413936,0.0001839797,0.0002443648,0.0001409538,0.2692493,0.05115535,0.6702195,0.00772531,0.00007898696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01116218,0.0001247822,0.9869768,0.00006554598,0.00001406529,0.00008635788,0.0000262658,0.0007590386,0.0007850346],"genre_scores_gemma":[0.2174128,0.0001978098,0.7806497,0.0001406197,0.00003188605,0.0001786715,0.0001290936,0.0003424787,0.0009169179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01065959,"threshold_uncertainty_score":0.05637395,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Joel D. Day","is_ca":false},{"name":"Vijay Ganesh","is_ca":true},{"name":"Nathan Grewal","is_ca":true},{"name":"Florín Manea","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01940751461595399,"gpt":0.2728039704731813,"spread":0.2533964558572274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01330319,0.0009738712,0.001412574,0.003920056,0.001811437,0.009309274,0.002810306,0.002396247,0.005431646],"category_scores_gemma":[0.03864104,0.001017704,0.003093457,0.004731813,0.01187609,0.02554627,0.006268583,0.00626272,0.0005217915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002215496,"about_ca_system_score_gemma":0.001054104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001247525,"about_ca_topic_score_gemma":0.0009383887,"domain_scores_codex":[0.9862787,0.005609553,0.001190153,0.001989164,0.003533274,0.001399111],"domain_scores_gemma":[0.9378139,0.05303066,0.00201166,0.005112112,0.001397645,0.0006340923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001352819,0.0000556504,0.001795058,0.000213148,0.00005300494,0.0002292981,0.0009970696,0.01500607,0.003135044,0.9522703,0.0007342692,0.02537581],"study_design_scores_gemma":[0.00001615059,0.00003183391,0.0002405909,0.0000613576,0.00003090737,0.0001699013,0.0002620403,0.02626195,0.002078227,0.9682336,0.002590955,0.00002248141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2124693,0.002731987,0.7079812,0.01074361,0.0001652876,0.0001595996,0.001045403,0.001302696,0.0634009],"genre_scores_gemma":[0.8351402,0.002061636,0.1561519,0.001395687,0.0003030539,0.0002543755,0.0006775297,0.0004218299,0.003593937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01330319,"threshold_uncertainty_score":0.07035482,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Decomposition; Block (permutation group theory); Domain (mathematical analysis); Human–computer interaction; Programming language","authors":[{"name":"Nico Ritschel","is_ca":true},{"name":"Felipe Fronchetti","is_ca":false},{"name":"Reid Holmes","is_ca":true},{"name":"Ronald Garcia","is_ca":true},{"name":"David Shepherd","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01884490930995728,"gpt":0.2837958892846623,"spread":0.264950979974705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003142764,0.001192453,0.0007173913,0.0005335435,0.000631989,0.001206969,0.001487029,0.001336832,0.006994158],"category_scores_gemma":[0.02337757,0.0006298934,0.000526504,0.000306963,0.0008283554,0.002979729,0.001843058,0.001507425,0.002427678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002817083,"about_ca_system_score_gemma":0.000547062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001240907,"about_ca_topic_score_gemma":0.001609933,"domain_scores_codex":[0.9980531,0.001011098,0.0001356802,0.0003899652,0.0002170522,0.000193194],"domain_scores_gemma":[0.9740311,0.01948118,0.000720091,0.002814905,0.001496448,0.001456263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.02033924,0.02976255,0.06834505,0.002660173,0.0003443926,0.003093441,0.07661224,0.01062118,0.1064793,0.004525175,0.03029163,0.6469256],"study_design_scores_gemma":[0.01084654,0.1159655,0.2020892,0.001165688,0.00104724,0.006845861,0.05019422,0.2618971,0.1701579,0.01718099,0.1613165,0.001293205],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.983997,0.0001054297,0.01199406,0.0002000886,0.00002687051,0.0003127735,0.0001611927,0.001304542,0.001898108],"genre_scores_gemma":[0.9510392,0.000181766,0.04237068,0.0004567879,0.00002191054,0.000701504,0.0006257878,0.0004380486,0.004164306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006994158,"threshold_uncertainty_score":0.0233978,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0131746766437271,"gpt":0.2418999690306452,"spread":0.2287252923869181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004293364,0.0009296457,0.0008903545,0.001132546,0.002022497,0.005004701,0.00276685,0.001528485,0.002536303],"category_scores_gemma":[0.01280629,0.001237281,0.002607011,0.0008367299,0.005880647,0.00811426,0.003463042,0.006355474,0.0005268606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004251853,"about_ca_system_score_gemma":0.006791215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01096256,"about_ca_topic_score_gemma":0.008204434,"domain_scores_codex":[0.9955676,0.0004827276,0.0003356492,0.001267556,0.001523908,0.000822588],"domain_scores_gemma":[0.9737763,0.01774241,0.001870795,0.003533203,0.002368117,0.0007091751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006819357,0.0003992668,0.01073424,0.000818287,0.0001382223,0.001067547,0.00179501,0.03033553,0.03202005,0.8528301,0.007635895,0.06154393],"study_design_scores_gemma":[0.000195506,0.00009873712,0.002520591,0.0001096294,0.0001833132,0.0007562417,0.0003145393,0.1875514,0.08595837,0.7002353,0.02195709,0.0001192814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2178251,0.000668541,0.7541141,0.003189184,0.0002373736,0.0003073035,0.00150795,0.006099004,0.01605151],"genre_scores_gemma":[0.805195,0.0005711105,0.1796981,0.001150515,0.0001921032,0.0003348865,0.002235282,0.001208165,0.009414724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01096256,"threshold_uncertainty_score":0.03084952,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Rajan Walia","is_ca":false},{"name":"P. J. Narayanan","is_ca":false},{"name":"Jacques Carette","is_ca":true},{"name":"Sam Tobin-Hochstadt","is_ca":false},{"name":"Chung-chieh Shan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02762690857749259,"gpt":0.2898079864273575,"spread":0.2621810778498649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003402884,0.001620204,0.0007301825,0.001074839,0.000857707,0.003573482,0.00317047,0.001187536,0.01211149],"category_scores_gemma":[0.01845585,0.001583426,0.001482602,0.001565948,0.002917895,0.005120094,0.003595538,0.004482838,0.007018369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00198415,"about_ca_system_score_gemma":0.003852936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002157523,"about_ca_topic_score_gemma":0.002609017,"domain_scores_codex":[0.9954952,0.001181038,0.000382222,0.0007046512,0.001864706,0.0003721758],"domain_scores_gemma":[0.9901092,0.005191525,0.0005380745,0.002908199,0.001068278,0.0001846475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002810151,0.0002357342,0.001921408,0.0007639062,0.0001054802,0.0002551647,0.0006472165,0.1008309,0.01213538,0.3781852,0.03142209,0.4732165],"study_design_scores_gemma":[0.0001248143,0.00007281059,0.0004027981,0.0002374214,0.00006720201,0.0001809507,0.0001261928,0.5161716,0.02759404,0.4090196,0.04594122,0.00006145644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002344239,0.0001377852,0.9818625,0.0003920319,0.00003234718,0.00005694496,0.0001348263,0.01235212,0.00268721],"genre_scores_gemma":[0.05595131,0.0004166983,0.9334447,0.0003626296,0.00007318547,0.0003089771,0.0007537383,0.005681903,0.00300677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01211149,"threshold_uncertainty_score":0.04051697,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ende Jin","is_ca":true},{"name":"Nada Amin","is_ca":false},{"name":"Yizhou Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02153602823069928,"gpt":0.2567209835178066,"spread":0.2351849552871074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004511075,0.000436541,0.0004064185,0.001253541,0.001235135,0.002221108,0.002408854,0.0009438993,0.004663219],"category_scores_gemma":[0.009485203,0.0007125689,0.001333376,0.0005845262,0.004499604,0.005095874,0.006609996,0.00277945,0.001088339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009361579,"about_ca_system_score_gemma":0.00177376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008514686,"about_ca_topic_score_gemma":0.001114336,"domain_scores_codex":[0.9963663,0.001387504,0.0001969776,0.0005636551,0.001208443,0.0002772188],"domain_scores_gemma":[0.9934109,0.002679094,0.0003564689,0.002784278,0.000595103,0.0001741406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004373192,0.00003827623,0.0006190209,0.0001017739,0.00002276309,0.000312373,0.00120757,0.00674683,0.0068521,0.9423972,0.001990316,0.039668],"study_design_scores_gemma":[0.00007595086,0.0001093058,0.0004056958,0.0001646063,0.00006470711,0.001177161,0.0004095772,0.07486723,0.02952901,0.7832057,0.1098986,0.00009236896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01546716,0.0001213224,0.9717063,0.000670458,0.00007728174,0.00006631625,0.00005635964,0.00229062,0.009544245],"genre_scores_gemma":[0.3733281,0.0003861721,0.6129502,0.0005589185,0.0001203858,0.0003143215,0.0001719353,0.00115107,0.01101885],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004663219,"threshold_uncertainty_score":0.02385712,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Dominik Klumpp","is_ca":false},{"name":"Andreas Podelski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0337666528042439,"gpt":0.3208212074906647,"spread":0.2870545546864208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007600811,0.001049315,0.001042937,0.001531362,0.001457781,0.003361171,0.002488513,0.001124175,0.004427005],"category_scores_gemma":[0.02070291,0.001216405,0.003808521,0.001164736,0.005210455,0.008526946,0.006399741,0.006357197,0.001367007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002587183,"about_ca_system_score_gemma":0.002970112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001625063,"about_ca_topic_score_gemma":0.001299595,"domain_scores_codex":[0.9859321,0.004456714,0.001129888,0.00249645,0.004930396,0.001054549],"domain_scores_gemma":[0.9773864,0.01377136,0.00111097,0.004814101,0.002569289,0.0003480303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007964665,0.00005890647,0.0003915929,0.0003104435,0.00006590243,0.0002258923,0.0009710167,0.01091188,0.008952744,0.9442971,0.002151711,0.03158315],"study_design_scores_gemma":[0.00004515616,0.00007033372,0.0001839791,0.00009244637,0.00009922712,0.0002486279,0.0001226457,0.0375898,0.0239514,0.8925475,0.04499063,0.00005825101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01236607,0.0003602099,0.9762539,0.0005433172,0.0001044045,0.0001167836,0.0001691216,0.001447771,0.008638491],"genre_scores_gemma":[0.4110432,0.001283976,0.5692017,0.001118038,0.0004176636,0.0007706778,0.0009740789,0.0023899,0.01280075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007600811,"threshold_uncertainty_score":0.04019743,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Matthew Amy","is_ca":true},{"name":"Joseph Lunderville","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02384835767695466,"gpt":0.330130432551213,"spread":0.3062820748742584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001681765,0.0007487854,0.000430584,0.001200319,0.0009483312,0.002370571,0.001368283,0.0006323993,0.006878013],"category_scores_gemma":[0.007943013,0.000500045,0.001705562,0.001446808,0.002605623,0.005503895,0.001843654,0.002913383,0.001247352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002061435,"about_ca_system_score_gemma":0.00174443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00302262,"about_ca_topic_score_gemma":0.004224322,"domain_scores_codex":[0.9971987,0.0008332871,0.0002057536,0.000484486,0.001063047,0.000214674],"domain_scores_gemma":[0.9958605,0.00235366,0.0003004474,0.0009906094,0.0004410016,0.00005367654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001219198,0.00008104184,0.0009364281,0.0003294585,0.00005448613,0.0001017734,0.0005719976,0.07534192,0.01406302,0.7860166,0.003365011,0.1190164],"study_design_scores_gemma":[0.00002319963,0.00007053918,0.0003357512,0.00006224943,0.00007671647,0.00007398819,0.0001563402,0.3902232,0.02872917,0.5609616,0.01924432,0.000043034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007757799,0.0001860966,0.9865899,0.0002806748,0.00003012523,0.00004622029,0.0001295492,0.001632176,0.003347373],"genre_scores_gemma":[0.2698502,0.0005168689,0.7232212,0.0003875591,0.0001292241,0.0001929358,0.0005233428,0.001433223,0.003745467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006878013,"threshold_uncertainty_score":0.02300924,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Tongtong Xiang","is_ca":true},{"name":"Jeff Y. Luo","is_ca":true},{"name":"Werner Dietl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05754636231231046,"gpt":0.2715869837430079,"spread":0.2140406214306974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01519245,0.001459486,0.001430606,0.002589763,0.001321572,0.005704138,0.00391684,0.001785612,0.002600835],"category_scores_gemma":[0.09171733,0.003016026,0.004020222,0.00173164,0.004566894,0.01151679,0.006457078,0.004804736,0.001111701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002574732,"about_ca_system_score_gemma":0.004052038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002963291,"about_ca_topic_score_gemma":0.002930508,"domain_scores_codex":[0.9726781,0.00793517,0.002895742,0.003939299,0.01143716,0.001114553],"domain_scores_gemma":[0.9315767,0.03338793,0.005732133,0.02313647,0.005683947,0.0004828885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001312669,0.0002371785,0.05991028,0.001772837,0.0005406614,0.0009961831,0.004416935,0.141703,0.05348745,0.4013336,0.009353621,0.3249357],"study_design_scores_gemma":[0.000135463,0.000200379,0.005374055,0.0005975364,0.0003577498,0.0006351171,0.0006199445,0.5140387,0.1346422,0.2976458,0.04549333,0.0002596841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02199999,0.0001272081,0.963981,0.0002087858,0.00006914826,0.00007677474,0.0002635768,0.01173602,0.001537508],"genre_scores_gemma":[0.3422529,0.0002555652,0.6425981,0.0003926065,0.00009189898,0.0003564724,0.001031931,0.01057595,0.002444618],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01519245,"threshold_uncertainty_score":0.08034629,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yang He","is_ca":true},{"name":"P. Zhao","is_ca":false},{"name":"Xinyu Wang","is_ca":false},{"name":"Yuepeng Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03972119569841741,"gpt":0.3154632234301081,"spread":0.2757420277316907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01171052,0.001871927,0.001250604,0.002436852,0.001573541,0.004804825,0.006791669,0.002348501,0.02104037],"category_scores_gemma":[0.04121261,0.001662062,0.003561387,0.001599095,0.005317302,0.01154907,0.008307191,0.004374546,0.004746285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002997618,"about_ca_system_score_gemma":0.008106749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009002251,"about_ca_topic_score_gemma":0.009964707,"domain_scores_codex":[0.9831417,0.005407745,0.001477376,0.001917112,0.006540702,0.001515429],"domain_scores_gemma":[0.961682,0.02409471,0.002042021,0.008213934,0.003575156,0.0003920952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002322327,0.0009281042,0.01157576,0.003980674,0.0005976032,0.00168574,0.00177014,0.155909,0.05154872,0.2758333,0.107044,0.3868046],"study_design_scores_gemma":[0.0005701173,0.0004326452,0.001040733,0.0003989475,0.0001968943,0.0006966177,0.0003604907,0.7091718,0.08460478,0.1545147,0.04781914,0.000193142],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01558993,0.0005853408,0.8982455,0.0009862529,0.0002652658,0.0003847487,0.002445637,0.07543015,0.00606713],"genre_scores_gemma":[0.3715772,0.0006084921,0.5972393,0.002186194,0.0002443473,0.0007113607,0.010144,0.01085092,0.006438221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02104037,"threshold_uncertainty_score":0.07038707,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeremy Yallop","is_ca":false},{"name":"Ningning Xie","is_ca":true},{"name":"Neel Krishnaswami","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01751960330658922,"gpt":0.2787272433611151,"spread":0.2612076400545259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002599659,0.001675437,0.001245899,0.001745096,0.001008492,0.00343561,0.004235371,0.002172055,0.01514209],"category_scores_gemma":[0.008863979,0.002150722,0.002998195,0.001835152,0.00313166,0.007132077,0.005786314,0.003254775,0.009170741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002020492,"about_ca_system_score_gemma":0.004815814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005403544,"about_ca_topic_score_gemma":0.00646093,"domain_scores_codex":[0.9970113,0.0004430301,0.0003324531,0.0009353338,0.0009775606,0.0003002624],"domain_scores_gemma":[0.9960998,0.001315267,0.0002375763,0.001509525,0.0007141988,0.0001234623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001104212,0.0002932348,0.004604423,0.001015493,0.000232983,0.001244607,0.001249511,0.05615489,0.04779697,0.2789066,0.1074951,0.499902],"study_design_scores_gemma":[0.0003138926,0.0002095763,0.0009339934,0.0001937695,0.0001971974,0.001503949,0.0002454707,0.3991923,0.1527501,0.2860861,0.1579397,0.0004337945],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.004520654,0.0001129237,0.8793535,0.000205978,0.0001214064,0.0001251879,0.001054539,0.1114556,0.003050248],"genre_scores_gemma":[0.1053763,0.0002209116,0.8508801,0.0006213465,0.00009173248,0.0003136017,0.003404559,0.02809672,0.01099463],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.01514209,"threshold_uncertainty_score":0.05065531,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Umang Mathur","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02269710457130419,"gpt":0.3079195908962046,"spread":0.2852224863249004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003021478,0.0007704973,0.0009897089,0.002119995,0.001389636,0.002607724,0.001847284,0.0009132779,0.009756427],"category_scores_gemma":[0.01341575,0.0006354786,0.002092515,0.001576034,0.005692297,0.008670574,0.004775424,0.006330553,0.0008052794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002699749,"about_ca_system_score_gemma":0.001363758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00388077,"about_ca_topic_score_gemma":0.003022727,"domain_scores_codex":[0.994693,0.0008640578,0.0003340588,0.00157967,0.001976917,0.0005523521],"domain_scores_gemma":[0.9916061,0.00454358,0.0005209367,0.002250017,0.0007308949,0.0003484572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006437091,0.00005005778,0.0003937832,0.00007131859,0.00001510508,0.00006384159,0.0004095996,0.01486652,0.001910772,0.9627567,0.0006336281,0.01876434],"study_design_scores_gemma":[0.00002741754,0.0000337713,0.0002078825,0.00001549092,0.0000167563,0.00003062275,0.00008211009,0.0517415,0.00171605,0.941582,0.004533072,0.00001329608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03802573,0.0005179344,0.9460251,0.0006671983,0.00009464608,0.0001862023,0.0001732267,0.000780997,0.01352893],"genre_scores_gemma":[0.6981272,0.0005824582,0.2894416,0.0007689137,0.0003635371,0.000499489,0.0006696803,0.0004141684,0.009132919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009756427,"threshold_uncertainty_score":0.03263849,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Fengyun Liu","is_ca":false},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Aggelos Biboudis","is_ca":false},{"name":"Paolo G. Giarrusso","is_ca":false},{"name":"Martin Odersky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02470907620312796,"gpt":0.2709525580646441,"spread":0.2462434818615162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009818728,0.001237546,0.001619923,0.002899142,0.00299721,0.005231699,0.004070024,0.002795866,0.01436518],"category_scores_gemma":[0.01448229,0.001858491,0.003140264,0.001775969,0.005824085,0.00941114,0.006159804,0.004190169,0.00802481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003086806,"about_ca_system_score_gemma":0.00652534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005193033,"about_ca_topic_score_gemma":0.005320938,"domain_scores_codex":[0.9939839,0.001212201,0.0008497175,0.001480519,0.001835899,0.0006377815],"domain_scores_gemma":[0.9885881,0.003226722,0.0008500913,0.00520976,0.001748891,0.0003765333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001513603,0.000381381,0.009407309,0.001049674,0.0002904458,0.001136787,0.001693182,0.02882603,0.02817673,0.6635998,0.0571419,0.2067832],"study_design_scores_gemma":[0.0005104637,0.0004317999,0.002509803,0.0004491301,0.0007256166,0.001449941,0.0002009935,0.1911399,0.09439847,0.3790727,0.3285301,0.0005810685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003466296,0.000154145,0.9562678,0.0002680564,0.0002348727,0.0002764662,0.0006323428,0.03433161,0.004368359],"genre_scores_gemma":[0.1508975,0.0005432438,0.8149471,0.001207593,0.0004607602,0.0009877415,0.002347332,0.008979673,0.01962894],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01436518,"threshold_uncertainty_score":0.05192703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}