{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":167,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":167,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"4599bf974945","filters":{"venue":"ACM SIGPLAN Notices"}},"results":[{"id":"W4242946001","doi":"10.1145/1103845.1094852","title":"X10","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":293,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Uniprocessor system; Computer science; Scalability; Synchronization (alternating current); Programming paradigm; Multiprocessing; Partitioned global address space; Distributed computing; Construct (python library); Node (physics); Parallel computing; Programming language; Operating system; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01662160194682793,"gpt":0.2513658921889296,"spread":0.2347442902421016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001516074,0.00009712558,0.0001180032,0.00003509174,0.00008407718,0.0001888973,0.00145227,0.00004420535,0.00003634487],"category_scores_gemma":[0.00006850418,0.00008257155,0.00003632011,0.0001770875,0.00001898452,0.0005923026,0.0001874059,0.0000791116,0.000842883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001589762,"about_ca_system_score_gemma":0.00002144647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003444729,"about_ca_topic_score_gemma":0.00004397355,"domain_scores_codex":[0.999119,0.00002512444,0.0001674184,0.0002542843,0.0001991475,0.0002350555],"domain_scores_gemma":[0.9989304,0.0001016181,0.00007067953,0.0007806229,0.00003623304,0.00008047585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001669964,0.0003075145,0.008827047,0.00008130776,0.00008021457,0.0001133555,0.003195398,0.002878663,0.002169182,0.2091263,0.1302429,0.6429614],"study_design_scores_gemma":[0.0004158386,0.00005572742,0.01003877,0.00003809597,0.000006127868,0.00002446366,0.00004312401,0.03666357,0.001572622,0.0008994553,0.9499002,0.0003420583],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4074455,0.003731313,0.4004494,0.03687444,0.003659339,0.0006894187,0.00009669714,0.002093958,0.14496],"genre_scores_gemma":[0.9756184,0.000004609361,0.02269336,0.0006652075,0.0002685111,0.0000056358,0.000004981414,0.000004634409,0.0007346156],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8196572,"threshold_uncertainty_score":0.9999351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075309900","doi":"10.1145/780822.781144","title":"Points-to analysis using BDDs","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Binary decision diagram; Computer science; Algorithm; Solver; Model checking; Simple (philosophy); Data structure; Satisfiability; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.06622918099250913,"gpt":0.3433915543306719,"spread":0.2771623733381628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283228,0.0001092747,0.000165473,0.0003012512,0.0001173514,0.0001652101,0.001224951,0.00004885476,0.00004708087],"category_scores_gemma":[0.001208546,0.0001034982,0.00006770328,0.001752858,0.00002183022,0.0005219423,0.0001629124,0.00007826877,0.0001376313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004138868,"about_ca_system_score_gemma":0.00003346005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004362945,"about_ca_topic_score_gemma":0.00001851834,"domain_scores_codex":[0.9987395,0.0002006686,0.0002075138,0.0003447376,0.0002605015,0.0002471062],"domain_scores_gemma":[0.9983224,0.0001944949,0.0001057287,0.001199745,0.00006801157,0.0001096736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003279378,0.0002756882,0.08883579,0.00008034414,0.0009629363,0.00005314311,0.008501492,0.05759178,0.01358148,0.7786648,0.00093464,0.05048516],"study_design_scores_gemma":[0.0006271422,0.0003073334,0.08120882,0.00005066688,0.0008079,0.00002754931,0.0005558912,0.778128,0.08902867,0.01753822,0.03009633,0.001623427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.199494,0.0000357055,0.7971858,0.0001717979,0.0003116712,0.00008122967,0.000001634325,0.00009313916,0.002625059],"genre_scores_gemma":[0.4034988,7.982972e-7,0.5961462,0.000292726,0.00001784247,0.000002519672,8.894544e-7,0.000003896265,0.00003632284],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7611265,"threshold_uncertainty_score":0.4220535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969599528","doi":"10.1145/1925844.1926390","title":"Pick your contexts well","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":167,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Context (archaeology); Object (grammar); Sensitivity (control systems); Abstraction; Implementation; Quality (philosophy); Theoretical computer science; Allocator; Method; Programming language; Object-oriented programming; Artificial intelligence; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.06018896433042852,"gpt":0.262159894383952,"spread":0.2019709300535235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002538961,0.000142261,0.000169901,0.00005899163,0.0001050054,0.0001462494,0.001721127,0.00007637167,0.0001166116],"category_scores_gemma":[0.00008476935,0.0001106907,0.00005652992,0.0001464642,0.00004711075,0.0004060004,0.0003071516,0.0001018933,0.001735957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001169258,"about_ca_system_score_gemma":0.0000291361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005090481,"about_ca_topic_score_gemma":0.0001229323,"domain_scores_codex":[0.9988696,0.00006259669,0.0002014759,0.0003401788,0.0002030153,0.0003231202],"domain_scores_gemma":[0.9987252,0.0001000059,0.0001315542,0.0008751256,0.00005528975,0.0001128042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002802057,0.0002900161,0.06445945,0.000100036,0.000107997,0.0002672448,0.01723467,0.000004375299,0.0002790508,0.8318488,0.008711943,0.07666837],"study_design_scores_gemma":[0.002668291,0.001687017,0.1191533,0.00004338583,0.0001053097,0.0001819336,0.001314781,0.002636718,0.01358401,0.2039375,0.6524619,0.002225817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1394454,0.002846049,0.2212838,0.001109623,0.008092388,0.001159614,0.000004365095,0.00203849,0.6240202],"genre_scores_gemma":[0.9911226,0.000005325855,0.006703849,0.0003011027,0.0001573669,0.000009270137,0.000002139931,0.000008640995,0.001689681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8516772,"threshold_uncertainty_score":0.9990413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952568606","doi":"10.1145/2499370.2462177","title":"Quipper","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quantum computer; Quantum; Theoretical computer science; Quantum algorithm; Programming language; Scalability; Set (abstract data type); Quantum gate; Computation; Computer engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01088186685814538,"gpt":0.2256192025983448,"spread":0.2147373357401995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009982515,0.0001175896,0.000110705,0.00006070099,0.0001248176,0.0003037976,0.001592141,0.00004117817,0.00009226002],"category_scores_gemma":[0.00009276658,0.00008900699,0.00004189062,0.0001824333,0.00003050931,0.0003430514,0.0004787711,0.0001331673,0.001008812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006289017,"about_ca_system_score_gemma":0.00001893096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002098134,"about_ca_topic_score_gemma":0.000005507933,"domain_scores_codex":[0.999065,0.00003705408,0.0001313627,0.0002905464,0.0001865448,0.0002894872],"domain_scores_gemma":[0.9987913,0.0002449405,0.00005505024,0.000771787,0.00004065454,0.00009620328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003901564,0.0001860403,0.008498588,0.00006625892,0.0000803174,0.00007537036,0.006780613,0.006697356,0.003851433,0.03142342,0.04452417,0.8978125],"study_design_scores_gemma":[0.0004087831,0.000207094,0.05668442,0.00005277504,0.000008599056,0.00005099196,0.0001189544,0.8865494,0.001738517,0.03011932,0.02341538,0.0006457545],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9491757,0.0002122484,0.03751232,0.008456367,0.0007726345,0.0001664823,0.000001395708,0.0004989133,0.003203926],"genre_scores_gemma":[0.8936769,0.000001915068,0.1049359,0.0009883675,0.0001820029,0.000006654481,0.000001396529,0.000007034932,0.0001999198],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8971668,"threshold_uncertainty_score":0.999769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3137917418","doi":"10.1145/1735971.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Thread (computing); Shared memory; Multi-core processor; Gang scheduling; Cache; Parallel computing; Fair-share scheduling; Quality of service; Two-level scheduling; Operating system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.05763234658827183,"gpt":0.3106199538624083,"spread":0.2529876072741365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042673,0.0001382585,0.0001583429,0.0001941663,0.0001503815,0.0003078371,0.001243657,0.0001139737,0.00001025475],"category_scores_gemma":[0.0006797953,0.0001323365,0.00003462631,0.0003571717,0.00004179953,0.0005948588,0.0002908172,0.0003427312,0.0000166431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000146572,"about_ca_system_score_gemma":0.00003229492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006651406,"about_ca_topic_score_gemma":0.00008889824,"domain_scores_codex":[0.9987949,0.00005958202,0.0002787905,0.0003852417,0.0002125267,0.0002689537],"domain_scores_gemma":[0.9988658,0.000232813,0.0001831355,0.0005570026,0.00009076084,0.00007043697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002295894,0.0012827,0.1944523,0.0007777875,0.0001118262,0.0003083952,0.02609301,0.2117653,0.1190986,0.01344885,0.002518911,0.4299128],"study_design_scores_gemma":[0.0004391472,0.00003611333,0.009221734,0.0001680484,0.000004707197,0.000009729604,0.00006368412,0.9819892,0.006106503,0.001107876,0.0005834851,0.0002697948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5046285,0.0001087395,0.4918439,0.0008331998,0.0002675928,0.0002400761,0.000001732242,0.0008148978,0.001261295],"genre_scores_gemma":[0.6960797,0.000001498311,0.3036597,0.0001475963,0.00004727692,0.000008600587,0.000008801224,0.000007948876,0.00003877637],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7702239,"threshold_uncertainty_score":0.5396525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109819183","doi":"10.1145/1925844.1926432","title":"Delay-bounded scheduling","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Concurrency; Scheduling (production processes); Context switch; Distributed computing; Bounded function; Limiting; Parallel computing; Task (project management); Programming language; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.06042743518341133,"gpt":0.2581025017501475,"spread":0.1976750665667362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005867406,0.0002213053,0.0002525531,0.0001492835,0.0001997171,0.000346301,0.00277712,0.0001154709,0.0000806584],"category_scores_gemma":[0.0003378062,0.0002005187,0.00008188079,0.0003657595,0.0000550618,0.001393474,0.000583077,0.0002006098,0.001046076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003474991,"about_ca_system_score_gemma":0.00008647583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004657067,"about_ca_topic_score_gemma":0.00005098856,"domain_scores_codex":[0.998078,0.0001109005,0.000384882,0.0005568305,0.0003754954,0.000493898],"domain_scores_gemma":[0.9976686,0.0002889667,0.000223289,0.001540156,0.00009811026,0.0001808329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001787793,0.0009439961,0.1033575,0.0007069092,0.0009254321,0.002046495,0.07027536,0.002797632,0.02826047,0.6804489,0.002042558,0.1080159],"study_design_scores_gemma":[0.0064501,0.00185481,0.09931529,0.001471488,0.0003715259,0.001440012,0.004757797,0.5577734,0.1449174,0.1568263,0.01678208,0.008039826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7624238,0.0004326929,0.1958317,0.0003553016,0.001563774,0.0003140763,0.000002175417,0.0008169248,0.03825952],"genre_scores_gemma":[0.6736229,0.000003214308,0.3259805,0.0001395449,0.0001224051,0.000009353673,0.000001684658,0.00001429884,0.0001061026],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5549758,"threshold_uncertainty_score":0.9997317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3005523836","doi":"10.1145/583854.582436","title":"Design pattern implementation in Java and aspectJ","year":2002,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"AspectJ; Computer science; Modularity (biology); Programming language; Composability; Java; Software design pattern; Reusability; Locality; Implementation; Design pattern; Aspect-oriented programming; Object-oriented programming; Compiler; Software engineering; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.08859055418377597,"gpt":0.319533329656488,"spread":0.230942775472712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002888358,0.00009263728,0.00010335,0.00009255554,0.00003330082,0.0000659661,0.000465516,0.00002972918,0.00002309341],"category_scores_gemma":[0.0003372455,0.00008872749,0.000008926904,0.0001536635,0.0000171466,0.0004493022,0.0001730123,0.00008050971,0.00001869567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000207659,"about_ca_system_score_gemma":0.000003728366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003192078,"about_ca_topic_score_gemma":0.00002616815,"domain_scores_codex":[0.9992308,0.0001038569,0.0001348949,0.0002332024,0.0001049843,0.0001922763],"domain_scores_gemma":[0.9983171,0.001265042,0.00004799083,0.0003264965,0.00001170435,0.00003172686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000003333218,0.00003066296,0.02010231,0.00003831607,0.00001505103,0.00008937463,0.005900722,0.02797956,0.001359232,0.0008741262,0.0004488776,0.9431584],"study_design_scores_gemma":[0.004678851,0.00128039,0.4877697,0.0002008519,0.00004640604,0.0001371035,0.001730035,0.3506701,0.04459031,0.1040205,0.002148885,0.002726898],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03340803,0.0003540844,0.9653675,0.0004205291,0.0001350543,0.0001023717,8.417032e-7,0.000175973,0.0000356236],"genre_scores_gemma":[0.5442417,0.00003099565,0.4556007,0.00008506795,0.00001898167,0.000007523735,6.014584e-7,0.000004652216,0.000009700566],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9404315,"threshold_uncertainty_score":0.3618202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4238275896","doi":"10.1145/1103845.1094839","title":"Adding trace matching with free variables to AspectJ","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"AspectJ; Computer science; Programming language; TRACE (psycholinguistics); Compiler; Semantics (computer science); Aspect-oriented programming; Programmer; Feature (linguistics); Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02970843314310803,"gpt":0.2764361334019181,"spread":0.2467277002588101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000430824,0.0001923508,0.0002073285,0.0001222401,0.0001218466,0.0001772341,0.002289466,0.00005204592,0.00001276709],"category_scores_gemma":[0.00161562,0.000160427,0.00002497777,0.00036306,0.00002160489,0.0009064815,0.0005839158,0.0001870111,0.00005666911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005354976,"about_ca_system_score_gemma":0.00002990361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002803123,"about_ca_topic_score_gemma":0.00006298441,"domain_scores_codex":[0.998679,0.00006211802,0.0001719359,0.0004276795,0.0002670386,0.000392165],"domain_scores_gemma":[0.9963252,0.002235112,0.00007406453,0.00121231,0.00003965575,0.0001136868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001886958,0.00002776987,0.0002326668,0.00003147846,0.00003539863,0.00004515108,0.003358056,0.9130607,0.002376965,0.02432284,0.0007204213,0.05576971],"study_design_scores_gemma":[0.007865668,0.00379881,0.05102878,0.002748723,0.0003548208,0.000953796,0.004186063,0.08300098,0.1745918,0.3944024,0.2647882,0.01227991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.026531,0.0001926434,0.9696307,0.001625089,0.0002188948,0.0001167091,0.000004686588,0.0009121613,0.0007680911],"genre_scores_gemma":[0.1942677,0.000003155062,0.8051732,0.0002511201,0.0001607051,0.00001210939,8.032239e-7,0.00001715434,0.0001139796],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8300597,"threshold_uncertainty_score":0.6542025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295265000","doi":"10.1145/1064978.1065026","title":"Optimising aspectJ","year":2005,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"AspectJ; Computer science; Compiler; Programming language; Aspect-oriented programming; Optimizing compiler; Context (archaeology); Compile time; Implementation; Java; Just-in-time compilation; Code (set theory); Overhead (engineering); Software; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.0471053546590998,"gpt":0.3028725758971136,"spread":0.2557672212380138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003418935,0.0001278119,0.0001379689,0.00009496357,0.00008144289,0.0001308303,0.001599585,0.00005060357,0.00001537113],"category_scores_gemma":[0.001848434,0.0001182755,0.00003474862,0.0002386704,0.00002956136,0.0008275816,0.0004179097,0.0001425556,0.0001329002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000389814,"about_ca_system_score_gemma":0.000019775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004726232,"about_ca_topic_score_gemma":0.000004210227,"domain_scores_codex":[0.9990109,0.00005094753,0.0001472681,0.0002967316,0.0002010041,0.0002931191],"domain_scores_gemma":[0.9976161,0.001365781,0.00006139957,0.0008527356,0.00003538281,0.00006858745],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005377894,0.00003342229,0.0003452802,0.00002187441,0.00002565511,0.00004099593,0.001303379,0.6613349,0.002252162,0.01737403,0.000987726,0.3162752],"study_design_scores_gemma":[0.002960954,0.0007950107,0.03220451,0.0003692008,0.0001027554,0.000374011,0.0005267741,0.3370101,0.2275527,0.17657,0.2162934,0.005240642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01150473,0.0004345089,0.9839927,0.001466667,0.0003734944,0.00005275121,8.199863e-7,0.0009603,0.001214007],"genre_scores_gemma":[0.2123762,0.00001017223,0.7870838,0.0002246044,0.0001671521,0.000003051521,7.623456e-7,0.000008755852,0.0001255297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3243248,"threshold_uncertainty_score":0.4823136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3005412289","doi":"10.1145/354222.353189","title":"Practical virtual method call resolution for Java","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bytecode; Call graph; Java; Program analysis; Static analysis; Variable (mathematics); Benchmark (surveying); Class hierarchy; Call stack; Theoretical computer science; Hierarchy; Dependence analysis; Class (philosophy); Programming language; Algorithm; Computer engineering; Object-oriented programming; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06052537541571937,"gpt":0.3429938513744404,"spread":0.282468475958721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008015313,0.0001348445,0.0001800895,0.00004819782,0.0001713299,0.0002296949,0.0007918599,0.0001150711,0.00005722971],"category_scores_gemma":[0.0004859537,0.0001093806,0.00007177574,0.0001577299,0.0000359789,0.0005240059,0.0001100895,0.0001197969,0.0003111536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002675839,"about_ca_system_score_gemma":0.00006385519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001763181,"about_ca_topic_score_gemma":0.00006409672,"domain_scores_codex":[0.9985633,0.0001707522,0.0002386993,0.0004129527,0.0002533374,0.0003609261],"domain_scores_gemma":[0.9980795,0.001000944,0.0001003076,0.0006451492,0.00006444343,0.0001095885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000103511,0.0001979442,0.0003083603,0.00005305128,0.00006771935,0.00004835775,0.001901868,0.000349454,0.0002474353,0.6199812,0.02887674,0.3478643],"study_design_scores_gemma":[0.0009684415,0.001029396,0.0008132626,0.000009129275,0.00005513541,0.0001034174,0.0001296069,0.1076601,0.001064595,0.02154554,0.866105,0.0005164822],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001555145,0.00009994361,0.9877062,0.002339825,0.0005594414,0.0003591681,0.000002848976,0.0002459721,0.007131476],"genre_scores_gemma":[0.641682,0.000007622456,0.3546941,0.000429071,0.0003957677,0.00004325415,0.0000120451,0.00001167653,0.002724496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8372282,"threshold_uncertainty_score":0.446041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4240517907","doi":"10.1145/2499368.2451157","title":"Traffic management","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Locality; Operating system; Linux kernel; Page fault; Embedded system; Virtual memory; Memory management; Overlay","retraction":null,"screen_n_in":null,"score":{"opus":0.01576817122047086,"gpt":0.2423602508148654,"spread":0.2265920795943945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001051272,0.00009271738,0.00008464562,0.00008833365,0.00008954587,0.0002465367,0.001401474,0.00003190642,0.00005227649],"category_scores_gemma":[0.00002280167,0.00008095075,0.0000281862,0.0001978806,0.00001758919,0.0003753803,0.0003298688,0.00005794811,0.0005088128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001044991,"about_ca_system_score_gemma":0.000006303623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001570948,"about_ca_topic_score_gemma":0.000001212018,"domain_scores_codex":[0.999243,0.00003197117,0.0001357323,0.0002412927,0.0001537348,0.0001942989],"domain_scores_gemma":[0.9991126,0.00008531836,0.00005791197,0.000649601,0.00003643565,0.00005811467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005524331,0.0002259216,0.0009122207,0.00009567916,0.00009769267,0.00005039312,0.001534498,0.0702313,0.00007956307,0.07050299,0.1359312,0.720333],"study_design_scores_gemma":[0.0004835142,0.000211274,0.01240813,0.00006571961,0.00001658957,0.00001295493,0.00008749672,0.9467897,0.0008548484,0.01148911,0.02690705,0.0006735963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07769699,0.00021473,0.8654793,0.00380046,0.0004494708,0.000501128,7.570148e-7,0.002567909,0.04928926],"genre_scores_gemma":[0.6282851,0.00001400091,0.3707028,0.0004292995,0.00002615476,0.00001705052,0.000001865144,0.000004264725,0.0005195145],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8765584,"threshold_uncertainty_score":0.6539928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245783794","doi":"10.1145/1961296.1950391","title":"Flikker","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dram; Embedded system; Correctness; Energy consumption; Software; Operating system; Computer hardware; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05171605834278985,"gpt":0.2596344905854311,"spread":0.2079184322426413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001516498,0.00008568075,0.00008578247,0.00006887743,0.0000808434,0.00006886499,0.001429838,0.00004245745,0.00004802425],"category_scores_gemma":[0.00008956739,0.00007433014,0.00002888933,0.0001694191,0.00002390818,0.000313304,0.0003180762,0.00006903036,0.0001722091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006546,"about_ca_system_score_gemma":0.0000173989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004742466,"about_ca_topic_score_gemma":0.00000363361,"domain_scores_codex":[0.9993258,0.00003535829,0.0001254397,0.0002213459,0.0001199272,0.0001721235],"domain_scores_gemma":[0.9990692,0.00007854024,0.00006629476,0.0006868664,0.00004271709,0.00005634948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005547546,0.0007106618,0.04403261,0.00009406472,0.0001687929,0.0002585378,0.02659952,0.002018025,0.0008209073,0.6213903,0.09462969,0.2092214],"study_design_scores_gemma":[0.001714896,0.001167899,0.1066296,0.0002000925,0.00006708239,0.0001181325,0.0002244303,0.5536787,0.08609016,0.1530542,0.09395666,0.003098173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01235043,0.0001178778,0.9142653,0.0003317168,0.0003212281,0.00008748715,8.509844e-7,0.001272257,0.07125284],"genre_scores_gemma":[0.5552609,0.000005845943,0.4440716,0.0003561925,0.00002900605,0.000003007688,0.000001068486,0.000004098079,0.0002682906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5516607,"threshold_uncertainty_score":0.3031095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136271630","doi":"10.1145/1925844.1926389","title":"Points-to analysis with efficient strong updates","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Singleton; Flow (mathematics); Set (abstract data type); Program analysis; Compiler; Sensitivity (control systems); Abstract interpretation; Optimizing compiler; Key (lock); Static analysis; Quadratic equation; Theoretical computer science; Algorithm; Programming language; Mathematics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02764097134449946,"gpt":0.2537133634451165,"spread":0.2260723921006171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002422109,0.0001368502,0.0001832777,0.0003173065,0.0001146001,0.0001277821,0.001466302,0.00003455942,0.00004225537],"category_scores_gemma":[0.00006303409,0.0001054573,0.00005022077,0.001103602,0.00002814928,0.000153248,0.0003421787,0.00007345026,0.00007487021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001551269,"about_ca_system_score_gemma":0.00002383209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001184765,"about_ca_topic_score_gemma":0.00004698025,"domain_scores_codex":[0.9988948,0.00005350658,0.0001716053,0.0003909536,0.0002327123,0.0002564828],"domain_scores_gemma":[0.9986914,0.0001012076,0.0001031822,0.0008927716,0.00009170921,0.0001197096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001538079,0.0007277576,0.1568592,0.00004558945,0.0014768,0.0001368226,0.01641106,0.7276919,0.0001083828,0.07323623,0.004913261,0.0182392],"study_design_scores_gemma":[0.0004149247,0.0006250069,0.07477708,0.0000527756,0.0003112314,0.000006199763,0.0001961684,0.9108617,0.0100231,0.000858896,0.001010485,0.0008624777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0850456,0.0000246562,0.9092016,0.0003139073,0.00005012275,0.0001040027,0.000002306217,0.0004952582,0.004762609],"genre_scores_gemma":[0.597808,8.110551e-7,0.4019384,0.0001913246,0.00001113601,0.00000454859,0.000003304878,0.000004368844,0.00003804745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5127624,"threshold_uncertainty_score":0.4300424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3003432522","doi":"10.1145/2248487.2150989","title":"Cosmic rays don't strike twice","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Dram; Computer science; Set (abstract data type); Terabyte; Memory errors; Field (mathematics); Soft error; Range (aeronautics); Reliability engineering; Computer hardware; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01032953240259595,"gpt":0.2262867329616512,"spread":0.2159572005590553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002185358,0.0001552796,0.0001413691,0.00007508868,0.00005402544,0.0000375717,0.0003589678,0.00008908532,0.0001547167],"category_scores_gemma":[0.0001799053,0.0001563603,0.00003579764,0.0001658432,0.0000209218,0.0003719821,0.00003304537,0.0002115544,0.0004469518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009794703,"about_ca_system_score_gemma":0.00001358138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001794388,"about_ca_topic_score_gemma":0.0000196812,"domain_scores_codex":[0.9990272,0.00003447863,0.0001552594,0.0001108452,0.0001694991,0.0005026956],"domain_scores_gemma":[0.998925,0.0004769153,0.00003803465,0.0004287765,0.00001529686,0.0001160183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005900408,0.000198592,0.03085115,0.0005526022,0.0005022695,0.00001580825,0.003659689,0.794919,0.0204208,0.006637535,0.08285824,0.05932537],"study_design_scores_gemma":[0.002152237,0.0003539999,0.06235588,0.00009984311,0.0003366149,0.00005613567,0.0004206981,0.3060034,0.04931821,0.001242655,0.5754876,0.002172735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9818372,0.003453624,0.0007885339,0.00008702553,0.001361419,0.0001785435,0.00001524185,0.0006189047,0.01165958],"genre_scores_gemma":[0.9980527,0.00004685226,0.00113534,0.0001273429,0.0004722889,0.000013657,0.00002225581,0.00004222229,0.00008739459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4926294,"threshold_uncertainty_score":0.637619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156742168","doi":"10.1145/1133255.1133995","title":"Shared memory programming for large scale machines","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Compiler; Parallel computing; Scalability; Runtime system; Distributed memory; Partitioned global address space; Optimizing compiler; Programming paradigm; Shared memory; Asynchronous communication; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01619749730491173,"gpt":0.2706697248421612,"spread":0.2544722275372495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003038517,0.0001344237,0.0001484988,0.00009193389,0.0002326226,0.0002973919,0.001145434,0.00006016236,0.000006619784],"category_scores_gemma":[0.0001004309,0.0001212194,0.00006413255,0.0002055972,0.00001630287,0.0003549987,0.0002593284,0.00006644915,0.00001385814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001338203,"about_ca_system_score_gemma":0.00002271309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007072561,"about_ca_topic_score_gemma":0.00006824447,"domain_scores_codex":[0.9989443,0.00003449328,0.0002112688,0.0003425105,0.0001575303,0.0003098985],"domain_scores_gemma":[0.9989849,0.0002252624,0.0001214482,0.0005387689,0.0000843899,0.00004524892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001703813,0.002332238,0.05903796,0.0009913475,0.0001858453,0.00008632223,0.006661803,0.05804057,0.00236835,0.1483219,0.2544597,0.4673436],"study_design_scores_gemma":[0.0009412487,0.0001755737,0.004394231,0.00006802235,0.00002092846,0.00001037342,0.00003990509,0.9400597,0.004225667,0.01153463,0.03794223,0.0005874585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009586799,0.0002539396,0.9854754,0.0008057432,0.0002205688,0.0003558628,0.00001531837,0.001191476,0.002094943],"genre_scores_gemma":[0.3277956,0.000001304735,0.6713005,0.0001868656,0.0001595967,0.00004118439,0.00004401911,0.00001065339,0.0004603205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8820192,"threshold_uncertainty_score":0.4943184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113401164","doi":"10.1145/1993316.1993573","title":"Synchronization via scheduling","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Electronic Arts (Canada); Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Software transactional memory; Transactional memory; Programmer; Debugging; Scheduling (production processes); Rollback; Distributed computing; Parallel computing; Synchronization (alternating current); Programming language; Database transaction","retraction":null,"screen_n_in":null,"score":{"opus":0.03181491806750968,"gpt":0.237042772319435,"spread":0.2052278542519253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000159829,0.00009975871,0.0001128484,0.00004391103,0.0001026166,0.0001046403,0.001107715,0.00005402951,0.00005233134],"category_scores_gemma":[0.00007891658,0.00008930278,0.00002837291,0.0002432126,0.00002142607,0.0006226713,0.0001660493,0.00007105842,0.0002714903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001589909,"about_ca_system_score_gemma":0.00002445444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001141736,"about_ca_topic_score_gemma":0.00001857435,"domain_scores_codex":[0.9991504,0.00003216474,0.0001805688,0.0002621814,0.0001658765,0.0002088212],"domain_scores_gemma":[0.9990635,0.00005196036,0.0001049023,0.000645311,0.00006633272,0.00006802312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005543249,0.0007286405,0.07485189,0.0004379448,0.0002529,0.0003741874,0.02127072,0.004317829,0.003919062,0.3413109,0.004103071,0.5483774],"study_design_scores_gemma":[0.001321058,0.0003601902,0.04939254,0.0003128166,0.00004761176,0.00008963372,0.0003352087,0.9017051,0.00986217,0.01795934,0.01716885,0.001445496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02917667,0.0002692173,0.961287,0.0001470366,0.0006418843,0.00009904691,0.000004336265,0.0002375507,0.008137309],"genre_scores_gemma":[0.9399221,0.000003468957,0.05978478,0.0001271277,0.00008152738,0.000005554306,0.000007261333,0.000005879203,0.00006229382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9107454,"threshold_uncertainty_score":0.3641661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3161455369","doi":"10.1145/949343.949320","title":"Dynamic metrics for java","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency; Just-in-time compilation; Java; Suite; Programming language; Benchmark (surveying); Set (abstract data type); Metric (unit)","retraction":null,"screen_n_in":null,"score":{"opus":0.02608503985579406,"gpt":0.2884924635516347,"spread":0.2624074236958406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003671051,0.0001040807,0.0001218765,0.0001552084,0.0001330532,0.0001496358,0.001035561,0.00005635864,0.000006066539],"category_scores_gemma":[0.0009661418,0.00009617789,0.00004800429,0.000430472,0.00001741844,0.0002255442,0.0001028392,0.00006199099,0.00002153011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002142943,"about_ca_system_score_gemma":0.00003856742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005454035,"about_ca_topic_score_gemma":0.00000345713,"domain_scores_codex":[0.9991465,0.00005019097,0.0001639805,0.0002738285,0.0001421787,0.0002233175],"domain_scores_gemma":[0.9985982,0.0005663252,0.00009696961,0.0005951803,0.00008633597,0.00005696218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002941149,0.0004816232,0.005539598,0.0002301524,0.0001653727,0.00003163971,0.002132747,0.05244216,0.0007508338,0.7469526,0.05574808,0.1354958],"study_design_scores_gemma":[0.0005434999,0.0002332029,0.0005559557,0.0000238632,0.00001894839,0.00001294528,0.00002867125,0.8841853,0.00492219,0.03399312,0.07499053,0.000491769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002195907,0.0002853506,0.992269,0.0003573817,0.0002864231,0.0001595154,0.000002699047,0.0004563574,0.003987402],"genre_scores_gemma":[0.3834939,0.00001449811,0.6159104,0.0002499619,0.000009728303,0.000009802488,0.000003775928,0.000006203598,0.0003017497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8317431,"threshold_uncertainty_score":0.392202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3003638206","doi":"10.1145/2858965.2814272","title":"Static analysis of event-driven Node.js JavaScript applications","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; JavaScript; Event (particle physics); Asynchronous communication; Callback; Suite; Node (physics); Programming language; False positive paradox; Operating system; Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06467412276819863,"gpt":0.3154442103194611,"spread":0.2507700875512625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003596684,0.00009998948,0.0002237647,0.000268755,0.00008435727,0.00009510845,0.001589153,0.00004422149,0.00001538265],"category_scores_gemma":[0.0001982691,0.00009830991,0.00008557984,0.001430805,0.00004872773,0.0003131249,0.0002580435,0.00008142395,0.00006235818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002944625,"about_ca_system_score_gemma":0.00008455559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001258889,"about_ca_topic_score_gemma":0.00003960709,"domain_scores_codex":[0.9987579,0.00008371214,0.0003405334,0.0003109075,0.0003328243,0.0001741344],"domain_scores_gemma":[0.9979119,0.0003904861,0.0002660413,0.001109565,0.0002045509,0.0001174234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004601881,0.00142263,0.133358,0.000285891,0.003871353,0.00001999785,0.05043469,0.3314785,0.002178132,0.3756104,0.01664795,0.08464635],"study_design_scores_gemma":[0.0003264497,0.00006425692,0.01425891,0.00001872787,0.0003858276,0.000001985876,0.0005494297,0.9634152,0.001071482,0.003885498,0.01574869,0.000273535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04107443,0.0001887459,0.9556363,0.001146225,0.0002179805,0.0001881239,0.00001970367,0.000141383,0.001387155],"genre_scores_gemma":[0.9344875,0.000005111051,0.06507675,0.0002933066,0.00004465982,0.00002059054,0.00002914519,0.000004602815,0.00003834837],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8934131,"threshold_uncertainty_score":0.4008962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096199323","doi":"10.1145/2103621.2103693","title":"Verification of parameterized concurrent programs by modular reasoning about data and control","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Thread (computing); Parameterized complexity; Modular design; Programming language; Separation logic; Control flow; Theoretical computer science; Boolean data type; Bounded function; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.06308417104739514,"gpt":0.3242422977401453,"spread":0.2611581266927502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172158,0.0001201611,0.0001971962,0.00003937486,0.00006623196,0.0001056112,0.001507103,0.00006279999,0.000002877764],"category_scores_gemma":[0.0008190322,0.0001085262,0.00001734556,0.0001508954,0.0001033471,0.001380139,0.0003241736,0.00009195229,0.000006906635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001255564,"about_ca_system_score_gemma":0.00001622773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000316507,"about_ca_topic_score_gemma":7.785889e-7,"domain_scores_codex":[0.9986913,0.0002031192,0.00029262,0.0003209602,0.0002371628,0.0002548179],"domain_scores_gemma":[0.9977568,0.0002350381,0.0003258169,0.001525804,0.00005655298,0.00009998709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006789812,0.0004205197,0.04349889,0.0002440053,0.0001210207,9.000793e-7,0.003146964,0.00002323415,0.08765104,0.03653207,0.0004293951,0.8278641],"study_design_scores_gemma":[0.002406484,0.000432286,0.08029246,0.0002193216,0.0001665546,0.00002124073,0.0002334658,0.8490624,0.04113866,0.0005874996,0.0246565,0.000783085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3559749,0.002209338,0.6406469,0.0001210308,0.0004584014,0.0003718115,0.00004921147,0.00009487668,0.00007342538],"genre_scores_gemma":[0.6662638,0.00003303651,0.3335456,0.00002990389,0.00003113193,0.00001683286,0.00007078557,0.000005226948,0.000003685882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8490392,"threshold_uncertainty_score":0.4425569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062757415","doi":"10.1145/2103621.2103705","title":"Programming with binders and indexed data-types","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Decidability; Type safety; Operational semantics; Data type; Type theory; Undecidable problem; Modular design; Programming language specification; Theoretical computer science; Semantics (computer science); Type (biology); Programming paradigm; Inductive programming; Programming domain","retraction":null,"screen_n_in":null,"score":{"opus":0.05305382815606168,"gpt":0.2724485179284469,"spread":0.2193946897723852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004822317,0.0001498416,0.0001628212,0.0000661957,0.0001437617,0.0003163709,0.001323052,0.0000648015,0.000004993522],"category_scores_gemma":[0.0000932859,0.0001018973,0.00001274224,0.0002163077,0.00009096431,0.001315851,0.0006218902,0.000110538,0.00004718273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009200497,"about_ca_system_score_gemma":0.0000318525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001840371,"about_ca_topic_score_gemma":0.0001133897,"domain_scores_codex":[0.9987632,0.00005616505,0.0001426413,0.0003564359,0.0002499084,0.0004316182],"domain_scores_gemma":[0.9984398,0.0001720405,0.0001180048,0.001081662,0.00003209314,0.0001564231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002844242,0.0001959069,0.6098045,0.0001782375,0.000173372,0.00005068145,0.006502413,0.00001032918,0.00006504782,0.09263907,0.000815217,0.2895368],"study_design_scores_gemma":[0.003553555,0.001530024,0.1363606,0.00009054058,0.0003296771,0.0006512923,0.003190489,0.007272134,0.001395587,0.006574751,0.836189,0.002862361],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6318148,0.01166196,0.3325734,0.003649182,0.003891716,0.002562078,0.00001344341,0.002430388,0.01140296],"genre_scores_gemma":[0.9749521,0.000007882682,0.02463321,0.0001070149,0.0001777822,0.00001036795,0.00001699121,0.00001015407,0.00008448317],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8353738,"threshold_uncertainty_score":0.4155251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014903559","doi":"10.1145/1449955.1449790","title":"Enabling static analysis for partial java programs","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Java; Source code; Static analysis; Partial evaluation; Class (philosophy); Type inference; Theoretical computer science; Inference; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06896249739321578,"gpt":0.3043800919129288,"spread":0.235417594519713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003412063,0.0001249169,0.0002058139,0.0002590169,0.0001652833,0.000165715,0.001341289,0.00004606538,0.00001164237],"category_scores_gemma":[0.001614672,0.0001132786,0.0001086046,0.001090309,0.00004560559,0.0003558971,0.0002214657,0.0001038143,0.00003973754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002801943,"about_ca_system_score_gemma":0.00006557773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007462241,"about_ca_topic_score_gemma":0.00001863125,"domain_scores_codex":[0.9985294,0.00003408556,0.0002001295,0.00038254,0.0003934983,0.0004603306],"domain_scores_gemma":[0.9969975,0.001893797,0.0000599266,0.0008164934,0.0001026531,0.0001296629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006614842,0.0004418065,0.8242965,0.0003178919,0.001788397,0.0003148462,0.009430123,0.06461251,0.0006392539,0.002881629,0.002298619,0.09291222],"study_design_scores_gemma":[0.001590839,0.0008681183,0.1406096,0.00005772374,0.0003689723,0.00003522962,0.0001681639,0.8258957,0.007036089,0.001108123,0.02108869,0.001172793],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4386524,0.0001186826,0.560078,0.000337687,0.0001668367,0.0002593463,0.000004115231,0.0003619586,0.00002089176],"genre_scores_gemma":[0.8801646,0.00000722582,0.1194761,0.00004604763,0.00009770052,0.00007063814,0.00001788065,0.00001084332,0.0001090279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7612832,"threshold_uncertainty_score":0.4619366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108650361","doi":"10.1145/1411203.1411218","title":"A type-preserving compiler in Haskell","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Haskell; Compiler; Programming language; Mathematical proof; Optimizing compiler; Type (biology); Functional programming","retraction":null,"screen_n_in":null,"score":{"opus":0.06064749100290676,"gpt":0.2688792115612433,"spread":0.2082317205583366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002393916,0.0001198477,0.0001771264,0.0000949954,0.0001126312,0.00009906365,0.001568827,0.00006896148,0.00003651177],"category_scores_gemma":[0.0001580497,0.0001003787,0.00003379686,0.0003716791,0.00004608915,0.0004007814,0.0004343642,0.0001353456,0.0004013577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001942527,"about_ca_system_score_gemma":0.0000451717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006269907,"about_ca_topic_score_gemma":0.0003421947,"domain_scores_codex":[0.9988675,0.00007964751,0.0002076032,0.0003107212,0.0002244555,0.0003100666],"domain_scores_gemma":[0.9988073,0.0002169505,0.00008286778,0.0007730349,0.00004778685,0.00007212866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000570174,0.0005533213,0.7554055,0.0002466874,0.00008329675,0.001578765,0.0218366,0.0009429659,0.001028085,0.1731444,0.02587103,0.01925231],"study_design_scores_gemma":[0.003775482,0.001121317,0.4064852,0.00009680332,0.00003125439,0.0004751917,0.0007681245,0.07387786,0.002810358,0.05398034,0.4541704,0.002407696],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8779001,0.002300826,0.0319358,0.00169827,0.003211336,0.0007250803,0.000001763873,0.0008134545,0.08141337],"genre_scores_gemma":[0.9940282,0.00001460382,0.004978806,0.000214754,0.0001160126,0.000006319939,0.000003401389,0.000007622627,0.0006302783],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4282993,"threshold_uncertainty_score":0.5158776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3005050519","doi":"10.1145/2980983.2908096","title":"From Datalog to flix: a declarative language for fixed points on lattices","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Datalog; Computer science; Programming language; Semantics (computer science); Syntax; Compiler; Declarative programming; Theoretical computer science; Programming paradigm; Artificial intelligence; Inductive programming","retraction":null,"screen_n_in":null,"score":{"opus":0.04392462176471745,"gpt":0.2999157988836089,"spread":0.2559911771188915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002821944,0.0001722483,0.0002133655,0.00007795012,0.000109132,0.0002170787,0.001597615,0.00007505062,0.00003336915],"category_scores_gemma":[0.0007005428,0.0001042579,0.00005456377,0.0001366411,0.00003095629,0.0004644914,0.0003173046,0.00005240667,0.0008074815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002621709,"about_ca_system_score_gemma":0.00002944606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003251761,"about_ca_topic_score_gemma":0.0004050442,"domain_scores_codex":[0.9986255,0.00007891463,0.0001991366,0.0005348153,0.0002299023,0.000331719],"domain_scores_gemma":[0.9972165,0.001474728,0.0001311329,0.0009888952,0.00005380102,0.0001350058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005052465,0.0005689363,0.008118883,0.0001616689,0.0005232471,0.0002553376,0.0596462,0.00002249036,0.02746667,0.3706754,0.04766801,0.4843879],"study_design_scores_gemma":[0.009624802,0.006137772,0.03002473,0.0004539866,0.0002194304,0.00002580103,0.004592267,0.003141956,0.1373125,0.2110369,0.5935833,0.003846491],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3531575,0.0003577601,0.6280727,0.009361824,0.002483139,0.001616183,0.0003119954,0.0006569075,0.003981909],"genre_scores_gemma":[0.9686536,0.000001535329,0.02939678,0.0008236697,0.0003879483,0.00006282266,0.00003541972,0.00001231897,0.0006259317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.615496,"threshold_uncertainty_score":0.9999705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4229576726","doi":"10.1145/1273442.1250769","title":"Path invariants","year":2007,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Predicate abstraction; Computer science; Predicate (mathematical logic); Path (computing); Abstract interpretation; Program analysis; Theoretical computer science; Abstraction; Counterexample; Spurious relationship; Path expression; Programming language; Control flow; Invariant (physics); Control flow graph; Algorithm; Model checking; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04224519862286649,"gpt":0.3124832385447945,"spread":0.2702380399219281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246982,0.0000876136,0.00008746413,0.00008134698,0.00008819819,0.000104859,0.001614366,0.00005873319,0.00001958121],"category_scores_gemma":[0.0007308235,0.00007862862,0.00002279486,0.0002920099,0.00003097261,0.0006943063,0.0002740879,0.0001034202,0.0002599894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002150935,"about_ca_system_score_gemma":0.00002369372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003159519,"about_ca_topic_score_gemma":0.00001273324,"domain_scores_codex":[0.9990126,0.0000539345,0.0001941603,0.0002451134,0.0002320185,0.0002621461],"domain_scores_gemma":[0.9985136,0.0003216535,0.0001077848,0.0009321974,0.00004361581,0.00008113057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00003427447,0.0001320131,0.01234378,0.00006378168,0.00002839676,0.000103025,0.00338301,0.00004974196,0.007315532,0.6356798,0.002201135,0.3386655],"study_design_scores_gemma":[0.001265641,0.000570662,0.6975767,0.0001306372,0.00003573124,0.0001077818,0.0004490192,0.06420723,0.1162136,0.05512417,0.06286389,0.001454965],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07827275,0.00007626291,0.9043868,0.0002980086,0.000946864,0.0001084956,0.000001568726,0.000232413,0.01567684],"genre_scores_gemma":[0.4623894,0.000002724732,0.5371617,0.0003030533,0.00006931418,0.00000152907,0.000001374312,0.000003790068,0.00006708102],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6852329,"threshold_uncertainty_score":0.3341724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3148573243","doi":"10.1145/2858788.2688521","title":"On optimizing machine learning workloads via kernel fusion","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"Nvidia","keywords":"Computer science; Kernel (algebra); Scalability; Locality; Parallel computing; Matrix multiplication; Computation; Range (aeronautics); Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03233663507408029,"gpt":0.2699771110886107,"spread":0.2376404760145304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005363111,0.0001790892,0.0001780208,0.0001562999,0.0001969712,0.0002324509,0.001311822,0.00008463556,0.00001248452],"category_scores_gemma":[0.0004703137,0.0001584108,0.00004484956,0.0003281715,0.00002589893,0.000334295,0.0005632535,0.0002867362,0.0001346564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000413062,"about_ca_system_score_gemma":0.0000357739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000753057,"about_ca_topic_score_gemma":0.000004973843,"domain_scores_codex":[0.9986045,0.0001446502,0.0002188191,0.0003942506,0.0003508588,0.0002869525],"domain_scores_gemma":[0.9986106,0.0003445991,0.0001631732,0.0006311318,0.00009000061,0.0001605437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007133963,0.0001630476,0.003961464,0.00002027498,0.0000309728,0.0000682125,0.002869463,0.907451,0.0002930863,0.006462612,0.006552627,0.07205588],"study_design_scores_gemma":[0.0003699113,0.0002943965,0.0002073689,0.00006974993,0.000005999413,0.00001116257,0.00002375453,0.9913529,0.00128385,0.003514178,0.002584126,0.0002826329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01780638,0.0003490953,0.9710273,0.0008483063,0.0003717444,0.0001134995,6.665e-7,0.001297684,0.008185295],"genre_scores_gemma":[0.6843567,0.00001836412,0.3147604,0.0004065202,0.0000706536,0.000004028832,0.000008819362,0.0000124678,0.0003620587],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6665503,"threshold_uncertainty_score":0.6459804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3157431840","doi":"10.1145/2544174.2500591","title":"Wellfounded recursion with copatterns","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Normalization (sociology); Rewriting; Recursion (computer science); Programming language; Theoretical computer science; Functional programming; Data type; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02353269379013488,"gpt":0.2382345287073475,"spread":0.2147018349172126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001500487,0.0001397659,0.000148979,0.00005559158,0.0001196295,0.0004172003,0.001214749,0.00005825741,0.0001121686],"category_scores_gemma":[0.00004021318,0.00009290432,0.00002873934,0.000177974,0.00004290804,0.0006381841,0.0002030233,0.0001001699,0.001479401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001888568,"about_ca_system_score_gemma":0.00002710177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008305237,"about_ca_topic_score_gemma":0.000133195,"domain_scores_codex":[0.9988821,0.00005872222,0.000153264,0.0003368391,0.0002678098,0.0003013255],"domain_scores_gemma":[0.9987535,0.0001441857,0.0001206445,0.0008012577,0.00007681164,0.000103545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000648653,0.000635407,0.2595938,0.0004689766,0.0002537047,0.0003242859,0.01210449,0.0001533729,0.002188501,0.3492715,0.04854739,0.3263937],"study_design_scores_gemma":[0.005738706,0.005498723,0.2124757,0.0002087433,0.0001361952,0.0004758699,0.002228088,0.02392885,0.01367514,0.1666386,0.564743,0.004252391],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5627036,0.0006009797,0.3670302,0.007094877,0.002879265,0.001721446,0.000002308669,0.001453247,0.05651404],"genre_scores_gemma":[0.9911054,0.000004067303,0.007312872,0.0003527627,0.000126663,0.00002750443,0.000004772754,0.000009258487,0.001056695],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5161957,"threshold_uncertainty_score":0.999298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077845927","doi":"10.1145/2775052.2661090","title":"Using JavaScript and WebCL for numerical computations","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"JavaScript; Computer science; Unobtrusive JavaScript; Programming language; Computation; Code (set theory); Web application; Variety (cybernetics); Rich Internet application; World Wide Web; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05326982129687474,"gpt":0.3120641831897885,"spread":0.2587943618929137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002233157,0.00009206725,0.0001284194,0.00007214952,0.0002113422,0.0001858416,0.0005195422,0.00004070136,0.000001525254],"category_scores_gemma":[0.0002588925,0.00008674201,0.00002807063,0.0001360876,0.00003039239,0.0002257068,0.0001869069,0.00005111297,0.00000403311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009251882,"about_ca_system_score_gemma":0.00001832397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002375463,"about_ca_topic_score_gemma":0.000001438396,"domain_scores_codex":[0.9992759,0.00005509846,0.0001489133,0.000254352,0.00009823257,0.0001675632],"domain_scores_gemma":[0.9989755,0.0004917689,0.00008398781,0.0003180899,0.00006644712,0.00006425843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003931036,0.00031032,0.01167967,0.0002690165,0.0001343645,0.000007100298,0.004219708,0.3879307,0.00128459,0.3672671,0.02023461,0.2066236],"study_design_scores_gemma":[0.0001744238,0.00006606953,0.0006616497,0.00001451166,0.000007870836,0.000006340837,0.000007213819,0.9863313,0.0002537634,0.00721518,0.005136386,0.000125291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006494258,0.00007043462,0.9917233,0.0006124639,0.0001511299,0.0001140131,0.000001807753,0.0003138748,0.0005187039],"genre_scores_gemma":[0.4491369,0.000001766434,0.5504786,0.00030662,0.00004618788,0.00000330109,0.000002851598,0.000004473345,0.00001921833],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5984007,"threshold_uncertainty_score":0.3537236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953181121","doi":"10.1145/3140587.3062348","title":"HoTTSQL: proving query rewrites with univalent SQL semantics","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Alberta Innovates - Technology Futures; U.S. Department of Energy; National Science Foundation","keywords":"Computer science; SQL; Query optimization; Programming language; Query language; Conjunctive query; Query by Example; Sargable; Spatial query; Undecidable problem; Tuple; Null (SQL); Database; Theoretical computer science; Decidability; Relational database; Information retrieval; Web search query; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02599575075013483,"gpt":0.2683679918576917,"spread":0.2423722411075568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002374403,0.0001939826,0.000225997,0.00005909186,0.0006727945,0.0004341943,0.001720553,0.00004782054,0.000006306486],"category_scores_gemma":[0.000371356,0.000142988,0.00003381027,0.00007106595,0.0001439771,0.002137587,0.0008317932,0.0001386125,0.0000418548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001988449,"about_ca_system_score_gemma":0.00007646748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003289742,"about_ca_topic_score_gemma":0.0004893783,"domain_scores_codex":[0.9986675,0.00004137713,0.0002011692,0.0004421581,0.0003096389,0.000338136],"domain_scores_gemma":[0.9966364,0.0002160283,0.0003507975,0.002602286,0.00009081487,0.0001036636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001601083,0.0003449613,0.1866436,0.001331634,0.0002794475,0.001629384,0.005677477,0.0007466878,0.005875223,0.7120877,0.005146126,0.08007769],"study_design_scores_gemma":[0.004404003,0.001977737,0.2370141,0.004230317,0.0002295206,0.0005433786,0.003281021,0.03754807,0.04074556,0.00619025,0.6588828,0.004953253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.512901,0.0009604167,0.4614033,0.009300852,0.0019318,0.00103836,0.0001175871,0.001036562,0.01131014],"genre_scores_gemma":[0.8049952,0.0000303445,0.1940191,0.0001136837,0.0001846765,0.00001100283,0.00000973529,0.00001724532,0.0006189373],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7058974,"threshold_uncertainty_score":0.583088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3012478566","doi":"10.1145/1035292.1029002","title":"Recovering binary class relationships","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Programming language; Class (philosophy); Binary number; Theoretical computer science; Software; Object-oriented programming; Programming complexity; Software development; Software construction; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04904132694768226,"gpt":0.2737487482202274,"spread":0.2247074212725451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003665924,0.0001028097,0.00009324044,0.0001530424,0.0001514305,0.0001632148,0.001375961,0.00006671239,0.00001102291],"category_scores_gemma":[0.002591972,0.0001019979,0.00003216584,0.0004532888,0.00002511162,0.0006683036,0.000415225,0.0003082601,0.0004059092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008938719,"about_ca_system_score_gemma":0.00007304438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005094037,"about_ca_topic_score_gemma":0.00001696167,"domain_scores_codex":[0.9989383,0.0000391847,0.0001400626,0.0002905188,0.0002982754,0.0002936189],"domain_scores_gemma":[0.9974133,0.001531217,0.00003758182,0.0008765983,0.0000393768,0.0001018891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00004141907,0.0003228993,0.2737312,0.0002918872,0.0001584709,0.0008503314,0.007480829,0.5619505,0.0066582,0.1134139,0.004691791,0.03040855],"study_design_scores_gemma":[0.001677595,0.0004700077,0.9120151,0.0003235029,0.00002011543,0.0001025989,0.0001762018,0.02742116,0.007191741,0.03010929,0.01926698,0.00122567],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8912668,0.0002730438,0.1024346,0.003103174,0.0007159582,0.0001498863,0.000002801339,0.0009123631,0.001141384],"genre_scores_gemma":[0.9238369,0.000007609233,0.07588512,0.00006062434,0.00008090324,0.000009194287,0.000003195852,0.00001175641,0.0001046326],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.638284,"threshold_uncertainty_score":0.5217277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148708444","doi":"10.1145/1149982.1149988","title":"A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Memoization; Recursion (computer science); Programming language; Backtracking; Time complexity; Parsing; Theoretical computer science; Algorithm; Modular design; Top-down parsing","retraction":null,"screen_n_in":null,"score":{"opus":0.007901481672039504,"gpt":0.2541193857042048,"spread":0.2462179040321653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965266,0.0001732248,0.0002086187,0.0002051683,0.00009859943,0.0003735596,0.001130284,0.0001012865,0.00001603446],"category_scores_gemma":[0.0001282754,0.0001582875,0.00002454997,0.0003063583,0.00002463878,0.0007425885,0.0007073591,0.000197138,0.00003246365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005676227,"about_ca_system_score_gemma":0.00005577965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002731031,"about_ca_topic_score_gemma":0.0003093828,"domain_scores_codex":[0.9986925,0.00006167944,0.0002318577,0.0004547423,0.000217313,0.0003419074],"domain_scores_gemma":[0.9990681,0.0001572812,0.00009110496,0.0005410443,0.00003041605,0.0001120382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000336535,0.00005505913,0.003580574,0.0000266504,0.00000570208,0.00009013443,0.001077366,0.00002111227,0.01405185,0.0005009876,0.01515768,0.9653992],"study_design_scores_gemma":[0.005073757,0.001620127,0.1220096,0.002309899,0.0001049972,0.0005133864,0.000163372,0.1085495,0.4846692,0.2105319,0.05885591,0.005598413],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6807165,0.004024692,0.2948066,0.01566724,0.0006515635,0.0008535496,0.00002890185,0.001685763,0.001565231],"genre_scores_gemma":[0.2988333,0.000003270201,0.7003128,0.0003909606,0.0001501226,0.000001663092,0.00000732811,0.000009616686,0.0002909141],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9598008,"threshold_uncertainty_score":0.6454776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029402327","doi":"10.1145/2578855.2535857","title":"Symbolic optimization with SMT solvers","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Satisfiability modulo theories; Symbolic execution; Programming language; Satisfiability; Set (abstract data type); Function (biology); Software; Theoretical computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01283092764887383,"gpt":0.2239901630927133,"spread":0.2111592354438395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002251337,0.0001136077,0.0001150183,0.00008365572,0.0001156402,0.0001727981,0.0009850543,0.0000444966,0.000006767318],"category_scores_gemma":[0.0005252382,0.00008922053,0.00001865496,0.0002319461,0.00003821594,0.000321724,0.0001604212,0.00007848445,0.00002567322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001237585,"about_ca_system_score_gemma":0.00002476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000831682,"about_ca_topic_score_gemma":0.000007359663,"domain_scores_codex":[0.9991769,0.00004493695,0.0001061908,0.0002752711,0.0001952991,0.0002013571],"domain_scores_gemma":[0.9984659,0.0005461148,0.00008769751,0.0007764141,0.00005902983,0.00006484133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009423465,0.000439522,0.2152406,0.0002839624,0.0001817588,0.0001047044,0.008341495,0.317078,0.000254881,0.06256419,0.09541269,0.3000039],"study_design_scores_gemma":[0.0004894094,0.0005242606,0.00567,0.0001575386,0.0000286441,0.00004051684,0.00001236426,0.972555,0.001149508,0.01568366,0.003107795,0.000581346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01001013,0.00002279854,0.9793479,0.0006486551,0.00011957,0.0000782982,5.782185e-7,0.006908721,0.002863351],"genre_scores_gemma":[0.5304784,0.000001458753,0.469084,0.0003481936,0.00004241918,0.000005548281,0.000002841291,0.000006973712,0.00003011867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6554769,"threshold_uncertainty_score":0.3638308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4239191916","doi":"10.1145/2398857.2384665","title":"Speculative analysis of integrated development environment recommendations","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Code refactoring; Source code; Eclipse; Programming language; Software engineering; Code (set theory); Domain (mathematical analysis); Semantics (computer science); Executable; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.04011398993521328,"gpt":0.2883590507156111,"spread":0.2482450607803978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675059,0.00009084794,0.0001562388,0.0003474163,0.00004367906,0.00002894477,0.0007265282,0.00003081632,0.0002348059],"category_scores_gemma":[0.0004775073,0.00007975972,0.00004294496,0.0008145202,0.00002448362,0.0003019143,0.0003101833,0.0000863899,0.00009381256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009412879,"about_ca_system_score_gemma":0.0000327672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003523238,"about_ca_topic_score_gemma":0.000007611719,"domain_scores_codex":[0.9990796,0.00004901404,0.0002011805,0.0001661132,0.0002671554,0.000236941],"domain_scores_gemma":[0.9982532,0.001008687,0.00007554181,0.0005372215,0.00003197364,0.00009332995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000008689055,0.0004264204,0.8739746,0.00003044854,0.002377269,0.000004560971,0.01577558,0.01055436,0.00129454,0.004337742,0.0009430837,0.09027278],"study_design_scores_gemma":[0.0001178339,0.00002767184,0.9542493,0.00001510426,0.0001077335,6.523156e-7,0.0001510542,0.009086379,0.008396662,0.00002906004,0.02761314,0.0002054527],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4788089,0.0001699952,0.5199729,0.0003851127,0.0001977969,0.0001245666,0.00001361425,0.0001091143,0.0002179502],"genre_scores_gemma":[0.7907737,0.00000546815,0.2090636,0.00001715913,0.00001312827,0.000006954966,0.00004057205,0.000004051482,0.00007527146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3119648,"threshold_uncertainty_score":0.3252507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4255914661","doi":"10.1145/1735971.1736038","title":"SherLog","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Unavailability; Task (project management); Code (set theory); Software; Software bug; Source code; Operating system; Server; Programming language; Software engineering; Reliability engineering; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01029332178757227,"gpt":0.2435370911879403,"spread":0.233243769400368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003266594,0.00009169649,0.0001127208,0.00004463744,0.0001109649,0.0001234585,0.001642534,0.00008802021,0.00005824281],"category_scores_gemma":[0.0002820005,0.00007130304,0.00004130492,0.0001720544,0.00004912927,0.0005233095,0.0002737769,0.0002079966,0.0005867693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005912511,"about_ca_system_score_gemma":0.00004008547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006683423,"about_ca_topic_score_gemma":0.00008281622,"domain_scores_codex":[0.9991345,0.00002227854,0.0001548447,0.000277704,0.0001907124,0.0002199213],"domain_scores_gemma":[0.9982876,0.0002506415,0.00006045063,0.001272869,0.0000491922,0.00007927055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00001871363,0.0002420394,0.591889,0.000214437,0.00005703227,0.00005952995,0.003717025,0.00009318153,0.01093006,0.01926704,0.01109179,0.3624202],"study_design_scores_gemma":[0.0009742244,0.0002944796,0.8101428,0.00005656232,0.00002397,0.00009961293,0.0001058485,0.01207119,0.01592302,0.01536684,0.1438783,0.001063188],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9858609,0.00004650863,0.004667184,0.001362223,0.002699951,0.0001149651,0.000001510587,0.0004111408,0.004835632],"genre_scores_gemma":[0.9750705,0.000002212784,0.02428562,0.0002734178,0.0002071625,0.000007606615,0.000001473445,0.000004697985,0.0001473459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.361357,"threshold_uncertainty_score":0.7541928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241907611","doi":"10.1145/2480359.2429075","title":"Copatterns","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Coinduction; Programming language; Soundness; Haskell; Functional programming; Data type; Data structure; Theoretical computer science; Pattern matching; Type (biology); Matching (statistics); Semantics (computer science); Sketch; Algorithm; Mathematical proof; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02893206053508614,"gpt":0.2500366596544939,"spread":0.2211045991194077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001342236,0.0001070515,0.0001222782,0.00004540114,0.000084092,0.0003899521,0.001444408,0.00005027371,0.00014838],"category_scores_gemma":[0.00007281418,0.00008095106,0.00003703805,0.000126756,0.00002718773,0.0005493429,0.0002910956,0.00007694233,0.003301853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001072984,"about_ca_system_score_gemma":0.00001707232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007310862,"about_ca_topic_score_gemma":0.00005198511,"domain_scores_codex":[0.9990752,0.00004449555,0.0001514325,0.0002636906,0.000192267,0.0002729386],"domain_scores_gemma":[0.9988708,0.0001458555,0.00008325271,0.0007554315,0.0000520729,0.00009261368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004763068,0.0002528759,0.1992261,0.0001906014,0.0001068266,0.0001280942,0.00650727,0.00006065556,0.001602254,0.4327215,0.06499825,0.2942008],"study_design_scores_gemma":[0.002143624,0.001151506,0.2760732,0.00004337884,0.00005921851,0.0001721607,0.0009448679,0.03115709,0.007035013,0.1864939,0.4921715,0.002554555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4928105,0.001218662,0.3882692,0.00914439,0.00632098,0.001613031,0.000003292469,0.002150624,0.09846925],"genre_scores_gemma":[0.9943276,0.000002734249,0.004039515,0.0005280848,0.0001724292,0.00002618938,0.000002855693,0.000006287944,0.0008943063],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5015171,"threshold_uncertainty_score":0.9974742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2997135906","doi":"10.1145/1932682.1869467","title":"Agility in context","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Agile software development; Grounded theory; Computer science; Context (archaeology); Knowledge management; Process management; Engineering management; Management science; Software engineering; Qualitative research; Sociology; Business; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01682338457458814,"gpt":0.2689305406292369,"spread":0.2521071560546488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004268944,0.00008858198,0.0001019693,0.00007200106,0.00003351089,0.0001213329,0.001304761,0.0000713761,0.00004029966],"category_scores_gemma":[0.001003868,0.00008035561,0.00002294973,0.0001887538,0.00002323753,0.0006368746,0.0002426791,0.0003216736,0.00005262156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007278759,"about_ca_system_score_gemma":0.00002140729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000307072,"about_ca_topic_score_gemma":0.0006388039,"domain_scores_codex":[0.9993072,0.0000277581,0.0001353421,0.0002281778,0.000122574,0.0001789081],"domain_scores_gemma":[0.9981875,0.0008527585,0.00005494151,0.0008273285,0.0000245852,0.00005288012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00004097197,0.000359482,0.1837794,0.0001184672,0.00003811312,0.0002736798,0.004866522,0.0002016338,0.008636199,0.2045413,0.004803956,0.5923403],"study_design_scores_gemma":[0.0009383243,0.0002739024,0.4618784,0.00007778417,0.00001590728,0.0000766032,0.0001176966,0.03030135,0.01721793,0.04257948,0.4453127,0.001209897],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9360385,0.0001465787,0.0558642,0.002844331,0.001275478,0.000168582,0.0000030483,0.0009571639,0.002702142],"genre_scores_gemma":[0.8883142,0.000004918215,0.1113382,0.0002478851,0.00004944024,0.000008098527,0.000001070038,0.000004528316,0.000031635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5911304,"threshold_uncertainty_score":0.3276807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128328132","doi":"10.1145/1639949.1640093","title":"Empirical assessment of object-oriented implementations with multiple inheritance and static typing","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Executable; Programming language; Compiler; Compile time; Just-in-time compilation; Java; Theoretical computer science; Inheritance (genetic algorithm); Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.04083546651247664,"gpt":0.3391471307351192,"spread":0.2983116642226425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001757009,0.00009906993,0.000156765,0.00005411881,0.00009739766,0.00008306083,0.000317125,0.00002462672,0.000003992232],"category_scores_gemma":[0.00006103216,0.00007448211,0.00001653045,0.0002352856,0.00003840584,0.0002860958,0.00006899428,0.00006539991,0.000001619615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000182109,"about_ca_system_score_gemma":0.00005785151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008770356,"about_ca_topic_score_gemma":0.0002002763,"domain_scores_codex":[0.9991231,0.00005788925,0.0002104882,0.0002371496,0.0001811235,0.0001902803],"domain_scores_gemma":[0.9991376,0.0002508537,0.0001526495,0.0003370229,0.0000615821,0.00006025211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002731025,0.0002971387,0.8648281,0.0001341241,0.00009134453,0.00003056063,0.00865346,0.0001986229,0.00128654,0.08291726,0.0004317135,0.0411039],"study_design_scores_gemma":[0.001978015,0.00184421,0.9516924,0.00004514651,0.00004946524,0.00002858625,0.002768908,0.02989025,0.0007724881,0.006159544,0.004305563,0.0004654437],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5867248,0.0001800093,0.410688,0.0007431137,0.0001397163,0.0003825685,0.000004416166,0.0001133447,0.001024117],"genre_scores_gemma":[0.9159973,0.000004861425,0.08378053,0.0001614501,0.00001943458,0.000008800544,0.000006697212,0.000003477945,0.00001746027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3292725,"threshold_uncertainty_score":0.3037292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4256519592","doi":"10.1145/2499368.2451124","title":"Power containers","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Server; Multi-core processor; Cloud computing; Operating system; Power management; Efficient energy use; Power (physics); Power budget; Embedded system; Distributed computing; Power control","retraction":null,"screen_n_in":null,"score":{"opus":0.01080499698835507,"gpt":0.2213848371067874,"spread":0.2105798401184324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001398012,0.0001088818,0.0001060413,0.00006572466,0.0001008233,0.0002752492,0.001544611,0.00003221498,0.0001142107],"category_scores_gemma":[0.0000871528,0.00008509526,0.00004241062,0.0001668297,0.00002845553,0.00005993512,0.0006653787,0.00008450977,0.001010082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001467353,"about_ca_system_score_gemma":0.00001007333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001657422,"about_ca_topic_score_gemma":0.000003863267,"domain_scores_codex":[0.9990731,0.00003656145,0.0001386764,0.0002751061,0.00020563,0.000270873],"domain_scores_gemma":[0.9988099,0.0001987909,0.00006504766,0.0008003574,0.00003992729,0.00008598599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001788468,0.0005617019,0.03166483,0.0001431454,0.0004377661,0.0002793812,0.01422078,0.01879198,0.00318555,0.2021799,0.3788164,0.3497007],"study_design_scores_gemma":[0.002372012,0.000858035,0.1625252,0.0001735017,0.00004519013,0.00004674175,0.002228497,0.4158857,0.001648374,0.02337368,0.3886504,0.002192718],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9337333,0.0001307538,0.008028399,0.008991236,0.0006048525,0.0002158881,3.922431e-7,0.0004452294,0.04784994],"genre_scores_gemma":[0.9875219,6.005106e-7,0.009565637,0.00141843,0.0000659795,0.000008121221,6.21954e-7,0.000006065661,0.001412648],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3970937,"threshold_uncertainty_score":0.9997677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4240790600","doi":"10.1145/1932682.1869518","title":"Refactoring references for library migration","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Engineering Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Code refactoring; Computer science; Programming language; Declaration; Set (abstract data type); Transformation (genetics); Source code; Feature (linguistics); Software engineering; Code (set theory); Key (lock); Program transformation; Software; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03467563794292089,"gpt":0.28359976719964,"spread":0.2489241292567191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001693696,0.00008694702,0.00008206661,0.00009895756,0.00008427863,0.0003155787,0.001430278,0.00006523854,0.00002433738],"category_scores_gemma":[0.001514598,0.00007502603,0.0000273263,0.000186826,0.00001822966,0.001119141,0.0002293994,0.0001816112,0.00003564806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005032998,"about_ca_system_score_gemma":0.00004862955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002600203,"about_ca_topic_score_gemma":0.00004880655,"domain_scores_codex":[0.9991967,0.00001317161,0.000112431,0.0002555101,0.0001945581,0.0002276085],"domain_scores_gemma":[0.9972413,0.001967512,0.00003898553,0.0006404185,0.00003433166,0.00007747288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00005959635,0.0001591013,0.5268252,0.0003915992,0.00009561923,0.0000332401,0.004545545,0.0004668117,0.08452667,0.0790614,0.02353588,0.2802993],"study_design_scores_gemma":[0.0009177143,0.000561909,0.4484041,0.0001104543,0.00001958427,0.00001683817,0.00009900819,0.04663037,0.191568,0.02350339,0.2869942,0.001174411],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9683586,0.00005613337,0.02741878,0.001813223,0.001213262,0.0001722614,0.000006868814,0.0006246649,0.0003361944],"genre_scores_gemma":[0.8524356,0.000004889584,0.1470324,0.00003901447,0.0002315008,0.00002552646,0.000009801028,0.000009640604,0.0002116444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2791249,"threshold_uncertainty_score":0.3059473,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W2113124751","doi":"10.1145/356989.357009","title":"OS and compiler considerations in the design of the IA-64 architecture","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Compiler; Instruction-level parallelism; Instruction set; Computer architecture; Exploit; Parallelism (grammar); Architecture; Addressing mode; Parallel computing; Programming language; Operating system; Instructions per cycle","retraction":null,"screen_n_in":null,"score":{"opus":0.02859106683194543,"gpt":0.265078318118973,"spread":0.2364872512870276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003079748,0.00007193659,0.00008737556,0.00003857928,0.0001378397,0.00009576026,0.000742248,0.00003227016,0.00002352312],"category_scores_gemma":[0.0001230539,0.00004006762,0.0000182984,0.0001835547,0.00008110789,0.00008319954,0.00008808642,0.0001200197,0.000002756303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003341454,"about_ca_system_score_gemma":0.00002774458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003658132,"about_ca_topic_score_gemma":0.00002278783,"domain_scores_codex":[0.9992073,0.0002695212,0.0001473734,0.0001419265,0.0001310035,0.0001028739],"domain_scores_gemma":[0.9984167,0.0009928736,0.00005840096,0.0004959017,0.00002113514,0.00001501477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002131554,0.0002004082,0.008322731,0.00004004691,0.00003469596,0.00001778857,0.02473349,0.8714036,0.0004028377,0.03310559,0.01786515,0.04385235],"study_design_scores_gemma":[0.001229414,0.0003495446,0.1224148,0.0002402014,0.00004119734,0.0001879641,0.0002324613,0.7193373,0.004808769,0.1428417,0.007621089,0.00069558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1439719,0.0008142382,0.8290278,0.01766275,0.0001518386,0.001046502,0.000009034813,0.0002845009,0.007031404],"genre_scores_gemma":[0.8830643,0.00001111413,0.115807,0.001055633,0.00001447281,0.000005944333,5.684726e-7,0.000002412723,0.00003857433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7390924,"threshold_uncertainty_score":0.163391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234512893","doi":"10.1145/2365864.2151039","title":"SecondSite","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Virtualization; Cloud computing; High availability; Virtual machine; Replication (statistics); Distributed computing; Computer network; Simple (philosophy); Operating system; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.0209380154092813,"gpt":0.2428657893768349,"spread":0.2219277739675536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002962246,0.00009554135,0.00009077153,0.00006268116,0.0001142784,0.0001145498,0.00122799,0.00003020984,0.00003503072],"category_scores_gemma":[0.00005742391,0.00007865659,0.00003935027,0.0001711127,0.00001742132,0.00007667408,0.000750675,0.00008378434,0.0005186457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001096771,"about_ca_system_score_gemma":0.000005882124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000210229,"about_ca_topic_score_gemma":0.000002671212,"domain_scores_codex":[0.999134,0.00003931296,0.000116039,0.0001815863,0.0001778846,0.0003511887],"domain_scores_gemma":[0.998889,0.0001757031,0.0000606396,0.0007502723,0.00001415081,0.0001102312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001210202,0.0005383657,0.09713872,0.000158142,0.0002127249,0.00006119272,0.01566563,0.003936808,0.0007290152,0.1097607,0.05136888,0.7204177],"study_design_scores_gemma":[0.0008721895,0.0001774156,0.1700282,0.00007583448,0.00005249601,0.00005103349,0.0003814436,0.07863904,0.002829833,0.002981924,0.7427751,0.001135502],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9540621,0.0008377458,0.008171149,0.00178329,0.001125095,0.00008779616,7.796028e-7,0.0004052861,0.03352675],"genre_scores_gemma":[0.9841301,0.000001351501,0.01360425,0.0007920763,0.0003414571,0.000002368281,9.27296e-7,0.000005555895,0.001121864],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7192823,"threshold_uncertainty_score":0.6666315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4238588277","doi":"10.1145/1508284.1508259","title":"RapidMRC","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Multi-core processor; Parallel computing; Cache algorithms; Overhead (engineering); Cache invalidation; Smart Cache; Process (computing); Software; Code (set theory); Operating system; CPU cache; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02070682735645182,"gpt":0.2700367176350224,"spread":0.2493298902785706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001672215,0.00009147431,0.00009953049,0.00007922452,0.00009917451,0.000156421,0.001397215,0.00004293235,0.0000121544],"category_scores_gemma":[0.0001230114,0.00008146329,0.00003259299,0.0002248605,0.00001385345,0.0003128703,0.0001241139,0.00007729513,0.00007580747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008948999,"about_ca_system_score_gemma":0.00001910298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006306586,"about_ca_topic_score_gemma":7.544493e-7,"domain_scores_codex":[0.9992597,0.00003731613,0.0001342328,0.0002318861,0.0001509758,0.000185856],"domain_scores_gemma":[0.9990504,0.0001151405,0.00006780104,0.0006675927,0.00004026228,0.0000587814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002184574,0.0003233452,0.002022902,0.00002224514,0.00003743824,0.00009586505,0.002403245,0.01489602,0.001701674,0.2414044,0.1051774,0.6318936],"study_design_scores_gemma":[0.001323907,0.001395862,0.03914593,0.0001410039,0.00002764863,0.00007402156,0.00004915911,0.6675673,0.03104842,0.1625974,0.09483474,0.001794658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008295741,0.0002799286,0.9570976,0.005490443,0.0002252184,0.0001025557,7.433196e-7,0.001599067,0.02690866],"genre_scores_gemma":[0.6723591,0.0000123338,0.3260057,0.001369613,0.00005507279,0.000001065284,0.000001953242,0.000002464193,0.0001926696],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6640634,"threshold_uncertainty_score":0.3321977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4249463296","doi":"10.1145/2775054.2694380","title":"Protecting Data on Smartphones and Tablets from Memory Attacks","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Computer science; Embedded system; Dram; Code (set theory); Class (philosophy); Operating system; Memory protection; Computer hardware; Physical address; Memory management; Semiconductor memory; Virtual memory; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1716073472514013,"gpt":0.3224399001503169,"spread":0.1508325528989156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161425,0.0001166478,0.0001291597,0.00005292579,0.0002072295,0.0003379119,0.002035772,0.00005712069,0.000007583916],"category_scores_gemma":[0.001193943,0.000107345,0.00001005331,0.0001611352,0.00003686694,0.00068929,0.001194978,0.0001972099,0.00008456827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001469469,"about_ca_system_score_gemma":0.00005291418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004630549,"about_ca_topic_score_gemma":0.00005348134,"domain_scores_codex":[0.9987176,0.0001192227,0.0001758388,0.0005407303,0.0002564034,0.0001902026],"domain_scores_gemma":[0.9971734,0.0009181791,0.000131969,0.001610071,0.00005189144,0.0001145279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002404141,0.0006824004,0.03680478,0.0002910973,0.0003203271,0.0002376586,0.07283261,0.003911156,0.004978475,0.0135537,0.07407238,0.792075],"study_design_scores_gemma":[0.002504608,0.0004793045,0.02595702,0.0004353115,0.00005590691,0.00005325338,0.003396417,0.8554562,0.01667294,0.01773163,0.07575139,0.00150605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9435481,0.00080799,0.0450578,0.005467496,0.001571097,0.0003418327,0.00003724382,0.0004573456,0.002711091],"genre_scores_gemma":[0.94968,0.000004499243,0.04937983,0.000530398,0.0003220369,0.000005007096,0.0000290855,0.000007467425,0.00004169979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.851545,"threshold_uncertainty_score":0.43774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3120062901","doi":"10.1145/1328897.1328483","title":"A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Syntax; Metaprogramming; Abstract syntax; Recursion (computer science); Substitution (logic); Class (philosophy); Functional programming; Theoretical computer science; Semantics (computer science); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03549497197042957,"gpt":0.2581122223749779,"spread":0.2226172504045484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001909964,0.0001545526,0.0001621104,0.00006727552,0.0004712189,0.0002358404,0.0004564106,0.00007126324,0.00001315075],"category_scores_gemma":[0.0001366194,0.0001155585,0.00002730514,0.0002755864,0.0001959535,0.0004651461,0.00007607388,0.00008271961,0.00004045593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002787856,"about_ca_system_score_gemma":0.00008555542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001597111,"about_ca_topic_score_gemma":0.0002499767,"domain_scores_codex":[0.9989559,0.0000209926,0.0001803898,0.0003576192,0.0001904772,0.0002946179],"domain_scores_gemma":[0.998863,0.0003296913,0.0001388667,0.0004308656,0.0001513771,0.00008618116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009103437,0.0002279556,0.01836144,0.0003957588,0.0001312524,0.00008852547,0.003038295,0.0002301324,0.0000720004,0.9351794,0.0004622131,0.04172202],"study_design_scores_gemma":[0.003829893,0.002875965,0.06937673,0.0001452741,0.0002510584,0.0006272877,0.0004830069,0.01047067,0.0007319351,0.03185398,0.877363,0.00199125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3627642,0.001362018,0.6170335,0.004547994,0.002447749,0.00327414,0.00000661693,0.001245969,0.00731773],"genre_scores_gemma":[0.9634989,0.00001799076,0.03594835,0.00005817904,0.0001198825,0.00007355229,0.00001717723,0.00001131616,0.0002546319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9033254,"threshold_uncertainty_score":0.471234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4248497488","doi":"10.1145/2914770.2837670","title":"Abstracting gradual typing","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Subtyping; Programming language; Exception handling; Typing; Type theory; Consistency (knowledge bases); Syntax; Type inference; Sophistication; Type safety; Language construct; Abstract interpretation; Artificial intelligence; Type (biology)","retraction":null,"screen_n_in":null,"score":{"opus":0.04552239643461935,"gpt":0.2721415908594423,"spread":0.226619194424823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372708,0.000111889,0.0001228411,0.00005416216,0.0001307489,0.0001894423,0.001084041,0.00005573607,0.00002220226],"category_scores_gemma":[0.000322509,0.00006877475,0.00004255708,0.0001202333,0.00003234717,0.0005886593,0.0002440865,0.00006912142,0.0006125497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001899344,"about_ca_system_score_gemma":0.00002738455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000961998,"about_ca_topic_score_gemma":0.00004167387,"domain_scores_codex":[0.9989845,0.00004404354,0.000187192,0.0003038035,0.0001709791,0.0003095029],"domain_scores_gemma":[0.9986573,0.0004816112,0.00014183,0.0005985778,0.00004202625,0.00007865649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009898848,0.00007291575,0.02563173,0.00006273685,0.00006264618,0.00008961938,0.002008049,0.00000956084,0.005287576,0.34502,0.002117353,0.619628],"study_design_scores_gemma":[0.004047845,0.001058771,0.107173,0.0002640396,0.0001028986,0.0004101238,0.001342697,0.002947605,0.03801306,0.2543089,0.5868099,0.003521198],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3471828,0.00103885,0.5757047,0.008690319,0.006625106,0.0006207862,0.000003448592,0.002047117,0.05808686],"genre_scores_gemma":[0.9946305,0.000005137255,0.004421425,0.000115638,0.0002821675,0.000005429589,7.741952e-7,0.000007490256,0.0005314745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6474476,"threshold_uncertainty_score":0.7873292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3004099993","doi":"10.1145/2499370.2462168","title":"Dynamic determinacy analysis","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Static analysis; Programming language; JavaScript; Soundness; Determinacy; Program analysis; Functional programming; Leverage (statistics); Source code; Scalability; Theoretical computer science; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01462332702158383,"gpt":0.2669698366788959,"spread":0.2523465096573121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001616206,0.0001290952,0.0001825894,0.0002560136,0.000103055,0.0003218251,0.001742852,0.00005310185,0.00005245527],"category_scores_gemma":[0.0005704339,0.0001098273,0.00008582063,0.000766006,0.00003435489,0.0005294134,0.0003860557,0.00009339131,0.0002948805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002058554,"about_ca_system_score_gemma":0.00001845244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005949347,"about_ca_topic_score_gemma":0.00004240784,"domain_scores_codex":[0.9989848,0.00004416082,0.000175346,0.0003422954,0.0001935395,0.0002598999],"domain_scores_gemma":[0.9977479,0.0007345052,0.0001020652,0.001258288,0.00007139637,0.00008587522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004539665,0.0002049322,0.3598177,0.00007220017,0.000573984,0.000119861,0.002205783,0.0005020872,0.0007218871,0.001875242,0.03933586,0.594566],"study_design_scores_gemma":[0.0001498608,0.0001350865,0.2869634,0.0000328798,0.0001874231,0.00001889668,0.00001298461,0.6364675,0.0004728249,0.07438529,0.0006209712,0.0005528936],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5483116,0.0002054375,0.4320019,0.001822935,0.0002510135,0.0002437019,0.000003042766,0.01535736,0.001802998],"genre_scores_gemma":[0.6909605,0.000002139396,0.3086038,0.0002788594,0.00001138773,0.00001842062,0.000003404878,0.00000509248,0.0001164318],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6359654,"threshold_uncertainty_score":0.4478626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3015862912","doi":"10.1145/2480359.2429086","title":"Inductive data flow graphs","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Control flow graph; Correctness; Data flow diagram; Theoretical computer science; Thread (computing); Graph; Control flow; Data-flow analysis; Program analysis; Algorithm; Programming language; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.04660543932888916,"gpt":0.2677414092628199,"spread":0.2211359699339307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001896165,0.0001396933,0.0001703067,0.00005560697,0.0001138125,0.0004152503,0.004416896,0.00006577851,0.00006028984],"category_scores_gemma":[0.0001585438,0.0001134579,0.00002248389,0.0003255819,0.00004425907,0.002135928,0.001029985,0.0001328913,0.0008428186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001002467,"about_ca_system_score_gemma":0.0000330165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006003892,"about_ca_topic_score_gemma":0.00004990934,"domain_scores_codex":[0.9986613,0.00005458185,0.0002093362,0.0005197296,0.0002615308,0.0002934881],"domain_scores_gemma":[0.9969645,0.0001627682,0.0001099748,0.002561674,0.00009109172,0.0001100137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001418679,0.0003716293,0.01554283,0.0001419546,0.0002846631,0.000108469,0.003768375,0.0004348482,0.002647267,0.06992273,0.4052466,0.5015164],"study_design_scores_gemma":[0.00206944,0.0003855864,0.1264766,0.000270053,0.0000601656,0.00007180996,0.0009111066,0.5493155,0.001086148,0.0501113,0.2671495,0.002092784],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5761398,0.002512787,0.3565081,0.01578486,0.008079054,0.002367176,0.0009100515,0.001838871,0.03585933],"genre_scores_gemma":[0.9602218,0.00000665787,0.03901377,0.0003484785,0.0001194582,0.0000216215,0.00008352811,0.000007504321,0.0001771669],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5488806,"threshold_uncertainty_score":0.9999352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3093060337","doi":"10.1145/640128.604132","title":"The essence of XML","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"XPath; Computer science; XML Schema Editor; Document Structure Description; XQuery; XML validation; XML Schema (W3C); Programming language; Streaming XML; Efficient XML Interchange; Information retrieval; RELAX NG; XML; Document type definition; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01570635196451936,"gpt":0.2509543156734476,"spread":0.2352479637089283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002752289,0.0000697608,0.00009256307,0.00001762483,0.0001833004,0.00003476591,0.0007382136,0.00001831417,0.000005562885],"category_scores_gemma":[0.0005899409,0.00004283859,0.00002327356,0.0001598595,0.0000785769,0.0003932779,0.0001427816,0.00005136234,0.00002619283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004553631,"about_ca_system_score_gemma":0.00003432689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003619061,"about_ca_topic_score_gemma":0.00005121682,"domain_scores_codex":[0.9992909,0.00006116399,0.000161864,0.0001583892,0.0001666341,0.0001610682],"domain_scores_gemma":[0.9982587,0.0006146883,0.000119527,0.0009253242,0.00004765179,0.00003415458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001613936,0.00000763508,0.0007311492,0.00001228709,0.000005570634,0.000003952462,0.0001878074,0.00004767335,0.0008402886,0.9951012,0.0004016543,0.002659171],"study_design_scores_gemma":[0.0003639565,0.0001493899,0.004141085,0.00009901482,0.00001112018,0.00003736419,0.0009107718,0.001509325,0.04699085,0.03474794,0.9106331,0.0004060628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03044446,0.001526744,0.953372,0.0009419614,0.00113297,0.0001940326,0.00001726661,0.000114047,0.01225654],"genre_scores_gemma":[0.9366827,0.00002811848,0.06289165,0.00006963813,0.00002569926,0.000005978368,0.00000107136,0.000003865269,0.0002912717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9603533,"threshold_uncertainty_score":0.1746907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4247047556","doi":"10.1145/2345156.2254091","title":"Parallelizing top-down interprocedural analyses","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reachability; Scalability; Call graph; Graph; Modular design; Context (archaeology); Parallelism (grammar); Programming language; Top-down and bottom-up design; Static analysis; Theoretical computer science; Parallel computing; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.08809835399604228,"gpt":0.3637649504610175,"spread":0.2756665964649753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003162623,0.0001599819,0.0001732748,0.0001284529,0.0001296955,0.0001929165,0.001432175,0.00005864813,0.00001869301],"category_scores_gemma":[0.001186127,0.0001307838,0.00006314043,0.0002875768,0.00003737568,0.0008612931,0.0005071934,0.0001358703,0.0001084919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002324769,"about_ca_system_score_gemma":0.0000252239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000163613,"about_ca_topic_score_gemma":0.000005865932,"domain_scores_codex":[0.9988362,0.00005207305,0.000202379,0.0002589495,0.0002158632,0.0004344924],"domain_scores_gemma":[0.9981892,0.0006970147,0.0001120093,0.0008191588,0.00004704691,0.0001355866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002015271,0.0003256244,0.6872506,0.00014516,0.00015082,0.00005200686,0.009297018,0.0001374536,0.002405969,0.009367354,0.1084405,0.1824074],"study_design_scores_gemma":[0.002497089,0.001647447,0.5251513,0.001801845,0.0004961824,0.001056225,0.000773296,0.1293355,0.1014504,0.1708773,0.05733266,0.007580691],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5418684,0.003551277,0.4131373,0.002990159,0.001766526,0.0003070557,0.000004934087,0.02793231,0.008441951],"genre_scores_gemma":[0.7831405,0.000004410321,0.2159869,0.0006230767,0.0001698189,0.000009423632,0.00000264502,0.000008010984,0.00005517175],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2412721,"threshold_uncertainty_score":0.5333207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4231154768","doi":"10.1145/2499369.2465572","title":"A two-step optimization technique for functions placement, partitioning, and priority assignment in distributed systems","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Software deployment; Scheduling (production processes); Distributed computing; Integer programming; Implementation; Execution time; Linear programming; Mathematical optimization; Algorithm; Operating system; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01881043873557907,"gpt":0.2596678242833735,"spread":0.2408573855477945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755679,0.0001524349,0.0002035561,0.0001165723,0.0001676497,0.0005496666,0.0004077386,0.00007921983,0.00001052174],"category_scores_gemma":[0.0002291058,0.0001432827,0.00002669598,0.0002528892,0.00002676956,0.0009762457,0.0001759519,0.00009585403,0.00001482767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000107784,"about_ca_system_score_gemma":0.0000460055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006971086,"about_ca_topic_score_gemma":0.00005568544,"domain_scores_codex":[0.9985874,0.0001300015,0.0003856356,0.0004044137,0.0001987448,0.0002937732],"domain_scores_gemma":[0.9986833,0.0003802656,0.000226494,0.0005068812,0.0001074931,0.00009551166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002617305,0.0002324454,0.04138307,0.0004428267,0.00008337427,0.000007810936,0.0007872823,0.9368458,0.005909547,0.01021492,0.00242823,0.001638496],"study_design_scores_gemma":[0.0008248541,0.0001463313,0.004465875,0.000190391,0.00001672502,0.00001447783,0.0003198676,0.9926447,0.0004676438,0.000285363,0.0003617858,0.0002619305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009529216,0.0001133474,0.9874472,0.0002430441,0.0002771946,0.00191012,0.00002301158,0.0001337247,0.0003231427],"genre_scores_gemma":[0.8758041,0.000003977192,0.1226896,0.00002021035,0.00006350869,0.001284656,0.00006541893,0.000009854003,0.00005864671],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.866275,"threshold_uncertainty_score":0.58429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3006309927","doi":"10.1145/3140587.3062355","title":"Synthesis of divide and conquer parallelism for loops","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Computer science; Divide and conquer algorithms; Joins; Parallel computing; Programmer; Traverse; Code (set theory); Parallelism (grammar); Programming language; Theoretical computer science; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.0332562492190776,"gpt":0.2947483492212483,"spread":0.2614921000021707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002756985,0.00009080988,0.0001756579,0.00004705188,0.0002602573,0.0002122447,0.001380943,0.00005169282,0.000002592789],"category_scores_gemma":[0.001122207,0.00007910764,0.00003353158,0.00002351116,0.0000919616,0.0003325542,0.0004079684,0.00003908915,0.00000227646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003713018,"about_ca_system_score_gemma":0.00001819598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006388489,"about_ca_topic_score_gemma":0.000008731606,"domain_scores_codex":[0.9993402,0.00002655933,0.0001624036,0.0002259722,0.0001002838,0.0001445872],"domain_scores_gemma":[0.9980036,0.0007354851,0.0002510808,0.0008868412,0.00007648964,0.00004651141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001592966,0.0003701048,0.0744516,0.0008775532,0.0003883824,0.00003424966,0.003898912,0.005683405,0.002204229,0.3424068,0.03677924,0.5327463],"study_design_scores_gemma":[0.002281793,0.0006721967,0.1250372,0.0006752778,0.000178847,0.00002944923,0.0000749843,0.5778962,0.1413925,0.1195068,0.03051469,0.001740001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04620452,0.0003149,0.9455483,0.003507436,0.0002272249,0.0002993938,0.00001284793,0.0002552135,0.00363014],"genre_scores_gemma":[0.7880645,0.00003660789,0.2116582,0.00009013415,0.00003456744,0.00001432579,0.000001059799,0.000004659404,0.00009587894],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.74186,"threshold_uncertainty_score":0.3225916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}