{"meta":{"query_hash":"2e63c7f45fe9","filters":{"venue":"ACM Transactions on Programming Languages and Systems"},"cohort_total":23,"direct_labels_cover":0,"predictions_cover":23,"exported":23,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2e63c7f45fe9","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Join (topology); Programming language; Semantics (computer science); Advice (programming); Aspect-oriented programming; Denotational semantics; Correctness; Set (abstract data type); Operational semantics; Software; Mathematics","score_opus":0.020608175611742274,"score_gpt":0.3099701202073812,"score_spread":0.2893619445956389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965418329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025426008,0.0014577054,0.9711779,0.00036124018,0.00025295664,0.0007596848,0.0000047574094,0.0005568873,0.0000028659097],"genre_scores_gemma":[0.38379997,0.000049181534,0.6158635,0.000014935437,0.0000112821135,0.00019675262,0.0000022279319,0.000016276845,0.00004588815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987426,0.000058357895,0.00026808356,0.00042449989,0.00014179535,0.000364698],"domain_scores_gemma":[0.99896777,0.00042516683,0.000070482136,0.00041237805,0.000046028985,0.00007817293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498973,0.00019014337,0.00026038048,0.00020117061,0.00014414433,0.0001660381,0.00024674265,0.000092552094,1.6848412e-7],"category_scores_gemma":[0.00022451575,0.00017585304,0.000045694815,0.0003582259,0.00004788463,0.0002536381,0.000020171117,0.00018818761,6.7681054e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029975214,0.00018336732,0.00014858045,0.0006364354,0.00006304705,0.000066915476,0.0058858427,0.02388071,0.00039576183,0.0055286125,0.0000010132146,0.96317977],"study_design_scores_gemma":[0.063875355,0.02045764,0.017696528,0.021313509,0.0010640064,0.0077855047,0.1432492,0.53375006,0.0133533105,0.08436163,0.07574639,0.017346887],"about_ca_topic_score_codex":0.0001459898,"about_ca_topic_score_gemma":0.000119269214,"teacher_disagreement_score":0.94583285,"about_ca_system_score_codex":0.00007405613,"about_ca_system_score_gemma":0.000021941503,"threshold_uncertainty_score":0.7171079},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01628096330478509,"score_gpt":0.2897348647963653,"score_spread":0.2734539014915802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984005572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025783523,0.0005725518,0.9944733,0.00014413508,0.00017568334,0.00018226067,8.72232e-7,0.00073282846,0.0011400309],"genre_scores_gemma":[0.83246696,0.000038915758,0.16672438,0.0001058996,0.000035388715,0.000016740649,0.0000013751043,0.000008039722,0.00060233026],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991381,0.000028908515,0.00020359839,0.00022522362,0.000157383,0.00024677877],"domain_scores_gemma":[0.99927056,0.00010397669,0.00005646072,0.00043969436,0.000042020456,0.00008727976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247665,0.000107830296,0.00011668007,0.0001273855,0.00021654852,0.00023276712,0.00036926876,0.00006354822,0.0000014311958],"category_scores_gemma":[0.000012695359,0.00009203891,0.0000412622,0.00024988328,0.000024812547,0.00017322045,0.0000122876845,0.00012263075,0.0000065903437],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051598504,0.000060424674,0.000086041255,0.000031538028,0.000018035822,0.000019152618,0.00086337165,0.00085351686,0.00006665309,0.0045423196,0.000107279324,0.9933465],"study_design_scores_gemma":[0.004717891,0.0045757582,0.0027788116,0.0012686838,0.00014801382,0.0023525795,0.011276402,0.39582878,0.028651629,0.0025472934,0.5413424,0.0045117647],"about_ca_topic_score_codex":0.00009944047,"about_ca_topic_score_gemma":0.000008602213,"teacher_disagreement_score":0.98883474,"about_ca_system_score_codex":0.000016805066,"about_ca_system_score_gemma":0.0000096430285,"threshold_uncertainty_score":0.37532377},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05634059262171508,"score_gpt":0.3122899557454259,"score_spread":0.2559493631237108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996180635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1306298,0.0008504079,0.86615425,0.00012520245,0.00023339818,0.0010555676,0.0000057200627,0.0009449131,7.739788e-7],"genre_scores_gemma":[0.8488969,0.0000062406057,0.15079322,0.000038367274,0.000069098685,0.00014688702,0.0000025787301,0.00003908204,0.0000076180195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971277,0.00031589338,0.00043867872,0.0007524327,0.000583854,0.0007814472],"domain_scores_gemma":[0.997194,0.0014620062,0.00015346684,0.00081396365,0.00010381525,0.00027275222],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096590084,0.0004070797,0.00042636044,0.00044961274,0.0006446819,0.0012958096,0.0006701703,0.00016144809,0.0000016187024],"category_scores_gemma":[0.00016444764,0.00036122708,0.00008106186,0.0004997261,0.0000474817,0.00031366237,0.000037777194,0.00037402313,0.0000023492632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056705794,0.00003155701,0.001581231,0.00023701393,0.000044628254,0.00011478964,0.0013678044,0.0152634075,0.00042355282,0.0000068776003,0.0000010438766,0.9809224],"study_design_scores_gemma":[0.00070262235,0.0005972153,0.0026490707,0.0017144723,0.00005395134,0.0005099599,0.0014620982,0.9907268,0.00096580473,0.0000066642256,0.000038834536,0.0005724663],"about_ca_topic_score_codex":0.0005549871,"about_ca_topic_score_gemma":0.000026996573,"teacher_disagreement_score":0.98034996,"about_ca_system_score_codex":0.00016038133,"about_ca_system_score_gemma":0.0000535057,"threshold_uncertainty_score":0.99988395},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023561644945106923,"score_gpt":0.28563738714632797,"score_spread":0.26207574220122104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011384897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037423093,0.0010403043,0.95884377,0.00025883765,0.00042261012,0.00027192195,0.000004468902,0.0011410036,0.000593989],"genre_scores_gemma":[0.86379266,0.000028050468,0.13487512,0.00008026658,0.000059996695,0.000051690797,0.0000040813593,0.000010801915,0.0010973591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989111,0.000084191495,0.00020559457,0.00033181545,0.0002522496,0.0002150558],"domain_scores_gemma":[0.99925345,0.00012626454,0.00006345426,0.00039972126,0.00006918511,0.00008795105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021859279,0.0001411995,0.00016043209,0.00015671608,0.0004874867,0.00012789643,0.0003008251,0.000060905695,0.0000057706247],"category_scores_gemma":[0.000018500092,0.00012295177,0.00006550773,0.00027920073,0.000052258572,0.00016804309,0.000016368678,0.00015195883,0.000012358803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007395089,0.0010931327,0.0022694613,0.00016857297,0.00038433663,0.00040028643,0.007130543,0.30552202,0.00085484673,0.011154089,0.0023066008,0.66864216],"study_design_scores_gemma":[0.003762127,0.0016443281,0.0028308996,0.0005675415,0.00008360259,0.0071283765,0.0013028085,0.9376305,0.0054630754,0.0008042194,0.036326658,0.00245591],"about_ca_topic_score_codex":0.00028303865,"about_ca_topic_score_gemma":0.0000066579987,"teacher_disagreement_score":0.8263695,"about_ca_system_score_codex":0.00002501338,"about_ca_system_score_gemma":0.00003893624,"threshold_uncertainty_score":0.50138277},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02675059458321067,"score_gpt":0.2806556860792817,"score_spread":0.25390509149607104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023809115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016198744,0.0012485635,0.9943117,0.00043356617,0.0008725725,0.00089483877,0.0000036078814,0.00037338858,0.00024188375],"genre_scores_gemma":[0.98450935,0.000032364023,0.014216271,0.00006405527,0.00022073751,0.00028240323,0.000009416517,0.000020554078,0.00064482726],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868226,0.000046676556,0.00028789876,0.00041885738,0.00022065696,0.00034364997],"domain_scores_gemma":[0.9990598,0.00007778955,0.000107777814,0.0005630153,0.0000788219,0.00011277401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003438074,0.00018314892,0.00022435529,0.00013984652,0.00035734326,0.0005078339,0.0004227235,0.00011632266,0.0000027509461],"category_scores_gemma":[0.00003125643,0.00015297551,0.00009916613,0.00029406286,0.000042694395,0.00026071197,0.00001086437,0.00009854416,0.000014623206],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018493356,0.00023430053,0.000113788396,0.0002577255,0.00009063385,0.000023227261,0.0031265407,0.00089049904,0.0002770406,0.4036014,0.0000362481,0.5913301],"study_design_scores_gemma":[0.01995071,0.0092215,0.0015787827,0.00071270025,0.0005847103,0.0022861548,0.022250103,0.019720964,0.012761566,0.099372305,0.8055215,0.0060390104],"about_ca_topic_score_codex":0.00051334995,"about_ca_topic_score_gemma":0.00008268636,"teacher_disagreement_score":0.9828895,"about_ca_system_score_codex":0.00005353554,"about_ca_system_score_gemma":0.000041855994,"threshold_uncertainty_score":0.6238161},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0178246464309781,"score_gpt":0.26779478561531345,"score_spread":0.24997013918433536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027222319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015230993,0.0011928378,0.9797363,0.000088019195,0.0004172364,0.0005639741,9.167666e-7,0.0004938997,0.0022758162],"genre_scores_gemma":[0.9852056,0.000009493856,0.0137036685,0.000042432777,0.00009225337,0.00004817908,0.0000027056908,0.000018371926,0.00087730197],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846596,0.00006095835,0.00029843944,0.00042227205,0.00030323004,0.00044915412],"domain_scores_gemma":[0.9988493,0.0001901191,0.00012780294,0.00059548405,0.00008832766,0.00014899364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070248777,0.00020982331,0.00025026835,0.00014901746,0.0003158993,0.00042388748,0.00039215822,0.000106789834,0.000004672699],"category_scores_gemma":[0.000026436186,0.00015066408,0.000054627795,0.0003828101,0.000060955717,0.00021243207,0.000013126795,0.00018477046,0.000014878144],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038300757,0.00016303582,0.001136998,0.00023059726,0.00015717489,0.00020423801,0.0064552957,0.00019907273,0.0007016044,0.049856815,0.000010056091,0.9408468],"study_design_scores_gemma":[0.031242609,0.03105627,0.028168371,0.002688061,0.0015576483,0.015892973,0.23458672,0.071722195,0.048191268,0.010685537,0.5063721,0.017836267],"about_ca_topic_score_codex":0.00066088274,"about_ca_topic_score_gemma":0.00024241231,"teacher_disagreement_score":0.9699746,"about_ca_system_score_codex":0.000028336684,"about_ca_system_score_gemma":0.000030931966,"threshold_uncertainty_score":0.6143903},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014240703262559305,"score_gpt":0.2645974458612206,"score_spread":0.25035674259866125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037783464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004110262,0.00026463697,0.99168015,0.0005212112,0.00016348777,0.0003546604,0.0000065112467,0.00035150046,0.002547598],"genre_scores_gemma":[0.8519796,0.00003114916,0.14721698,0.00013236629,0.00006867175,0.000059761092,0.000003938589,0.000015284415,0.00049221184],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893194,0.00006262409,0.00022010237,0.00035172122,0.0001835024,0.0002500875],"domain_scores_gemma":[0.9991539,0.00014540971,0.00007559036,0.0004496116,0.00006128107,0.00011419655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023495247,0.00017106518,0.00017293163,0.00015211635,0.00036927452,0.00032802703,0.0002398434,0.00006823683,0.000018142917],"category_scores_gemma":[0.000007760182,0.00013860707,0.000038575417,0.00029634443,0.000041740084,0.000262553,0.000009020526,0.0001740302,0.000023126993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020586995,0.0001259865,0.00011104224,0.000049255243,0.0000555491,0.000008804505,0.0013120715,0.020919507,0.0001165135,0.029494211,0.000021847736,0.94776464],"study_design_scores_gemma":[0.00684343,0.0028960155,0.0014050517,0.0016303747,0.00022593483,0.0012912627,0.006285525,0.40416998,0.0017435984,0.00038402926,0.57051295,0.0026118364],"about_ca_topic_score_codex":0.000115006624,"about_ca_topic_score_gemma":0.00015683795,"teacher_disagreement_score":0.94515276,"about_ca_system_score_codex":0.000051086354,"about_ca_system_score_gemma":0.00003360173,"threshold_uncertainty_score":0.5652232},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009267692778704437,"score_gpt":0.25828902054438296,"score_spread":0.24902132776567854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048907983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006000086,0.0007501767,0.9914381,0.0006088551,0.00004480453,0.00070911454,0.0000032331377,0.000235789,0.00020985141],"genre_scores_gemma":[0.9510024,0.00004094658,0.048195723,0.00003522382,0.000037316393,0.00021654996,0.0000029790544,0.0000074917157,0.00046134554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918973,0.00007836936,0.0002313587,0.00023393269,0.0001302901,0.00013634402],"domain_scores_gemma":[0.99932986,0.00014073201,0.00008933563,0.00030658636,0.000092790746,0.000040682862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033021838,0.00009777216,0.00014402001,0.00011903971,0.0003397,0.00017368341,0.00021299266,0.00005055343,6.6317335e-7],"category_scores_gemma":[0.000013742805,0.000075706404,0.000033124757,0.00038878355,0.00003872174,0.00008885862,0.000011212726,0.00007812267,0.0000016080628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017694257,0.001082569,0.000720803,0.00066695124,0.00029473956,0.000011302778,0.01005952,0.08191403,0.026842402,0.06668013,0.0025816408,0.80896896],"study_design_scores_gemma":[0.003638217,0.0022416497,0.0035954916,0.0009426584,0.00028274392,0.00053089834,0.003908659,0.90166384,0.043223206,0.004129475,0.033966817,0.0018763181],"about_ca_topic_score_codex":0.0006445773,"about_ca_topic_score_gemma":0.000010835792,"teacher_disagreement_score":0.9450023,"about_ca_system_score_codex":0.000019471894,"about_ca_system_score_gemma":0.0000144713495,"threshold_uncertainty_score":0.30872175},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science; Programming language; Binary decision diagram; Theoretical computer science; Language construct","score_opus":0.04614680829532904,"score_gpt":0.3601858993755705,"score_spread":0.3140390910802415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083104467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07044612,0.00012461939,0.92752975,0.00012823139,0.00020697768,0.00093180826,0.000008891541,0.00052380015,0.00009981873],"genre_scores_gemma":[0.5777602,0.0000071952936,0.42139804,0.000018518527,0.000025381352,0.0005604385,0.000021285443,0.000009117331,0.00019980219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866474,0.00011561148,0.00032581852,0.00041866914,0.00023311845,0.00024204126],"domain_scores_gemma":[0.9986665,0.00017332709,0.0001470979,0.00076803734,0.00012623728,0.00011877273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097426,0.00014946403,0.00020148794,0.00033497938,0.0005945314,0.00018876865,0.0003501238,0.00011850114,0.0000051834872],"category_scores_gemma":[0.00006653718,0.0001384546,0.0001405167,0.00080329063,0.0000590355,0.0005477008,0.0000038512558,0.00014407696,0.000008342471],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040595725,0.0006652919,0.00072505773,0.000069309324,0.00027332225,0.000009953964,0.0017099716,0.013275626,0.0002050136,0.006982011,0.000012717404,0.9760311],"study_design_scores_gemma":[0.0013031898,0.0026088986,0.013563901,0.00007026122,0.00061446946,0.0001735968,0.002330154,0.9516467,0.002609482,0.00034215007,0.023887252,0.0008499756],"about_ca_topic_score_codex":0.00033837234,"about_ca_topic_score_gemma":0.00004376907,"teacher_disagreement_score":0.97518116,"about_ca_system_score_codex":0.000048798367,"about_ca_system_score_gemma":0.000050437025,"threshold_uncertainty_score":0.5646015},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01979513296798275,"score_gpt":0.28031658038187457,"score_spread":0.2605214474138918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123691799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053467373,0.0004827202,0.9915884,0.00015229915,0.000647174,0.00062937377,0.0000021989833,0.00037400646,0.00077706645],"genre_scores_gemma":[0.9744326,0.000020851592,0.024610244,0.000022744609,0.0000695748,0.00015996964,0.0000095375,0.000020234884,0.0006542323],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821305,0.00016809972,0.00045418876,0.00044709287,0.0003300049,0.00038755685],"domain_scores_gemma":[0.9984293,0.0002130546,0.00021238002,0.0008473937,0.0001557244,0.00014217135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726963,0.0002166513,0.00032940175,0.00019815542,0.00029686344,0.00030766922,0.00051140005,0.00011345897,0.000005163422],"category_scores_gemma":[0.00008318336,0.0001787211,0.000108969536,0.0005103781,0.00010076491,0.00027595964,0.000024757273,0.00017373348,0.000018364573],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008168536,0.0001902888,0.00048533545,0.00021740008,0.000075649616,0.0000060205375,0.001951076,0.00011496067,0.00012610223,0.13629064,0.0000146921475,0.86051965],"study_design_scores_gemma":[0.0037994205,0.0042754537,0.001479519,0.00034921718,0.00029466726,0.0005069131,0.012467501,0.03630583,0.002373626,0.005204507,0.93080616,0.0021371923],"about_ca_topic_score_codex":0.00062203896,"about_ca_topic_score_gemma":0.000070748836,"teacher_disagreement_score":0.9690859,"about_ca_system_score_codex":0.000027892203,"about_ca_system_score_gemma":0.00003340123,"threshold_uncertainty_score":0.72880346},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; SIGNAL (programming language); POSIX Threads; Synchronization (alternating current); Real-time computing; Bottleneck; Concurrency; Embedded system; Distributed computing; Programming language; Thread (computing)","score_opus":0.019658134108877894,"score_gpt":0.27913806230981975,"score_spread":0.25947992820094185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140249069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009362036,0.002657581,0.984415,0.00057882624,0.0006601828,0.000642012,0.0000027476797,0.0007078867,0.00097372517],"genre_scores_gemma":[0.9881545,0.00003291416,0.009952323,0.000084674335,0.00029105903,0.00015819444,0.0000026397888,0.000020506195,0.0013032368],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828154,0.00010283417,0.000347007,0.00048761143,0.00031748004,0.00046351057],"domain_scores_gemma":[0.9987841,0.0001245262,0.000108584536,0.0007333926,0.00006445,0.00018491574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041407192,0.00023814352,0.000281462,0.0001645408,0.00035985507,0.0006062355,0.0006398207,0.00013494476,0.0000105544505],"category_scores_gemma":[0.000012353713,0.00019082335,0.00011984617,0.00030798116,0.000052867465,0.000363685,0.000021662669,0.00021818471,0.00006857212],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052533683,0.00011874549,0.00028444704,0.000059323123,0.000059339513,0.000019431029,0.0014244198,0.0001907684,0.000133597,0.019749185,0.00006442341,0.9778911],"study_design_scores_gemma":[0.0033769244,0.0028453742,0.0016738994,0.00018289596,0.0001965817,0.0017455114,0.011925727,0.028664736,0.004541893,0.002485714,0.939587,0.002773737],"about_ca_topic_score_codex":0.0006194268,"about_ca_topic_score_gemma":0.00004196781,"teacher_disagreement_score":0.9787924,"about_ca_system_score_codex":0.000049969694,"about_ca_system_score_gemma":0.000026565422,"threshold_uncertainty_score":0.778155},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Java; Modular design; Programming language; Class (philosophy); Software; Operating system; Artificial intelligence","score_opus":0.04144992129324543,"score_gpt":0.35050278528111634,"score_spread":0.3090528639878709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162762034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014337728,0.00031463994,0.9956425,0.001088555,0.00023638915,0.0008341409,0.0000052007995,0.001502844,0.00023238201],"genre_scores_gemma":[0.41371495,0.00011942831,0.58441395,0.000081973696,0.00006880611,0.0008020287,0.0000013224221,0.000019938172,0.00077759224],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988558,0.000055444925,0.00024959873,0.0003965636,0.00018184942,0.00026070463],"domain_scores_gemma":[0.9988554,0.00029332898,0.00010779414,0.000566402,0.00009046948,0.00008660395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000267633,0.00016116585,0.00017233852,0.00016583747,0.0002847791,0.000277402,0.00024468376,0.00012705135,0.000008345956],"category_scores_gemma":[0.00008885359,0.00014686985,0.00007610952,0.00022104259,0.00003874596,0.0006049632,0.000009805705,0.00020033374,0.000006810373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007779856,0.00012322179,0.0000029152409,0.00005721821,0.00001907912,0.000011175283,0.00025284552,0.000009823278,0.00086557324,0.0032443434,0.0003181121,0.9950879],"study_design_scores_gemma":[0.0011144966,0.0034926622,0.000033900225,0.0003174429,0.00011077929,0.0022710494,0.0034105266,0.0630727,0.108784564,0.0020919251,0.81381625,0.0014837142],"about_ca_topic_score_codex":0.000037091886,"about_ca_topic_score_gemma":0.000006594526,"teacher_disagreement_score":0.9936042,"about_ca_system_score_codex":0.000048031834,"about_ca_system_score_gemma":0.0000072627445,"threshold_uncertainty_score":0.59891784},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021919488006407025,"score_gpt":0.27047769635798435,"score_spread":0.24855820835157733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163420823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027323144,0.0033546365,0.9882127,0.00017701008,0.0009952445,0.00048760715,0.0000013894506,0.00051079947,0.0035282758],"genre_scores_gemma":[0.98935246,0.000042941192,0.007855724,0.000064549225,0.000051871146,0.00012435191,0.0000015411202,0.00001760415,0.0024889566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842006,0.00016307995,0.0002826514,0.0004501705,0.00027022674,0.00041382143],"domain_scores_gemma":[0.9987562,0.00011113248,0.000089935704,0.0008280783,0.000054284432,0.00016038395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005076121,0.00020786322,0.00024379579,0.00013195428,0.00032653278,0.00053869036,0.00046782996,0.000116898016,0.00000994263],"category_scores_gemma":[0.00004330955,0.00016593117,0.00009274626,0.00033870063,0.000051014726,0.00023831012,0.000010288567,0.0001811321,0.000047172023],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005251734,0.00020174641,0.00045145638,0.00013941996,0.00009379955,0.00006800264,0.0020723029,0.00006960734,0.00016525165,0.3379244,0.00007683888,0.65873194],"study_design_scores_gemma":[0.0026859785,0.0016558161,0.00045517564,0.00011155634,0.00012069465,0.0018587757,0.011871574,0.0031301815,0.0031637077,0.007461654,0.9655063,0.0019785413],"about_ca_topic_score_codex":0.00033996734,"about_ca_topic_score_gemma":0.00003138729,"teacher_disagreement_score":0.9866201,"about_ca_system_score_codex":0.000029509736,"about_ca_system_score_gemma":0.000033015065,"threshold_uncertainty_score":0.67664766},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03542469374141972,"score_gpt":0.30975706894314725,"score_spread":0.27433237520172754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170181173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08802328,0.00417046,0.9042601,0.00011098966,0.0012956619,0.0010941351,0.0000075508406,0.00048974715,0.000548052],"genre_scores_gemma":[0.9906183,0.00002441335,0.007911225,0.000015499378,0.00013047569,0.000120249955,0.0000041740673,0.000021853095,0.0011538379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979573,0.00023157115,0.00050104177,0.0003383783,0.0004287814,0.000542947],"domain_scores_gemma":[0.9984225,0.0003291749,0.00023723727,0.0007136075,0.00011026976,0.00018718757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012472022,0.00023068688,0.00036255846,0.00015661783,0.00024240148,0.00024132009,0.0004955225,0.00010779022,0.000011864054],"category_scores_gemma":[0.00008062423,0.00018745627,0.00012025757,0.00035841347,0.0000688872,0.0004178346,0.00002762586,0.00017397494,0.00006755453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002744621,0.00047804625,0.003603838,0.00038515488,0.00022677411,0.000021156966,0.010487001,0.001707817,0.0015422596,0.003638042,0.00003291258,0.97784954],"study_design_scores_gemma":[0.02018468,0.023283044,0.018959813,0.0025939574,0.0024098586,0.0030922317,0.044453435,0.58356905,0.06575463,0.007182319,0.21394058,0.014576386],"about_ca_topic_score_codex":0.00064795674,"about_ca_topic_score_gemma":0.000015005974,"teacher_disagreement_score":0.96327317,"about_ca_system_score_codex":0.000029220668,"about_ca_system_score_gemma":0.00003479248,"threshold_uncertainty_score":0.7644245},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012963272500974168,"score_gpt":0.2714709635762032,"score_spread":0.25850769107522903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465422497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9593797,0.0020069822,0.02205568,0.01115116,0.0041898503,0.0007347579,0.000053976895,0.00027595952,0.00015198161],"genre_scores_gemma":[0.9979886,0.00008786103,0.0005875983,0.000074116644,0.00019346755,0.0001620366,6.194471e-7,0.000023089682,0.0008826064],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980108,0.0004142072,0.0003322789,0.00041582691,0.00038326174,0.00044363324],"domain_scores_gemma":[0.99442637,0.004458048,0.00016955966,0.0008184157,0.000045573062,0.00008206346],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022475491,0.00020840883,0.0001997972,0.000036842623,0.0018929349,0.0012656535,0.0007610391,0.00007313794,0.000035727797],"category_scores_gemma":[0.0007939565,0.000076300355,0.00005677346,0.00013984318,0.00058012514,0.0001989835,0.000037156675,0.00018586332,0.000042454656],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017171839,0.00010175309,0.00025422263,0.00021715571,0.00008454998,0.000026251602,0.019533651,0.00068679097,0.2532751,0.008900658,0.00009618331,0.716652],"study_design_scores_gemma":[0.00645628,0.002605447,0.009362948,0.002699312,0.0007822346,0.0028571712,0.16200085,0.012013581,0.10218021,0.0030265662,0.69221675,0.0037986357],"about_ca_topic_score_codex":0.00045039805,"about_ca_topic_score_gemma":0.000029906769,"teacher_disagreement_score":0.7128534,"about_ca_system_score_codex":0.000024808296,"about_ca_system_score_gemma":0.00002351808,"threshold_uncertainty_score":0.9997711},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Programming language; Static analysis; Code refactoring; Simple (philosophy); Type (biology); Type safety; Type inference; Code (set theory); Theoretical computer science; Artificial intelligence; Software","score_opus":0.03285374123396055,"score_gpt":0.30095392533094545,"score_spread":0.2681001840969849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904756193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22942358,0.0005475999,0.76693696,0.0006402492,0.00076950353,0.00039173104,0.0000040054915,0.000554927,0.00073143037],"genre_scores_gemma":[0.9817774,0.000019298026,0.017904859,0.00004983889,0.0001107162,0.000022091845,0.000001960648,0.000007038209,0.00010678738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904287,0.00007173103,0.00015628304,0.00032848577,0.00019680266,0.00020382056],"domain_scores_gemma":[0.9991377,0.0000976254,0.0000685247,0.0004987299,0.00012091482,0.00007648346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019618179,0.00011717602,0.00012883743,0.00007814665,0.00036937976,0.0003401041,0.00042401833,0.000059252612,0.000005896615],"category_scores_gemma":[0.000014582165,0.00008967645,0.000023206687,0.0003483213,0.00010012149,0.00019167391,0.000013003847,0.0001399617,0.000017220511],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008364217,0.00041052295,0.0019187257,0.00025027193,0.00023058533,0.000043804102,0.03271397,0.00022384782,0.0002579484,0.05837304,0.0002403135,0.90525335],"study_design_scores_gemma":[0.0074387677,0.021713749,0.00945573,0.0033651213,0.00044418572,0.0031525716,0.07668066,0.42847306,0.012928854,0.0072672525,0.42265046,0.006429603],"about_ca_topic_score_codex":0.00024630717,"about_ca_topic_score_gemma":0.00008810745,"teacher_disagreement_score":0.89882374,"about_ca_system_score_codex":0.00001481306,"about_ca_system_score_gemma":0.000028034885,"threshold_uncertainty_score":0.36568993},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021207126664278694,"score_gpt":0.2651548231398666,"score_spread":0.2439476964755879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106677187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013482175,0.0011480236,0.9752176,0.008840114,0.000088441804,0.00032811996,0.0000048441884,0.00070997863,0.00018074803],"genre_scores_gemma":[0.9783545,0.000036769605,0.02110162,0.000302679,0.000029342875,0.00010904776,0.000001237762,0.000006749049,0.00005805629],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992606,0.000028887918,0.00013934734,0.0002996465,0.00009944324,0.00017206454],"domain_scores_gemma":[0.999297,0.000052521078,0.000037486567,0.00047994257,0.00002400906,0.00010901367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101244535,0.00009746621,0.00012418626,0.000049984486,0.00019880921,0.0001395154,0.00047985298,0.00008877612,0.0000038246594],"category_scores_gemma":[0.00001599223,0.00008570638,0.00003765614,0.00029950388,0.00004220862,0.00008684099,0.000015637856,0.00017548795,0.000019997728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030120868,0.00006901418,0.000097552256,0.00005458663,0.000033493612,0.000018255287,0.002176898,0.00005991745,0.0002461725,0.048065845,0.0000867099,0.9490885],"study_design_scores_gemma":[0.0031712393,0.0025819782,0.001422652,0.00025138725,0.00015172083,0.000624438,0.020909736,0.20010124,0.008881301,0.005572632,0.75377375,0.0025579368],"about_ca_topic_score_codex":0.00007810167,"about_ca_topic_score_gemma":0.000008683019,"teacher_disagreement_score":0.9648723,"about_ca_system_score_codex":0.00000805679,"about_ca_system_score_gemma":0.00001088827,"threshold_uncertainty_score":0.34950048},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01933573393885135,"score_gpt":0.2976680095504109,"score_spread":0.27833227561155954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211705538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01839176,0.001890829,0.97798014,0.00030275853,0.00049060816,0.00067137997,0.00009640895,0.00012464158,0.00005146854],"genre_scores_gemma":[0.95975584,0.0000135443215,0.039467998,0.000013878019,0.000052259078,0.00029939017,0.00011322473,0.000009864356,0.00027398416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876946,0.00007317997,0.00035124007,0.0003432251,0.00023971773,0.00022317744],"domain_scores_gemma":[0.9989791,0.00014624985,0.0001560241,0.00036655055,0.00027563958,0.00007647145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026392285,0.00014381937,0.00026100763,0.00005810983,0.00019293657,0.00025428977,0.00024932888,0.000074287425,0.0000026069106],"category_scores_gemma":[0.000034656314,0.00013145834,0.00010797056,0.0002419681,0.00004222218,0.00018362908,0.000011971299,0.00009425705,0.0000012676253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012451167,0.00036355024,0.00014463984,0.0005214451,0.000092215945,0.000023370476,0.0012694794,0.00022060961,0.0016349634,0.014754425,0.000060930935,0.9809019],"study_design_scores_gemma":[0.018175548,0.0065760906,0.0060249288,0.012892882,0.00064775476,0.0030583574,0.030687844,0.6343908,0.03547736,0.001214645,0.24632935,0.0045244945],"about_ca_topic_score_codex":0.000096362404,"about_ca_topic_score_gemma":0.00003814367,"teacher_disagreement_score":0.9763774,"about_ca_system_score_codex":0.000027166388,"about_ca_system_score_gemma":0.000051123618,"threshold_uncertainty_score":0.5360715},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024968235120783455,"score_gpt":0.28987154523197606,"score_spread":0.2649033101111926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223911053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06666599,0.0021133542,0.9257687,0.00068931346,0.00093649124,0.0016919074,0.000015721831,0.001471865,0.00064668234],"genre_scores_gemma":[0.95832187,0.0000090280555,0.039928433,0.000039736642,0.000066262015,0.0014793661,0.0000036586762,0.00002120157,0.00013041477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801534,0.00024163988,0.00039254042,0.0005169584,0.00046919467,0.00036435225],"domain_scores_gemma":[0.99871385,0.00022597678,0.00019867094,0.00068064075,0.0000757868,0.00010507987],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00088849897,0.00019262124,0.00025352917,0.00015031606,0.001368303,0.0009440561,0.0006892503,0.000047295176,0.000008047994],"category_scores_gemma":[0.000044791625,0.00016561875,0.00005766567,0.00055664626,0.00003946963,0.00024004429,0.000050594466,0.000325768,0.0000022596168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009592301,0.0002603686,0.00024979448,0.00020922933,0.00009711281,0.000060543134,0.0041647404,0.019582825,0.00006372642,0.0053906767,0.000016009837,0.96989536],"study_design_scores_gemma":[0.0012008414,0.0023898608,0.0005315032,0.00075095304,0.00014759743,0.0027511732,0.08104095,0.8509525,0.0007510486,0.000048221493,0.057774443,0.0016608802],"about_ca_topic_score_codex":0.0006996883,"about_ca_topic_score_gemma":0.0000067396945,"teacher_disagreement_score":0.9682345,"about_ca_system_score_codex":0.000075806776,"about_ca_system_score_gemma":0.00006561698,"threshold_uncertainty_score":0.99993175},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Simple (philosophy); Key (lock); Type safety; Data type; Variable (mathematics); Theoretical computer science; Mathematics","score_opus":0.02784691637161136,"score_gpt":0.27967099843206455,"score_spread":0.2518240820604532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386711821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021022784,0.0029982142,0.96699876,0.00087896234,0.0022051898,0.0009742056,0.000004385496,0.0030023237,0.0019151822],"genre_scores_gemma":[0.99505544,0.000059327016,0.0018623365,0.000032191114,0.00010199698,0.00013338857,0.000004495582,0.000018254825,0.0027325952],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863213,0.000076633136,0.00023583893,0.00040292827,0.0002542703,0.00039817017],"domain_scores_gemma":[0.99900115,0.00012467212,0.00006873081,0.00064367056,0.000043731976,0.000118048476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044359983,0.00017190225,0.00021125565,0.00019908133,0.00030403672,0.00048989995,0.0004958299,0.00009797634,0.0000041899725],"category_scores_gemma":[0.000026311402,0.00013754728,0.000077207784,0.000546989,0.00003843518,0.00021085935,0.000025945374,0.00015643639,0.00014923974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064458404,0.000080218255,0.0004492702,0.00025546295,0.00011645582,0.0001468055,0.0045481957,0.0004592204,0.0001800659,0.05742188,0.00018428544,0.9361517],"study_design_scores_gemma":[0.0042913654,0.0024599652,0.0043780906,0.00041287724,0.00027331154,0.0015533409,0.03526106,0.07105193,0.0033069332,0.014167588,0.8586832,0.004160315],"about_ca_topic_score_codex":0.00053153693,"about_ca_topic_score_gemma":0.000043196662,"teacher_disagreement_score":0.97403264,"about_ca_system_score_codex":0.000022860617,"about_ca_system_score_gemma":0.00001888569,"threshold_uncertainty_score":0.5609015},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.03707078402181975,"score_gpt":0.2963346349498387,"score_spread":0.25926385092801896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387693588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018796243,0.001369188,0.96972185,0.0015847664,0.0023787618,0.0012177356,0.000004240165,0.002400661,0.0025265529],"genre_scores_gemma":[0.99546355,0.000052001487,0.0022902347,0.00007777389,0.00013860359,0.00016272943,0.0000056814483,0.000022147486,0.0017872689],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998364,0.00010044175,0.00029911834,0.0004909859,0.00029402325,0.0004514636],"domain_scores_gemma":[0.9988262,0.00015451908,0.00009657904,0.0007552477,0.000048284084,0.00011914861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061030616,0.00020673088,0.00023665949,0.00026341577,0.00043658566,0.00053719507,0.00045905472,0.00009918955,0.0000048077372],"category_scores_gemma":[0.000032451375,0.00016592784,0.00008881191,0.0006110149,0.0000341143,0.00016577524,0.00002663491,0.00018752304,0.00013139097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009539685,0.00009253182,0.0001072219,0.00015796996,0.00007093634,0.00006593522,0.0020202082,0.00043175954,0.00020210166,0.04517006,0.00014899836,0.9515227],"study_design_scores_gemma":[0.004488225,0.0044351877,0.0020791306,0.0008727747,0.00019638994,0.0006199387,0.02398986,0.04609808,0.0034569602,0.005762086,0.9046069,0.0033944757],"about_ca_topic_score_codex":0.00035157276,"about_ca_topic_score_gemma":0.00003322443,"teacher_disagreement_score":0.97666734,"about_ca_system_score_codex":0.000046367226,"about_ca_system_score_gemma":0.00002127554,"threshold_uncertainty_score":0.6766341},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Type theory; Programming language; Normalization (sociology); Syntax; Functional programming; Data type; Metaprogramming; Theoretical computer science; Type (biology); Algorithm; Artificial intelligence","score_opus":0.02670016142233279,"score_gpt":0.287105682198416,"score_spread":0.2604055207760832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405080277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004233399,0.003993732,0.9892976,0.00017641827,0.0006122717,0.000497464,0.0000025026234,0.00036529155,0.00082130753],"genre_scores_gemma":[0.9903414,0.000021790807,0.008211867,0.000064079046,0.00005350757,0.00014004606,0.0000072083244,0.0000146248085,0.0011454797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983911,0.00016657152,0.00029532143,0.0005699828,0.00025665443,0.0003203603],"domain_scores_gemma":[0.99901354,0.00018297632,0.000033002092,0.000577702,0.00006328057,0.00012946916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630467,0.00018182457,0.00030458864,0.0006265609,0.00010983101,0.00063446467,0.00044152202,0.00010237525,0.000005286894],"category_scores_gemma":[0.000039280723,0.00013687329,0.0001233285,0.0020681194,0.000030462685,0.00017469954,0.000025189229,0.00021244865,0.00003474969],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003997928,0.0003008193,0.0003873175,0.00033880578,0.00074702303,0.00014190523,0.010028208,0.0037201825,0.000122803,0.287072,0.00008367204,0.69701725],"study_design_scores_gemma":[0.0029221713,0.0036365022,0.0062586092,0.0008114006,0.0017541121,0.0016247793,0.055746295,0.620146,0.0004993444,0.01851769,0.28315282,0.0049302657],"about_ca_topic_score_codex":0.0005085662,"about_ca_topic_score_gemma":0.00007907346,"teacher_disagreement_score":0.986108,"about_ca_system_score_codex":0.0000465642,"about_ca_system_score_gemma":0.000035775978,"threshold_uncertainty_score":0.61181575},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Race (biology); Sound (geography); Arms race; Acoustics","score_opus":0.053239937609046516,"score_gpt":0.37149698846588414,"score_spread":0.31825705085683764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409920357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005169854,0.0016454225,0.9909228,0.00560135,0.00048716916,0.0006706742,0.000036982277,0.00007912926,0.000039462106],"genre_scores_gemma":[0.23972999,0.00020669351,0.7542877,0.0008006499,0.00011152346,0.00040317178,0.000021674134,0.000020965977,0.00441762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989365,0.00011626245,0.00020890399,0.00039953622,0.00013904055,0.00019976417],"domain_scores_gemma":[0.9977864,0.00071777485,0.0000712893,0.0013276367,0.00005321517,0.000043672273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006760204,0.00011366132,0.00016106592,0.00005465101,0.000346848,0.00047850222,0.00093993364,0.000045985103,0.0000022988],"category_scores_gemma":[0.00008879799,0.0000759695,0.00004266082,0.00033030956,0.000047999816,0.00022099745,0.000030483407,0.00011681954,0.0000047318035],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007085747,0.00005515199,0.000014483652,0.00010720089,0.000053080093,0.0000010156077,0.0007333438,0.000045714976,0.00006511306,0.0038033887,0.0003123889,0.99480206],"study_design_scores_gemma":[0.0013613276,0.00046835575,0.00029663826,0.00035979386,0.00022483402,0.00004000982,0.010051859,0.4030393,0.0008258461,0.007528105,0.5751782,0.0006257401],"about_ca_topic_score_codex":0.000114455615,"about_ca_topic_score_gemma":0.0000067147985,"teacher_disagreement_score":0.99417627,"about_ca_system_score_codex":0.000016877362,"about_ca_system_score_gemma":0.000026879983,"threshold_uncertainty_score":0.46142077},"labels":[],"label_agreement":null}]}