{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006162061,0.0001929505,0.0002351683,0.00006941753,0.0005123113,0.0007789406,0.004985663,0.0001080366,0.000002131214],"category_scores_gemma":[0.002112063,0.0001268008,0.0001696085,0.0001293352,0.00008024358,0.000566653,0.000984526,0.0001332514,0.000005420522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003113512,"about_ca_system_score_gemma":0.00005259465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009536934,"about_ca_topic_score_gemma":0.00000833323,"domain_scores_codex":[0.9985889,0.000007051382,0.0002536607,0.0004125645,0.0003721852,0.0003656505],"domain_scores_gemma":[0.9978441,0.00006072948,0.0006478089,0.001095879,0.0002685917,0.00008290815],"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.00002209631,0.0001002331,0.006921758,0.0002781819,0.00004125663,0.000001306442,0.002183311,3.936344e-7,0.003169478,0.128369,0.003334992,0.855578],"study_design_scores_gemma":[0.003592849,0.00205467,0.02481077,0.0004151815,0.0001706277,0.0001106123,0.0018325,0.0008959612,0.4789845,0.2904753,0.1952455,0.001411575],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6023842,0.005175082,0.1676752,0.09661971,0.01010861,0.03015058,0.00003087699,0.004444536,0.08341123],"genre_scores_gemma":[0.9274814,0.000002332826,0.06860084,0.00006920722,0.0002709918,0.0001516768,0.000001206421,0.00002033504,0.003401987],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8541664,"threshold_uncertainty_score":0.9264686,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002446785,0.000232634,0.0002792634,0.00004716796,0.0001391722,0.001217814,0.003808716,0.00008693292,0.000001514694],"category_scores_gemma":[0.001582997,0.0001558594,0.000175773,0.000872867,0.0001015747,0.0007666022,0.0009656895,0.0002534578,0.000007001512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002579696,"about_ca_system_score_gemma":0.0000248876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002298303,"about_ca_topic_score_gemma":7.142733e-7,"domain_scores_codex":[0.9982486,0.0000123823,0.0002538809,0.0005079155,0.0005456659,0.0004315904],"domain_scores_gemma":[0.9985871,0.00005738787,0.0003363067,0.0006230148,0.0002358828,0.0001603608],"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.00006648613,0.0002898207,0.01657688,0.0006149365,0.000146449,0.00001549599,0.007044231,0.00001143944,0.008397151,0.08677371,0.0151572,0.8649062],"study_design_scores_gemma":[0.002035941,0.001391973,0.007160985,0.001041132,0.000100325,0.00006450422,0.009104584,0.001581724,0.06904337,0.001477357,0.9054982,0.001499895],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7806329,0.002161226,0.008569099,0.1979343,0.001078541,0.004349237,0.00006389122,0.002570499,0.002640384],"genre_scores_gemma":[0.9525996,0.000009419075,0.04631282,0.0005876691,0.0001233656,0.00006221883,0.000001670152,0.00002139826,0.0002818738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.890341,"threshold_uncertainty_score":0.999819,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005108956,0.0001946734,0.0003845279,0.0002222359,0.0001196229,0.0002592067,0.002199325,0.00009246147,0.000002965605],"category_scores_gemma":[0.0009963221,0.0001426772,0.00009589003,0.0008512121,0.00006412753,0.0006429251,0.002024441,0.0002077864,0.000002352918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005167737,"about_ca_system_score_gemma":0.0000200199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001449229,"about_ca_topic_score_gemma":0.000006773821,"domain_scores_codex":[0.998485,0.00002069695,0.0002802627,0.0005842739,0.0003578194,0.0002718919],"domain_scores_gemma":[0.9979275,0.0002089241,0.0003558429,0.001190476,0.000262336,0.00005495901],"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.0001482841,0.0001795379,0.01108512,0.0007601806,0.001262176,0.00001307955,0.004431909,0.0008715312,0.04890982,0.007381854,0.000585496,0.924371],"study_design_scores_gemma":[0.001202628,0.0008860769,0.0008134838,0.0008805,0.0007149533,0.0001538878,0.006014256,0.5700607,0.4139344,0.001366875,0.002935068,0.001037151],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7766687,0.001215793,0.2164437,0.001276372,0.0005175491,0.00216447,0.00003510612,0.001175969,0.0005023725],"genre_scores_gemma":[0.8112945,0.00001124072,0.1884233,0.0001122679,0.0000362085,0.00001642801,0.000002252967,0.0000130942,0.00009066726],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9233339,"threshold_uncertainty_score":0.5818208,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0005613111,0.0001060886,0.0001427495,0.0001074665,0.0002386805,0.0003504189,0.005103446,0.00004926605,0.000001532638],"category_scores_gemma":[0.01242206,0.00006038909,0.00006906523,0.0002469843,0.0001815022,0.0004549501,0.002165759,0.0002532824,0.000001007709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005280902,"about_ca_system_score_gemma":0.00002220053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009478005,"about_ca_topic_score_gemma":0.000006280977,"domain_scores_codex":[0.9988903,0.00001021996,0.0001822657,0.0002146631,0.0004304745,0.0002720506],"domain_scores_gemma":[0.9977537,0.0006850634,0.0002297805,0.001209301,0.00008653173,0.00003555949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00007511085,0.0004449891,0.709376,0.0006487028,0.0001272126,0.00001569904,0.02130324,0.0004423995,0.05653872,0.1135105,0.004907025,0.09261039],"study_design_scores_gemma":[0.002245,0.0006466702,0.6229635,0.005233228,0.00005336294,0.00004565949,0.007268035,0.006306196,0.3232908,0.02426336,0.006579352,0.001104794],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9920219,0.0001091057,0.002391544,0.004373161,0.0001803222,0.0005128572,0.000002025293,0.0001329618,0.0002761481],"genre_scores_gemma":[0.9758488,0.000007961355,0.02393036,0.00002174944,0.00002288856,0.00002601038,9.119373e-8,0.00001157767,0.0001305828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2667521,"threshold_uncertainty_score":0.9958968,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006008554,0.0001386919,0.0001656949,0.00004122807,0.0001273302,0.0003297536,0.002646454,0.00007805917,0.000002533105],"category_scores_gemma":[0.0002035294,0.00007238064,0.00007337581,0.0005487605,0.0000383505,0.0003061218,0.0004409179,0.0001899454,0.0000164028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003427782,"about_ca_system_score_gemma":0.00002657851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002501833,"about_ca_topic_score_gemma":0.000005489262,"domain_scores_codex":[0.9988001,0.00001389087,0.0002443711,0.0003053274,0.0003498041,0.0002864871],"domain_scores_gemma":[0.99891,0.00005811604,0.000257587,0.0006020024,0.0001446215,0.00002769758],"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.00009455621,0.0004131252,0.06807125,0.0006086766,0.00009084085,0.000004223537,0.01096313,0.00006490204,0.01411421,0.5337126,0.01482601,0.3570365],"study_design_scores_gemma":[0.005106194,0.002259731,0.08775471,0.003874126,0.00008640006,0.0001500973,0.03316674,0.01277656,0.1225553,0.1057994,0.6238384,0.002632316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9580981,0.002960375,0.0003740519,0.02886667,0.001163875,0.002132726,0.000008869103,0.0002675451,0.006127788],"genre_scores_gemma":[0.9918721,0.00002305767,0.006718586,0.0002518823,0.0001208964,0.00006519483,8.628038e-7,0.000009047913,0.0009383539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6090124,"threshold_uncertainty_score":0.4917815,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008069834,0.0002343903,0.0003041702,0.00007086583,0.0007928029,0.001030597,0.00636516,0.0001071347,7.83462e-7],"category_scores_gemma":[0.003428299,0.0001536623,0.0002312066,0.0001124275,0.0001607854,0.0006122197,0.001421438,0.0001653731,0.000003856547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003503182,"about_ca_system_score_gemma":0.00005020472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000695319,"about_ca_topic_score_gemma":0.000009839967,"domain_scores_codex":[0.9983006,0.000007147251,0.0003004461,0.0005069781,0.0003913649,0.000493434],"domain_scores_gemma":[0.9973986,0.00005580462,0.0007061438,0.001433517,0.0003193613,0.00008656683],"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.00005723338,0.0002307508,0.01136072,0.0006386396,0.0001129873,0.000002050859,0.006727867,0.0000152011,0.00449708,0.6893891,0.003167436,0.2838009],"study_design_scores_gemma":[0.007620499,0.002660181,0.01507457,0.001633939,0.0004543921,0.0001784635,0.004870283,0.1934139,0.2107929,0.4735017,0.08616228,0.003636937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7067194,0.006053378,0.1763037,0.02294397,0.004776774,0.01773126,0.00002764975,0.004234939,0.06120891],"genre_scores_gemma":[0.8994732,0.0000076303,0.09775849,0.00009131213,0.00014523,0.0002867983,6.694141e-7,0.0000254621,0.002211211],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.280164,"threshold_uncertainty_score":0.9990109,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008816681,0.0001340464,0.0001755843,0.00006267583,0.0003736763,0.0004009415,0.00560471,0.00006884993,0.000001358536],"category_scores_gemma":[0.01077942,0.00009178014,0.0001171435,0.0001043775,0.0001488889,0.0004803858,0.0007899685,0.000116924,0.000003294595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002120952,"about_ca_system_score_gemma":0.00002039435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001848979,"about_ca_topic_score_gemma":7.541272e-7,"domain_scores_codex":[0.9989742,0.000009069301,0.0002046004,0.0003021797,0.0002540786,0.0002558962],"domain_scores_gemma":[0.9978813,0.0001641595,0.0004817655,0.0012199,0.0002114266,0.00004145077],"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.00002296545,0.00009111762,0.001403302,0.0002404045,0.00003204577,3.180727e-7,0.0005612883,0.000004373607,0.006285807,0.1235535,0.0002464076,0.8675584],"study_design_scores_gemma":[0.0003780859,0.0004408424,0.01478899,0.0004150259,0.00006420086,0.00001514429,0.0007434444,0.007087735,0.9464869,0.02340668,0.005775603,0.0003973297],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9199799,0.0006616059,0.04684114,0.01438697,0.001357264,0.003891836,0.00002367272,0.001033191,0.01182441],"genre_scores_gemma":[0.4472399,0.000005168195,0.5523515,0.00003118099,0.00006223983,0.0001252873,1.290365e-7,0.00001029264,0.0001742959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9402011,"threshold_uncertainty_score":0.9997755,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009984892,0.0001906952,0.000198962,0.0002843182,0.0000901704,0.0003195602,0.002136603,0.00007791031,0.000001474818],"category_scores_gemma":[0.002545661,0.0001399059,0.000100439,0.0008912398,0.00007576527,0.0003845297,0.001200882,0.0003267503,0.000003074438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000133891,"about_ca_system_score_gemma":0.00004115289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001092006,"about_ca_topic_score_gemma":0.000001090763,"domain_scores_codex":[0.9983932,0.00001647893,0.0002986154,0.0005265693,0.0004107401,0.0003544091],"domain_scores_gemma":[0.9988913,0.0001950701,0.0001366878,0.0006550771,0.00007760933,0.00004424143],"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.00003270324,0.0003759868,0.09573543,0.001441411,0.0001067567,0.00006893549,0.01133956,0.00006485149,0.06088803,0.01611809,0.01237003,0.8014582],"study_design_scores_gemma":[0.001337494,0.00144285,0.02591796,0.02127973,0.0001950276,0.0006388712,0.001567816,0.06679298,0.6209052,0.24288,0.01398389,0.003058194],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9832026,0.001506299,0.001855845,0.001805309,0.0006185505,0.0005108527,0.000001109235,0.009931546,0.0005678689],"genre_scores_gemma":[0.7647365,0.000005270509,0.2349369,0.00007452993,0.0001080095,0.00002618257,2.463254e-7,0.00002571107,0.00008661055],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7984,"threshold_uncertainty_score":0.5705196,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001034436,0.0002393114,0.0002591835,0.00009579308,0.001600266,0.001347448,0.008086819,0.00006897438,0.000001399254],"category_scores_gemma":[0.001773353,0.000150195,0.0001367278,0.0002363525,0.0001610185,0.0003554178,0.003489042,0.0002576232,0.00002322681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004692926,"about_ca_system_score_gemma":0.00003702522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000455331,"about_ca_topic_score_gemma":0.000002330538,"domain_scores_codex":[0.9984575,0.00002514776,0.0002783735,0.0004494614,0.0003222561,0.0004672781],"domain_scores_gemma":[0.99754,0.0001899845,0.0004791968,0.001422176,0.0002685937,0.000100056],"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.0001043469,0.0003982994,0.008273966,0.0002121165,0.0002197415,0.00000489091,0.01433061,0.0007571725,0.003455535,0.05241286,0.0327903,0.8870401],"study_design_scores_gemma":[0.005762378,0.002639127,0.05275872,0.009258096,0.0003495477,0.0002995904,0.005354677,0.200684,0.488406,0.04937722,0.1789407,0.006169986],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6262939,0.005690203,0.128079,0.123877,0.003824615,0.008023119,0.00001484405,0.0088713,0.09532601],"genre_scores_gemma":[0.8008735,0.00002039181,0.19719,0.0002372441,0.0001236755,0.0000514654,5.308301e-7,0.00002684889,0.001476407],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8808702,"threshold_uncertainty_score":0.9996995,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004340634,0.0001874272,0.0002888034,0.0001322309,0.00003875342,0.0001007225,0.00238695,0.00008725877,0.000007582642],"category_scores_gemma":[0.0005645776,0.0001186746,0.0000817223,0.0008728267,0.0001168209,0.0003083275,0.0004904846,0.0001966877,0.00002384988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004059765,"about_ca_system_score_gemma":0.00004483242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006505398,"about_ca_topic_score_gemma":0.000005414798,"domain_scores_codex":[0.9986355,0.00001705098,0.0002961516,0.0003959512,0.0003517378,0.000303564],"domain_scores_gemma":[0.9985164,0.00008089764,0.0003820599,0.0006877033,0.0002863183,0.00004663923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004215805,0.001645594,0.4091183,0.0009632114,0.0002001247,0.000006496647,0.02791269,0.00002569331,0.1407635,0.04509622,0.0002773795,0.3735692],"study_design_scores_gemma":[0.007550426,0.01251039,0.2117016,0.006897179,0.0001948518,0.0001183283,0.007044197,0.01872593,0.7196263,0.007775725,0.005408423,0.002446669],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9958745,0.0001560077,0.0000752195,0.0003833738,0.00005511766,0.0007645597,8.218213e-7,0.0001666601,0.002523749],"genre_scores_gemma":[0.9615775,0.000003721006,0.0378426,0.00002993931,0.00002694571,0.00004255387,0.0000024947,0.00001849429,0.0004557606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5788628,"threshold_uncertainty_score":0.4839411,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003287,0.000119874,0.0001375619,0.0000739193,0.00007354709,0.0001637168,0.002494729,0.00005244739,0.00000827292],"category_scores_gemma":[0.000606106,0.00007764614,0.0001001394,0.0005335487,0.00005591555,0.0003630727,0.000803832,0.0001402182,0.00002402554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001575096,"about_ca_system_score_gemma":0.00001502248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000123641,"about_ca_topic_score_gemma":0.000001765396,"domain_scores_codex":[0.9989978,0.000007924514,0.0001689211,0.0003147715,0.000298026,0.0002125599],"domain_scores_gemma":[0.998916,0.0000688515,0.0001771784,0.0006844981,0.0001174189,0.00003599357],"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.0000244404,0.0002178397,0.0107781,0.0002505957,0.00002396107,6.462399e-7,0.001991287,0.000006196417,0.00823951,0.9428599,0.001020566,0.0345869],"study_design_scores_gemma":[0.002253802,0.002549457,0.04723751,0.0009804828,0.0001119109,0.0000940012,0.003042067,0.002859447,0.1471502,0.7571779,0.03495364,0.001589509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9924119,0.000168912,0.0004256474,0.00185276,0.0001979987,0.0007943133,0.000003871965,0.0002598038,0.003884862],"genre_scores_gemma":[0.9559458,0.00000337729,0.0437535,0.0001780743,0.0000313638,0.00003092369,0.000001611264,0.000006300521,0.00004901659],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.185682,"threshold_uncertainty_score":0.4635868,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007177889,0.0001772688,0.0002246503,0.0001350815,0.0002022142,0.0002174572,0.003062574,0.00009174623,0.000003300653],"category_scores_gemma":[0.001344167,0.0001151749,0.0001761158,0.0008031576,0.00007632122,0.0002132328,0.0009271248,0.000123115,0.00005254905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002438244,"about_ca_system_score_gemma":0.00002604369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002259963,"about_ca_topic_score_gemma":0.000002298633,"domain_scores_codex":[0.9985623,0.00000856561,0.0002529493,0.0003841565,0.000343144,0.0004488532],"domain_scores_gemma":[0.998758,0.0001399465,0.0002333391,0.000598222,0.0002069328,0.00006357297],"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.00007671975,0.0001565483,0.00150356,0.0006384871,0.0001122412,0.000003647341,0.004574099,0.000006710619,0.00922518,0.7406511,0.01825689,0.2247949],"study_design_scores_gemma":[0.001848681,0.003427537,0.00243531,0.0002388517,0.0001263027,0.00005620918,0.004827934,0.0009849248,0.297352,0.07682786,0.6105859,0.001288541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8748354,0.003290898,0.01258935,0.04218111,0.006755107,0.01154571,0.00002472594,0.01097744,0.03780029],"genre_scores_gemma":[0.9807404,0.000007426325,0.01534062,0.0001386355,0.000223307,0.0002234043,0.000003511527,0.00002690494,0.003295818],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6638232,"threshold_uncertainty_score":0.5691075,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005496415,0.0002057443,0.0004680959,0.0003364976,0.00008198898,0.0001191052,0.003497669,0.00006989751,0.000003781076],"category_scores_gemma":[0.0004460448,0.000131808,0.0003441065,0.002593851,0.0001201122,0.0001666746,0.001091024,0.0002270839,0.000002671709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001719691,"about_ca_system_score_gemma":0.00002534899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004811366,"about_ca_topic_score_gemma":0.000002170723,"domain_scores_codex":[0.9982888,0.0000201441,0.0003633226,0.00045121,0.0005373238,0.0003392001],"domain_scores_gemma":[0.9981079,0.0001759268,0.0005456127,0.0008205533,0.0002976924,0.00005233935],"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.0001297633,0.001203701,0.08633053,0.0009357152,0.002494388,0.000004470066,0.01450421,0.02132463,0.01409717,0.3233751,0.0001974551,0.5354029],"study_design_scores_gemma":[0.0006346708,0.001752783,0.02417737,0.0006614357,0.000483651,0.00001131037,0.002962409,0.9390508,0.02575436,0.003309732,0.0005937705,0.0006076994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.995248,0.0001989193,0.002649587,0.0009298214,0.0001514219,0.000424124,0.000002574226,0.0001532128,0.0002423181],"genre_scores_gemma":[0.8857912,0.000003033524,0.1140485,0.00003187022,0.00001739247,0.00001387095,0.000001649476,0.00001328551,0.00007918622],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9177262,"threshold_uncertainty_score":0.6499597,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001883732,0.0004203241,0.0004871396,0.0001643396,0.001131715,0.0006525914,0.005865013,0.00009523257,0.00001476961],"category_scores_gemma":[0.0003746556,0.000253813,0.0003066075,0.0009769591,0.0001581152,0.0002278598,0.002488053,0.0006653782,0.00001082959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002842321,"about_ca_system_score_gemma":0.00008269915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001098637,"about_ca_topic_score_gemma":0.0000575562,"domain_scores_codex":[0.9965258,0.0001406716,0.0005767026,0.0007444151,0.001238104,0.0007743361],"domain_scores_gemma":[0.9972796,0.0002279605,0.0008205506,0.001320737,0.0002385744,0.0001125329],"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.0001378844,0.0009440774,0.01712179,0.002120846,0.000808282,0.00008663974,0.0402611,0.000470152,0.003291829,0.399334,0.00201877,0.5334046],"study_design_scores_gemma":[0.006949598,0.008748965,0.001711271,0.001582299,0.001154421,0.00155048,0.4493504,0.02294805,0.05318924,0.007062047,0.4399874,0.005765828],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.959252,0.005177611,0.005530931,0.009167733,0.004065495,0.00778284,0.00005863358,0.002812745,0.006152031],"genre_scores_gemma":[0.9953213,0.000004329633,0.003013978,0.0003241642,0.0001884383,0.0003049038,0.000002656225,0.00005744954,0.0007828309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5276387,"threshold_uncertainty_score":0.9999914,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008496116,0.0001187518,0.0001341833,0.0001009652,0.0004205044,0.000146259,0.003395239,0.00003182387,0.000008577587],"category_scores_gemma":[0.002012697,0.00009450028,0.00003459334,0.0004917491,0.0001479683,0.0004804425,0.003541284,0.0002501993,0.000001663523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003415877,"about_ca_system_score_gemma":0.00003128259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002375338,"about_ca_topic_score_gemma":0.00000147159,"domain_scores_codex":[0.9988374,0.00002966145,0.0001897985,0.0004077206,0.0003227608,0.0002126382],"domain_scores_gemma":[0.9986148,0.0001224492,0.0002524653,0.0008674148,0.0001024692,0.00004039472],"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.00005870684,0.0002423113,0.003373227,0.0001966001,0.0001331118,0.000001951086,0.007760612,0.00003106561,0.01533467,0.2552584,0.005550955,0.7120584],"study_design_scores_gemma":[0.005484041,0.007217984,0.0383205,0.001431537,0.0009964785,0.00157217,0.1352766,0.07096664,0.2547732,0.254214,0.224705,0.005041797],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9759399,0.002336842,0.007966795,0.007696605,0.001042124,0.001513766,0.00007422585,0.0008005776,0.002629195],"genre_scores_gemma":[0.5868927,0.00001433949,0.4126042,0.0001850541,0.0000474197,0.00006838985,0.000006131187,0.0000133915,0.0001684207],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7070166,"threshold_uncertainty_score":0.6309254,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007613223,0.0001813032,0.000256547,0.0001451604,0.0007125096,0.0009203937,0.005162028,0.00006367209,0.000003592243],"category_scores_gemma":[0.001557091,0.0001348205,0.0001436088,0.0004445354,0.0001774495,0.0003488264,0.002586694,0.0001963926,0.000003841079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002313998,"about_ca_system_score_gemma":0.00001849494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007592818,"about_ca_topic_score_gemma":0.000002872601,"domain_scores_codex":[0.9984154,0.00001392,0.0002771937,0.0005522715,0.0004373616,0.0003038936],"domain_scores_gemma":[0.9974558,0.0001304162,0.0004917103,0.00164587,0.0001903433,0.00008587761],"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.00009036226,0.0009012789,0.1496487,0.0007567952,0.001112932,0.00001139618,0.02835312,0.00205506,0.003997458,0.04710152,0.008159851,0.7578115],"study_design_scores_gemma":[0.002966233,0.0006865439,0.1295539,0.001521986,0.001503986,0.0001036023,0.008570826,0.6751341,0.124757,0.006367453,0.04630663,0.002527778],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9880183,0.0003390307,0.003246526,0.006749373,0.0001339321,0.0004369945,0.0000105433,0.0002325173,0.0008327912],"genre_scores_gemma":[0.9666904,0.00001664172,0.03289296,0.0002166542,0.0000586467,0.000022425,0.000002019609,0.00001065401,0.00008956456],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7552837,"threshold_uncertainty_score":0.9592419,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324105,0.0001545094,0.0001921792,0.00007499792,0.00009276929,0.0002365431,0.001745561,0.00006103193,0.000002470284],"category_scores_gemma":[0.0003461228,0.00009018754,0.00009327636,0.0002821106,0.00008186454,0.0002574621,0.0009006298,0.0001518835,0.00001471542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001409557,"about_ca_system_score_gemma":0.0000139018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002123998,"about_ca_topic_score_gemma":0.000001932009,"domain_scores_codex":[0.9990551,0.00001014578,0.0001948565,0.0002986763,0.0001981007,0.0002431538],"domain_scores_gemma":[0.9990457,0.00008933579,0.0002033248,0.0004942997,0.0001200811,0.00004729885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000009620102,0.0001591762,0.03836843,0.0004720819,0.00010389,0.000001184845,0.01470413,0.000002055589,0.01146021,0.6197725,0.0003509526,0.3145958],"study_design_scores_gemma":[0.004744517,0.005349065,0.04759903,0.001020134,0.0002400196,0.0006427086,0.04835611,0.01191125,0.3750969,0.3560357,0.1451901,0.003814482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9838942,0.0008601237,0.00323126,0.002882051,0.000570074,0.001092003,0.000001573615,0.0004095078,0.007059265],"genre_scores_gemma":[0.99164,0.000006899534,0.007666931,0.0001057957,0.00004244049,0.00002166643,6.213038e-7,0.00001211966,0.0005034968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3636367,"threshold_uncertainty_score":0.3677741,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008773262,0.0002547049,0.0003286677,0.0001329078,0.0004284149,0.000393049,0.001660598,0.00006398203,0.00001096446],"category_scores_gemma":[0.001554,0.000194724,0.00007441123,0.000608585,0.0001157675,0.0001730348,0.001353713,0.000278788,0.000004909206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008344145,"about_ca_system_score_gemma":0.00007207211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007125368,"about_ca_topic_score_gemma":0.00001122356,"domain_scores_codex":[0.9981019,0.00006382872,0.0002719005,0.0006492263,0.0004922207,0.0004208592],"domain_scores_gemma":[0.9985621,0.0003577965,0.0002592224,0.0005547753,0.0001246789,0.0001414438],"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.0008731412,0.00113976,0.206954,0.003960348,0.0003746097,0.00005398572,0.03458235,0.0002830327,0.03601573,0.1284108,0.006169394,0.5811828],"study_design_scores_gemma":[0.01734697,0.01905389,0.06560552,0.004268031,0.0008258453,0.0002598666,0.03553009,0.02296739,0.4914734,0.03149231,0.3036416,0.007535106],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898009,0.004021694,0.001346119,0.001687218,0.0003748249,0.001589251,0.000006098052,0.0003645341,0.0008093907],"genre_scores_gemma":[0.9334272,0.000004541881,0.06563523,0.0004757225,0.00006850813,0.0001629184,0.000003480255,0.00002888865,0.0001935052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5736477,"threshold_uncertainty_score":0.7940615,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004315552,0.00009501583,0.0001649722,0.00007769636,0.00004509257,0.00008950176,0.0009167017,0.00006008868,0.000001325651],"category_scores_gemma":[0.0006610882,0.00007013447,0.00004870032,0.0004770183,0.00007014845,0.0001754496,0.0003368604,0.0000972184,0.000001197588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000187535,"about_ca_system_score_gemma":0.00002073296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004678642,"about_ca_topic_score_gemma":0.000006307567,"domain_scores_codex":[0.999046,0.00001671623,0.0002600451,0.0002797844,0.0002461754,0.0001512996],"domain_scores_gemma":[0.9990214,0.00004277061,0.0002554037,0.0004661315,0.0001878212,0.00002643707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000168513,0.0002894173,0.06357585,0.0004454947,0.00003017926,0.000003113718,0.005466023,0.000005763025,0.0931806,0.5635228,0.0001037496,0.2733601],"study_design_scores_gemma":[0.0009406458,0.0003194955,0.2288742,0.0002001137,0.00003439411,0.00005215647,0.005451353,0.000488583,0.7084415,0.04235324,0.01241375,0.0004305603],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9932843,0.001796024,0.001069282,0.001516761,0.0001509516,0.0004316431,7.370986e-7,0.00008577439,0.001664468],"genre_scores_gemma":[0.9826132,0.00004092979,0.0171531,0.00002118191,0.00003307398,0.00002328102,0.000001211032,0.000006950193,0.0001070753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6152609,"threshold_uncertainty_score":0.2860001,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009661348,0.0003094715,0.0003737376,0.0002230818,0.0002290459,0.0004730865,0.004388155,0.0001495285,0.000006117827],"category_scores_gemma":[0.001058009,0.0002093727,0.0001676221,0.001080254,0.0002898574,0.0004958978,0.001367031,0.0002928408,0.00003433551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001007342,"about_ca_system_score_gemma":0.00006096564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002235739,"about_ca_topic_score_gemma":0.0000519493,"domain_scores_codex":[0.9975117,0.00002856907,0.0004872062,0.0006577646,0.0005810831,0.0007336097],"domain_scores_gemma":[0.9982262,0.0000645071,0.0004299672,0.0009065542,0.0002708358,0.0001019091],"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.00004568283,0.0006344397,0.1101095,0.0004114162,0.00007912402,0.00001110392,0.01136062,7.822681e-7,0.004056237,0.1301492,0.0008248129,0.7423171],"study_design_scores_gemma":[0.00885844,0.01254065,0.07712124,0.002364386,0.0002557694,0.0006098737,0.0189353,0.002050601,0.5260959,0.1485521,0.1974209,0.005194889],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9696762,0.001217289,0.001602833,0.002145204,0.001258091,0.003393482,0.000001126395,0.001126925,0.01957883],"genre_scores_gemma":[0.9758955,0.000007071903,0.02300572,0.00009974802,0.0002674821,0.0001858998,0.000001126398,0.0000303711,0.0005070917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7371222,"threshold_uncertainty_score":0.8537972,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006973622,0.0003447693,0.0003675394,0.00005710768,0.0004806513,0.0006549533,0.005334078,0.0001079486,0.000004622214],"category_scores_gemma":[0.002163213,0.0001778109,0.0001981732,0.000706564,0.0004345892,0.0004180715,0.001185632,0.0002996668,0.00001111003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000360212,"about_ca_system_score_gemma":0.00008006608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004062244,"about_ca_topic_score_gemma":0.00002253813,"domain_scores_codex":[0.9976434,0.00001703239,0.0004057085,0.000691429,0.0006015807,0.0006408706],"domain_scores_gemma":[0.997642,0.0004803497,0.0005283834,0.0008917286,0.0003082861,0.0001492033],"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.0002137032,0.0003819599,0.01514434,0.001712924,0.0005186877,0.00001569655,0.01385839,0.00002311248,0.0009389051,0.2784216,0.007847895,0.6809227],"study_design_scores_gemma":[0.005084072,0.005417749,0.002027486,0.0006156915,0.0004956331,0.0003011853,0.02133127,0.003917606,0.04069062,0.01096029,0.9070641,0.002094331],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.120322,0.007812933,0.4788361,0.3139938,0.004273404,0.04924434,0.0001420406,0.008808097,0.01656741],"genre_scores_gemma":[0.930328,0.00001316138,0.06815033,0.0006477986,0.0002288871,0.0004576687,0.000004968422,0.00003945151,0.0001297233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8992162,"threshold_uncertainty_score":0.9912133,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004119488,0.00009438387,0.0001177301,0.00006034359,0.0001696563,0.0001218116,0.002300342,0.00004730167,0.000002671434],"category_scores_gemma":[0.0007902417,0.00006927361,0.0001027005,0.0003626547,0.00004084179,0.0002152078,0.0004854046,0.0001162047,0.000006573019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002744559,"about_ca_system_score_gemma":0.00002367404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005035125,"about_ca_topic_score_gemma":3.002296e-7,"domain_scores_codex":[0.9991101,0.000004979509,0.0001974603,0.0002860417,0.0001994788,0.0002019398],"domain_scores_gemma":[0.9988986,0.0001202276,0.0002092102,0.0005475826,0.0001948732,0.00002948506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004949734,0.0002418151,0.004547678,0.000433742,0.00006077345,1.08706e-7,0.005819609,0.00004007748,0.01551287,0.6712234,0.003898903,0.2981715],"study_design_scores_gemma":[0.002468249,0.001357256,0.01129943,0.001160348,0.00008440717,0.00008079493,0.007074194,0.00969699,0.5680558,0.08350742,0.3139535,0.001261528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9369231,0.0005160589,0.01162497,0.03115009,0.002193299,0.004258521,0.000009834858,0.001087979,0.01223608],"genre_scores_gemma":[0.8338829,0.000002923483,0.1651657,0.0001433748,0.0001081489,0.00006376836,8.365601e-7,0.00001037515,0.0006219343],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.587716,"threshold_uncertainty_score":0.4274645,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003210914,0.000185388,0.0002254767,0.0001257215,0.00009177785,0.0003629231,0.002856897,0.00007415544,0.0000176479],"category_scores_gemma":[0.007496849,0.0001460459,0.0001103054,0.0008902233,0.00003902432,0.000263362,0.00144894,0.0002180547,0.0000442766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001249667,"about_ca_system_score_gemma":0.00007934898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000156308,"about_ca_topic_score_gemma":0.00001465263,"domain_scores_codex":[0.9982211,0.00001503757,0.0002554272,0.0004803307,0.0006339325,0.0003941665],"domain_scores_gemma":[0.9981107,0.0003750777,0.0001110856,0.0009889852,0.0002982641,0.0001159154],"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.0000107606,0.0003559067,0.02967187,0.0003685521,0.0001620703,0.00003063078,0.009906654,0.00009293797,0.08991101,0.002828685,0.006546918,0.860114],"study_design_scores_gemma":[0.0007422689,0.0005936152,0.069234,0.001178639,0.00006299351,0.00008028431,0.00186687,0.007004655,0.9093046,0.003092613,0.005990144,0.0008493693],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9900254,0.0005825486,0.003797258,0.004235082,0.0002704412,0.0003899239,0.000003884087,0.0005659178,0.0001295628],"genre_scores_gemma":[0.7852647,0.000005763501,0.2142156,0.0001736934,0.00008878937,0.00007758445,0.000002136369,0.00002233951,0.000149402],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8592646,"threshold_uncertainty_score":0.897497,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006966479,0.0001681611,0.000221156,0.00007346144,0.0001297126,0.0003475675,0.0006953297,0.0001024785,0.000004635971],"category_scores_gemma":[0.0007610365,0.0001226747,0.00007258599,0.0007513067,0.0001004513,0.0004009983,0.0005052969,0.0002114305,0.000002519557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005271185,"about_ca_system_score_gemma":0.0000468892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007109706,"about_ca_topic_score_gemma":0.00003153791,"domain_scores_codex":[0.9985127,0.00003305621,0.0003090374,0.0004793909,0.0003667986,0.000299042],"domain_scores_gemma":[0.9989124,0.00007830067,0.000214098,0.0004236765,0.0003199672,0.00005153546],"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.00003011416,0.0004708168,0.1020998,0.0004044907,0.00005233362,0.000009168905,0.004788855,0.00001021093,0.005959738,0.1851892,0.0001121258,0.7008731],"study_design_scores_gemma":[0.006350474,0.002314194,0.3966026,0.001398201,0.000267194,0.0006838208,0.01751547,0.003462616,0.1912682,0.246794,0.1299763,0.003366825],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9807448,0.002928254,0.002313853,0.006235622,0.0008959823,0.001223675,7.996857e-7,0.0004820664,0.005174942],"genre_scores_gemma":[0.9822126,0.000008108652,0.01703516,0.00007019846,0.00009895115,0.00005621641,0.000002682398,0.00001244741,0.0005036271],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6975062,"threshold_uncertainty_score":0.500253,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285646,0.0001578983,0.0002462641,0.0001554078,0.0001221713,0.0000837702,0.002995405,0.00007320812,8.547343e-7],"category_scores_gemma":[0.008172713,0.00009545082,0.0001502571,0.001384289,0.0002298287,0.0001822468,0.001151463,0.000218895,0.000001799467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001972247,"about_ca_system_score_gemma":0.00002988612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001594112,"about_ca_topic_score_gemma":0.000001390959,"domain_scores_codex":[0.9984964,0.00002739566,0.0003852749,0.0003000895,0.0005030544,0.0002878082],"domain_scores_gemma":[0.9977292,0.0005438128,0.0005627114,0.000861008,0.0002690023,0.00003420618],"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.00003745773,0.0004043402,0.01913413,0.0008235751,0.00008366144,0.000002982931,0.01713191,0.0000180021,0.02938047,0.006138937,0.006870897,0.9199736],"study_design_scores_gemma":[0.0005523784,0.00173956,0.05689075,0.002438754,0.0001514988,0.00009117721,0.004989866,0.001778608,0.8893945,0.04040604,0.0009683754,0.0005985285],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9918861,0.0001971713,0.0001054312,0.002345982,0.0001477282,0.000714815,0.000003016993,0.004171086,0.0004286131],"genre_scores_gemma":[0.9165206,0.00001278158,0.08322207,0.00002555528,0.00004954134,0.0000940577,0.000001150713,0.0000162781,0.00005797724],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9193751,"threshold_uncertainty_score":0.9784091,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001275388,0.0004142477,0.0004932958,0.0001313063,0.001119003,0.0006222057,0.001904236,0.00009897428,0.000002408318],"category_scores_gemma":[0.003312173,0.0002919399,0.0001062343,0.0006794087,0.0004828484,0.0004985385,0.002091269,0.0004343041,3.943783e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008854147,"about_ca_system_score_gemma":0.00009476437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006520621,"about_ca_topic_score_gemma":0.00002148136,"domain_scores_codex":[0.997317,0.00005346956,0.0003959845,0.0009003798,0.0006088031,0.0007243271],"domain_scores_gemma":[0.9978362,0.000319752,0.0006486509,0.0006072367,0.000425229,0.0001629284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","study_design_scores_codex":[0.0006705784,0.0006416976,0.1291863,0.002255147,0.0002079985,0.00002083794,0.04142818,0.00002846811,0.001839717,0.4386811,0.0004343867,0.3846056],"study_design_scores_gemma":[0.03530352,0.06967597,0.2014684,0.04930678,0.003343301,0.009501772,0.2346286,0.1073219,0.06014045,0.09256092,0.119636,0.01711246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9908284,0.003532693,0.001050276,0.0009886902,0.0001881507,0.002213122,0.00001004706,0.0004752229,0.0007134025],"genre_scores_gemma":[0.9038032,0.00005226089,0.09486443,0.00008379747,0.00008217182,0.0005738407,0.000006096528,0.0000488181,0.0004854105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3674931,"threshold_uncertainty_score":0.9999533,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005323443,0.0001639032,0.0002051272,0.0000815332,0.0001126082,0.000230082,0.002206725,0.00007794775,0.000002943204],"category_scores_gemma":[0.0004119377,0.0001065537,0.0001213864,0.0002997363,0.00003776969,0.000303206,0.0005821964,0.00009805491,0.00001707668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002832301,"about_ca_system_score_gemma":0.00002029841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002677744,"about_ca_topic_score_gemma":0.000002813608,"domain_scores_codex":[0.9986966,0.000009183389,0.000247406,0.0003564178,0.0003610875,0.0003293452],"domain_scores_gemma":[0.9988395,0.00006410207,0.0003044766,0.0005234438,0.0002235447,0.0000449074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004574983,0.0002177002,0.0246782,0.0008147422,0.00008480826,7.241571e-7,0.003790134,0.00002065817,0.006616278,0.8222534,0.0006125844,0.140865],"study_design_scores_gemma":[0.006055324,0.004426743,0.007362857,0.0004411929,0.0002749231,0.0001754912,0.006409816,0.011121,0.6554306,0.1997545,0.105871,0.002676627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8896633,0.002090997,0.06686609,0.004980838,0.003698912,0.01033214,0.000009322835,0.002066607,0.02029183],"genre_scores_gemma":[0.9794537,0.00000452222,0.01920969,0.00009004511,0.00008825987,0.0001124438,0.000002680745,0.00001871652,0.001019984],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6488143,"threshold_uncertainty_score":0.4345135,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005155365,0.000118551,0.0001640374,0.0001126277,0.0001161231,0.0001265778,0.002075936,0.00006079195,3.894247e-7],"category_scores_gemma":[0.001395223,0.00008806331,0.00007364873,0.0008763006,0.00004489141,0.0001530424,0.0008450229,0.0001413101,8.928089e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001939738,"about_ca_system_score_gemma":0.00001395047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008333384,"about_ca_topic_score_gemma":0.000003679292,"domain_scores_codex":[0.9990021,0.000008223175,0.0002110746,0.0002838631,0.0001813374,0.0003134236],"domain_scores_gemma":[0.9990841,0.0002020292,0.000194678,0.0003792505,0.0001110883,0.00002884365],"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.0001490536,0.0001594541,0.09711548,0.0006790712,0.00006200511,0.000007139446,0.009683681,0.04434,0.002065785,0.08597321,0.01744948,0.7423156],"study_design_scores_gemma":[0.002162465,0.0007251657,0.06300697,0.001697814,0.00004342531,0.00002718643,0.001034363,0.7374584,0.04739332,0.1372222,0.007818943,0.001409753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9686062,0.0002389863,0.02129398,0.005007478,0.0005457836,0.001378516,0.000002790468,0.002064953,0.0008613375],"genre_scores_gemma":[0.7821128,0.00000580837,0.2175722,0.0001089828,0.00005894529,0.00003212744,0.000001236928,0.000008857336,0.00009903056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7409059,"threshold_uncertainty_score":0.385764,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000434438,0.0001831822,0.0001771444,0.0001442489,0.0002304488,0.0002102859,0.002891839,0.00004855873,0.000001027266],"category_scores_gemma":[0.0004955595,0.0001045594,0.00008420042,0.001239075,0.00008636474,0.0001443932,0.001385278,0.0002666025,0.00001190874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001778511,"about_ca_system_score_gemma":0.00002513381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001059843,"about_ca_topic_score_gemma":0.000001234321,"domain_scores_codex":[0.9985486,0.000008986756,0.0001848671,0.0003971157,0.0004379471,0.0004224448],"domain_scores_gemma":[0.9989611,0.00009295453,0.0002021472,0.000573877,0.0001150825,0.00005482611],"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.00003654,0.0001559831,0.01016751,0.0004642096,0.00009453162,0.00001942841,0.008871745,0.000595607,0.01106691,0.00954134,0.0008743263,0.9581119],"study_design_scores_gemma":[0.005139808,0.006228494,0.1096237,0.00855653,0.0001915114,0.0007775937,0.01120509,0.5581799,0.2196752,0.04217765,0.03379435,0.004450216],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9916704,0.00006118719,0.0003583493,0.005703749,0.000108011,0.0006822115,0.000001164405,0.0009183759,0.0004965176],"genre_scores_gemma":[0.9003319,0.000002613199,0.09899869,0.0001404729,0.00006578616,0.00008209763,7.224324e-7,0.00002702054,0.0003506904],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9536616,"threshold_uncertainty_score":0.5373805,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002277232,0.0003200107,0.000385569,0.0001953873,0.0005693387,0.0003801264,0.003417533,0.000114819,0.000005364097],"category_scores_gemma":[0.002472705,0.0002002505,0.0002759713,0.0008150418,0.0002150261,0.0005785871,0.001329445,0.0008323529,0.000007146039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008213564,"about_ca_system_score_gemma":0.00006645935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001932268,"about_ca_topic_score_gemma":0.000001399307,"domain_scores_codex":[0.9970422,0.00007809509,0.0006707799,0.0006542819,0.0009574561,0.0005972108],"domain_scores_gemma":[0.9970503,0.0003140484,0.001110294,0.001202333,0.0002445303,0.00007842034],"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.000100871,0.0007658122,0.1613122,0.0009526706,0.0003616467,0.00002812302,0.05041437,0.001538463,0.07726771,0.04627415,0.001234754,0.6597492],"study_design_scores_gemma":[0.006101843,0.003924399,0.07892855,0.01210156,0.0007912734,0.006512546,0.07935281,0.1733817,0.1449494,0.004185749,0.4834813,0.006288867],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9928586,0.0002123975,0.00242441,0.001613827,0.0005401711,0.0008038384,6.823331e-7,0.001045458,0.0005005571],"genre_scores_gemma":[0.8557154,9.749872e-7,0.1434503,0.00007450095,0.00008995915,0.00004088816,0.000001724151,0.00003315218,0.000593023],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6534603,"threshold_uncertainty_score":0.8165981,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005782709,0.00009395533,0.0001580573,0.00009077071,0.0001978031,0.00003284789,0.005093695,0.00004953657,0.000009338176],"category_scores_gemma":[0.001208185,0.00007541809,0.00003499728,0.0006291782,0.00006938235,0.0001580505,0.00323854,0.0002104859,5.849393e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002702306,"about_ca_system_score_gemma":0.00002305122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003154225,"about_ca_topic_score_gemma":0.000001230206,"domain_scores_codex":[0.9990199,0.00001251771,0.0002175331,0.000308466,0.0002756632,0.0001659651],"domain_scores_gemma":[0.9981414,0.0001136138,0.0003401032,0.001246607,0.000135428,0.00002282484],"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.0002187191,0.001981696,0.01508127,0.0004145986,0.0003638033,0.000004783854,0.005401151,0.001316695,0.08241838,0.1710796,0.002368376,0.7193509],"study_design_scores_gemma":[0.001223393,0.001303369,0.003915118,0.0003204482,0.0002238081,0.0001112278,0.004203366,0.07504792,0.8574584,0.01773463,0.03734056,0.001117776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726177,0.001528929,0.01059926,0.01038018,0.0005721958,0.001762807,0.0000502229,0.0009757829,0.001512947],"genre_scores_gemma":[0.924817,0.00001082298,0.07503341,0.00003815644,0.00001224765,0.00005415739,0.00000272146,0.000008958166,0.00002251464],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.77504,"threshold_uncertainty_score":0.9465437,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004705583,0.0001924705,0.000265142,0.00008673043,0.0001041749,0.000137543,0.001952955,0.0001023826,0.00000393958],"category_scores_gemma":[0.0005587736,0.0001236038,0.00009720132,0.0003708384,0.00008964671,0.000251626,0.0009531727,0.0002010197,0.00004823301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001980178,"about_ca_system_score_gemma":0.00002260477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005217963,"about_ca_topic_score_gemma":0.000002594111,"domain_scores_codex":[0.9986638,0.00001228871,0.0002333305,0.0004232132,0.000335707,0.0003316975],"domain_scores_gemma":[0.9987746,0.0000882019,0.0002742054,0.0005909192,0.0002000105,0.00007206829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001208386,0.0004981548,0.107182,0.00143878,0.0003055826,0.00001126254,0.0151933,0.00001425762,0.01714985,0.4900083,0.002789858,0.3652878],"study_design_scores_gemma":[0.007256579,0.007601182,0.04011223,0.001222212,0.0003633953,0.0003854689,0.01789865,0.007517797,0.58289,0.118425,0.212277,0.004050559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9893535,0.0007641301,0.0006984755,0.001826028,0.0007533122,0.001170763,0.000001221035,0.0003012049,0.005131344],"genre_scores_gemma":[0.9657005,0.00001470586,0.03290595,0.0001138353,0.0001239241,0.00002701326,8.633929e-7,0.00001841307,0.001094811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5657402,"threshold_uncertainty_score":0.5040418,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831171,0.0001696464,0.0002015984,0.0001032252,0.0005718732,0.0001870722,0.004123056,0.00003761377,0.00001355424],"category_scores_gemma":[0.0003248386,0.0001224683,0.0001588914,0.0005721234,0.00007825274,0.0002298234,0.002686954,0.0002985533,0.000006905469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008658621,"about_ca_system_score_gemma":0.00004545672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000493914,"about_ca_topic_score_gemma":0.000001424104,"domain_scores_codex":[0.9982151,0.00002962335,0.0002776323,0.0004121745,0.0007184086,0.0003470093],"domain_scores_gemma":[0.9987768,0.00008570927,0.0003267909,0.0006129806,0.0001408582,0.00005686871],"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.00004200486,0.0004674833,0.009706269,0.0002030644,0.00009193415,0.000008877676,0.005606162,0.00004409901,0.01150943,0.8233927,0.002214888,0.1467131],"study_design_scores_gemma":[0.005067622,0.006001428,0.02557335,0.0002380757,0.0002542801,0.001448817,0.02977561,0.003713657,0.1242034,0.1945599,0.605546,0.003617791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8713011,0.003322394,0.008187111,0.03372099,0.003854848,0.006743348,0.00002337152,0.0036574,0.06918941],"genre_scores_gemma":[0.9807969,0.000001631484,0.01802943,0.0003066456,0.00008723418,0.0001680761,0.000002247838,0.00001711156,0.0005907082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6288328,"threshold_uncertainty_score":0.7661732,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007385211,0.000203465,0.0002635032,0.0001394712,0.0002862553,0.0004403882,0.002289031,0.00006883622,0.000003521671],"category_scores_gemma":[0.0002972596,0.0001360746,0.00008625459,0.0008885866,0.0001349045,0.0002985208,0.001716396,0.0001902155,0.00003520467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002470736,"about_ca_system_score_gemma":0.00001907006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008992816,"about_ca_topic_score_gemma":0.000002281592,"domain_scores_codex":[0.9983802,0.00001449652,0.0002634998,0.0004285021,0.0004115365,0.0005017119],"domain_scores_gemma":[0.9988801,0.000110943,0.0002332173,0.0005538307,0.0001358616,0.0000860594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004832823,0.0002781769,0.1300348,0.001472065,0.0001830077,0.0000269164,0.01147939,0.0000317033,0.0208811,0.5481312,0.01574681,0.2716864],"study_design_scores_gemma":[0.005451178,0.002435005,0.05656402,0.0009338006,0.0002295166,0.0003541789,0.02259326,0.02175339,0.4052462,0.2215304,0.2593482,0.003560893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9738269,0.0009876094,0.001231287,0.006588478,0.0008754518,0.001740757,0.000005250263,0.002500742,0.0122435],"genre_scores_gemma":[0.9852799,0.00002218851,0.01269872,0.0001428877,0.00005888396,0.00005212765,0.000001781969,0.00002237047,0.001721111],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3843651,"threshold_uncertainty_score":0.554896,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001573361,0.0002375814,0.0002984611,0.0002322555,0.0002297941,0.0001748567,0.004543903,0.0000755088,9.269626e-7],"category_scores_gemma":[0.01741575,0.0001714423,0.0002166366,0.001021894,0.0001204325,0.0002282293,0.001843862,0.0002048606,0.00000282012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004991868,"about_ca_system_score_gemma":0.00002559793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002674946,"about_ca_topic_score_gemma":0.00001028335,"domain_scores_codex":[0.9981947,0.00002030717,0.0003581659,0.000534833,0.0004023622,0.0004896331],"domain_scores_gemma":[0.997121,0.0007784358,0.0003628772,0.001349959,0.0003124019,0.00007527869],"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.00008813645,0.000213547,0.01895306,0.0007144177,0.0001182432,0.000009194497,0.01679184,0.000006992648,0.007431261,0.02374169,0.1074723,0.8244593],"study_design_scores_gemma":[0.001595646,0.001030941,0.004549046,0.001149352,0.00007202024,0.00004760449,0.001670281,0.001721679,0.1965344,0.7870211,0.003718644,0.000889277],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9531513,0.0008251884,0.006637722,0.01232292,0.0004941358,0.002784772,0.00007555477,0.02308159,0.0006268558],"genre_scores_gemma":[0.7109489,0.00001109687,0.2879315,0.0003063067,0.00006246116,0.0002875128,0.000005761242,0.00004187609,0.000404628],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.82357,"threshold_uncertainty_score":0.990861,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095338,0.0001261446,0.0001297835,0.0001153842,0.00007335202,0.000422592,0.005261805,0.00004990935,0.000002213799],"category_scores_gemma":[0.005491245,0.00008593266,0.00006307787,0.000418171,0.00003714861,0.0004337517,0.001791781,0.0002122991,0.000008864798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003531493,"about_ca_system_score_gemma":0.00003607766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001600912,"about_ca_topic_score_gemma":0.000001307581,"domain_scores_codex":[0.9987277,0.000002161304,0.0001635724,0.000434553,0.0003623272,0.0003096586],"domain_scores_gemma":[0.9980749,0.0006982304,0.00005303934,0.001028097,0.00009978231,0.00004598497],"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.00003293212,0.0001715277,0.01060276,0.004914714,0.0003177942,0.00001659658,0.003611096,0.00004778181,0.03938081,0.03430711,0.01563868,0.8909582],"study_design_scores_gemma":[0.001327921,0.001164467,0.04763742,0.008039352,0.0002563299,0.000165501,0.001442787,0.04257252,0.5631177,0.01922711,0.3128449,0.002203955],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9641985,0.006458917,0.009364032,0.01102571,0.002177107,0.002201701,0.00008387252,0.003745065,0.0007450834],"genre_scores_gemma":[0.9333449,0.00001238386,0.06609435,0.00001787174,0.000150133,0.00004058232,0.000002845979,0.00002807532,0.0003088671],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8887542,"threshold_uncertainty_score":0.9777831,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003852608,0.0001777486,0.0002444822,0.00005554331,0.0001815493,0.0002575307,0.002446654,0.0000754629,0.000006109191],"category_scores_gemma":[0.001372259,0.0001167467,0.000165078,0.0005039271,0.0000726099,0.0002438469,0.0005337935,0.0002092069,0.00002283135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002317771,"about_ca_system_score_gemma":0.00002948138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002404184,"about_ca_topic_score_gemma":0.00000120368,"domain_scores_codex":[0.998558,0.00001503471,0.000264578,0.0003945076,0.0004489498,0.000318948],"domain_scores_gemma":[0.9990062,0.0000908378,0.0002543378,0.0003498349,0.0001905109,0.0001082964],"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.0001409452,0.0003859588,0.03802407,0.0006792086,0.0003354433,0.00001364656,0.01222689,0.0001145132,0.02365625,0.2788536,0.007289324,0.6382802],"study_design_scores_gemma":[0.01059076,0.005131844,0.01189049,0.0005015561,0.0004220829,0.0003170192,0.007368153,0.05472303,0.4048387,0.07249786,0.4279886,0.003729923],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5053773,0.01049756,0.2491998,0.1602795,0.007328786,0.0104367,0.00002807163,0.01015939,0.04669287],"genre_scores_gemma":[0.9756802,0.000004226191,0.02310353,0.0006800669,0.0003126099,0.0000464848,6.155369e-7,0.000015641,0.0001566042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6345502,"threshold_uncertainty_score":0.4760792,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177062,0.0001854526,0.0002553696,0.0001448613,0.0001430003,0.0002616881,0.002326185,0.00008976184,5.766811e-7],"category_scores_gemma":[0.000782813,0.0001306656,0.0001268716,0.001045253,0.0001036196,0.0002614638,0.0004833163,0.0001793378,0.000008403601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004769667,"about_ca_system_score_gemma":0.00003461768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006932908,"about_ca_topic_score_gemma":0.00002076749,"domain_scores_codex":[0.9984026,0.00002470421,0.0003582684,0.0004186256,0.0003683074,0.0004274849],"domain_scores_gemma":[0.9987268,0.0001564484,0.0003264576,0.0005439572,0.0001921083,0.00005419005],"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.00001255697,0.0002567278,0.006033503,0.0003190574,0.00002574656,0.000001308862,0.004458415,0.000004319172,0.001684977,0.1727521,0.0003837732,0.8140675],"study_design_scores_gemma":[0.01180534,0.007659779,0.09663334,0.001250883,0.000217606,0.00008798114,0.03919343,0.05010536,0.2959791,0.3688973,0.1239021,0.004267857],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9476463,0.0009755882,0.02283281,0.009042428,0.002486589,0.01172164,0.0000142749,0.003034411,0.002245953],"genre_scores_gemma":[0.9842587,0.000007727811,0.01480087,0.00002724642,0.00006369574,0.0006237514,0.00001132651,0.00001699862,0.0001896778],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8097997,"threshold_uncertainty_score":0.532839,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006592473,0.0001231612,0.0001515284,0.00009559289,0.0001231863,0.0000982751,0.003185919,0.0000457869,0.00001291035],"category_scores_gemma":[0.002714488,0.00007124585,0.00009330002,0.0006426664,0.0002984416,0.0001318503,0.001014366,0.0001899889,0.00001494357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001774036,"about_ca_system_score_gemma":0.00002202821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008378899,"about_ca_topic_score_gemma":3.135799e-7,"domain_scores_codex":[0.9987943,0.0000157109,0.0002329411,0.0002650514,0.0004622605,0.0002297483],"domain_scores_gemma":[0.9980921,0.0006479985,0.0002899284,0.0007518021,0.0001869734,0.00003120339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001232311,0.00009409587,0.001000141,0.0000983053,0.00003743865,7.117403e-7,0.01433881,0.00001056528,0.02187053,0.9307035,0.003466088,0.02836749],"study_design_scores_gemma":[0.0003941184,0.0002859853,0.004357474,0.0005010834,0.00001499579,0.000007990785,0.02005293,0.0001871849,0.8741045,0.09770289,0.00209599,0.000294874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9911826,0.00003308581,0.00007476861,0.005528062,0.00006827524,0.0004751768,0.000005348529,0.0002189319,0.002413781],"genre_scores_gemma":[0.9962618,0.000002576909,0.003331293,0.0001520564,0.0000187066,0.0000891726,3.483968e-7,0.00001021748,0.0001337769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8522339,"threshold_uncertainty_score":0.5920283,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007208063,0.0002990261,0.0002925531,0.0001891726,0.000630756,0.0003679263,0.003607191,0.00005432261,0.00002121242],"category_scores_gemma":[0.0001265888,0.0002368221,0.0002301289,0.0008073768,0.00007905837,0.0001892016,0.002296138,0.0003320298,0.00000247362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001932234,"about_ca_system_score_gemma":0.00006630026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001999224,"about_ca_topic_score_gemma":0.000005014244,"domain_scores_codex":[0.9974151,0.00004028147,0.0004233157,0.0006450452,0.000855055,0.0006211716],"domain_scores_gemma":[0.9983886,0.00007711175,0.0003990481,0.0008499828,0.0001692426,0.0001160097],"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.0002257088,0.004653183,0.04387407,0.0006389694,0.0004231126,0.00006269634,0.03592664,0.0103271,0.2069476,0.01479154,0.007820339,0.6743091],"study_design_scores_gemma":[0.004064694,0.004399686,0.003919124,0.0008657873,0.0001757596,0.000277175,0.0148361,0.02599984,0.9001467,0.001794645,0.04125415,0.002266363],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9924513,0.0004404559,0.000256521,0.004052675,0.0004068555,0.001344859,0.000005638249,0.0006484939,0.0003932682],"genre_scores_gemma":[0.9292551,0.000001887667,0.06928625,0.0005091505,0.00008759586,0.0007205991,0.000007524472,0.00003636927,0.00009556567],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6931991,"threshold_uncertainty_score":0.9657327,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008302887,0.0002110803,0.0003551224,0.00009194944,0.00009530914,0.0001431905,0.002219977,0.0001120518,0.000003499741],"category_scores_gemma":[0.0007341281,0.0001427061,0.0001236852,0.0005031181,0.0000904585,0.0003602297,0.001277317,0.0001700237,0.00001533077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003655168,"about_ca_system_score_gemma":0.00003342461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000272315,"about_ca_topic_score_gemma":0.000004083534,"domain_scores_codex":[0.9982008,0.00002092819,0.0003846867,0.000488379,0.0005322757,0.0003729317],"domain_scores_gemma":[0.998351,0.0001410012,0.0004510977,0.0006995155,0.0002737187,0.0000837006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008221716,0.0007245984,0.1501903,0.0019396,0.0001728252,0.000002630992,0.004102925,0.000008134571,0.3975703,0.248201,0.0006503573,0.196355],"study_design_scores_gemma":[0.0008279479,0.0006496686,0.009524824,0.0001413977,0.0000352163,0.00002030127,0.0006460502,0.0002234548,0.9655091,0.01933471,0.002734607,0.0003526924],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9951662,0.0007098542,0.0001514416,0.0003293307,0.0002344433,0.0009848517,0.00000123685,0.000125243,0.002297371],"genre_scores_gemma":[0.9962416,0.00001894011,0.003381929,0.00007662467,0.00003608569,0.00004596707,5.313595e-7,0.00001621865,0.000182128],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5679387,"threshold_uncertainty_score":0.5819386,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003327897,0.0002064891,0.0002445861,0.00009550452,0.00008530119,0.0002515684,0.004188361,0.00008275209,0.00001107812],"category_scores_gemma":[0.0007198129,0.0001435507,0.00008425776,0.0005136628,0.00004492169,0.0001492132,0.001591799,0.0002352942,0.000104586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003849489,"about_ca_system_score_gemma":0.00003901453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002662461,"about_ca_topic_score_gemma":0.000002870844,"domain_scores_codex":[0.9982812,0.00001004472,0.0002629141,0.000548008,0.0005247632,0.0003730849],"domain_scores_gemma":[0.998444,0.0001424417,0.0001827759,0.0008809248,0.0002373574,0.0001124675],"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.00008108623,0.0006666022,0.01138802,0.0002161591,0.0001337193,0.000004759341,0.01812307,0.001846179,0.07152527,0.1527429,0.001763242,0.741509],"study_design_scores_gemma":[0.002336217,0.002065317,0.04147554,0.002877325,0.0001087824,0.00002172216,0.004573043,0.07658753,0.8046674,0.05857511,0.004189826,0.002522215],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9694955,0.00006705768,0.02603428,0.002861861,0.0003652665,0.0004414915,0.00001795245,0.000246655,0.0004699156],"genre_scores_gemma":[0.8140855,0.000001751877,0.185196,0.0003323484,0.00006493243,0.00002825057,0.000001087534,0.00001317023,0.0002769401],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7389868,"threshold_uncertainty_score":0.7783086,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005125,0.0002188973,0.0002643624,0.0002435796,0.000222961,0.0002298214,0.002921565,0.0001034521,0.000003313603],"category_scores_gemma":[0.0008349644,0.0001472357,0.0001581592,0.001658279,0.00007864784,0.0003465013,0.001160157,0.000169111,0.00008598305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000312651,"about_ca_system_score_gemma":0.00002661061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006846055,"about_ca_topic_score_gemma":0.000001625873,"domain_scores_codex":[0.9981866,0.00002440123,0.0003133699,0.0004648371,0.0005536149,0.0004572103],"domain_scores_gemma":[0.9984832,0.00009279674,0.0003262104,0.0007562063,0.0002656527,0.00007591542],"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.00001460692,0.0001229818,0.001308462,0.0001828334,0.00008527425,0.000008998447,0.003075272,0.000006983065,0.05940446,0.6627127,0.002243907,0.2708335],"study_design_scores_gemma":[0.00145492,0.00107203,0.00839379,0.0001858662,0.0001680703,0.0001315375,0.006013541,0.003749072,0.357953,0.5908676,0.0286076,0.001402957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8387047,0.004664959,0.1005377,0.01319865,0.005578169,0.005913936,0.000007043716,0.01083652,0.02055831],"genre_scores_gemma":[0.9857851,0.00001740862,0.01241848,0.0002331608,0.0001211653,0.00007553163,0.000002547851,0.00003146922,0.001315125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2985485,"threshold_uncertainty_score":0.6004099,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001108518,0.0001712983,0.0002497601,0.0001216529,0.00007902426,0.0002589635,0.003006477,0.00007368527,0.000001582105],"category_scores_gemma":[0.001806162,0.0001120301,0.0001511236,0.0008668764,0.0002377783,0.0004820895,0.000978082,0.0002382238,0.000003416202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003066151,"about_ca_system_score_gemma":0.00003166182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000196179,"about_ca_topic_score_gemma":6.568604e-7,"domain_scores_codex":[0.9985867,0.00003420415,0.0003524969,0.0003324233,0.0004311438,0.0002629955],"domain_scores_gemma":[0.9985743,0.0001880632,0.0002722108,0.0007462598,0.0001793773,0.00003980243],"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.0000237727,0.0001681599,0.00130234,0.0009323073,0.000055997,9.696673e-7,0.004187643,0.00000183332,0.02252852,0.1218268,0.0001045864,0.848867],"study_design_scores_gemma":[0.0003679588,0.001074541,0.003311825,0.001484235,0.00007237725,0.00004372971,0.001525388,0.005744485,0.931251,0.04778631,0.006882812,0.0004553363],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9844202,0.0009937945,0.008555374,0.00191294,0.0004225178,0.001408,0.000004965251,0.0008159463,0.001466222],"genre_scores_gemma":[0.5968891,0.000005759655,0.4029076,0.0000186718,0.0000186095,0.00008718736,6.556047e-7,0.00001169814,0.00006081835],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9087225,"threshold_uncertainty_score":0.5586833,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318282,0.0001492625,0.0001813107,0.0001473354,0.0002398395,0.0001189968,0.001079886,0.00006818861,4.440079e-7],"category_scores_gemma":[0.0009723447,0.0001008352,0.0001011842,0.0005911869,0.00008235827,0.0001323749,0.0006078699,0.0001525391,2.807992e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001321129,"about_ca_system_score_gemma":0.00003328277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009293933,"about_ca_topic_score_gemma":3.672868e-7,"domain_scores_codex":[0.9989902,0.000007317168,0.0002341514,0.0003430264,0.0002048073,0.000220527],"domain_scores_gemma":[0.999059,0.0001762441,0.0001913364,0.0003073172,0.0002304419,0.00003563945],"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.000111175,0.0006877402,0.007128832,0.0009816834,0.0002956479,0.000001410571,0.002537259,0.05935533,0.003429341,0.08382702,0.001498408,0.8401461],"study_design_scores_gemma":[0.0003757441,0.0002611415,0.001434253,0.0002431907,0.00003456674,0.000004097704,0.0001244827,0.9860126,0.006180353,0.003762833,0.001427172,0.0001395769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6150875,0.0007828641,0.3652014,0.01437587,0.000483693,0.002669695,0.000009889668,0.0008077231,0.0005813743],"genre_scores_gemma":[0.2831302,0.000005933858,0.716466,0.0001178164,0.00007152031,0.00006476825,0.000002727573,0.000009412271,0.0001315965],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9266573,"threshold_uncertainty_score":0.4111941,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004508563,0.0001568977,0.0003097265,0.00006102821,0.00004807149,0.00005345429,0.00277537,0.00006506277,0.000003255595],"category_scores_gemma":[0.003711176,0.0001023172,0.00009227968,0.0006907024,0.0001154618,0.0001897,0.0009105334,0.0001322329,0.000002571795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001714235,"about_ca_system_score_gemma":0.00006313257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005170623,"about_ca_topic_score_gemma":0.000001959105,"domain_scores_codex":[0.9984076,0.00001986098,0.0003756307,0.0002841663,0.0006959687,0.0002167735],"domain_scores_gemma":[0.997874,0.00007766576,0.0006374493,0.000453076,0.0008859127,0.00007189378],"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.0001703742,0.0006264715,0.0348251,0.003388865,0.0003559765,0.000004245024,0.05407717,0.0000432706,0.2362971,0.275061,0.001735662,0.3934148],"study_design_scores_gemma":[0.0004733333,0.0008598239,0.00111209,0.0002635612,0.00004865164,0.000003232575,0.002204472,0.0001697136,0.9859775,0.005071323,0.003580501,0.0002357464],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9639356,0.004970482,0.01028099,0.004876363,0.0006731555,0.003409893,0.00001094764,0.0006768794,0.01116571],"genre_scores_gemma":[0.9906023,0.00001012457,0.00922819,0.00004194255,0.00004385976,0.00002823317,3.547361e-7,0.00001032665,0.00003471508],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7496805,"threshold_uncertainty_score":0.5157374,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003832025,0.0001751321,0.0001939436,0.00006486061,0.0001845333,0.0002556441,0.001226126,0.00004809421,0.000004094885],"category_scores_gemma":[0.0007044028,0.0001081909,0.00007697839,0.0003685145,0.000405041,0.0006702337,0.00038564,0.0001754735,0.000002746149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004383339,"about_ca_system_score_gemma":0.00006666704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002932287,"about_ca_topic_score_gemma":0.000006756575,"domain_scores_codex":[0.9987948,0.000008107409,0.0002279034,0.0004154269,0.0002890446,0.0002647038],"domain_scores_gemma":[0.9989081,0.0001436529,0.0001586661,0.0005237617,0.0002204484,0.00004536942],"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.00005761675,0.0000495136,0.0004405454,0.0009240715,0.00004953693,0.000002049355,0.002425178,0.000001321588,0.01808544,0.8486565,0.0008476678,0.1284605],"study_design_scores_gemma":[0.001740722,0.002694215,0.004792343,0.006722399,0.0001732026,0.0003445484,0.01857854,0.004660947,0.4074928,0.04059931,0.5103496,0.001851443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3770161,0.002201961,0.5948527,0.01402231,0.001273996,0.004585952,0.000304108,0.002544549,0.003198298],"genre_scores_gemma":[0.6245086,0.000008444065,0.3750623,0.0000613572,0.00005598143,0.0001501155,0.000006709573,0.00001515298,0.0001313853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8080572,"threshold_uncertainty_score":0.4411899,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004778317,0.0002331839,0.0002377132,0.0002154259,0.0001967873,0.0003199031,0.00412495,0.00008407585,0.000002160084],"category_scores_gemma":[0.001312234,0.0001401006,0.00008997757,0.001453722,0.0001320408,0.00038598,0.001410395,0.0002801206,0.00001340046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003531444,"about_ca_system_score_gemma":0.00003869392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001679666,"about_ca_topic_score_gemma":0.00000280717,"domain_scores_codex":[0.9982722,0.0000109882,0.0002416494,0.0004592926,0.0005518378,0.0004639868],"domain_scores_gemma":[0.998533,0.000140426,0.0002898265,0.0007762285,0.0001943193,0.00006619818],"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.0001533073,0.000275378,0.01262414,0.00121018,0.0001615345,0.0001257298,0.01104168,0.00001052768,0.0925387,0.09489913,0.005023339,0.7819363],"study_design_scores_gemma":[0.001341958,0.001426959,0.003944072,0.002757819,0.0001176132,0.0002416759,0.002402892,0.002173569,0.8996544,0.0793153,0.005159987,0.001463776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9778507,0.0009065714,0.002577161,0.008150402,0.0002819442,0.00145645,0.000005236654,0.006847958,0.001923613],"genre_scores_gemma":[0.7445827,0.000004430629,0.2546842,0.0001832163,0.00004848413,0.0000790569,9.105966e-7,0.00002804052,0.0003890324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8071157,"threshold_uncertainty_score":0.7665251,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181769,0.000142863,0.0001717955,0.000058037,0.0001035111,0.0004118473,0.002400987,0.00005595168,0.00000275719],"category_scores_gemma":[0.0005170365,0.00008933767,0.0001383197,0.0004074054,0.00007666776,0.0003314125,0.0004340483,0.0001245533,0.000007119602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002095003,"about_ca_system_score_gemma":0.00003514593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001543357,"about_ca_topic_score_gemma":0.000001042995,"domain_scores_codex":[0.9988235,0.000004918548,0.0002334845,0.0003546071,0.000296178,0.0002872686],"domain_scores_gemma":[0.9992014,0.0001276343,0.0001137099,0.0003570908,0.0001555494,0.00004467082],"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.00001393685,0.0001016535,0.001258366,0.001388592,0.00008332788,0.000003927013,0.00288145,0.000003285266,0.00726796,0.4381611,0.02319887,0.5256375],"study_design_scores_gemma":[0.00138216,0.001663262,0.001663143,0.006252382,0.0001613555,0.0001264564,0.004098448,0.0116428,0.1512585,0.04837365,0.771889,0.001488786],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8488408,0.03335357,0.03921856,0.03875957,0.01133556,0.00710838,0.0003620638,0.004312943,0.01670861],"genre_scores_gemma":[0.9833193,0.00001185829,0.01550713,0.00007418617,0.0001572059,0.0001345995,0.000001636961,0.00001276398,0.0007813046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7486902,"threshold_uncertainty_score":0.4461671,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004541996,0.0001568232,0.0002401872,0.0000472775,0.0001389944,0.0002291819,0.001348592,0.00007358189,4.766234e-7],"category_scores_gemma":[0.001871277,0.00009977695,0.00008376793,0.0005130012,0.0000472935,0.0001841181,0.0004926527,0.00009250634,0.000004250998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002269971,"about_ca_system_score_gemma":0.00002115846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001795839,"about_ca_topic_score_gemma":6.686867e-7,"domain_scores_codex":[0.998951,0.0000185645,0.0002172158,0.0003365827,0.0002417343,0.0002348885],"domain_scores_gemma":[0.9990717,0.00011914,0.0002413027,0.0002702903,0.000225424,0.00007213945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001870405,0.00009012076,0.01320951,0.004727385,0.0001571652,0.000004151937,0.01163972,0.00000518293,0.01170713,0.7097665,0.001791978,0.2467141],"study_design_scores_gemma":[0.008800692,0.01922251,0.00386358,0.00121525,0.0007086055,0.0003284339,0.01393275,0.01609429,0.7840006,0.02113455,0.1276196,0.003079215],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8249359,0.006631194,0.09730759,0.0218641,0.004516665,0.01996532,0.00001570351,0.006978842,0.01778465],"genre_scores_gemma":[0.9913112,0.00000326038,0.008195115,0.000157236,0.0001668207,0.0001042222,0.00000143578,0.00001701757,0.00004367876],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7722934,"threshold_uncertainty_score":0.4068786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}