{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012104627,0.0005213578,0.97431415,0.0016571418,0.0001969107,0.000108994114,0.00009330383,0.0011097676,0.009893803],"genre_scores_gemma":[0.3237261,0.0009676229,0.66559815,0.0011415789,0.00051266165,0.00065928185,0.00027795063,0.00060291716,0.0065138135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739766,0.00057473435,0.00035218635,0.00031261684,0.0010755417,0.0002872054],"domain_scores_gemma":[0.9966439,0.0012055698,0.0003821025,0.00052113977,0.0009426477,0.00030463518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026886347,0.0008913458,0.0006852059,0.001285292,0.0019325165,0.0037861678,0.001984742,0.0024633904,0.0020443343],"category_scores_gemma":[0.0068122786,0.0010455278,0.0012129523,0.0011366848,0.0060608764,0.0066238935,0.0033406615,0.0044673705,0.0007498897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025840063,0.000029200539,0.00015764916,0.0000652008,0.000005569089,0.00018447741,0.0016196173,0.0015375958,0.0021456454,0.9824274,0.00085870025,0.010943136],"study_design_scores_gemma":[0.000049396906,0.00006263756,0.00020250626,0.0000882315,0.00002242704,0.00054510083,0.0003384634,0.01273133,0.0028191851,0.9342669,0.04882835,0.000045483568],"about_ca_topic_score_codex":0.001994126,"about_ca_topic_score_gemma":0.0014295623,"teacher_disagreement_score":0.0037861678,"about_ca_system_score_codex":0.001290096,"about_ca_system_score_gemma":0.0020183788,"threshold_uncertainty_score":0.014218986},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013184395,0.005770763,0.67202306,0.008060196,0.009655034,0.00043201668,0.0051777004,0.09253247,0.19316435],"genre_scores_gemma":[0.14696875,0.0044519063,0.51043195,0.012173587,0.004404098,0.0007486402,0.016401619,0.022726435,0.281693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855846,0.00014349676,0.00011753645,0.00024028413,0.0007478802,0.00019233952],"domain_scores_gemma":[0.99824905,0.00021226407,0.00012666613,0.0005688851,0.0007091452,0.00013405365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010303118,0.0012594165,0.0006546754,0.0013060855,0.0011461426,0.00386986,0.002478882,0.0015704698,0.05335507],"category_scores_gemma":[0.003078497,0.0007553239,0.0007633406,0.0017549052,0.0013672326,0.005240204,0.0022328554,0.0018963334,0.02635938],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0004999826,0.00008398857,0.00086898665,0.0004085005,0.000036741647,0.0003085088,0.00018141842,0.0038876666,0.023762293,0.0504036,0.5554495,0.36410883],"study_design_scores_gemma":[0.000044703927,0.00020107283,0.000592482,0.000120346354,0.000021655085,0.00050200685,0.000051237857,0.02165219,0.036583092,0.014041559,0.92610425,0.00008533208],"about_ca_topic_score_codex":0.005162811,"about_ca_topic_score_gemma":0.00626426,"teacher_disagreement_score":0.05335507,"about_ca_system_score_codex":0.0018619407,"about_ca_system_score_gemma":0.0018016411,"threshold_uncertainty_score":0.17849046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062205074,0.000024956173,0.9850932,0.0002238663,0.000025706262,0.00022298546,0.000041037263,0.0069382833,0.001209536],"genre_scores_gemma":[0.03730492,0.00006691869,0.9586576,0.00016958635,0.000014791747,0.00025463803,0.00017604283,0.0007819832,0.0025736028],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942714,0.0020824408,0.0005824178,0.001204663,0.0015582994,0.00030085127],"domain_scores_gemma":[0.98583335,0.007460781,0.0012474293,0.0037189524,0.0014379006,0.00030159674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067922827,0.0015190353,0.0006233161,0.0011196737,0.00078039686,0.002565768,0.0025080505,0.0017469333,0.0024967943],"category_scores_gemma":[0.02123955,0.0011500239,0.0011459554,0.00080958346,0.0018864566,0.0033705235,0.002063744,0.0031397168,0.0013514111],"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.0005613471,0.00070227135,0.0061732824,0.0006495865,0.00014073585,0.0012001804,0.0045869634,0.07407547,0.061901078,0.069414645,0.010053315,0.77054113],"study_design_scores_gemma":[0.00033545843,0.00063189096,0.0013481464,0.00030089432,0.00019982902,0.001472838,0.00049727695,0.720069,0.08847812,0.08953276,0.09692329,0.00021046496],"about_ca_topic_score_codex":0.001905701,"about_ca_topic_score_gemma":0.002368661,"teacher_disagreement_score":0.0067922827,"about_ca_system_score_codex":0.00094634364,"about_ca_system_score_gemma":0.0027391517,"threshold_uncertainty_score":0.035921395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034263816,0.00036189763,0.9224129,0.0002891153,0.0001770155,0.00015755756,0.0019527505,0.020936528,0.01944849],"genre_scores_gemma":[0.27745825,0.00037913016,0.69030386,0.000237036,0.000040171853,0.00048545157,0.003926563,0.0034027183,0.023766804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993986,0.000114926755,0.00006117811,0.00009985009,0.00021734706,0.00010808897],"domain_scores_gemma":[0.9980209,0.00036536815,0.00013322834,0.0009259926,0.00045717758,0.00009731682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005952459,0.00054646604,0.00043780595,0.0008653706,0.00080333,0.0017794779,0.0013262735,0.00058957224,0.015842691],"category_scores_gemma":[0.0024880501,0.00047981535,0.00042488723,0.0017131567,0.0004992256,0.0016308189,0.0019163194,0.00062859466,0.003816107],"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.00089796254,0.00028743804,0.004739389,0.0007407157,0.000059760892,0.00033958585,0.0007815597,0.069764465,0.08124796,0.1449362,0.0594476,0.6367573],"study_design_scores_gemma":[0.000292443,0.0004065299,0.002491502,0.0001377103,0.00007044987,0.0006561013,0.00035293298,0.3341981,0.1814849,0.079564326,0.40013897,0.00020604527],"about_ca_topic_score_codex":0.0026063616,"about_ca_topic_score_gemma":0.0047439183,"teacher_disagreement_score":0.015842691,"about_ca_system_score_codex":0.00076211704,"about_ca_system_score_gemma":0.0014106339,"threshold_uncertainty_score":0.05299914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029400531,0.0002288313,0.9886825,0.0003324184,0.000054518117,0.000045302528,0.00006175544,0.001568973,0.006085573],"genre_scores_gemma":[0.3237979,0.00078087026,0.6615293,0.00079968164,0.0005402715,0.0002518113,0.0002134129,0.0018696426,0.010217078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657756,0.0009944,0.00023229705,0.0006213788,0.0011320893,0.00044238818],"domain_scores_gemma":[0.99703,0.0010789061,0.00024945804,0.0011021468,0.0004311601,0.00010826249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038515765,0.0007780204,0.00097266585,0.0014373926,0.0013368528,0.003286116,0.002275469,0.0011172284,0.0066647697],"category_scores_gemma":[0.0051581645,0.0009895638,0.0024419392,0.0013483063,0.004435784,0.0073779263,0.0042228824,0.004449613,0.0019488649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002091924,0.000009813903,0.00020661147,0.000070563336,0.0000116134015,0.00009699859,0.0003899437,0.0030779324,0.0019219703,0.96951073,0.0013614169,0.023321554],"study_design_scores_gemma":[0.000019970843,0.000050974577,0.0002831666,0.000076709686,0.00006637328,0.00040750077,0.00010797063,0.054359376,0.006738264,0.86318296,0.074647985,0.000058791076],"about_ca_topic_score_codex":0.0027167948,"about_ca_topic_score_gemma":0.00212099,"teacher_disagreement_score":0.0066647697,"about_ca_system_score_codex":0.0021239826,"about_ca_system_score_gemma":0.0020347831,"threshold_uncertainty_score":0.022295892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114477545,0.0003151412,0.87339437,0.00020515577,0.000057327445,0.00007589005,0.00031438863,0.0075968546,0.0035633],"genre_scores_gemma":[0.54335403,0.00048780773,0.44690752,0.00026385352,0.000068795394,0.00014002174,0.0009060309,0.0036222248,0.0042497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658823,0.00068183296,0.0002938682,0.0005823547,0.0015838968,0.0002697414],"domain_scores_gemma":[0.9810594,0.0063342005,0.0024151506,0.008119209,0.0018116136,0.00026045373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034987342,0.00063032156,0.00087090087,0.0020554292,0.0012094531,0.003216406,0.0016082183,0.001203345,0.001520441],"category_scores_gemma":[0.019618245,0.0012801924,0.0014100396,0.0015542055,0.002523219,0.00731102,0.0037729072,0.0016667743,0.00068704435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004883102,0.00016633574,0.0501886,0.0010518068,0.00028801674,0.00309127,0.008760423,0.060292166,0.082544245,0.5052912,0.008675107,0.2791625],"study_design_scores_gemma":[0.000059832597,0.00014971342,0.0086362995,0.00056564773,0.00054028037,0.0020731061,0.00096105225,0.30157688,0.18600741,0.4058721,0.093260095,0.00029763381],"about_ca_topic_score_codex":0.0020151697,"about_ca_topic_score_gemma":0.0020246308,"teacher_disagreement_score":0.0034987342,"about_ca_system_score_codex":0.0007400965,"about_ca_system_score_gemma":0.0015626997,"threshold_uncertainty_score":0.018503308},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056180614,0.00015921817,0.9906544,0.0006710125,0.000025025121,0.00008157825,0.00028388688,0.00041621516,0.0020905884],"genre_scores_gemma":[0.113740005,0.00046041782,0.8801715,0.0005128579,0.000077986886,0.00035360747,0.00083568715,0.0002971207,0.003550829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99328965,0.0026644277,0.0007384412,0.0013197436,0.0014938817,0.0004939212],"domain_scores_gemma":[0.9827723,0.011485794,0.0013152467,0.0027039356,0.0014825957,0.00024026046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009701204,0.00092304475,0.0010950075,0.001580344,0.0013918622,0.006138374,0.0038846093,0.0017716079,0.00348966],"category_scores_gemma":[0.021186868,0.0011458964,0.0020302276,0.0036971555,0.0042107045,0.012842016,0.004850162,0.0043577724,0.0005121688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009554237,0.00002955621,0.0009876769,0.0003581136,0.000055129658,0.00060599326,0.0010707378,0.07669552,0.0014538548,0.8460075,0.004310628,0.06832977],"study_design_scores_gemma":[0.00006566458,0.000052976906,0.00030490351,0.00021798973,0.000078991165,0.00058875186,0.0004693854,0.26363274,0.006757449,0.6706938,0.057073656,0.000063531865],"about_ca_topic_score_codex":0.00818987,"about_ca_topic_score_gemma":0.008406635,"teacher_disagreement_score":0.009701204,"about_ca_system_score_codex":0.0026557648,"about_ca_system_score_gemma":0.0032248267,"threshold_uncertainty_score":0.051305473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6616564,0.0017084546,0.31907335,0.00029228686,0.00007976304,0.00032033358,0.00008954617,0.013155272,0.0036246472],"genre_scores_gemma":[0.8854745,0.0003852129,0.11193901,0.00014117139,0.000029308092,0.00019833997,0.00008981148,0.000687918,0.0010547754],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835974,0.0002710535,0.00019245168,0.00028154667,0.00069914316,0.00019612584],"domain_scores_gemma":[0.9933943,0.0031631857,0.0012634541,0.0013202315,0.000603,0.00025587826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346987,0.0011366388,0.0004932019,0.0010795081,0.00062059826,0.0010021491,0.0016839547,0.0004771645,0.0006152569],"category_scores_gemma":[0.007625073,0.00057385885,0.0003643552,0.0008943062,0.0006068592,0.0019570151,0.0010505544,0.00077136635,0.00028513573],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0006613165,0.0006641676,0.011925212,0.0005643032,0.00006962352,0.00016018168,0.0009899845,0.045877464,0.73551697,0.0031815898,0.0009140941,0.19947505],"study_design_scores_gemma":[0.00015023514,0.0009577367,0.014924034,0.0000657531,0.00017258168,0.00029952402,0.00026611614,0.2659441,0.7042919,0.0029526977,0.0098570185,0.00011832612],"about_ca_topic_score_codex":0.0020432607,"about_ca_topic_score_gemma":0.003955165,"teacher_disagreement_score":0.0020432607,"about_ca_system_score_codex":0.0007116178,"about_ca_system_score_gemma":0.0017678012,"threshold_uncertainty_score":0.007123649},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007398693,0.00013897273,0.9965341,0.0000690479,0.000038686696,0.00004461704,0.000090867245,0.0011248281,0.0012189609],"genre_scores_gemma":[0.037466966,0.00047140341,0.95891935,0.00017835,0.00006361771,0.00028572613,0.0003731938,0.0006091319,0.0016323063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715185,0.0008218621,0.0003629192,0.00044493724,0.0010061405,0.00021224644],"domain_scores_gemma":[0.997521,0.0013860891,0.000164432,0.0005737917,0.00028800647,0.00006664735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028369576,0.0012751063,0.00090147165,0.0026537434,0.0009826584,0.0036570898,0.0016347318,0.0008352339,0.0046309265],"category_scores_gemma":[0.0052159554,0.0012824263,0.0026047246,0.0019477468,0.0028278937,0.004320641,0.0032406314,0.0041401843,0.0014889721],"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.00010768678,0.00005208728,0.00071109954,0.00064691296,0.000083882696,0.00032209666,0.0006939271,0.042446975,0.0078054927,0.84085596,0.0038668301,0.102407075],"study_design_scores_gemma":[0.00006807684,0.00006710903,0.00023681208,0.00023506377,0.0001231777,0.00029262973,0.00012397212,0.22053356,0.01342713,0.63939667,0.12542441,0.000071409064],"about_ca_topic_score_codex":0.0023741312,"about_ca_topic_score_gemma":0.0031133802,"teacher_disagreement_score":0.0046309265,"about_ca_system_score_codex":0.0015244982,"about_ca_system_score_gemma":0.0018386522,"threshold_uncertainty_score":0.015491962},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002754147,0.0016584472,0.96389717,0.0024513018,0.0002953727,0.00013608199,0.00022815539,0.001585872,0.026993461],"genre_scores_gemma":[0.103290625,0.0048255,0.8738957,0.0013253861,0.0010994859,0.0006662512,0.0005001864,0.00095975265,0.013437124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994504,0.0015204615,0.00058699993,0.0011902873,0.0016684285,0.0005298881],"domain_scores_gemma":[0.9938706,0.0035659345,0.00039272913,0.0010095134,0.00094321027,0.0002180103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054252655,0.0010305925,0.0008351623,0.0019238438,0.0017434036,0.005962253,0.0029986396,0.0025471966,0.0052510495],"category_scores_gemma":[0.009445659,0.0012769361,0.0024115304,0.0020727443,0.009689648,0.008106238,0.0031011738,0.0063481247,0.0029861492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009328162,0.000013349597,0.0001200252,0.00009187665,0.0000072651687,0.00006223347,0.00041338423,0.0018745615,0.00034001155,0.975453,0.0013786526,0.020236291],"study_design_scores_gemma":[0.000012407934,0.000012559463,0.00007178112,0.00010721549,0.0000091686725,0.00011074333,0.000055657263,0.0076467753,0.000697317,0.92365193,0.06760235,0.000022052218],"about_ca_topic_score_codex":0.0034964639,"about_ca_topic_score_gemma":0.0015606944,"teacher_disagreement_score":0.005962253,"about_ca_system_score_codex":0.0029762804,"about_ca_system_score_gemma":0.0041239196,"threshold_uncertainty_score":0.028691828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018826468,0.00034065978,0.9495725,0.0003167962,0.00019699834,0.00022767024,0.00025696246,0.013219703,0.017042302],"genre_scores_gemma":[0.50398254,0.00067910313,0.45390958,0.00093021384,0.00022938484,0.00069239025,0.0007864081,0.0039661843,0.03482412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651104,0.00093571894,0.00026089384,0.0006016453,0.001383858,0.00030694078],"domain_scores_gemma":[0.9909524,0.0040295697,0.0007386945,0.0026025693,0.0014411733,0.00023560724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002788124,0.0010354281,0.0004873208,0.0005446177,0.0005421979,0.0026329998,0.0029191787,0.0012395149,0.012000009],"category_scores_gemma":[0.011214002,0.0007605387,0.00077347964,0.00041791552,0.0016069915,0.004751277,0.0027821672,0.0024683527,0.0026411416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025760652,0.00042621617,0.0079996055,0.0017385805,0.00016303065,0.00064593175,0.0018115819,0.04599337,0.06811461,0.5585494,0.023523914,0.2884577],"study_design_scores_gemma":[0.0005521166,0.00107403,0.0019836866,0.00043731535,0.00032275027,0.00085390604,0.00020916588,0.39384034,0.1842212,0.14632192,0.26997778,0.00020579976],"about_ca_topic_score_codex":0.0008516516,"about_ca_topic_score_gemma":0.0010088922,"teacher_disagreement_score":0.012000009,"about_ca_system_score_codex":0.00073625485,"about_ca_system_score_gemma":0.0014408167,"threshold_uncertainty_score":0.040143967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032916197,0.0001706626,0.9777674,0.0002577757,0.000051448114,0.00013816897,0.00031127685,0.015532831,0.0024786536],"genre_scores_gemma":[0.06837164,0.0005394203,0.9110162,0.00034084852,0.00007052561,0.00036682904,0.0018979665,0.008985803,0.008410833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973193,0.00047564053,0.00047593907,0.00048296744,0.001078264,0.00016804508],"domain_scores_gemma":[0.9933171,0.0031492298,0.00066725013,0.0016182857,0.0011789846,0.000069097405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021709742,0.0012123198,0.0006501863,0.0015682777,0.0007040295,0.0018419157,0.0013361413,0.0008317894,0.009341092],"category_scores_gemma":[0.01109611,0.0014016037,0.001723179,0.0015177072,0.00081599865,0.0041532787,0.0023413093,0.0023970501,0.0067471243],"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.00033521783,0.00014120387,0.0028050093,0.001669054,0.00008770717,0.0005585835,0.0011182264,0.0074250433,0.0948409,0.07390734,0.028457683,0.788654],"study_design_scores_gemma":[0.0002067354,0.000301715,0.0027784808,0.0004990093,0.00020432218,0.0026445342,0.00047938916,0.1444155,0.27084088,0.109024785,0.46840504,0.00019967416],"about_ca_topic_score_codex":0.00081243477,"about_ca_topic_score_gemma":0.0014904821,"teacher_disagreement_score":0.009341092,"about_ca_system_score_codex":0.0005803456,"about_ca_system_score_gemma":0.0012708881,"threshold_uncertainty_score":0.031249046},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0157621,0.0009022959,0.7627837,0.0013568553,0.00093371567,0.0005319357,0.004393973,0.031116288,0.18221912],"genre_scores_gemma":[0.23589821,0.002383537,0.55172104,0.0033170537,0.00059216167,0.0019970369,0.014740134,0.010803679,0.17854716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985077,0.00015869542,0.00010099231,0.00027759792,0.00071464415,0.00024039659],"domain_scores_gemma":[0.99870384,0.00032069342,0.00016259051,0.0003542191,0.00031853115,0.00013996703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763747,0.000573089,0.0005302631,0.0012814074,0.0010954974,0.0040454906,0.0019120086,0.00075078,0.026384063],"category_scores_gemma":[0.0027210345,0.0005992431,0.00089529523,0.001155137,0.0015403712,0.004456149,0.0037070222,0.002266221,0.007624687],"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.00077140605,0.000183703,0.001978816,0.0013587803,0.000058753325,0.0007095007,0.0008216961,0.004824202,0.020065486,0.57611614,0.10343515,0.28967637],"study_design_scores_gemma":[0.000086245396,0.00012339624,0.0007242267,0.0001920216,0.00004873474,0.001019735,0.00009299312,0.016369145,0.013648511,0.08610533,0.8815017,0.00008802984],"about_ca_topic_score_codex":0.0013942842,"about_ca_topic_score_gemma":0.0020915014,"teacher_disagreement_score":0.026384063,"about_ca_system_score_codex":0.0008653805,"about_ca_system_score_gemma":0.0021621275,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38188198,0.00044149536,0.5864196,0.000281708,0.00009278163,0.00012294394,0.0002445263,0.027419949,0.00309503],"genre_scores_gemma":[0.7981711,0.00010692816,0.19804496,0.00015800334,0.000027700886,0.00010920071,0.00037610077,0.0017933595,0.0012126992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523205,0.0014649435,0.000289971,0.0008572618,0.001606566,0.0005492954],"domain_scores_gemma":[0.9775679,0.012092431,0.0019529754,0.005725853,0.00234263,0.00031825798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037309295,0.0012476012,0.0010748493,0.000960018,0.0005427984,0.0014997541,0.0015999952,0.0007897749,0.0017383695],"category_scores_gemma":[0.01639641,0.0010565716,0.0015484565,0.0004598925,0.0019868219,0.0028975385,0.001521092,0.0015172103,0.00043425427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002467387,0.00047201576,0.04465248,0.0010200836,0.00058485364,0.0011368822,0.0014963616,0.34790394,0.2821203,0.03476417,0.0036808613,0.27970064],"study_design_scores_gemma":[0.00008907768,0.00043969895,0.0043077786,0.00007372386,0.00024038774,0.0002520518,0.00010744656,0.81889606,0.15636194,0.0146397995,0.004502843,0.00008925762],"about_ca_topic_score_codex":0.0022198246,"about_ca_topic_score_gemma":0.003671703,"teacher_disagreement_score":0.0037309295,"about_ca_system_score_codex":0.0012643195,"about_ca_system_score_gemma":0.0024242545,"threshold_uncertainty_score":0.019731224},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025308022,0.012553879,0.3083504,0.40301773,0.008187519,0.0002613433,0.00032122407,0.0006126639,0.24138719],"genre_scores_gemma":[0.79356664,0.007651929,0.12324894,0.03842717,0.0039750156,0.0005072066,0.0003489306,0.00082717557,0.031447005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9393793,0.03134058,0.0040599005,0.0056754528,0.017140787,0.002403986],"domain_scores_gemma":[0.84332013,0.097329885,0.0103550255,0.027381092,0.018197645,0.0034162835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05438507,0.0013637942,0.0016446515,0.00430201,0.011773227,0.022555409,0.004515045,0.012689443,0.008565766],"category_scores_gemma":[0.12447263,0.0015303959,0.0016170555,0.0019707014,0.08844415,0.047445912,0.014381822,0.017197054,0.002437209],"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.00003074772,0.000021807558,0.00043599439,0.00020753991,0.000025479188,0.00017967525,0.006842309,0.00033869545,0.00029065573,0.97506446,0.007781122,0.008781562],"study_design_scores_gemma":[0.000009435189,0.000022121509,0.00013423704,0.0005409518,0.000020362622,0.0001848243,0.004060541,0.0006777395,0.000529025,0.94592696,0.047857244,0.00003660905],"about_ca_topic_score_codex":0.0031895721,"about_ca_topic_score_gemma":0.0028427881,"teacher_disagreement_score":0.05438507,"about_ca_system_score_codex":0.0075868247,"about_ca_system_score_gemma":0.010840478,"threshold_uncertainty_score":0.28761917},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036174964,0.0002927683,0.9425885,0.0011289904,0.00021369908,0.0001505617,0.0002039909,0.006942513,0.01230402],"genre_scores_gemma":[0.5292869,0.00038232253,0.44662654,0.0015524303,0.00019762156,0.00034817687,0.00036588073,0.0032267529,0.0180134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99183697,0.0018555884,0.000664758,0.0013165498,0.0032324297,0.0010936628],"domain_scores_gemma":[0.9791126,0.00643632,0.001446593,0.009272465,0.0031308343,0.00060110353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077179973,0.0010093839,0.00089039386,0.0014567288,0.0017021374,0.004791109,0.0038727962,0.0024896397,0.004345438],"category_scores_gemma":[0.023575803,0.0015873293,0.002767801,0.0011015282,0.008619728,0.012570535,0.010669696,0.006486484,0.0023526575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014108303,0.00004342367,0.0017928521,0.00018864004,0.00003054888,0.000332699,0.002254551,0.008233579,0.0070978496,0.9480861,0.0020902138,0.02970845],"study_design_scores_gemma":[0.00011489086,0.0001895985,0.000537665,0.000333268,0.00013310173,0.000719315,0.0005068104,0.07059957,0.036899354,0.7900064,0.099730596,0.00022945512],"about_ca_topic_score_codex":0.0032986735,"about_ca_topic_score_gemma":0.0034023956,"teacher_disagreement_score":0.0077179973,"about_ca_system_score_codex":0.0020461797,"about_ca_system_score_gemma":0.0041299183,"threshold_uncertainty_score":0.04081714},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022843994,0.00089050306,0.42763662,0.002246521,0.0010562824,0.00057829847,0.00795129,0.18446246,0.35233405],"genre_scores_gemma":[0.21499647,0.0013691224,0.26158094,0.0024588814,0.0003400999,0.0007408252,0.025157725,0.04400728,0.44934872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998319,0.00021351785,0.00012845811,0.00030924304,0.0008097607,0.00022010412],"domain_scores_gemma":[0.99694186,0.00058798277,0.00016093375,0.0012603226,0.0007959626,0.00025289378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019140553,0.000651281,0.0005039503,0.0011701877,0.0008853054,0.0028115339,0.002119377,0.001247113,0.10745291],"category_scores_gemma":[0.005307959,0.0009252099,0.00084918377,0.00093430583,0.001077655,0.00481015,0.0043352754,0.0018500985,0.039093588],"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.0013356444,0.00023573534,0.0048883082,0.0010858786,0.00007871916,0.0005630869,0.0011126715,0.004510576,0.024482198,0.3554783,0.2764116,0.32981732],"study_design_scores_gemma":[0.00009896097,0.00010473115,0.0007371797,0.00010792436,0.000027429802,0.00038975183,0.000094446594,0.011029471,0.007817372,0.034565933,0.9449851,0.000041647218],"about_ca_topic_score_codex":0.0029037667,"about_ca_topic_score_gemma":0.0036791784,"teacher_disagreement_score":0.10745291,"about_ca_system_score_codex":0.001142603,"about_ca_system_score_gemma":0.0021187328,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005186878,0.000066650384,0.9917527,0.00020040065,0.000042646443,0.00007054072,0.00005310413,0.0017092833,0.0009178599],"genre_scores_gemma":[0.2443049,0.00023147516,0.7503478,0.00039749607,0.000092670314,0.00031053077,0.00032160812,0.000701149,0.0032924036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528426,0.0013664467,0.00043059443,0.00052409014,0.0018600642,0.00053462107],"domain_scores_gemma":[0.99139434,0.0047970186,0.00066574896,0.0014001213,0.0013164819,0.0004263248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007984689,0.0010483409,0.000919234,0.0016513814,0.0016058161,0.003891241,0.002821416,0.0017671107,0.003889705],"category_scores_gemma":[0.016340435,0.0012568317,0.0032011108,0.00063443254,0.0042732996,0.007793564,0.005637745,0.0050804997,0.00090583396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034486936,0.00020168905,0.0012284411,0.0005249723,0.00013178163,0.0007404193,0.0020045328,0.08519285,0.019785201,0.8083124,0.0033627702,0.07817013],"study_design_scores_gemma":[0.0001590787,0.00013243253,0.00014612493,0.00013198769,0.00013947795,0.0002657011,0.00028965494,0.44300056,0.027906174,0.50946355,0.01827956,0.00008557225],"about_ca_topic_score_codex":0.0046669296,"about_ca_topic_score_gemma":0.0054747136,"teacher_disagreement_score":0.007984689,"about_ca_system_score_codex":0.0021319876,"about_ca_system_score_gemma":0.003950869,"threshold_uncertainty_score":0.042227566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075583104,0.00019793485,0.9837991,0.00024401095,0.00004864926,0.000115209645,0.000044328488,0.0042597014,0.0037327926],"genre_scores_gemma":[0.08198247,0.00060311554,0.91340554,0.00022014319,0.000049159247,0.00028005673,0.00027032016,0.0012502924,0.0019388319],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969891,0.0010087242,0.0002547605,0.00035799213,0.0011900297,0.00019942087],"domain_scores_gemma":[0.9953949,0.0025024684,0.00022826178,0.0012693497,0.000540029,0.00006492357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030193527,0.0010425518,0.000654521,0.0010364436,0.00055873685,0.0022988904,0.0017062909,0.0010237449,0.0037325413],"category_scores_gemma":[0.008604363,0.0009648707,0.0014727259,0.00068214396,0.0024496268,0.0032065883,0.0019156074,0.002737158,0.0014348892],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018595281,0.0002548783,0.00210662,0.00094837614,0.000121976074,0.00043945215,0.00091373676,0.27375108,0.055717856,0.3098015,0.005398299,0.35036036],"study_design_scores_gemma":[0.00009669288,0.00020519726,0.00032277594,0.00028669406,0.0000883831,0.00023690313,0.00013916235,0.66894615,0.078601465,0.18880115,0.062205568,0.00006983869],"about_ca_topic_score_codex":0.0013704317,"about_ca_topic_score_gemma":0.0012373974,"teacher_disagreement_score":0.0037325413,"about_ca_system_score_codex":0.00095794996,"about_ca_system_score_gemma":0.0020856168,"threshold_uncertainty_score":0.015968025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054390654,0.00028684566,0.9800024,0.00048604832,0.00026553922,0.0002421909,0.00089358847,0.0032993308,0.009085058],"genre_scores_gemma":[0.23011886,0.0011645268,0.7371976,0.0016418193,0.00035832066,0.0007717246,0.003564548,0.0036674824,0.021515204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905372,0.001967606,0.0011892779,0.0018482272,0.0036293187,0.0008282939],"domain_scores_gemma":[0.9853968,0.0037341244,0.00083118945,0.00733964,0.002406325,0.00029188095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072135776,0.0013730844,0.0011672575,0.0020620918,0.0019680134,0.0074329795,0.0040775435,0.0022826663,0.009913754],"category_scores_gemma":[0.025727855,0.001685383,0.0024503784,0.0023921893,0.003847194,0.012644162,0.0069484888,0.004412373,0.0037196847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007657699,0.000033355955,0.0017351286,0.00021348125,0.000041973257,0.00016377826,0.0010088941,0.0029446774,0.0037234311,0.9210965,0.007998823,0.060963325],"study_design_scores_gemma":[0.00005252539,0.00008128575,0.0006128668,0.00035639005,0.00013045999,0.00091908104,0.0004716491,0.025930308,0.02509421,0.6714591,0.27476344,0.0001286593],"about_ca_topic_score_codex":0.003461229,"about_ca_topic_score_gemma":0.0030711477,"teacher_disagreement_score":0.009913754,"about_ca_system_score_codex":0.0025375928,"about_ca_system_score_gemma":0.0041643633,"threshold_uncertainty_score":0.038149476},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032722282,0.000105197585,0.9865376,0.00041083817,0.00008679765,0.00008005148,0.000061485975,0.00062726525,0.008818572],"genre_scores_gemma":[0.17295353,0.0006307233,0.8104641,0.0011749552,0.00022724604,0.00041348697,0.0002890621,0.0010583733,0.012788541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589396,0.0010905429,0.00030906493,0.0009831407,0.0012478061,0.00047547105],"domain_scores_gemma":[0.9930379,0.002127289,0.00026816007,0.0030300878,0.0013463049,0.00019029691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051361253,0.0008438207,0.00090184074,0.001142591,0.0021544942,0.003913875,0.002350492,0.0013946301,0.010823763],"category_scores_gemma":[0.010166831,0.0011295924,0.0016978291,0.0011316242,0.0059040035,0.010142134,0.0058996896,0.0049823946,0.0040773926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003478036,0.000023214101,0.00057843904,0.0001492141,0.000015535674,0.00009086694,0.00071937696,0.0026510803,0.0074754236,0.95340705,0.0016154731,0.033239663],"study_design_scores_gemma":[0.000035165565,0.00012121025,0.00026814535,0.0001748403,0.00008879084,0.0004054194,0.00037509098,0.034145012,0.030262932,0.8346445,0.09940392,0.0000749172],"about_ca_topic_score_codex":0.0028309787,"about_ca_topic_score_gemma":0.0030564591,"teacher_disagreement_score":0.010823763,"about_ca_system_score_codex":0.0012580258,"about_ca_system_score_gemma":0.003462293,"threshold_uncertainty_score":0.036209047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030610242,0.00016360724,0.99157155,0.000356647,0.000065844215,0.000029230874,0.00005859568,0.00059437123,0.0040991157],"genre_scores_gemma":[0.15611103,0.00048095683,0.8352021,0.0005717359,0.00023777128,0.00023804308,0.00015020007,0.0005921853,0.0064158523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957268,0.001332636,0.00036903372,0.0006728829,0.0013166355,0.00058200123],"domain_scores_gemma":[0.99530244,0.0013575895,0.00031352296,0.001983693,0.0007895049,0.00025334695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005895804,0.000904879,0.000870129,0.0024770845,0.001746314,0.005373516,0.0030782088,0.0013565562,0.005152161],"category_scores_gemma":[0.0074939155,0.0015019436,0.0037836218,0.0018851892,0.0056490204,0.014044255,0.0071050455,0.0055673528,0.0014515899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002602839,0.000018646624,0.0003533451,0.000056758927,0.000030863765,0.000071898365,0.0005501179,0.004242665,0.002272053,0.9779158,0.0007019685,0.013759857],"study_design_scores_gemma":[0.000012485202,0.000031234224,0.00017668345,0.00006512832,0.00005126984,0.00013774562,0.000094405936,0.037618365,0.004806569,0.936444,0.020519411,0.000042662083],"about_ca_topic_score_codex":0.002893912,"about_ca_topic_score_gemma":0.003159111,"teacher_disagreement_score":0.005895804,"about_ca_system_score_codex":0.002709826,"about_ca_system_score_gemma":0.0022048906,"threshold_uncertainty_score":0.031180382},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22944756,0.0034902715,0.70041,0.00792623,0.0007029045,0.00026869267,0.0019773026,0.03745646,0.01832061],"genre_scores_gemma":[0.7114571,0.0007613419,0.27504763,0.0025902786,0.00015331064,0.00022933762,0.0019397578,0.005088289,0.002732973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9741168,0.0066517065,0.0015424299,0.0034259257,0.011563371,0.0026997104],"domain_scores_gemma":[0.89958906,0.058623094,0.0064785015,0.021454822,0.012807063,0.0010473599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013597466,0.0013446452,0.0010813171,0.0020506654,0.002332864,0.004437492,0.00367279,0.0024855835,0.0039657154],"category_scores_gemma":[0.07862045,0.0008330477,0.001650432,0.0021450142,0.005464722,0.0087335445,0.0035099501,0.0040669264,0.0014601175],"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.00244419,0.0004638631,0.046473943,0.003466212,0.00045749545,0.0009935728,0.0034957388,0.088406056,0.07607496,0.22881581,0.045367163,0.50354105],"study_design_scores_gemma":[0.00027258662,0.0012037292,0.013716843,0.0016491696,0.00041350696,0.0015493897,0.001666992,0.38229057,0.25567725,0.24178044,0.09924737,0.0005320976],"about_ca_topic_score_codex":0.011301578,"about_ca_topic_score_gemma":0.0124463,"teacher_disagreement_score":0.013597466,"about_ca_system_score_codex":0.003001976,"about_ca_system_score_gemma":0.008735709,"threshold_uncertainty_score":0.071911156},"labels":[],"label_agreement":null}]}