{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":23,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":23,"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":"2e63c7f45fe9","filters":{"venue":"ACM Transactions on Programming Languages and Systems"}},"results":[{"id":"W1965418329","doi":"10.1145/1018203.1018208","title":"A semantics for advice and dynamic join points in aspect-oriented programming","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":229,"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":"Computer science; Join (topology); Programming language; Semantics (computer science); Advice (programming); Aspect-oriented programming; Denotational semantics; Correctness; Set (abstract data type); Operational semantics; Software; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02060817561174227,"gpt":0.3099701202073812,"spread":0.2893619445956389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498973,0.0001901434,0.0002603805,0.0002011706,0.0001441443,0.0001660381,0.0002467427,0.00009255209,1.684841e-7],"category_scores_gemma":[0.0002245158,0.000175853,0.00004569481,0.0003582259,0.00004788463,0.0002536381,0.00002017112,0.0001881876,6.768105e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007405613,"about_ca_system_score_gemma":0.0000219415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001459898,"about_ca_topic_score_gemma":0.0001192692,"domain_scores_codex":[0.9987426,0.00005835789,0.0002680836,0.0004244999,0.0001417953,0.000364698],"domain_scores_gemma":[0.9989678,0.0004251668,0.00007048214,0.0004123781,0.00004602898,0.00007817293],"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.00002997521,0.0001833673,0.0001485805,0.0006364354,0.00006304705,0.00006691548,0.005885843,0.02388071,0.0003957618,0.005528613,0.000001013215,0.9631798],"study_design_scores_gemma":[0.06387535,0.02045764,0.01769653,0.02131351,0.001064006,0.007785505,0.1432492,0.5337501,0.01335331,0.08436163,0.07574639,0.01734689],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02542601,0.001457705,0.9711779,0.0003612402,0.0002529566,0.0007596848,0.000004757409,0.0005568873,0.00000286591],"genre_scores_gemma":[0.3838,0.00004918153,0.6158635,0.00001493544,0.00001128211,0.0001967526,0.000002227932,0.00001627684,0.00004588815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9458328,"threshold_uncertainty_score":0.7171079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123691799","doi":"10.1145/2629609","title":"Foundations of Typestate-Oriented Programming","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":77,"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":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Desarrollo Científico y Tecnológico; Computing Research Association; National Science Foundation","keywords":"Computer science; Programming language; Modular design; Object (grammar); Class (philosophy); State (computer science); Object-oriented programming; Type safety; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01979513296798275,"gpt":0.2803165803818746,"spread":0.2605214474138918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726963,0.0002166513,0.0003294018,0.0001981554,0.0002968634,0.0003076692,0.0005114001,0.000113459,0.000005163422],"category_scores_gemma":[0.00008318336,0.0001787211,0.0001089695,0.0005103781,0.0001007649,0.0002759596,0.00002475727,0.0001737335,0.00001836457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000278922,"about_ca_system_score_gemma":0.00003340123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000622039,"about_ca_topic_score_gemma":0.00007074884,"domain_scores_codex":[0.9982131,0.0001680997,0.0004541888,0.0004470929,0.0003300049,0.0003875569],"domain_scores_gemma":[0.9984293,0.0002130546,0.00021238,0.0008473937,0.0001557244,0.0001421714],"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.000008168536,0.0001902888,0.0004853354,0.0002174001,0.00007564962,0.000006020538,0.001951076,0.0001149607,0.0001261022,0.1362906,0.00001469215,0.8605196],"study_design_scores_gemma":[0.003799421,0.004275454,0.001479519,0.0003492172,0.0002946673,0.0005069131,0.0124675,0.03630583,0.002373626,0.005204507,0.9308062,0.002137192],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005346737,0.0004827202,0.9915884,0.0001522992,0.000647174,0.0006293738,0.000002198983,0.0003740065,0.0007770665],"genre_scores_gemma":[0.9744326,0.00002085159,0.02461024,0.00002274461,0.0000695748,0.0001599696,0.0000095375,0.00002023488,0.0006542323],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9690859,"threshold_uncertainty_score":0.7288035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162762034","doi":"10.1145/586088.586090","title":"Practical extraction techniques for Java","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Java; Modular design; Programming language; Class (philosophy); Software; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04144992129324543,"gpt":0.3505027852811163,"spread":0.3090528639878709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000267633,0.0001611659,0.0001723385,0.0001658375,0.0002847791,0.000277402,0.0002446838,0.0001270513,0.000008345956],"category_scores_gemma":[0.00008885359,0.0001468698,0.00007610952,0.0002210426,0.00003874596,0.0006049632,0.000009805705,0.0002003337,0.000006810373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004803183,"about_ca_system_score_gemma":0.000007262744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003709189,"about_ca_topic_score_gemma":0.000006594526,"domain_scores_codex":[0.9988558,0.00005544493,0.0002495987,0.0003965636,0.0001818494,0.0002607046],"domain_scores_gemma":[0.9988554,0.000293329,0.0001077941,0.000566402,0.00009046948,0.00008660395],"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.000007779856,0.0001232218,0.000002915241,0.00005721821,0.00001907912,0.00001117528,0.0002528455,0.000009823278,0.0008655732,0.003244343,0.0003181121,0.9950879],"study_design_scores_gemma":[0.001114497,0.003492662,0.00003390023,0.0003174429,0.0001107793,0.002271049,0.003410527,0.0630727,0.1087846,0.002091925,0.8138162,0.001483714],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001433773,0.0003146399,0.9956425,0.001088555,0.0002363892,0.0008341409,0.000005200799,0.001502844,0.000232382],"genre_scores_gemma":[0.4137149,0.0001194283,0.5844139,0.0000819737,0.00006880611,0.0008020287,0.000001322422,0.00001993817,0.0007775922],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9936042,"threshold_uncertainty_score":0.5989178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163420823","doi":"10.1145/641888.641891","title":"PolyTOIL","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Williams College; National Science Foundation","keywords":"Computer science; Programming language; Type safety; Subtyping; Type theory; Type (biology); Operational semantics; Semantics (computer science); Model checking; Functional programming; Modular design; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02191948800640703,"gpt":0.2704776963579844,"spread":0.2485582083515773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005076121,0.0002078632,0.0002437958,0.0001319543,0.0003265328,0.0005386904,0.00046783,0.000116898,0.00000994263],"category_scores_gemma":[0.00004330955,0.0001659312,0.00009274626,0.0003387006,0.00005101473,0.0002383101,0.00001028857,0.0001811321,0.00004717202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002950974,"about_ca_system_score_gemma":0.00003301507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003399673,"about_ca_topic_score_gemma":0.00003138729,"domain_scores_codex":[0.9984201,0.00016308,0.0002826514,0.0004501705,0.0002702267,0.0004138214],"domain_scores_gemma":[0.9987562,0.0001111325,0.0000899357,0.0008280783,0.00005428443,0.0001603839],"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.000005251734,0.0002017464,0.0004514564,0.00013942,0.00009379955,0.00006800264,0.002072303,0.00006960734,0.0001652517,0.3379244,0.00007683888,0.6587319],"study_design_scores_gemma":[0.002685979,0.001655816,0.0004551756,0.0001115563,0.0001206946,0.001858776,0.01187157,0.003130181,0.003163708,0.007461654,0.9655063,0.001978541],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002732314,0.003354636,0.9882127,0.0001770101,0.0009952445,0.0004876071,0.000001389451,0.0005107995,0.003528276],"genre_scores_gemma":[0.9893525,0.00004294119,0.007855724,0.00006454923,0.00005187115,0.0001243519,0.00000154112,0.00001760415,0.002488957],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9866201,"threshold_uncertainty_score":0.6766477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2904756193","doi":"10.1145/3229061","title":"Type-Driven Gradual Security with References","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":45,"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":"Computer science; Programming language; Static analysis; Code refactoring; Simple (philosophy); Type (biology); Type safety; Type inference; Code (set theory); Theoretical computer science; Artificial intelligence; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.03285374123396055,"gpt":0.3009539253309454,"spread":0.2681001840969849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001961818,0.000117176,0.0001288374,0.00007814665,0.0003693798,0.0003401041,0.0004240183,0.00005925261,0.000005896615],"category_scores_gemma":[0.00001458217,0.00008967645,0.00002320669,0.0003483213,0.0001001215,0.0001916739,0.00001300385,0.0001399617,0.00001722051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001481306,"about_ca_system_score_gemma":0.00002803488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002463072,"about_ca_topic_score_gemma":0.00008810745,"domain_scores_codex":[0.9990429,0.00007173103,0.000156283,0.0003284858,0.0001968027,0.0002038206],"domain_scores_gemma":[0.9991377,0.0000976254,0.0000685247,0.0004987299,0.0001209148,0.00007648346],"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.00008364217,0.0004105229,0.001918726,0.0002502719,0.0002305853,0.0000438041,0.03271397,0.0002238478,0.0002579484,0.05837304,0.0002403135,0.9052534],"study_design_scores_gemma":[0.007438768,0.02171375,0.00945573,0.003365121,0.0004441857,0.003152572,0.07668066,0.4284731,0.01292885,0.007267253,0.4226505,0.006429603],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2294236,0.0005475999,0.766937,0.0006402492,0.0007695035,0.000391731,0.000004005492,0.000554927,0.0007314304],"genre_scores_gemma":[0.9817774,0.00001929803,0.01790486,0.00004983889,0.0001107162,0.00002209184,0.000001960648,0.000007038209,0.0001067874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8988237,"threshold_uncertainty_score":0.3656899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027222319","doi":"10.1145/1286821.1286823","title":"Encapsulating objects with confined types","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University; Purdue University; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Computer science; Code refactoring; Programming language; Compiler; Java; Object-oriented programming; Encapsulation (networking); Source code; Software; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0178246464309781,"gpt":0.2677947856153134,"spread":0.2499701391843354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007024878,0.0002098233,0.0002502683,0.0001490175,0.0003158993,0.0004238875,0.0003921582,0.0001067898,0.000004672699],"category_scores_gemma":[0.00002643619,0.0001506641,0.0000546278,0.0003828101,0.00006095572,0.0002124321,0.0000131268,0.0001847705,0.00001487814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002833668,"about_ca_system_score_gemma":0.00003093197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006608827,"about_ca_topic_score_gemma":0.0002424123,"domain_scores_codex":[0.998466,0.00006095835,0.0002984394,0.000422272,0.00030323,0.0004491541],"domain_scores_gemma":[0.9988493,0.0001901191,0.0001278029,0.000595484,0.00008832766,0.0001489936],"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.00003830076,0.0001630358,0.001136998,0.0002305973,0.0001571749,0.000204238,0.006455296,0.0001990727,0.0007016044,0.04985682,0.00001005609,0.9408468],"study_design_scores_gemma":[0.03124261,0.03105627,0.02816837,0.002688061,0.001557648,0.01589297,0.2345867,0.07172219,0.04819127,0.01068554,0.5063721,0.01783627],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01523099,0.001192838,0.9797363,0.00008801919,0.0004172364,0.0005639741,9.167666e-7,0.0004938997,0.002275816],"genre_scores_gemma":[0.9852056,0.000009493856,0.01370367,0.00004243278,0.00009225337,0.00004817908,0.000002705691,0.00001837193,0.000877302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9699746,"threshold_uncertainty_score":0.6143903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984005572","doi":"10.1145/1290520.1290522","title":"<i>Forma</i>","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Locality; Pointer (user interface); Data structure; Partition (number theory); Alias; Parallel computing; Locality of reference; Theoretical computer science; Algorithm; Computer hardware; Programming language; Cache; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.01628096330478509,"gpt":0.2897348647963653,"spread":0.2734539014915802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247665,0.0001078303,0.0001166801,0.0001273855,0.0002165485,0.0002327671,0.0003692688,0.00006354822,0.000001431196],"category_scores_gemma":[0.00001269536,0.00009203891,0.0000412622,0.0002498833,0.00002481255,0.0001732205,0.00001228768,0.0001226308,0.000006590344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001680507,"about_ca_system_score_gemma":0.000009643029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009944047,"about_ca_topic_score_gemma":0.000008602213,"domain_scores_codex":[0.9991381,0.00002890851,0.0002035984,0.0002252236,0.000157383,0.0002467788],"domain_scores_gemma":[0.9992706,0.0001039767,0.00005646072,0.0004396944,0.00004202046,0.00008727976],"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.00000515985,0.00006042467,0.00008604125,0.00003153803,0.00001803582,0.00001915262,0.0008633716,0.0008535169,0.00006665309,0.00454232,0.0001072793,0.9933465],"study_design_scores_gemma":[0.004717891,0.004575758,0.002778812,0.001268684,0.0001480138,0.002352579,0.0112764,0.3958288,0.02865163,0.002547293,0.5413424,0.004511765],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002578352,0.0005725518,0.9944733,0.0001441351,0.0001756833,0.0001822607,8.72232e-7,0.0007328285,0.001140031],"genre_scores_gemma":[0.832467,0.00003891576,0.1667244,0.0001058996,0.00003538872,0.00001674065,0.000001375104,0.000008039722,0.0006023303],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9888347,"threshold_uncertainty_score":0.3753238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2465422497","doi":"10.1145/2983574","title":"The Truth, The Whole Truth, and Nothing But the Truth","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Machine Learning in Materials Science","field":"Materials 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":"McGill University; University of Waterloo; University of Alberta","funders":"","keywords":"Exposition (narrative); Abandonment (legal); Nothing; Computer science; Epistemology; Field (mathematics); Engineering ethics; Law; Philosophy; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01296327250097417,"gpt":0.2714709635762032,"spread":0.258507691075229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002247549,0.0002084088,0.0001997972,0.00003684262,0.001892935,0.001265654,0.0007610391,0.00007313794,0.0000357278],"category_scores_gemma":[0.0007939565,0.00007630036,0.00005677346,0.0001398432,0.0005801251,0.0001989835,0.00003715667,0.0001858633,0.00004245466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000248083,"about_ca_system_score_gemma":0.00002351808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000450398,"about_ca_topic_score_gemma":0.00002990677,"domain_scores_codex":[0.9980108,0.0004142072,0.0003322789,0.0004158269,0.0003832617,0.0004436332],"domain_scores_gemma":[0.9944264,0.004458048,0.0001695597,0.0008184157,0.00004557306,0.00008206346],"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.0001717184,0.0001017531,0.0002542226,0.0002171557,0.00008454998,0.0000262516,0.01953365,0.000686791,0.2532751,0.008900658,0.00009618331,0.716652],"study_design_scores_gemma":[0.00645628,0.002605447,0.009362948,0.002699312,0.0007822346,0.002857171,0.1620008,0.01201358,0.1021802,0.003026566,0.6922168,0.003798636],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9593797,0.002006982,0.02205568,0.01115116,0.00418985,0.0007347579,0.0000539769,0.0002759595,0.0001519816],"genre_scores_gemma":[0.9979886,0.00008786103,0.0005875983,0.00007411664,0.0001934676,0.0001620366,6.194471e-7,0.00002308968,0.0008826064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7128534,"threshold_uncertainty_score":0.9997711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048907983","doi":"10.1145/1152649.1152652","title":"Controlling garbage collection and heap growth to reduce the execution time of Java applications","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada); University of Toronto; York University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Garbage collection; Heap (data structure); Computer science; Manual memory management; Garbage; Memory leak; Java; Operating system; Memory footprint; Virtual machine; Database; Parallel computing; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.009267692778704437,"gpt":0.258289020544383,"spread":0.2490213277656785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003302184,0.00009777216,0.00014402,0.0001190397,0.0003397,0.0001736834,0.0002129927,0.00005055343,6.631734e-7],"category_scores_gemma":[0.00001374281,0.0000757064,0.00003312476,0.0003887835,0.00003872174,0.00008885862,0.00001121273,0.00007812267,0.000001608063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001947189,"about_ca_system_score_gemma":0.00001447135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006445773,"about_ca_topic_score_gemma":0.00001083579,"domain_scores_codex":[0.9991897,0.00007836936,0.0002313587,0.0002339327,0.0001302901,0.000136344],"domain_scores_gemma":[0.9993299,0.000140732,0.00008933563,0.0003065864,0.00009279075,0.00004068286],"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.0001769426,0.001082569,0.000720803,0.0006669512,0.0002947396,0.00001130278,0.01005952,0.08191403,0.0268424,0.06668013,0.002581641,0.808969],"study_design_scores_gemma":[0.003638217,0.00224165,0.003595492,0.0009426584,0.0002827439,0.0005308983,0.003908659,0.9016638,0.04322321,0.004129475,0.03396682,0.001876318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006000086,0.0007501767,0.9914381,0.0006088551,0.00004480453,0.0007091145,0.000003233138,0.000235789,0.0002098514],"genre_scores_gemma":[0.9510024,0.00004094658,0.04819572,0.00003522382,0.00003731639,0.00021655,0.000002979054,0.000007491716,0.0004613455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9450023,"threshold_uncertainty_score":0.3087218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3106677187","doi":"10.1145/3417516","title":"Obsidian","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":26,"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":"Center for Selective C-H Functionalization, National Science Foundation; U.S. Department of Defense","keywords":"Solidity; Computer science; State (computer science); Soundness; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02120712666427869,"gpt":0.2651548231398666,"spread":0.2439476964755879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001012445,0.00009746621,0.0001241863,0.00004998449,0.0001988092,0.0001395154,0.000479853,0.00008877612,0.000003824659],"category_scores_gemma":[0.00001599223,0.00008570638,0.00003765614,0.0002995039,0.00004220862,0.00008684099,0.00001563786,0.0001754879,0.00001999773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000805679,"about_ca_system_score_gemma":0.00001088827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007810167,"about_ca_topic_score_gemma":0.000008683019,"domain_scores_codex":[0.9992606,0.00002888792,0.0001393473,0.0002996465,0.00009944324,0.0001720645],"domain_scores_gemma":[0.999297,0.00005252108,0.00003748657,0.0004799426,0.00002400906,0.0001090137],"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.000003012087,0.00006901418,0.00009755226,0.00005458663,0.00003349361,0.00001825529,0.002176898,0.00005991745,0.0002461725,0.04806584,0.0000867099,0.9490885],"study_design_scores_gemma":[0.003171239,0.002581978,0.001422652,0.0002513872,0.0001517208,0.000624438,0.02090974,0.2001012,0.008881301,0.005572632,0.7537737,0.002557937],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01348217,0.001148024,0.9752176,0.008840114,0.0000884418,0.00032812,0.000004844188,0.0007099786,0.000180748],"genre_scores_gemma":[0.9783545,0.0000367696,0.02110162,0.000302679,0.00002934287,0.0001090478,0.000001237762,0.000006749049,0.00005805629],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9648723,"threshold_uncertainty_score":0.3495005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386711821","doi":"10.1145/3618003","title":"Capturing Types","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Simple (philosophy); Key (lock); Type safety; Data type; Variable (mathematics); Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02784691637161136,"gpt":0.2796709984320646,"spread":0.2518240820604532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004435998,0.0001719023,0.0002112557,0.0001990813,0.0003040367,0.0004898999,0.0004958299,0.00009797634,0.000004189973],"category_scores_gemma":[0.0000263114,0.0001375473,0.00007720778,0.000546989,0.00003843518,0.0002108593,0.00002594537,0.0001564364,0.0001492397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002286062,"about_ca_system_score_gemma":0.00001888569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005315369,"about_ca_topic_score_gemma":0.00004319666,"domain_scores_codex":[0.9986321,0.00007663314,0.0002358389,0.0004029283,0.0002542703,0.0003981702],"domain_scores_gemma":[0.9990011,0.0001246721,0.00006873081,0.0006436706,0.00004373198,0.0001180485],"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.00000644584,0.00008021825,0.0004492702,0.0002554629,0.0001164558,0.0001468055,0.004548196,0.0004592204,0.0001800659,0.05742188,0.0001842854,0.9361517],"study_design_scores_gemma":[0.004291365,0.002459965,0.004378091,0.0004128772,0.0002733115,0.001553341,0.03526106,0.07105193,0.003306933,0.01416759,0.8586832,0.004160315],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02102278,0.002998214,0.9669988,0.0008789623,0.00220519,0.0009742056,0.000004385496,0.003002324,0.001915182],"genre_scores_gemma":[0.9950554,0.00005932702,0.001862337,0.00003219111,0.000101997,0.0001333886,0.000004495582,0.00001825482,0.002732595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9740326,"threshold_uncertainty_score":0.5609015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170181173","doi":"10.1145/2220365.2220366","title":"Partially Evaluating Finite-State Runtime Monitors Ahead of Time","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"Bundesministerium für Bildung und Forschung; University of Oxford","keywords":"Computer science; Runtime verification; AspectJ; Compile time; State (computer science); Property (philosophy); Java; Runtime system; Compiler; Programming language; Finite-state machine; Implementation; Set (abstract data type); Static analysis; Distributed computing; Software; Formal verification; Aspect-oriented programming","retraction":null,"screen_n_in":null,"score":{"opus":0.03542469374141972,"gpt":0.3097570689431473,"spread":0.2743323752017275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247202,0.0002306869,0.0003625585,0.0001566178,0.0002424015,0.0002413201,0.0004955225,0.0001077902,0.00001186405],"category_scores_gemma":[0.00008062423,0.0001874563,0.0001202576,0.0003584135,0.0000688872,0.0004178346,0.00002762586,0.0001739749,0.00006755453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002922067,"about_ca_system_score_gemma":0.00003479248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006479567,"about_ca_topic_score_gemma":0.00001500597,"domain_scores_codex":[0.9979573,0.0002315711,0.0005010418,0.0003383783,0.0004287814,0.000542947],"domain_scores_gemma":[0.9984225,0.0003291749,0.0002372373,0.0007136075,0.0001102698,0.0001871876],"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.00002744621,0.0004780462,0.003603838,0.0003851549,0.0002267741,0.00002115697,0.010487,0.001707817,0.00154226,0.003638042,0.00003291258,0.9778495],"study_design_scores_gemma":[0.02018468,0.02328304,0.01895981,0.002593957,0.002409859,0.003092232,0.04445343,0.583569,0.06575463,0.007182319,0.2139406,0.01457639],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08802328,0.00417046,0.9042601,0.0001109897,0.001295662,0.001094135,0.000007550841,0.0004897472,0.000548052],"genre_scores_gemma":[0.9906183,0.00002441335,0.007911225,0.00001549938,0.0001304757,0.00012025,0.000004174067,0.00002185309,0.001153838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9632732,"threshold_uncertainty_score":0.7644245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140249069","doi":"10.1145/1108970.1108975","title":"Implicit-signal monitors","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","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 Waterloo","funders":"","keywords":"Computer science; SIGNAL (programming language); POSIX Threads; Synchronization (alternating current); Real-time computing; Bottleneck; Concurrency; Embedded system; Distributed computing; Programming language; Thread (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.01965813410887789,"gpt":0.2791380623098197,"spread":0.2594799282009418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004140719,0.0002381435,0.000281462,0.0001645408,0.0003598551,0.0006062355,0.0006398207,0.0001349448,0.00001055445],"category_scores_gemma":[0.00001235371,0.0001908234,0.0001198462,0.0003079812,0.00005286746,0.000363685,0.00002166267,0.0002181847,0.00006857212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004996969,"about_ca_system_score_gemma":0.00002656542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006194268,"about_ca_topic_score_gemma":0.00004196781,"domain_scores_codex":[0.9982815,0.0001028342,0.000347007,0.0004876114,0.00031748,0.0004635106],"domain_scores_gemma":[0.9987841,0.0001245262,0.0001085845,0.0007333926,0.00006445,0.0001849157],"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.000005253368,0.0001187455,0.000284447,0.00005932312,0.00005933951,0.00001943103,0.00142442,0.0001907684,0.000133597,0.01974919,0.00006442341,0.9778911],"study_design_scores_gemma":[0.003376924,0.002845374,0.001673899,0.000182896,0.0001965817,0.001745511,0.01192573,0.02866474,0.004541893,0.002485714,0.939587,0.002773737],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009362036,0.002657581,0.984415,0.0005788262,0.0006601828,0.000642012,0.00000274768,0.0007078867,0.0009737252],"genre_scores_gemma":[0.9881545,0.00003291416,0.009952323,0.00008467434,0.000291059,0.0001581944,0.000002639789,0.0000205062,0.001303237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9787924,"threshold_uncertainty_score":0.778155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3211705538","doi":"10.1145/3477082","title":"TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Distributed systems and fault tolerance","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":"Horizon 2020; Engineering and Physical Sciences Research Council; European Commission; UK Research and Innovation","keywords":"Liveness; Computer science; Blocking (statistics); Correctness; Separation logic; Abstraction; Programming language; Implementation; Mutual exclusion; Concurrency; Theoretical computer science; Model checking; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01933573393885135,"gpt":0.2976680095504109,"spread":0.2783322756115595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002639228,0.0001438194,0.0002610076,0.00005810983,0.0001929366,0.0002542898,0.0002493289,0.00007428743,0.000002606911],"category_scores_gemma":[0.00003465631,0.0001314583,0.0001079706,0.0002419681,0.00004222218,0.0001836291,0.0000119713,0.00009425705,0.000001267625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002716639,"about_ca_system_score_gemma":0.00005112362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000963624,"about_ca_topic_score_gemma":0.00003814367,"domain_scores_codex":[0.9987695,0.00007317997,0.0003512401,0.0003432251,0.0002397177,0.0002231774],"domain_scores_gemma":[0.9989791,0.0001462498,0.0001560241,0.0003665506,0.0002756396,0.00007647145],"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.00001245117,0.0003635502,0.0001446398,0.0005214451,0.00009221595,0.00002337048,0.001269479,0.0002206096,0.001634963,0.01475442,0.00006093094,0.9809019],"study_design_scores_gemma":[0.01817555,0.006576091,0.006024929,0.01289288,0.0006477548,0.003058357,0.03068784,0.6343908,0.03547736,0.001214645,0.2463294,0.004524495],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01839176,0.001890829,0.9779801,0.0003027585,0.0004906082,0.00067138,0.00009640895,0.0001246416,0.00005146854],"genre_scores_gemma":[0.9597558,0.00001354432,0.039468,0.00001387802,0.00005225908,0.0002993902,0.0001132247,0.000009864356,0.0002739842],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9763774,"threshold_uncertainty_score":0.5360715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037783464","doi":"10.1145/1057387.1057389","title":"Dealing with incomplete knowledge on CLP( <i>FD</i> ) variable domains","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Patient Safety Institute","keywords":"Computer science; Local consistency; Consistency (knowledge bases); Semantics (computer science); Domain (mathematical analysis); Set (abstract data type); Answer set programming; Theoretical computer science; Constraint programming; Programming language; Constraint logic programming; Constraint (computer-aided design); Constraint satisfaction; Artificial intelligence; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0142407032625593,"gpt":0.2645974458612206,"spread":0.2503567425986613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002349525,0.0001710652,0.0001729316,0.0001521164,0.0003692745,0.000328027,0.0002398434,0.00006823683,0.00001814292],"category_scores_gemma":[0.000007760182,0.0001386071,0.00003857542,0.0002963444,0.00004174008,0.000262553,0.000009020526,0.0001740302,0.00002312699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005108635,"about_ca_system_score_gemma":0.00003360173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001150066,"about_ca_topic_score_gemma":0.000156838,"domain_scores_codex":[0.9989319,0.00006262409,0.0002201024,0.0003517212,0.0001835024,0.0002500875],"domain_scores_gemma":[0.9991539,0.0001454097,0.00007559036,0.0004496116,0.00006128107,0.0001141965],"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.00002058699,0.0001259865,0.0001110422,0.00004925524,0.0000555491,0.000008804505,0.001312071,0.02091951,0.0001165135,0.02949421,0.00002184774,0.9477646],"study_design_scores_gemma":[0.00684343,0.002896016,0.001405052,0.001630375,0.0002259348,0.001291263,0.006285525,0.40417,0.001743598,0.0003840293,0.570513,0.002611836],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004110262,0.000264637,0.9916801,0.0005212112,0.0001634878,0.0003546604,0.000006511247,0.0003515005,0.002547598],"genre_scores_gemma":[0.8519796,0.00003114916,0.147217,0.0001323663,0.00006867175,0.00005976109,0.000003938589,0.00001528441,0.0004922118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9451528,"threshold_uncertainty_score":0.5652232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996180635","doi":"10.1145/1498926.1498927","title":"Deferring design pattern decisions and automating structural pattern changes using a design-pattern-based programming system","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Software Engineering Research","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 Alberta; University of Waterloo","funders":"University of Alberta","keywords":"Computer science; Software design pattern; Specification pattern; Design pattern; Generative Design; Coding (social sciences); Engineering design process; Structural pattern; Architecture; Context (archaeology); Software design; Software engineering; Programming language; Software development; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.05634059262171508,"gpt":0.3122899557454259,"spread":0.2559493631237108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009659008,0.0004070797,0.0004263604,0.0004496127,0.0006446819,0.00129581,0.0006701703,0.0001614481,0.000001618702],"category_scores_gemma":[0.0001644476,0.0003612271,0.00008106186,0.0004997261,0.0000474817,0.0003136624,0.00003777719,0.0003740231,0.000002349263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001603813,"about_ca_system_score_gemma":0.0000535057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005549871,"about_ca_topic_score_gemma":0.00002699657,"domain_scores_codex":[0.9971277,0.0003158934,0.0004386787,0.0007524327,0.000583854,0.0007814472],"domain_scores_gemma":[0.997194,0.001462006,0.0001534668,0.0008139636,0.0001038152,0.0002727522],"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.000005670579,0.00003155701,0.001581231,0.0002370139,0.00004462825,0.0001147896,0.001367804,0.01526341,0.0004235528,0.0000068776,0.000001043877,0.9809224],"study_design_scores_gemma":[0.0007026223,0.0005972153,0.002649071,0.001714472,0.00005395134,0.0005099599,0.001462098,0.9907268,0.0009658047,0.000006664226,0.00003883454,0.0005724663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1306298,0.0008504079,0.8661543,0.0001252025,0.0002333982,0.001055568,0.000005720063,0.0009449131,7.739788e-7],"genre_scores_gemma":[0.8488969,0.000006240606,0.1507932,0.00003836727,0.00006909869,0.000146887,0.00000257873,0.00003908204,0.000007618019],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.98035,"threshold_uncertainty_score":0.9998839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023809115","doi":"10.1145/1011508.1011510","title":"Polymorphic specialization for ML","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","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":"Soundness; Computer science; Semantics (computer science); Programming language; Type inference; Functional programming; Recursion (computer science); Linear logic; Inference; Lambda calculus; Theoretical computer science; Operational semantics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02675059458321067,"gpt":0.2806556860792817,"spread":0.253905091496071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003438074,0.0001831489,0.0002243553,0.0001398465,0.0003573433,0.0005078339,0.0004227235,0.0001163227,0.000002750946],"category_scores_gemma":[0.00003125643,0.0001529755,0.00009916613,0.0002940629,0.0000426944,0.000260712,0.00001086437,0.00009854416,0.00001462321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005353554,"about_ca_system_score_gemma":0.00004185599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00051335,"about_ca_topic_score_gemma":0.00008268636,"domain_scores_codex":[0.9986823,0.00004667656,0.0002878988,0.0004188574,0.000220657,0.00034365],"domain_scores_gemma":[0.9990598,0.00007778955,0.0001077778,0.0005630153,0.0000788219,0.000112774],"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.00001849336,0.0002343005,0.0001137884,0.0002577255,0.00009063385,0.00002322726,0.003126541,0.000890499,0.0002770406,0.4036014,0.0000362481,0.5913301],"study_design_scores_gemma":[0.01995071,0.0092215,0.001578783,0.0007127002,0.0005847103,0.002286155,0.0222501,0.01972096,0.01276157,0.0993723,0.8055215,0.00603901],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001619874,0.001248564,0.9943117,0.0004335662,0.0008725725,0.0008948388,0.000003607881,0.0003733886,0.0002418838],"genre_scores_gemma":[0.9845093,0.00003236402,0.01421627,0.00006405527,0.0002207375,0.0002824032,0.000009416517,0.00002055408,0.0006448273],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9828895,"threshold_uncertainty_score":0.6238161,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4223911053","doi":"10.1145/3563943","title":"Towards Porting Operating Systems with Program Synthesis","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"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":"U.S. Air Force; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Eidgenössische Technische Hochschule Zürich; U.S. Department of Defense","keywords":"Computer science; Toolchain; Porting; Software portability; Scalability; Programming language; Code generation; Abstract machine; Program synthesis; Operating system; Embedded system; Computer architecture; Software engineering; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02496823512078345,"gpt":0.2898715452319761,"spread":0.2649033101111926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000888499,0.0001926212,0.0002535292,0.0001503161,0.001368303,0.0009440561,0.0006892503,0.00004729518,0.000008047994],"category_scores_gemma":[0.00004479162,0.0001656188,0.00005766567,0.0005566463,0.00003946963,0.0002400443,0.00005059447,0.000325768,0.000002259617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007580678,"about_ca_system_score_gemma":0.00006561698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006996883,"about_ca_topic_score_gemma":0.000006739695,"domain_scores_codex":[0.9980153,0.0002416399,0.0003925404,0.0005169584,0.0004691947,0.0003643523],"domain_scores_gemma":[0.9987139,0.0002259768,0.0001986709,0.0006806407,0.0000757868,0.0001050799],"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.000009592301,0.0002603686,0.0002497945,0.0002092293,0.00009711281,0.00006054313,0.00416474,0.01958282,0.00006372642,0.005390677,0.00001600984,0.9698954],"study_design_scores_gemma":[0.001200841,0.002389861,0.0005315032,0.000750953,0.0001475974,0.002751173,0.08104095,0.8509525,0.0007510486,0.00004822149,0.05777444,0.00166088],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06666599,0.002113354,0.9257687,0.0006893135,0.0009364912,0.001691907,0.00001572183,0.001471865,0.0006466823],"genre_scores_gemma":[0.9583219,0.000009028056,0.03992843,0.00003973664,0.00006626202,0.001479366,0.000003658676,0.00002120157,0.0001304148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9682345,"threshold_uncertainty_score":0.9999318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083104467","doi":"10.1145/1377492.1377494","title":"Relations as an abstraction for BDD-based program analysis","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science; Programming language; Binary decision diagram; Theoretical computer science; Language construct","retraction":null,"screen_n_in":null,"score":{"opus":0.04614680829532904,"gpt":0.3601858993755705,"spread":0.3140390910802415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097426,0.000149464,0.0002014879,0.0003349794,0.0005945314,0.0001887687,0.0003501238,0.0001185011,0.000005183487],"category_scores_gemma":[0.00006653718,0.0001384546,0.0001405167,0.0008032906,0.0000590355,0.0005477008,0.000003851256,0.000144077,0.000008342471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004879837,"about_ca_system_score_gemma":0.00005043703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003383723,"about_ca_topic_score_gemma":0.00004376907,"domain_scores_codex":[0.9986647,0.0001156115,0.0003258185,0.0004186691,0.0002331185,0.0002420413],"domain_scores_gemma":[0.9986665,0.0001733271,0.0001470979,0.0007680373,0.0001262373,0.0001187727],"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.00004059573,0.0006652919,0.0007250577,0.00006930932,0.0002733222,0.000009953964,0.001709972,0.01327563,0.0002050136,0.006982011,0.0000127174,0.9760311],"study_design_scores_gemma":[0.00130319,0.002608899,0.0135639,0.00007026122,0.0006144695,0.0001735968,0.002330154,0.9516467,0.002609482,0.0003421501,0.02388725,0.0008499756],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07044612,0.0001246194,0.9275298,0.0001282314,0.0002069777,0.0009318083,0.000008891541,0.0005238001,0.00009981873],"genre_scores_gemma":[0.5777602,0.000007195294,0.421398,0.00001851853,0.00002538135,0.0005604385,0.00002128544,0.000009117331,0.0001998022],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9751812,"threshold_uncertainty_score":0.5646015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011384897","doi":"10.1145/1387673.1387677","title":"Two-dimensional bidirectional object layout","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"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":"Israel Science Foundation","keywords":"Computer science; Compiler; Scheme (mathematics); Programming language; Benchmark (surveying); Identifier; Bytecode; Inheritance (genetic algorithm); Field (mathematics); Parallel computing; Theoretical computer science; Virtual machine","retraction":null,"screen_n_in":null,"score":{"opus":0.02356164494510692,"gpt":0.285637387146328,"spread":0.262075742201221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002185928,0.0001411995,0.0001604321,0.0001567161,0.0004874867,0.0001278964,0.0003008251,0.0000609057,0.000005770625],"category_scores_gemma":[0.00001850009,0.0001229518,0.00006550773,0.0002792007,0.00005225857,0.0001680431,0.00001636868,0.0001519588,0.0000123588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002501338,"about_ca_system_score_gemma":0.00003893624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002830387,"about_ca_topic_score_gemma":0.000006657999,"domain_scores_codex":[0.9989111,0.0000841915,0.0002055946,0.0003318154,0.0002522496,0.0002150558],"domain_scores_gemma":[0.9992535,0.0001262645,0.00006345426,0.0003997213,0.00006918511,0.00008795105],"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.00007395089,0.001093133,0.002269461,0.000168573,0.0003843366,0.0004002864,0.007130543,0.305522,0.0008548467,0.01115409,0.002306601,0.6686422],"study_design_scores_gemma":[0.003762127,0.001644328,0.0028309,0.0005675415,0.00008360259,0.007128377,0.001302809,0.9376305,0.005463075,0.0008042194,0.03632666,0.00245591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03742309,0.001040304,0.9588438,0.0002588377,0.0004226101,0.0002719219,0.000004468902,0.001141004,0.000593989],"genre_scores_gemma":[0.8637927,0.00002805047,0.1348751,0.00008026658,0.0000599967,0.0000516908,0.000004081359,0.00001080191,0.001097359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8263695,"threshold_uncertainty_score":0.5013828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387693588","doi":"10.1145/3610408","title":"Focusing on Refinement Typing","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; European Commission","keywords":"Computer science; Soundness; Programming language; Correctness; Decidability; Theoretical computer science; Unification; Type theory; Algorithm; Type (biology)","retraction":null,"screen_n_in":null,"score":{"opus":0.03707078402181975,"gpt":0.2963346349498387,"spread":0.259263850928019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103062,0.0002067309,0.0002366595,0.0002634158,0.0004365857,0.0005371951,0.0004590547,0.00009918955,0.000004807737],"category_scores_gemma":[0.00003245137,0.0001659278,0.00008881191,0.0006110149,0.0000341143,0.0001657752,0.00002663491,0.000187523,0.000131391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004636723,"about_ca_system_score_gemma":0.00002127554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003515728,"about_ca_topic_score_gemma":0.00003322443,"domain_scores_codex":[0.998364,0.0001004417,0.0002991183,0.0004909859,0.0002940233,0.0004514636],"domain_scores_gemma":[0.9988262,0.0001545191,0.00009657904,0.0007552477,0.00004828408,0.0001191486],"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.000009539685,0.00009253182,0.0001072219,0.00015797,0.00007093634,0.00006593522,0.002020208,0.0004317595,0.0002021017,0.04517006,0.0001489984,0.9515227],"study_design_scores_gemma":[0.004488225,0.004435188,0.002079131,0.0008727747,0.0001963899,0.0006199387,0.02398986,0.04609808,0.00345696,0.005762086,0.9046069,0.003394476],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01879624,0.001369188,0.9697219,0.001584766,0.002378762,0.001217736,0.000004240165,0.002400661,0.002526553],"genre_scores_gemma":[0.9954636,0.00005200149,0.002290235,0.00007777389,0.0001386036,0.0001627294,0.000005681448,0.00002214749,0.001787269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9766673,"threshold_uncertainty_score":0.6766341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409920357","doi":"10.1145/3732933","title":"Sound Static Data Race Verification for C: Is the Race Lost?","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"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":"Computer science; Race (biology); Sound (geography); Arms race; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.05323993760904652,"gpt":0.3714969884658841,"spread":0.3182570508568376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006760204,0.0001136613,0.0001610659,0.00005465101,0.000346848,0.0004785022,0.0009399336,0.0000459851,0.0000022988],"category_scores_gemma":[0.00008879799,0.0000759695,0.00004266082,0.0003303096,0.00004799982,0.0002209974,0.00003048341,0.0001168195,0.000004731804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001687736,"about_ca_system_score_gemma":0.00002687998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001144556,"about_ca_topic_score_gemma":0.000006714798,"domain_scores_codex":[0.9989365,0.0001162624,0.000208904,0.0003995362,0.0001390406,0.0001997642],"domain_scores_gemma":[0.9977864,0.0007177748,0.0000712893,0.001327637,0.00005321517,0.00004367227],"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.000007085747,0.00005515199,0.00001448365,0.0001072009,0.00005308009,0.000001015608,0.0007333438,0.00004571498,0.00006511306,0.003803389,0.0003123889,0.9948021],"study_design_scores_gemma":[0.001361328,0.0004683557,0.0002966383,0.0003597939,0.000224834,0.00004000982,0.01005186,0.4030393,0.0008258461,0.007528105,0.5751782,0.0006257401],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005169854,0.001645423,0.9909228,0.00560135,0.0004871692,0.0006706742,0.00003698228,0.00007912926,0.00003946211],"genre_scores_gemma":[0.23973,0.0002066935,0.7542877,0.0008006499,0.0001115235,0.0004031718,0.00002167413,0.00002096598,0.00441762],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9941763,"threshold_uncertainty_score":0.4614208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405080277","doi":"10.1145/3707203","title":"A Layered Approach to Intensional Analysis in Type Theory","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"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":"Computer science; Type theory; Programming language; Normalization (sociology); Syntax; Functional programming; Data type; Metaprogramming; Theoretical computer science; Type (biology); Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02670016142233279,"gpt":0.287105682198416,"spread":0.2604055207760832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630467,0.0001818246,0.0003045886,0.0006265609,0.000109831,0.0006344647,0.000441522,0.0001023752,0.000005286894],"category_scores_gemma":[0.00003928072,0.0001368733,0.0001233285,0.002068119,0.00003046268,0.0001746995,0.00002518923,0.0002124486,0.00003474969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000465642,"about_ca_system_score_gemma":0.00003577598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005085662,"about_ca_topic_score_gemma":0.00007907346,"domain_scores_codex":[0.9983911,0.0001665715,0.0002953214,0.0005699828,0.0002566544,0.0003203603],"domain_scores_gemma":[0.9990135,0.0001829763,0.00003300209,0.000577702,0.00006328057,0.0001294692],"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.00003997928,0.0003008193,0.0003873175,0.0003388058,0.000747023,0.0001419052,0.01002821,0.003720182,0.000122803,0.287072,0.00008367204,0.6970173],"study_design_scores_gemma":[0.002922171,0.003636502,0.006258609,0.0008114006,0.001754112,0.001624779,0.05574629,0.620146,0.0004993444,0.01851769,0.2831528,0.004930266],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004233399,0.003993732,0.9892976,0.0001764183,0.0006122717,0.000497464,0.000002502623,0.0003652915,0.0008213075],"genre_scores_gemma":[0.9903414,0.00002179081,0.008211867,0.00006407905,0.00005350757,0.0001400461,0.000007208324,0.00001462481,0.00114548],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.986108,"threshold_uncertainty_score":0.6118158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}