{"meta":{"query_hash":"6e4593d97041","filters":{"venue":"Computer Languages Systems & Structures"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/6e4593d97041","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computer+Languages+Systems+%26+Structures"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.009951291997882314,"score_gpt":0.26495902796880855,"score_spread":0.25500773597092624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058854006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1489589,0.0015744563,0.84318155,0.00014943955,0.004524807,0.00037425582,0.000018479412,0.001009336,0.00020875967],"genre_scores_gemma":[0.7692023,0.000004658851,0.22921044,0.0003260799,0.0011385821,0.000015210541,0.000031609405,0.00002755146,0.000043572538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976616,0.00016896696,0.0005403033,0.00073617796,0.0003934502,0.0004994981],"domain_scores_gemma":[0.9978471,0.00042743867,0.00031641655,0.0010267668,0.00019908042,0.0001832221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031674156,0.0003222732,0.00037339298,0.0001658403,0.00058781676,0.0009315241,0.0014389871,0.00021115379,0.000026724954],"category_scores_gemma":[0.000119316406,0.0002905748,0.000102173064,0.0003307892,0.00008392295,0.00043453812,0.00052845123,0.00055595656,0.000039674534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021105685,0.00020278833,0.009364974,0.0018460157,0.00035409146,0.0002567124,0.019265356,0.008696001,0.09323854,0.46362588,0.06372912,0.3393994],"study_design_scores_gemma":[0.0017716797,0.00017250511,0.014444117,0.0021545417,0.00005490942,0.0015146796,0.0009105303,0.9483365,0.007551537,0.0040753502,0.016257532,0.002756128],"about_ca_topic_score_codex":0.0002251719,"about_ca_topic_score_gemma":0.000014766375,"teacher_disagreement_score":0.93964046,"about_ca_system_score_codex":0.000031917305,"about_ca_system_score_gemma":0.00008218939,"threshold_uncertainty_score":0.99995464},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01375078203080666,"score_gpt":0.28220837444646263,"score_spread":0.268457592415656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074790440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07229856,0.0022545953,0.92172325,0.00006748871,0.0023485282,0.0004886102,0.000036492922,0.00030117147,0.00048130014],"genre_scores_gemma":[0.9146507,0.0000025884112,0.08397435,0.00010872673,0.0011136115,0.000013047502,0.000059485126,0.00001841122,0.000059100763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790657,0.000088372784,0.00071631913,0.00049353746,0.000339926,0.00045526426],"domain_scores_gemma":[0.99800634,0.000377835,0.00042257222,0.00076663616,0.00029683163,0.00012977849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680757,0.00026261606,0.00043913609,0.00020477714,0.00018117325,0.00027349894,0.00141899,0.0001420707,0.0000020303573],"category_scores_gemma":[0.000017582035,0.00022696787,0.00015131506,0.00040456938,0.000041973068,0.00022995716,0.00024495783,0.0001245565,0.0000044342455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007296945,0.0002449269,0.013362894,0.007841578,0.0008381349,0.00008934176,0.033533666,0.23904516,0.008455481,0.61055833,0.008623022,0.07733453],"study_design_scores_gemma":[0.002773053,0.0005717156,0.039162874,0.0015824276,0.0001060346,0.0002264198,0.004447084,0.89260745,0.0080448715,0.0052286605,0.04324163,0.002007754],"about_ca_topic_score_codex":0.00031089745,"about_ca_topic_score_gemma":0.000055820674,"teacher_disagreement_score":0.84235215,"about_ca_system_score_codex":0.000040089555,"about_ca_system_score_gemma":0.000054463762,"threshold_uncertainty_score":0.92554814},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02820051897616679,"score_gpt":0.29715384336554085,"score_spread":0.2689533243893741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805096089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2859622,0.0018645584,0.7091491,0.000015997144,0.0017330036,0.00026675028,0.000003577195,0.0009542893,0.000050542498],"genre_scores_gemma":[0.55955625,0.0000024973106,0.43973476,0.000052874773,0.00052763865,0.000030028483,0.000004873091,0.000033756587,0.000057299996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997592,0.00015204943,0.0005309504,0.00070256396,0.00035295627,0.00066950795],"domain_scores_gemma":[0.99805474,0.00034187213,0.00014955523,0.0012374948,0.000082805855,0.00013353112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043539976,0.0004129488,0.00048652335,0.0003666981,0.00009471507,0.0002118119,0.0016415117,0.00014836746,0.0000060285643],"category_scores_gemma":[0.00029142603,0.00038309197,0.00006168694,0.00053053064,0.000058466147,0.0004048232,0.0015744396,0.00029997813,0.00002104814],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068665075,0.000116108116,0.0024857097,0.0016193773,0.00042818952,0.0036528138,0.2382794,0.25911266,0.23863256,0.032508627,0.0016000998,0.22149579],"study_design_scores_gemma":[0.0073367925,0.0010369704,0.08548099,0.0035242215,0.000059182483,0.0014973353,0.008109798,0.3223726,0.5352387,0.000640056,0.026692169,0.008011192],"about_ca_topic_score_codex":0.00011956795,"about_ca_topic_score_gemma":0.000025591824,"teacher_disagreement_score":0.29660612,"about_ca_system_score_codex":0.0002103153,"about_ca_system_score_gemma":0.00005729253,"threshold_uncertainty_score":0.9998621},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014055229782921886,"score_gpt":0.2434491590086239,"score_spread":0.229393929225702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W763938970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28651848,0.0007862302,0.71039,0.00005041268,0.0010984371,0.00032744135,0.00002877661,0.0002376887,0.0005625261],"genre_scores_gemma":[0.9824619,0.0000018567781,0.01700109,0.00004457267,0.00034029348,0.000016002197,0.000017235077,0.00001908322,0.000097942735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981824,0.00011657795,0.0004452957,0.0004015065,0.00046285483,0.00039136357],"domain_scores_gemma":[0.99843055,0.000046057005,0.00030843198,0.0007658191,0.0002658411,0.00018329972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002272662,0.0002692677,0.00046941423,0.00011760107,0.00009625804,0.00024402114,0.00083261455,0.00011337734,0.0000025967447],"category_scores_gemma":[0.0000086928185,0.0001955175,0.00007705065,0.0004966959,0.000069847505,0.00050976657,0.00026720006,0.00015579519,0.000012657509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022113844,0.00040358835,0.04952598,0.002011343,0.0011898669,0.0009841628,0.03168945,0.1906818,0.0019290759,0.6169848,0.06348283,0.040895976],"study_design_scores_gemma":[0.008208623,0.0019378206,0.08926823,0.0014137478,0.00018505585,0.0078054853,0.0036327194,0.85189337,0.0030077735,0.0032146408,0.026488187,0.0029443586],"about_ca_topic_score_codex":0.00069549895,"about_ca_topic_score_gemma":0.00009254974,"teacher_disagreement_score":0.6959434,"about_ca_system_score_codex":0.000054959204,"about_ca_system_score_gemma":0.00010902987,"threshold_uncertainty_score":0.7972972},"labels":[],"label_agreement":null}]}