{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"6e4593d97041","filters":{"venue":"Computer Languages Systems & Structures"}},"results":[{"id":"W2805096089","doi":"10.1016/j.cl.2018.05.004","title":"Concern-oriented language development (COLD): Fostering reuse in language engineering","year":2018,"lang":"en","type":"article","venue":"Computer Languages Systems & Structures","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Software engineering; Domain-specific language; Metamodeling; Reuse; Artifact (error); Programming language; Modeling language; Semantics (computer science); Systems engineering; Software; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02820051897616679,"gpt":0.2971538433655408,"spread":0.2689533243893741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004353998,0.0004129488,0.0004865233,0.0003666981,0.00009471507,0.0002118119,0.001641512,0.0001483675,0.000006028564],"category_scores_gemma":[0.000291426,0.000383092,0.00006168694,0.0005305306,0.00005846615,0.0004048232,0.00157444,0.0002999781,0.00002104814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002103153,"about_ca_system_score_gemma":0.00005729253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000119568,"about_ca_topic_score_gemma":0.00002559182,"domain_scores_codex":[0.997592,0.0001520494,0.0005309504,0.000702564,0.0003529563,0.000669508],"domain_scores_gemma":[0.9980547,0.0003418721,0.0001495552,0.001237495,0.00008280585,0.0001335311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006866507,0.0001161081,0.00248571,0.001619377,0.0004281895,0.003652814,0.2382794,0.2591127,0.2386326,0.03250863,0.0016001,0.2214958],"study_design_scores_gemma":[0.007336793,0.00103697,0.08548099,0.003524221,0.00005918248,0.001497335,0.008109798,0.3223726,0.5352387,0.000640056,0.02669217,0.008011192],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2859622,0.001864558,0.7091491,0.00001599714,0.001733004,0.0002667503,0.000003577195,0.0009542893,0.0000505425],"genre_scores_gemma":[0.5595562,0.000002497311,0.4397348,0.00005287477,0.0005276387,0.00003002848,0.000004873091,0.00003375659,0.0000573],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2966061,"threshold_uncertainty_score":0.9998621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058854006","doi":"10.1016/j.cl.2009.12.002","title":"Isolating untrusted software extensions by custom scoping rules","year":2010,"lang":"en","type":"article","venue":"Computer Languages Systems & Structures","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Calgary","funders":"","keywords":"Computer science; Visibility; Security policy; Java; Programming language; Access control; Software; Control (management); Core (optical fiber); Architecture; Code (set theory); Operating system; Software engineering; Artificial intelligence; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.009951291997882314,"gpt":0.2649590279688085,"spread":0.2550077359709262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003167416,0.0003222732,0.000373393,0.0001658403,0.0005878168,0.0009315241,0.001438987,0.0002111538,0.00002672495],"category_scores_gemma":[0.0001193164,0.0002905748,0.0001021731,0.0003307892,0.00008392295,0.0004345381,0.0005284512,0.0005559566,0.00003967453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003191731,"about_ca_system_score_gemma":0.00008218939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002251719,"about_ca_topic_score_gemma":0.00001476637,"domain_scores_codex":[0.9976616,0.000168967,0.0005403033,0.000736178,0.0003934502,0.0004994981],"domain_scores_gemma":[0.9978471,0.0004274387,0.0003164166,0.001026767,0.0001990804,0.0001832221],"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.00002110568,0.0002027883,0.009364974,0.001846016,0.0003540915,0.0002567124,0.01926536,0.008696001,0.09323854,0.4636259,0.06372912,0.3393994],"study_design_scores_gemma":[0.00177168,0.0001725051,0.01444412,0.002154542,0.00005490942,0.00151468,0.0009105303,0.9483365,0.007551537,0.00407535,0.01625753,0.002756128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1489589,0.001574456,0.8431816,0.0001494396,0.004524807,0.0003742558,0.00001847941,0.001009336,0.0002087597],"genre_scores_gemma":[0.7692023,0.000004658851,0.2292104,0.0003260799,0.001138582,0.00001521054,0.0000316094,0.00002755146,0.00004357254],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9396405,"threshold_uncertainty_score":0.9999546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074790440","doi":"10.1016/j.cl.2006.07.006","title":"Re-scheduling invocations of services for RPC grids","year":2007,"lang":"en","type":"article","venue":"Computer Languages Systems & Structures","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Apache (Canada)","funders":"","keywords":"Common Object Request Broker Architecture; Computer science; Compiler; Distributed computing; Scheduling (production processes); Reuse; Grid; Operating system; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01375078203080666,"gpt":0.2822083744464626,"spread":0.268457592415656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680757,0.0002626161,0.0004391361,0.0002047771,0.0001811733,0.0002734989,0.00141899,0.0001420707,0.000002030357],"category_scores_gemma":[0.00001758204,0.0002269679,0.0001513151,0.0004045694,0.00004197307,0.0002299572,0.0002449578,0.0001245565,0.000004434246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008956,"about_ca_system_score_gemma":0.00005446376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003108974,"about_ca_topic_score_gemma":0.00005582067,"domain_scores_codex":[0.9979066,0.00008837278,0.0007163191,0.0004935375,0.000339926,0.0004552643],"domain_scores_gemma":[0.9980063,0.000377835,0.0004225722,0.0007666362,0.0002968316,0.0001297785],"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.00007296945,0.0002449269,0.01336289,0.007841578,0.0008381349,0.00008934176,0.03353367,0.2390452,0.008455481,0.6105583,0.008623022,0.07733453],"study_design_scores_gemma":[0.002773053,0.0005717156,0.03916287,0.001582428,0.0001060346,0.0002264198,0.004447084,0.8926075,0.008044872,0.005228661,0.04324163,0.002007754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07229856,0.002254595,0.9217232,0.00006748871,0.002348528,0.0004886102,0.00003649292,0.0003011715,0.0004813001],"genre_scores_gemma":[0.9146507,0.000002588411,0.08397435,0.0001087267,0.001113612,0.0000130475,0.00005948513,0.00001841122,0.00005910076],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8423522,"threshold_uncertainty_score":0.9255481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W763938970","doi":"10.1016/j.cl.2015.04.001","title":"A formal semantics of nested atomic sections with thread escape","year":2015,"lang":"en","type":"article","venue":"Computer Languages Systems & Structures","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"Japan Science and Technology Agency; Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche; Agence Nationale de la Recherche","keywords":"Atomicity; Computer science; Programming language; Thread (computing); Compiler; Modularity (biology); Mutual exclusion; Programming paradigm; Semantics (computer science); Optimizing compiler; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01405522978292189,"gpt":0.2434491590086239,"spread":0.229393929225702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002272662,0.0002692677,0.0004694142,0.0001176011,0.00009625804,0.0002440211,0.0008326145,0.0001133773,0.000002596745],"category_scores_gemma":[0.000008692818,0.0001955175,0.00007705065,0.0004966959,0.00006984751,0.0005097666,0.0002672001,0.0001557952,0.00001265751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000549592,"about_ca_system_score_gemma":0.0001090299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000695499,"about_ca_topic_score_gemma":0.00009254974,"domain_scores_codex":[0.9981824,0.0001165779,0.0004452957,0.0004015065,0.0004628548,0.0003913636],"domain_scores_gemma":[0.9984306,0.000046057,0.000308432,0.0007658191,0.0002658411,0.0001832997],"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.0002211384,0.0004035883,0.04952598,0.002011343,0.001189867,0.0009841628,0.03168945,0.1906818,0.001929076,0.6169848,0.06348283,0.04089598],"study_design_scores_gemma":[0.008208623,0.001937821,0.08926823,0.001413748,0.0001850558,0.007805485,0.003632719,0.8518934,0.003007774,0.003214641,0.02648819,0.002944359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2865185,0.0007862302,0.71039,0.00005041268,0.001098437,0.0003274413,0.00002877661,0.0002376887,0.0005625261],"genre_scores_gemma":[0.9824619,0.000001856778,0.01700109,0.00004457267,0.0003402935,0.0000160022,0.00001723508,0.00001908322,0.00009794274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6959434,"threshold_uncertainty_score":0.7972972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}