{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":429,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":429,"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":"6fd67aaaa6e7","filters":{"topic":"Real-Time Systems Scheduling"}},"results":[{"id":"W2151250495","doi":"10.1109/sutc.2008.85","title":"Cyber-Physical Systems: A New Frontier","year":2008,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":314,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of British Columbia","funders":"","keywords":"Frontier; Trustworthiness; Articulation (sociology); Cyber-physical system; Investment (military); Computer science; Data science; Computer security; Ubiquitous computing; Political science; Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.02277156888542558,"gpt":0.2310929751193857,"spread":0.2083214062339601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001291192,0.000144454,0.0002563615,0.00007142172,0.0001045164,0.0001572243,0.0007798909,0.00005142001,0.000011917],"category_scores_gemma":[0.00002245995,0.0001156103,0.00009088888,0.0002978646,0.00002593068,0.0007246156,0.0001751305,0.0001025361,0.00130718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004805825,"about_ca_system_score_gemma":0.0001666315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001310662,"about_ca_topic_score_gemma":0.000003885094,"domain_scores_codex":[0.9986032,0.00006886895,0.0002308429,0.0003954966,0.0003877404,0.0003138866],"domain_scores_gemma":[0.9988576,0.00005636824,0.00006892828,0.0007509447,0.00005066154,0.0002154562],"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.00001564207,0.0004375007,0.005562659,0.0001108479,0.0002468594,0.0007272594,0.025976,0.005208001,0.0137486,0.4342976,0.4832657,0.03040332],"study_design_scores_gemma":[0.001282851,0.0001841142,0.004205103,0.0001096663,0.00001396044,0.001204711,0.0004153325,0.9547407,0.004733694,0.001285408,0.03082661,0.0009978681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08295722,0.0002298894,0.8693757,0.0003267412,0.0008553004,0.0002049078,2.326207e-7,0.0004596736,0.04559034],"genre_scores_gemma":[0.9169524,0.000003205509,0.05788134,0.00007901674,0.0005617589,0.00001036498,4.746062e-7,0.00001250086,0.024499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9495327,"threshold_uncertainty_score":0.9994704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149075075","doi":"10.1109/rtas.2013.6531079","title":"MemGuard: Memory bandwidth reservation system for efficient performance isolation in multi-core platforms","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":271,"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":"Office of Naval Research","keywords":"Computer science; Bandwidth (computing); Memory bandwidth; Dynamic bandwidth allocation; Bandwidth management; Throughput; Bandwidth throttling; Isolation (microbiology); Computer architecture; Parallel computing; Computer network; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04416116553926974,"gpt":0.2590191950680221,"spread":0.2148580295287524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023063,0.0001736217,0.0002331337,0.0002417289,0.000144688,0.0002161944,0.0005298113,0.0001122458,0.000009210645],"category_scores_gemma":[0.00006061809,0.0001359135,0.00006097568,0.0004619416,0.00001483029,0.001526333,0.0001191109,0.0001076003,0.0001823822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000255287,"about_ca_system_score_gemma":0.00006400669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004485865,"about_ca_topic_score_gemma":0.00004195495,"domain_scores_codex":[0.9982252,0.00002316161,0.0005763895,0.0004442717,0.0003401936,0.0003907777],"domain_scores_gemma":[0.9987845,0.0001231551,0.000194265,0.0005765503,0.0002407993,0.00008074882],"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.000120554,0.0005728697,0.06287733,0.003686906,0.00009085432,0.000008853516,0.01467526,0.7311184,0.06889028,0.05748749,0.002074826,0.05839636],"study_design_scores_gemma":[0.0008855057,0.00005965092,0.02678603,0.0001555834,0.000001843425,0.000007394319,0.0003811281,0.9672202,0.004257992,0.0000469607,0.00001874611,0.0001789362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5340865,0.00001580164,0.4635384,0.00006902442,0.0003301935,0.0009708997,3.80544e-7,0.0001583069,0.0008304203],"genre_scores_gemma":[0.8911426,0.000001090183,0.1079239,0.00003323032,0.0000561998,0.0002984328,0.000006493703,0.00001392903,0.0005241736],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3570561,"threshold_uncertainty_score":0.5542391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169142010","doi":"10.1109/rtcsa.1999.811269","title":"Scheduling fixed-priority tasks with preemption threshold","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":270,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Preemption; Computer science; Fixed-priority pre-emptive scheduling; Deadline-monotonic scheduling; Rate-monotonic scheduling; Dynamic priority scheduling; Earliest deadline first scheduling; Fair-share scheduling; Scheduling (production processes); Distributed computing; Two-level scheduling; Context switch; Real-time computing; Mathematical optimization; Embedded system; Operating system; Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01626772737875741,"gpt":0.2411538590225183,"spread":0.2248861316437608,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007206073,0.0001905672,0.0002017802,0.00009439953,0.0001644194,0.0003499737,0.0005806289,0.00009306844,0.00005049543],"category_scores_gemma":[0.00005411572,0.0001469942,0.00005465147,0.0004518734,0.00003382031,0.001121592,0.00009397702,0.0002008936,0.0002271387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000631581,"about_ca_system_score_gemma":0.0001359134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007688688,"about_ca_topic_score_gemma":0.00003648666,"domain_scores_codex":[0.9982563,0.00009255048,0.000272475,0.0005462104,0.0004383958,0.0003941056],"domain_scores_gemma":[0.9986833,0.00005722147,0.0001097783,0.0008865115,0.0001164815,0.0001466868],"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.00001660614,0.0001856335,0.05501245,0.0001021021,0.00008883312,0.00007252059,0.001184445,0.01488084,0.01213836,0.90991,0.0003773018,0.006030935],"study_design_scores_gemma":[0.005351933,0.001111568,0.02849321,0.0006911916,0.00007742247,0.001268122,0.0009849018,0.7670233,0.1598952,0.02132427,0.01010751,0.003671405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1942072,0.00009549643,0.7547447,0.0001554822,0.000260688,0.0002468661,2.180426e-7,0.0003566007,0.04993274],"genre_scores_gemma":[0.714317,0.000002894973,0.2849805,0.00007961786,0.00004413137,0.00001311911,6.173302e-7,0.00001077368,0.0005512807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8885857,"threshold_uncertainty_score":0.5994248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122969894","doi":"10.1109/rtas.2011.33","title":"A Predictable Execution Model for COTS-Based Embedded Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":248,"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":"National Science Foundation","keywords":"Computer science; Testbed; Executable; Embedded system; Compiler; Worst-case execution time; Cache; Multi-core processor; Execution model; Real-time operating system; Operating system; Execution time; Distributed computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.08050642459028037,"gpt":0.2545788877068428,"spread":0.1740724631165625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007955001,0.0001499841,0.0002151705,0.0001034253,0.0001122114,0.0001686364,0.0006690774,0.0000975399,0.000008491682],"category_scores_gemma":[0.00004483705,0.000128989,0.00008469493,0.0001964824,0.00001936997,0.0006991628,0.00006993733,0.00005714476,0.00005444232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006675765,"about_ca_system_score_gemma":0.0001889924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002439496,"about_ca_topic_score_gemma":0.000007758526,"domain_scores_codex":[0.9985186,0.00006349975,0.0003535864,0.0004239882,0.0002721079,0.0003682328],"domain_scores_gemma":[0.9987578,0.0000746872,0.0001327266,0.0007042708,0.0002027407,0.0001277202],"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.0001095583,0.0004150952,0.0005830774,0.0006957495,0.0001082679,0.00001203368,0.006270603,0.3303918,0.01177022,0.6284289,0.01933819,0.001876593],"study_design_scores_gemma":[0.0004699523,0.00007199688,0.00001723124,0.00004776855,0.000007384169,0.000006917478,0.00006313997,0.9942536,0.003801493,0.001002505,0.00009805259,0.0001599663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002328479,0.00005263756,0.974491,0.00002924356,0.000389759,0.0008205175,0.000003182065,0.0005056918,0.02137947],"genre_scores_gemma":[0.7457567,4.239819e-7,0.2515912,0.0000573634,0.00004599506,0.0002177606,0.000003229911,0.00001308132,0.002314259],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7434282,"threshold_uncertainty_score":0.5260021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3127604390","doi":"10.1109/tvt.2021.3054934","title":"Making the Case for Centralized Automotive E/E Architectures","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":169,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Centres of Excellence","keywords":"Automotive industry; AUTOSAR; Original equipment manufacturer; Electronic control unit; Automotive electronics; Architecture; Engineering; Virtualization; Manufacturing engineering; Software; Computer science; Embedded system; Systems engineering; Automotive engineering; Operating system; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0242552448803119,"gpt":0.284122712876489,"spread":0.2598674679961771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002554078,0.0001993772,0.0002458934,0.0002652882,0.0005324348,0.0001301708,0.0006784677,0.0002386423,0.00001333534],"category_scores_gemma":[0.00004482043,0.0001554342,0.0002183398,0.0009118438,0.0001276184,0.00009186116,0.000009417048,0.0004597585,0.00002281271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008178983,"about_ca_system_score_gemma":0.0001108066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002196478,"about_ca_topic_score_gemma":0.00007257483,"domain_scores_codex":[0.9984057,0.0001550549,0.0002856356,0.000554441,0.0001583647,0.0004408288],"domain_scores_gemma":[0.9983625,0.0002541026,0.00009648663,0.0010323,0.0002097815,0.00004478212],"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.00008491525,0.0008542904,0.0000264537,0.0002453815,0.001276649,0.02112975,0.003645428,0.3624102,0.06723481,0.08665636,0.0005323092,0.4559035],"study_design_scores_gemma":[0.001739921,0.0002786862,0.00002287473,0.0001675116,0.0001332825,0.04138466,0.001153189,0.3342537,0.5968096,0.01778055,0.005619659,0.0006563679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06522652,0.0002103429,0.9248431,0.007852598,0.0006576272,0.0004704242,0.000009177724,0.0006522848,0.0000779328],"genre_scores_gemma":[0.9343846,0.000005884582,0.0649524,0.0002900261,0.0000297617,0.0002185207,5.190091e-7,0.00002065789,0.00009764058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8691581,"threshold_uncertainty_score":0.6338424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964142318","doi":"10.1109/rtss.2006.42","title":"Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Shared resource; Interrupt; Server; Distributed computing; Computer network; Resource (disambiguation); Resource management (computing); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01094205829376414,"gpt":0.2411258155490805,"spread":0.2301837572553164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033504,0.0001807626,0.0002982531,0.000197738,0.00009163862,0.000439324,0.001137516,0.0001219953,0.000006184192],"category_scores_gemma":[0.00005791266,0.0001619203,0.00006380641,0.0005650843,0.00003635014,0.000580287,0.0005191043,0.0003092327,0.00007604773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001627527,"about_ca_system_score_gemma":0.00006382549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00446965,"about_ca_topic_score_gemma":0.000168578,"domain_scores_codex":[0.9976248,0.0001971797,0.0005496332,0.0007062267,0.0004391508,0.00048297],"domain_scores_gemma":[0.9987246,0.0001973213,0.0001141973,0.0008130611,0.00004956358,0.0001012992],"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.00003817213,0.0003035977,0.1222921,0.0002411669,0.00003334879,0.0002374686,0.003214059,0.03342942,0.005440202,0.8295974,0.001892541,0.003280526],"study_design_scores_gemma":[0.0008369844,0.00007219816,0.1287421,0.0002765209,0.000003673967,0.00008899109,0.0001385476,0.8618585,0.001097966,0.003022428,0.003336052,0.0005259782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5235418,0.0001917785,0.3869305,0.0003761745,0.0003734032,0.0006977089,0.000001038673,0.0005374905,0.0873501],"genre_scores_gemma":[0.9772115,6.135302e-7,0.0191747,0.0000285802,0.0002009716,0.00003504405,0.0000020547,0.0000132743,0.003333272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8284291,"threshold_uncertainty_score":0.6756804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114620069","doi":"10.1109/ecrts.2012.32","title":"Memory Access Control in Multiprocessor for Real-Time Systems with Mixed Criticality","year":2012,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":130,"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; Bandwidth throttling; Mixed criticality; Embedded system; Multiprocessing; Temporal isolation among virtual machines; Isolation (microbiology); Kernel (algebra); Software; Distributed computing; Operating system; Criticality; Cloud computing; Virtualization; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02484475998112554,"gpt":0.2916959363251446,"spread":0.266851176344019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002012335,0.0002441778,0.000521358,0.0001416179,0.00009737514,0.0004731017,0.001118618,0.0001228122,0.00001153984],"category_scores_gemma":[0.0002139408,0.0001811108,0.00006541868,0.0003913993,0.00005476368,0.002575172,0.0001364227,0.0001152334,0.000079409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000107655,"about_ca_system_score_gemma":0.0001142395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001202842,"about_ca_topic_score_gemma":0.00004375991,"domain_scores_codex":[0.9974415,0.000240589,0.0005626575,0.0005158421,0.0004044402,0.0008349259],"domain_scores_gemma":[0.9977236,0.000824032,0.0001451976,0.0007350028,0.0002785443,0.0002935925],"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.002319999,0.007196306,0.2826176,0.01440236,0.001333263,0.0002427447,0.01332313,0.03216416,0.1219521,0.474986,0.02399812,0.02546418],"study_design_scores_gemma":[0.006060666,0.0001871695,0.01876619,0.0003322628,0.00003953308,0.00009644554,0.0004135111,0.9646396,0.0077732,0.0002795184,0.0004620056,0.0009498776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0605204,0.0001369539,0.9265704,0.0006157193,0.0005871771,0.00186116,0.000007868844,0.0004190219,0.009281269],"genre_scores_gemma":[0.9745699,0.000001338016,0.02393141,0.00012845,0.00021423,0.0004446733,0.000002604123,0.00002494214,0.0006825018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9324754,"threshold_uncertainty_score":0.7385484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143082536","doi":"10.1109/rtcsa.2008.42","title":"Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Cache; Cache-oblivious algorithm; Parallel computing; Cache coloring; Cache algorithms; Cache pollution; Cache invalidation; Partition (number theory); Smart Cache; CPU cache; Distributed computing; Real-time computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0407747948231475,"gpt":0.2952486094003172,"spread":0.2544738145771697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006101786,0.0001874491,0.0003496319,0.0001550616,0.0001626641,0.000101584,0.0005328787,0.00008827681,0.00003269311],"category_scores_gemma":[0.00007991749,0.0001484158,0.0001678059,0.0003646073,0.00004106785,0.0005305996,0.0001031646,0.0001199539,0.0003643679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001457108,"about_ca_system_score_gemma":0.0001470501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00252968,"about_ca_topic_score_gemma":0.000004839558,"domain_scores_codex":[0.998117,0.0002196756,0.0004945273,0.0003909607,0.0004100077,0.0003678847],"domain_scores_gemma":[0.9985538,0.0002036261,0.0002581192,0.000709367,0.0001370081,0.0001380934],"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.00008437278,0.00127105,0.09077515,0.0002883362,0.0008138574,0.0005664423,0.01792422,0.5413552,0.3061386,0.02912765,0.007408189,0.004246975],"study_design_scores_gemma":[0.0005718617,0.0002369555,0.02795094,0.0001750315,0.000005948823,0.0002053162,0.00005793275,0.9662897,0.004207831,0.00001449699,0.00001062627,0.0002733377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7571918,0.00004196628,0.2179927,0.00001802269,0.0002748212,0.0003357224,0.000002836475,0.0003867162,0.02375538],"genre_scores_gemma":[0.9753727,0.000004993143,0.02342481,0.0000071855,0.00008668245,0.00001432286,0.000003305764,0.00001604921,0.001069949],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4249345,"threshold_uncertainty_score":0.6052219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036838567","doi":"10.1145/1068009.1068183","title":"Stress testing real-time systems with genetic algorithms","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Task (project management); Stress testing (software); Genetic algorithm; Stress test; Real-time computing; Distributed computing; Algorithm; Machine learning; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01691599748657851,"gpt":0.2280009666353948,"spread":0.2110849691488163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003655634,0.0002442517,0.0002956984,0.0001211197,0.0001436282,0.000586747,0.0009723759,0.00007605483,0.00001888984],"category_scores_gemma":[0.00003345699,0.0001845766,0.00003678349,0.0005901564,0.00003513666,0.0007163018,0.0001868351,0.0001167473,0.0006794466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000930522,"about_ca_system_score_gemma":0.0001244894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219199,"about_ca_topic_score_gemma":0.00001997337,"domain_scores_codex":[0.9977556,0.0001107221,0.0004374124,0.000622881,0.000544264,0.0005291143],"domain_scores_gemma":[0.9983206,0.0002112167,0.0001864539,0.0008642236,0.0002112563,0.0002062982],"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.00001909812,0.0004881503,0.02863933,0.0005146785,0.0003322659,0.0006607617,0.002369636,0.6227346,0.05524131,0.02283515,0.002842785,0.2633222],"study_design_scores_gemma":[0.0002979645,0.0001135516,0.002337204,0.0001748564,0.000007911322,0.0003384959,0.00006209157,0.9942822,0.001816516,0.00002131633,0.0002135109,0.0003343892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0838156,0.0002365788,0.7877287,0.0002298003,0.0003014807,0.0006911714,0.000002789561,0.00149768,0.1254961],"genre_scores_gemma":[0.4065085,0.000003367849,0.5906052,0.00002485801,0.0003856364,0.00003055977,0.000001135437,0.00002577958,0.002415015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3715476,"threshold_uncertainty_score":0.8733138,"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":"W2230430964","doi":"10.1145/2830555","title":"A Survey on Cache Management Mechanisms for Real-Time Embedded Systems","year":2015,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":105,"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; Multi-core processor; Cache; Memory hierarchy; Predictability; Key (lock); Context (archaeology); Field (mathematics); Computer architecture; Embedded system; Distributed computing; Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.1158351543148515,"gpt":0.3584870204792108,"spread":0.2426518661643593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.05385835,0.00141968,0.004370478,0.0007704125,0.0003956203,0.001319786,0.007451881,0.0007137935,0.00000377492],"category_scores_gemma":[0.001496398,0.001252457,0.0008141019,0.001665208,0.00004680898,0.0002866739,0.00276138,0.0006158705,0.001094241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008017399,"about_ca_system_score_gemma":0.0006092248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001244894,"about_ca_topic_score_gemma":0.00002293698,"domain_scores_codex":[0.978336,0.01388014,0.002334608,0.002515916,0.0014484,0.001484889],"domain_scores_gemma":[0.9838805,0.007466531,0.001984574,0.005466834,0.0007246694,0.0004769521],"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.000004539659,0.0001288863,0.000003525754,0.01287096,0.0008175437,0.000085774,0.0001612294,0.0009697031,7.248438e-7,0.006399988,0.01060668,0.9679505],"study_design_scores_gemma":[0.003673374,0.001580367,0.0003581011,0.08574907,0.001549938,0.0004079591,0.000110134,0.3434699,0.00000541245,0.002691055,0.5505714,0.009833345],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.000003391749,0.4187059,0.5696384,0.00001027663,0.003917899,0.004623629,0.0001370463,0.0009743054,0.001989141],"genre_scores_gemma":[0.0002850447,0.7378997,0.2489391,0.00005874917,0.001607477,0.0008690489,0.002506114,0.000862078,0.006972663],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9581171,"threshold_uncertainty_score":0.9998553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1953227509","doi":"10.1109/maes.2015.150014","title":"Integrated Modular Avionics - Past, present, and future","year":2015,"lang":"en","type":"article","venue":"IEEE Aerospace and Electronic Systems Magazine","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Avionics; Integrated modular avionics; Engineering; Software; Modular design; Systems engineering; Avionics software; Aerospace; Software engineering; Software development; Aeronautics; Computer science; Operating system; Component-based software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01414553549661212,"gpt":0.2282402965364972,"spread":0.2140947610398851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009654743,0.0003626424,0.0004959533,0.0001283935,0.0001410318,0.0006204412,0.0004957436,0.0002032419,0.000001369062],"category_scores_gemma":[0.00001250251,0.0003024901,0.00005173785,0.0005422318,0.0000632014,0.0008640765,0.0001461993,0.0003888697,0.00006787777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001906917,"about_ca_system_score_gemma":0.0002732986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003180244,"about_ca_topic_score_gemma":0.00003927204,"domain_scores_codex":[0.997319,0.0002336392,0.0004063808,0.0007344317,0.0004631831,0.0008432952],"domain_scores_gemma":[0.9983311,0.00005021386,0.0002076773,0.0007724759,0.0002478943,0.0003905943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004569736,0.0008678189,0.02020463,0.002079779,0.001786362,0.0007048636,0.01661519,0.01213535,0.1154596,0.1931534,0.55043,0.08610614],"study_design_scores_gemma":[0.003261291,0.001017527,0.0009483627,0.0002576558,0.00006865355,0.001956515,0.0008708002,0.4022951,0.001090341,0.001251162,0.5857688,0.001213768],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5656314,0.06783693,0.3431825,0.01123768,0.004820392,0.002172629,0.00001043716,0.001141975,0.00396602],"genre_scores_gemma":[0.9915192,0.0005434654,0.001793914,0.00006797453,0.002372477,0.00007123144,0.000008639584,0.00004560846,0.003577552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4258877,"threshold_uncertainty_score":0.9999427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981191435","doi":"10.1109/rtss.2013.44","title":"Worst Case Analysis of DRAM Latency in Multi-requestor Systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":101,"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; CMC Microsystems","keywords":"Dram; Computer science; CAS latency; Memory controller; Latency (audio); Benchmark (surveying); Embedded system; Parallel computing; Registered memory; Distributed computing; Operating system; Computer hardware; Computer data storage; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.03067242606097093,"gpt":0.2704592703814393,"spread":0.2397868443204684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468043,0.0001392103,0.000450538,0.000682158,0.00003532435,0.0001868293,0.0005677686,0.00008511165,0.00004899066],"category_scores_gemma":[0.00005286882,0.0001128154,0.0001185818,0.002075719,0.00002469982,0.0008062214,0.0001361938,0.00009363629,0.000182256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007613845,"about_ca_system_score_gemma":0.00004329895,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.05296575,"about_ca_topic_score_gemma":0.001078881,"domain_scores_codex":[0.9983202,0.0001336537,0.0006400745,0.0003840736,0.0002403634,0.0002816626],"domain_scores_gemma":[0.9985823,0.0001238754,0.0001965472,0.0008132643,0.0001694978,0.0001145319],"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.00001286735,0.001778737,0.5269204,0.0008937765,0.003517807,0.005645412,0.02258003,0.2116478,0.02396309,0.1816016,0.001139758,0.02029867],"study_design_scores_gemma":[0.000189416,0.0000192743,0.0118277,0.00003700452,0.00003627433,0.00009083722,0.0002660466,0.9871486,0.0001924114,0.0000294171,0.00001235464,0.0001506629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5279639,0.0001510006,0.4691274,0.00006323247,0.0002537066,0.0003714495,9.267677e-7,0.0001101195,0.001958261],"genre_scores_gemma":[0.9476269,0.000001868822,0.0514721,0.0000138177,0.00001499018,0.00004358322,0.00000113274,0.000007157105,0.0008184547],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7755008,"threshold_uncertainty_score":0.9533406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2336850053","doi":"10.1023/a:1008198310125","title":"Priority Scheduling Versus Pre-Run-Time Scheduling","year":2000,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; York University","funders":"","keywords":"Computer science; Earliest deadline first scheduling; Scheduling (production processes); Deadline-monotonic scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Fixed-priority pre-emptive scheduling; Distributed computing; Real-time computing; Operations management; Engineering; Schedule; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01473515877034779,"gpt":0.2555779986494441,"spread":0.2408428398790963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003052412,0.0009699436,0.001475866,0.000443395,0.0007298173,0.001691924,0.002977578,0.0006154356,0.0006386522],"category_scores_gemma":[0.0002503794,0.0009768726,0.0004808415,0.001610177,0.0001468257,0.00253019,0.000453511,0.0007104764,0.01481564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006007502,"about_ca_system_score_gemma":0.0005800998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002213391,"about_ca_topic_score_gemma":0.000008125487,"domain_scores_codex":[0.9915032,0.0009478774,0.001880254,0.002070914,0.001736718,0.001861051],"domain_scores_gemma":[0.994193,0.0007433057,0.0006867265,0.003152875,0.0004000976,0.0008239874],"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.001508638,0.001556144,0.002043343,0.002750924,0.002593077,0.001231926,0.01057578,0.5121921,0.3143225,0.03780198,0.004530232,0.1088934],"study_design_scores_gemma":[0.003016772,0.0003777348,0.0006499846,0.0009885149,0.00008965865,0.0003734407,0.0001312637,0.9835441,0.001647871,0.000134986,0.007297688,0.001747985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7981673,0.001825952,0.03899543,0.0003744805,0.004285762,0.003084203,0.00002797069,0.004513459,0.1487254],"genre_scores_gemma":[0.8742175,0.0002358483,0.1012959,0.0000450943,0.002517957,0.0002335018,0.00004877472,0.0002531385,0.02115233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.471352,"threshold_uncertainty_score":0.9993444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061663604","doi":"10.1007/s11241-012-9158-9","title":"Memory-centric scheduling for multicore hard real-time systems","year":2012,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multi-core processor; Bottleneck; Scheduling (production processes); Two-level scheduling; Uniform memory access; Parallel computing; Distributed computing; Schedule; Dynamic priority scheduling; Embedded system; Memory management; Operating system; Semiconductor memory; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02522899895287399,"gpt":0.2600384088994585,"spread":0.2348094099465845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005654891,0.001242537,0.002210167,0.0008566672,0.0007911909,0.001661,0.002823394,0.0007768833,0.00005700316],"category_scores_gemma":[0.0005223179,0.001166298,0.0006913376,0.001577866,0.0001288519,0.003020106,0.0006025049,0.0004687571,0.00542563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009672857,"about_ca_system_score_gemma":0.0004425063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003168256,"about_ca_topic_score_gemma":0.000002472063,"domain_scores_codex":[0.9893615,0.001152299,0.002592677,0.001908734,0.001799662,0.003185115],"domain_scores_gemma":[0.991261,0.001451194,0.001608455,0.00335571,0.0008828788,0.001440736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003442861,0.002125761,0.007285749,0.01085349,0.002605051,0.000273214,0.01117165,0.1006312,0.753956,0.05916192,0.04376543,0.007826285],"study_design_scores_gemma":[0.0029549,0.0002819564,0.0008423481,0.001631813,0.0002157663,0.0008691946,0.0008014533,0.9792756,0.003198083,0.00003592842,0.007629708,0.002263261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4383273,0.01140492,0.408774,0.0005415745,0.03067767,0.02308287,0.0003266369,0.009694889,0.07717023],"genre_scores_gemma":[0.9082565,0.0002350493,0.06314315,0.00003550016,0.005788147,0.001499678,0.0001429351,0.0004335002,0.02046557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8786444,"threshold_uncertainty_score":0.9993753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400187704","doi":"10.1109/comst.2024.3421523","title":"A Survey on Resource Management in Joint Communication and Computing-Embedded SAGIN","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":80,"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":"National Natural Science Foundation of China; National Research Foundation; Key Research and Development Program of Heilongjiang","keywords":"Joint (building); Resource (disambiguation); Computer science; Business; Knowledge management; Engineering; Computer network; Architectural engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07061011548589385,"gpt":0.3284740775819592,"spread":0.2578639620960654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.02241922,0.0003009286,0.0004890045,0.0005786604,0.00035943,0.001016828,0.00324576,0.0001405995,0.000004450932],"category_scores_gemma":[0.0003286356,0.0003107959,0.0000802752,0.001490899,0.0002065924,0.0005235673,0.001518238,0.0005414777,0.0001504468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002704702,"about_ca_system_score_gemma":0.0001036961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002347081,"about_ca_topic_score_gemma":0.001069083,"domain_scores_codex":[0.9863674,0.0110283,0.00105157,0.0006838861,0.0004599211,0.0004088967],"domain_scores_gemma":[0.9888899,0.004894254,0.000227904,0.005720488,0.0001434783,0.000123942],"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.00006423586,0.001768841,0.007331512,0.0007311238,0.001001289,0.0001096404,0.02963267,0.007200544,0.004466801,0.3439366,0.03826939,0.5654874],"study_design_scores_gemma":[0.003124841,0.0002992001,0.4376766,0.004179298,0.00008972148,0.00006235273,0.001006825,0.4600431,0.001435899,0.008465654,0.08101177,0.002604717],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2507333,0.04031416,0.5680561,0.01364878,0.0114005,0.008810087,0.000205257,0.004817964,0.1020138],"genre_scores_gemma":[0.9643515,0.0006736054,0.03431522,0.00008829133,0.00009703061,0.00007995254,0.00009306788,0.00003941269,0.0002619487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7136181,"threshold_uncertainty_score":0.9999344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052671997","doi":"10.1007/s10710-006-9003-9","title":"Using genetic algorithms for early schedulability analysis and stress testing in real-time systems","year":2006,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Task (project management); Worst-case execution time; Process (computing); Genetic algorithm; Execution time; Stress testing (software); Distributed computing; Embedded system; Machine learning; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02595016831673748,"gpt":0.2712235646308619,"spread":0.2452733963141245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000912618,0.0003346405,0.0006074962,0.0004281251,0.00030216,0.0009937151,0.0003773817,0.0001329273,8.305894e-7],"category_scores_gemma":[0.0001026287,0.0003158606,0.00008789074,0.001470854,0.0000965476,0.0002786838,0.0002226937,0.0001163503,0.000001354984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006697785,"about_ca_system_score_gemma":0.0000701125,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03139737,"about_ca_topic_score_gemma":0.000211025,"domain_scores_codex":[0.9971254,0.0001911366,0.000733164,0.0009573211,0.0002945148,0.000698389],"domain_scores_gemma":[0.9984996,0.0003111046,0.0002597995,0.0005823518,0.000197289,0.0001498217],"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.000006188417,0.00007350641,0.8574669,0.0003487201,0.00009176331,0.00001432934,0.0002046726,0.07323102,0.002495202,0.00006353463,0.000001226872,0.06600292],"study_design_scores_gemma":[0.0003254078,0.00007588173,0.2544478,0.00008751349,0.0001084118,0.00003375014,0.00002891907,0.7441797,0.00007658686,0.0003606635,0.000006964545,0.0002684814],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6848662,0.001836666,0.3123686,0.00001278569,0.0000861645,0.0006432186,0.000007334232,0.0001392011,0.00003979341],"genre_scores_gemma":[0.5112897,0.000006488916,0.4884763,0.000001487252,0.00009543842,0.00007430858,0.000005165313,0.00001693565,0.00003419056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6709486,"threshold_uncertainty_score":0.9999294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003309571","doi":"10.1109/ecrts.2013.27","title":"Analysis of Probabilistic Cache Related Pre-emption Delays","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Engineering and Physical Sciences Research Council","keywords":"Probabilistic logic; Cache; Computer science; Scheduling (production processes); Probabilistic analysis of algorithms; Function (biology); Static analysis; Parallel computing; Real-time computing; Mathematical optimization; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01957326062042232,"gpt":0.2626189037684474,"spread":0.2430456431480251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001033072,0.0003167308,0.0008619826,0.0007475572,0.00004677294,0.0002311333,0.001685803,0.0004949507,0.0001878528],"category_scores_gemma":[0.0001800721,0.0002706807,0.0004615918,0.001392159,0.0000548013,0.0003485328,0.001486377,0.0004788154,0.0001291337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001768306,"about_ca_system_score_gemma":0.000210174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00334672,"about_ca_topic_score_gemma":0.00008796424,"domain_scores_codex":[0.99669,0.000313951,0.001124845,0.001003517,0.0005652952,0.0003024074],"domain_scores_gemma":[0.9960886,0.0001784589,0.0008472587,0.002302901,0.0004577544,0.0001250839],"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.000004548129,0.0001671566,0.005724658,0.0005956276,0.003880107,0.000007005913,0.003103326,0.932891,0.00126491,0.04704439,0.0002789569,0.005038367],"study_design_scores_gemma":[0.00008603394,0.00002468571,0.01629798,0.0001078478,0.0006170465,0.000003973988,0.00001492051,0.9768466,0.0001889765,0.005513616,0.00001181487,0.0002865278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3807722,0.0001471022,0.6072587,0.0001505084,0.0005125275,0.0009723178,0.00000520358,0.0003552454,0.009826257],"genre_scores_gemma":[0.9430256,0.00001124723,0.0552109,0.00001190994,0.00002755858,0.0001088762,0.00005258818,0.00001666777,0.001534647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5622534,"threshold_uncertainty_score":0.9999745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1567247259","doi":"10.1109/ecrts.2015.23","title":"WCET(m) Estimation in Multi-core Systems Using Single Core Equivalence","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":57,"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":"National Science Foundation","keywords":"Computer science; Core (optical fiber); Multi-core processor; Embedded system; Reuse; Modular design; Software; Many core; Single-core; Distributed computing; Computer architecture; Operating system; Parallel computing; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3065236688287156,"gpt":0.3562251715504708,"spread":0.04970150272175522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037741,0.0001820412,0.0002715825,0.0002075048,0.0000660471,0.0003463294,0.0006736651,0.0001037946,0.000002594907],"category_scores_gemma":[0.0002384951,0.0001663397,0.00003829288,0.0006383346,0.00003676269,0.001362603,0.0002579578,0.0001246186,0.0001304118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000356719,"about_ca_system_score_gemma":0.0001839962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00190026,"about_ca_topic_score_gemma":0.00005244839,"domain_scores_codex":[0.9980444,0.00008913031,0.0005148355,0.0004765565,0.0004830839,0.000391973],"domain_scores_gemma":[0.9986693,0.00008368353,0.0001992235,0.0006712427,0.0001939618,0.0001825545],"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.00001179792,0.0003253136,0.01704209,0.0002658261,0.00002153167,0.0001522076,0.005052527,0.8869228,0.04891595,0.0348946,0.0003159837,0.006079409],"study_design_scores_gemma":[0.0004707926,0.00004594723,0.000401587,0.000240312,0.000002624073,0.0000991112,0.0003065498,0.9972056,0.0007441746,0.0002535489,0.00002381215,0.0002059758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.236321,0.0001824538,0.7606871,0.00003197057,0.0007928912,0.0003140327,5.035535e-7,0.0002119671,0.001458135],"genre_scores_gemma":[0.7197073,4.837536e-7,0.2800094,0.00002066961,0.00003572579,0.000009512718,0.000001362794,0.00001134693,0.0002042818],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4833863,"threshold_uncertainty_score":0.6783136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1543670042","doi":"10.1109/rtas.2015.7108454","title":"A framework for scheduling DRAM memory accesses for multi-core mixed-time critical systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":55,"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; Memory controller; Schedule; Registered memory; Interleaved memory; Latency (audio); Uniform memory access; Scheduling (production processes); Non-uniform memory access; Cache; Embedded system; CAS latency; Distributed computing; Dram; Real-time computing; Memory management; Parallel computing; Operating system; Overlay; Computer hardware; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.1671161315927872,"gpt":0.3867648919135359,"spread":0.2196487603207488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001897632,0.000365305,0.000637553,0.0001854634,0.0002756542,0.0012122,0.001567753,0.0003533867,0.000006275098],"category_scores_gemma":[0.005507721,0.0003180551,0.000236519,0.0004223908,0.00009671743,0.001437357,0.0003600649,0.0002239613,0.0002030917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001328737,"about_ca_system_score_gemma":0.0003798641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001093648,"about_ca_topic_score_gemma":0.000006124864,"domain_scores_codex":[0.9967597,0.0001125479,0.0007626708,0.0009487933,0.0005373561,0.0008789726],"domain_scores_gemma":[0.9947051,0.002445419,0.0001925327,0.001082402,0.001034355,0.0005401755],"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.00008691646,0.0004297951,0.0001906402,0.00149395,0.0001818349,0.00002433079,0.001980575,0.01333259,0.002329567,0.9678664,0.005788697,0.006294691],"study_design_scores_gemma":[0.001004952,0.0001919711,0.00001075538,0.000339975,0.00003055407,0.00004990003,0.0007483517,0.980319,0.002976051,0.01262357,0.001208895,0.0004960024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004699215,0.0005697724,0.9874231,0.000790407,0.003263261,0.001760985,0.00001229728,0.0007350142,0.0007460069],"genre_scores_gemma":[0.250275,0.000001172734,0.7475877,0.0001478514,0.000700141,0.0005713018,0.000006047396,0.00004823721,0.0006625159],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9669864,"threshold_uncertainty_score":0.9999272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058980727","doi":"10.1109/ecrts.2014.28","title":"Real-Time Systems Security through Scheduler Constraints","year":2014,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":54,"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; Scheduling (production processes); Distributed computing; Isolation (microbiology); Information leakage; Task (project management); Worst-case execution time; Execution time; Real-time computing; Computer security; Mathematical optimization; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01249754820693166,"gpt":0.2422898172220095,"spread":0.2297922690150778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00133607,0.0002830073,0.000454106,0.00008218796,0.000167903,0.0005887519,0.001252332,0.0001756494,0.0001596581],"category_scores_gemma":[0.0001254903,0.0002417172,0.0001151557,0.0003816138,0.000149186,0.001262959,0.0003193246,0.0001926638,0.003372116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007451612,"about_ca_system_score_gemma":0.000108275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007026727,"about_ca_topic_score_gemma":0.000003805173,"domain_scores_codex":[0.99714,0.0003878172,0.0005681997,0.0007453522,0.0005635929,0.0005950349],"domain_scores_gemma":[0.9977475,0.0002781306,0.0002100544,0.001365509,0.0001916994,0.0002071197],"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.000002564368,0.00006002946,0.0003195854,0.00008629565,0.000049717,0.00001445064,0.0009087948,0.0003313832,0.008334097,0.9844886,0.003796072,0.001608431],"study_design_scores_gemma":[0.001336155,0.0001916551,0.0006188648,0.0002957619,0.00002157332,0.0004386168,0.0003226701,0.9607576,0.006346381,0.01587,0.01254893,0.001251822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03396982,0.00003578638,0.5524555,0.00035069,0.0009822833,0.0003906442,0.000001788883,0.0009569867,0.4108565],"genre_scores_gemma":[0.9111118,0.00000793137,0.08693441,0.0001207248,0.0002852319,0.00002561261,0.000003001505,0.00002288682,0.001488436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9686186,"threshold_uncertainty_score":0.9974039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978574312","doi":"10.1007/s11241-013-9183-3","title":"Implementation and evaluation of global and partitioned scheduling in a real-time OS","year":2013,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Real-time operating system; Scheduling (production processes); Fixed-priority pre-emptive scheduling; Embedded system; Thread (computing); Operating system; Earliest deadline first scheduling; Dynamic priority scheduling; Parallel computing; Distributed computing; Real-time computing; Rate-monotonic scheduling; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02342294152655525,"gpt":0.307505476957824,"spread":0.2840825354312687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003149621,0.0002725846,0.0005555031,0.0001836303,0.000108994,0.0003800154,0.0002968786,0.0001492471,0.00007340889],"category_scores_gemma":[0.0000781791,0.0002698919,0.00005244968,0.0006169274,0.0000638905,0.001419645,0.0001739753,0.00008193761,0.0001608004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003178429,"about_ca_system_score_gemma":0.0002212292,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01514173,"about_ca_topic_score_gemma":0.000101298,"domain_scores_codex":[0.9960892,0.0008309733,0.001055289,0.0006703407,0.0008994552,0.0004547161],"domain_scores_gemma":[0.9980332,0.0001696066,0.0005474751,0.0005755891,0.0004839793,0.0001901306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006438231,0.000381817,0.1720792,0.00177172,0.0004408412,0.00002823484,0.006586601,0.02416743,0.6898836,0.03982947,0.001482574,0.06328409],"study_design_scores_gemma":[0.002076517,0.0001462921,0.1110552,0.0004606663,0.00005379134,0.0001057126,0.0007587025,0.8826782,0.0009278903,0.001326084,0.00001129281,0.0003996152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9891391,0.0003076381,0.003521801,0.0001651857,0.000167293,0.002114931,0.0000103617,0.000143849,0.004429797],"genre_scores_gemma":[0.9916369,0.00006726561,0.007824453,0.0000056123,0.00008413546,0.0002898543,0.0000184469,0.00001894286,0.00005441498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8585108,"threshold_uncertainty_score":0.9999753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126720785","doi":"10.1109/real.1997.641286","title":"Guidelines for automated implementation of executable object oriented models for real-time embedded control systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal; Concordia University","funders":"","keywords":"Executable; Computer science; Scheduling (production processes); Distributed computing; Real-time computing; Real-time operating system; Embedded system; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05486894020533312,"gpt":0.3357297370310439,"spread":0.2808607968257108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101864,0.0002488431,0.0005944562,0.0001988961,0.0001396085,0.0001753196,0.0005562166,0.0001048548,0.00003153292],"category_scores_gemma":[0.0001341832,0.0002155229,0.0001802462,0.0003946003,0.00001847214,0.001046291,0.00005805909,0.00003216389,0.00001979852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008972075,"about_ca_system_score_gemma":0.00008696441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001145482,"about_ca_topic_score_gemma":0.00001334011,"domain_scores_codex":[0.9971313,0.0001046016,0.001307922,0.0005439612,0.0003898586,0.0005223788],"domain_scores_gemma":[0.9965063,0.0003735666,0.0005578281,0.0006605034,0.001791053,0.000110801],"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.0001100182,0.0002356457,0.0001035387,0.0009911567,0.0005895726,0.000003778816,0.002815818,0.503071,0.1864555,0.1188674,0.1819635,0.004793134],"study_design_scores_gemma":[0.002844729,0.0002325804,0.000006111135,0.00006302384,0.00003473437,0.00001170268,0.0004363574,0.9892319,0.006325572,0.000291563,0.0002933821,0.0002283269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004453951,0.0001133905,0.9887035,0.0002654541,0.000455486,0.003412955,0.00008002279,0.001054534,0.001460691],"genre_scores_gemma":[0.6058229,0.00001175461,0.3905722,0.0000798843,0.0001509696,0.0008994737,0.00004199386,0.00004391035,0.002376956],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6013689,"threshold_uncertainty_score":0.8788771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1534030588","doi":"10.1109/rtas.2015.7108450","title":"A generalized model for preventing information leakage in hard real-time systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":49,"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; Information leakage; Scheduling (production processes); Distributed computing; State information; Embedded system; Leakage (economics); Real-time computing; State (computer science); Computer security; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04770569517853304,"gpt":0.2693522208232108,"spread":0.2216465256446777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905145,0.0001479556,0.0002786295,0.0002103552,0.00005155549,0.0004805588,0.0005730472,0.00009026612,0.000001486314],"category_scores_gemma":[0.0001293881,0.0001335977,0.00006641239,0.0002835172,0.000008318671,0.003201468,0.0001571711,0.0000637381,0.0001487532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001525681,"about_ca_system_score_gemma":0.0001952455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007878547,"about_ca_topic_score_gemma":0.0000158016,"domain_scores_codex":[0.9982921,0.000100857,0.0006643987,0.0002474048,0.0003380351,0.0003571851],"domain_scores_gemma":[0.9988784,0.00005897845,0.0002332004,0.0004877289,0.0002091846,0.0001325772],"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.00003365602,0.00005476156,0.00038333,0.0003084304,0.00003139548,0.000003432662,0.008601054,0.8500636,0.006315053,0.1224352,0.008554124,0.003215912],"study_design_scores_gemma":[0.000949314,0.00002533674,0.00003338398,0.00005978522,0.000002764808,0.000009919855,0.0001036994,0.9973715,0.0002384051,0.0007599153,0.0002784573,0.000167494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06850971,0.00002481643,0.9202415,0.000118853,0.0002663659,0.0009269745,0.000002189919,0.0002817349,0.009627825],"genre_scores_gemma":[0.4991667,0.000003609353,0.4941259,0.00006934241,0.00009398063,0.0002894096,0.00001901859,0.00001731469,0.006214698],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.430657,"threshold_uncertainty_score":0.5447958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124192052","doi":"10.1109/ecrts.2014.37","title":"A Rank-Switching, Open-Row DRAM Controller for Time-Predictable Systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","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 Waterloo","funders":"","keywords":"Computer science; Dram; Memory controller; Latency (audio); CAS latency; Verilog; Embedded system; Key (lock); Multi-core processor; Parallel computing; Controller (irrigation); Field-programmable gate array; Computer hardware; Operating system; Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.0125119818389603,"gpt":0.2498818602644712,"spread":0.2373698784255109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002833821,0.0002623563,0.0006474477,0.0001138468,0.0002947658,0.002062914,0.002696096,0.0001340375,0.00003775252],"category_scores_gemma":[0.0002588109,0.0002069366,0.0001120133,0.0002521145,0.00001919178,0.00141695,0.0005531129,0.0001255704,0.0006680377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005959392,"about_ca_system_score_gemma":0.0001052661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007918649,"about_ca_topic_score_gemma":0.00000982218,"domain_scores_codex":[0.9973984,0.0002434598,0.0006128015,0.0007270191,0.0004023271,0.0006159903],"domain_scores_gemma":[0.9976926,0.0005648075,0.0002553677,0.001031044,0.000224668,0.0002315177],"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.0001540636,0.0002941651,0.0004979535,0.0004028629,0.0004117879,0.000008657162,0.001285344,0.01039148,0.04077224,0.7838643,0.1304644,0.03145269],"study_design_scores_gemma":[0.002757745,0.0001848295,0.00002884111,0.00008864127,0.00001299127,0.00002838039,0.00002721888,0.9557068,0.0003829663,0.001702112,0.03879644,0.0002830669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008481429,0.0001117891,0.9206659,0.0005632853,0.0009397575,0.001904603,0.000002345517,0.0004336651,0.07453046],"genre_scores_gemma":[0.8866271,0.000001421076,0.08630045,0.0004782471,0.0004838331,0.000444044,0.000004091237,0.00004258006,0.02561826],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9453153,"threshold_uncertainty_score":0.998973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1905713602","doi":"10.1109/isorc.2000.839552","title":"Automatic synthesis of multi-tasking implementations from real-time object-oriented models","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","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":"Concordia University","funders":"","keywords":"Computer science; Implementation; Object-oriented programming; Code generation; Process (computing); Architecture; Event (particle physics); Code (set theory); Program synthesis; Distributed computing; Programming language; Set (abstract data type); Operating system; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.03581200861855367,"gpt":0.266551280083951,"spread":0.2307392714653974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384104,0.0001965865,0.0003681034,0.0002011125,0.0001364412,0.0001166767,0.0007310502,0.00006495538,0.0008685581],"category_scores_gemma":[0.00009974847,0.000182132,0.0001225066,0.0005388804,0.00003267231,0.001041555,0.0002117225,0.00007000571,0.0003335676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007805236,"about_ca_system_score_gemma":0.00003482205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002873387,"about_ca_topic_score_gemma":0.0000520345,"domain_scores_codex":[0.9978232,0.0001798088,0.0007312695,0.000468583,0.0004422881,0.0003547866],"domain_scores_gemma":[0.997923,0.0006329964,0.0003040434,0.0008975136,0.0001250994,0.0001173395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001288368,0.002437231,0.004418679,0.0005254759,0.001707263,0.0001207537,0.06194976,0.04891549,0.3993175,0.1072258,0.008956084,0.3644131],"study_design_scores_gemma":[0.0002887565,0.00001800683,0.0005489358,0.00008921317,0.00002238802,0.000004891871,0.0002476063,0.9828146,0.01532596,0.0004413436,0.00001126492,0.0001871149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1465283,0.00005498499,0.8373039,0.0001512777,0.0001686769,0.000433948,0.00002468014,0.0006089971,0.01472517],"genre_scores_gemma":[0.6141153,0.000009278702,0.3855259,0.00001682623,0.00001967892,0.00004026427,0.000003584392,0.00001359108,0.0002555909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.933899,"threshold_uncertainty_score":0.9510102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2314658126","doi":"10.1109/tsmc.2016.2531681","title":"Optimal Priority-Free Conditionally-Preemptive Real-Time Scheduling of Periodic Tasks Based on DES Supervisory Control","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":46,"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":"Science and Technology Development Fund; National Natural Science Foundation of China","keywords":"Preemption; Uniprocessor system; Supervisor; Computer science; Supervisory control theory; Multiprocessing; Scheduling (production processes); Real-time operating system; Priority inversion; Supervisory control; Real-time computing; Distributed computing; Parallel computing; Embedded system; Control (management); Rate-monotonic scheduling; Dynamic priority scheduling; Operating system; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01607328337765222,"gpt":0.2212362122154326,"spread":0.2051629288377804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00132153,0.0005806607,0.001015034,0.0005544,0.0004216528,0.0004321039,0.001098186,0.000345034,0.00002657978],"category_scores_gemma":[0.00004037236,0.0004633662,0.0002734928,0.0003927457,0.0004047588,0.0005610135,0.00001444135,0.0002924287,0.0001550487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000285119,"about_ca_system_score_gemma":0.0002537159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000747433,"about_ca_topic_score_gemma":0.00001714406,"domain_scores_codex":[0.9950617,0.0008769091,0.001262484,0.001014138,0.001116635,0.0006681435],"domain_scores_gemma":[0.9958835,0.001055061,0.0005419665,0.001624444,0.000501842,0.0003932343],"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.0007259888,0.001468916,0.001319676,0.003054538,0.00127407,0.000171931,0.00478245,0.7928666,0.1638859,0.02476574,0.0003968076,0.005287381],"study_design_scores_gemma":[0.0102405,0.002417653,0.002040659,0.007287981,0.0002380999,0.0003872383,0.001345792,0.9649099,0.008867409,0.0001646169,0.0003651612,0.001735067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1857994,0.0003279963,0.8088648,0.0001233155,0.001152961,0.001295115,0.0002724669,0.0002863237,0.001877566],"genre_scores_gemma":[0.9937479,0.00006558142,0.004375936,0.00002704096,0.0001617272,0.0002581053,0.000003638522,0.00006807538,0.001292028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8079485,"threshold_uncertainty_score":0.9997818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166778115","doi":"10.1109/tii.2010.2068304","title":"Time-Aware Instrumentation of Embedded Software","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":46,"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; Firmware; Instrumentation (computer programming); Debugging; Embedded system; Software; Laptop; TRACE (psycholinguistics); Real-time computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02582778607053425,"gpt":0.2525440793111139,"spread":0.2267162932405797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003920853,0.0001780897,0.0002543922,0.0002875516,0.0001584593,0.0001465791,0.0005950931,0.0003000809,0.0001096354],"category_scores_gemma":[0.00003159975,0.000172485,0.0001145713,0.000553245,0.0000754584,0.001619469,0.00000479893,0.0006480205,0.0002470006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004799056,"about_ca_system_score_gemma":0.0002319254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000316312,"about_ca_topic_score_gemma":0.000007522669,"domain_scores_codex":[0.9982682,0.00004718184,0.0008615985,0.0001269033,0.0004599221,0.0002361995],"domain_scores_gemma":[0.9985393,0.0001760751,0.0003895903,0.0006144329,0.0001593957,0.000121219],"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.0001662515,0.0007135761,0.0001094003,0.0002713034,0.0003874551,0.00000620653,0.0238889,0.1532723,0.02115103,0.001538972,0.003288062,0.7952065],"study_design_scores_gemma":[0.003811558,0.0005629932,0.0000244879,0.0002329497,0.00006903035,0.00008209649,0.001549244,0.5009773,0.4908392,0.0002182375,0.000906906,0.000726036],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1800667,4.222092e-7,0.8166875,0.0000530615,0.002079238,0.0003401259,0.00002347653,0.0001854435,0.0005640341],"genre_scores_gemma":[0.9397194,0.000001238001,0.05989689,0.00005679263,0.00009670839,0.00002680124,0.000006231437,0.00001329483,0.0001826105],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7944804,"threshold_uncertainty_score":0.7033733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077288229","doi":"10.1109/tetc.2013.2274042","title":"Scheduling Co-Design for Reliability and Energy in Cyber-Physical Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Energy consumption; Scheduling (production processes); Heuristics; Cyber-physical system; Reliability (semiconductor); Reliability engineering; Dynamic voltage scaling; Energy management; Energy (signal processing); Real-time computing; Distributed computing; Mathematical optimization; Power (physics); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02622107456477722,"gpt":0.2829032067352962,"spread":0.256682132170519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009721763,0.000229918,0.0003837056,0.0003184516,0.0002168671,0.0002622561,0.000432444,0.0001171817,0.000001347715],"category_scores_gemma":[0.00003470813,0.0002425642,0.00008157304,0.000468591,0.00004402566,0.000503912,0.000009694285,0.0003452378,0.000005296652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000182006,"about_ca_system_score_gemma":0.00006091439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00119793,"about_ca_topic_score_gemma":0.00002439313,"domain_scores_codex":[0.9977269,0.0002756559,0.0005986184,0.0006703714,0.0002493955,0.0004790941],"domain_scores_gemma":[0.9982573,0.0009364863,0.0001289626,0.0004900892,0.00009271524,0.00009440717],"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.000004787802,0.0001066441,0.0001640412,0.00007911777,0.00001083717,0.000003131907,0.001212612,0.953137,0.0006071531,0.003469131,0.000008930823,0.04119665],"study_design_scores_gemma":[0.0004734483,0.00006607334,0.0002274756,0.0002229659,0.000003709979,0.00000919342,0.0001575897,0.9953912,0.001750642,0.001386209,0.00007268482,0.0002387604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1898377,0.00004180121,0.8083567,0.0003189989,0.0007975915,0.0003666751,6.488042e-7,0.000125414,0.0001544187],"genre_scores_gemma":[0.8997923,0.000006794055,0.0998353,0.00003783525,0.0001503196,0.00009536367,3.856418e-7,0.00001918952,0.00006249711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7099546,"threshold_uncertainty_score":0.9891483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2344324982","doi":"10.1109/rtas.2016.7461327","title":"Criticality- and Requirement-Aware Bus Arbitration for Multi-Core Mixed Criticality Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":42,"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":"Arbiter; Computer science; Mixed criticality; Avionics; Criticality; Preemption; Arbitration; Scheduling (production processes); Offset (computer science); Asynchronous communication; Fault tolerance; Embedded system; Distributed computing; Computer network; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1153880140636774,"gpt":0.3407920492908154,"spread":0.2254040352271379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279062,0.0001963137,0.0003002034,0.00006553479,0.0001853207,0.0003765151,0.0003804327,0.0001282198,0.000008295464],"category_scores_gemma":[0.0005999887,0.0001335952,0.00007305205,0.0001254601,0.0001098717,0.001030849,0.0001467065,0.00006338507,0.00003591842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008657455,"about_ca_system_score_gemma":0.00007030278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001689658,"about_ca_topic_score_gemma":0.00002995989,"domain_scores_codex":[0.9977635,0.0001643634,0.0005783823,0.0006827453,0.000335442,0.0004756004],"domain_scores_gemma":[0.9980211,0.0005832906,0.00007255431,0.000676762,0.0004030085,0.0002433249],"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.00001176805,0.0001137293,0.001289627,0.0004400832,0.00003202096,0.000008389286,0.0001217797,0.000003586523,0.02432864,0.9690816,0.0006676693,0.00390109],"study_design_scores_gemma":[0.005522348,0.0005044562,0.009383976,0.001129049,0.00007624625,0.0001604797,0.0007110796,0.9267868,0.02906328,0.02223156,0.002902814,0.001527842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01231426,0.00008946488,0.9826517,0.00246133,0.00073988,0.0007482588,0.00001498894,0.0002918245,0.0006883465],"genre_scores_gemma":[0.9075568,0.000004029536,0.09149294,0.0002219205,0.0001491309,0.0001393451,0.000002789687,0.00001433776,0.0004187655],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9468501,"threshold_uncertainty_score":0.5447853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092758480","doi":"10.1007/s10270-014-0399-z","title":"An executable formal semantics for UML-RT","year":2014,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Applications of UML; Unified Modeling Language; Formal semantics (linguistics); UML tool; Object Constraint Language; Operational semantics; Denotational semantics; Semantics (computer science); Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02070657615113778,"gpt":0.2578143589089094,"spread":0.2371077827577716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002562623,0.0003683774,0.0006000568,0.0001988457,0.0005295633,0.0009675543,0.001478501,0.0002233399,0.00000115701],"category_scores_gemma":[0.0002153051,0.0003528006,0.0001784788,0.0002978056,0.00002013762,0.00280174,0.0002204568,0.000196334,0.00005369805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001145783,"about_ca_system_score_gemma":0.0001453031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005718943,"about_ca_topic_score_gemma":0.0000150371,"domain_scores_codex":[0.9964223,0.0001894777,0.0008944478,0.0008675658,0.0005982236,0.001027967],"domain_scores_gemma":[0.9972033,0.0002109031,0.0002934581,0.001543346,0.0004448524,0.0003041709],"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.00000988733,0.00004516321,0.000746293,0.0005418119,0.00003485861,0.000003459245,0.001004084,0.9646148,0.0008646162,0.02452237,0.000157067,0.007455586],"study_design_scores_gemma":[0.0004753202,0.0001425862,0.000004693805,0.0002825375,0.00001739942,0.00006993103,0.0001984968,0.9960626,0.0001221453,0.001331446,0.000842114,0.0004507703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02811455,0.0002843497,0.9673068,0.00004941525,0.002031856,0.0008783865,0.000006856558,0.001110205,0.000217616],"genre_scores_gemma":[0.7715825,0.000002614327,0.2273536,0.00005881916,0.0006358058,0.0001397655,0.00001469548,0.00005933187,0.0001528565],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7434679,"threshold_uncertainty_score":0.9998924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024105885","doi":"10.1109/rtcsa.2012.48","title":"Memory-Aware Scheduling of Multicore Task Sets for Real-Time Systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":39,"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; Distributed computing; Worst-case execution time; Scheduling (production processes); Suite; Uniform memory access; Shared memory; Parallel computing; Execution time; Memory management; Operating system; Overlay","retraction":null,"screen_n_in":null,"score":{"opus":0.02747565627631463,"gpt":0.281897413612841,"spread":0.2544217573365264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001466724,0.0002748648,0.0005512775,0.0001784385,0.0001341832,0.0001532027,0.0009856001,0.0001705912,0.00001894083],"category_scores_gemma":[0.0001423156,0.0002355646,0.0001801382,0.0003477006,0.0000428887,0.001255146,0.0002587999,0.0001068198,0.0002172038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008565185,"about_ca_system_score_gemma":0.0001015339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004944967,"about_ca_topic_score_gemma":0.000002712268,"domain_scores_codex":[0.9974228,0.0001394238,0.0007496027,0.0004694451,0.0004693658,0.0007493233],"domain_scores_gemma":[0.9974651,0.0004553398,0.0003878169,0.001066962,0.0003298716,0.000294906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001454202,0.001568494,0.01469284,0.006632684,0.001070252,0.00003312362,0.02085899,0.05295924,0.7039138,0.1481712,0.01049628,0.03945759],"study_design_scores_gemma":[0.0009006647,0.0001001538,0.0005979841,0.0002782474,0.00003190462,0.00006738997,0.0006612291,0.9741197,0.02229852,0.00008811175,0.0003544964,0.0005015807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1463264,0.0003861801,0.8427392,0.0001276036,0.001692575,0.001455592,0.00001676548,0.0005483259,0.006707455],"genre_scores_gemma":[0.8172721,0.000005110034,0.181424,0.00002008136,0.0002512883,0.00008384746,0.000008465592,0.00003268414,0.0009024041],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9211605,"threshold_uncertainty_score":0.9606045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1604530876","doi":"10.1109/rtas.2015.7108452","title":"Memory efficient global scheduling of real-time tasks","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":38,"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":"King Abdulaziz University; King Saud University","keywords":"Computer science; Bottleneck; Scheduling (production processes); Parallel computing; Distributed computing; Latency (audio); CAS latency; Computation; Uniform memory access; Memory architecture; Embedded system; Memory management; Semiconductor memory; Memory controller; Operating system; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02324868176041726,"gpt":0.2669086847118722,"spread":0.2436600029514549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313212,0.0001918519,0.0003496291,0.00008747847,0.00005180893,0.0001200017,0.001132308,0.0001003957,0.00002693944],"category_scores_gemma":[0.0001602016,0.0001660997,0.000105838,0.000678567,0.00006148396,0.0003214883,0.0004723207,0.000085822,0.0006762939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001688742,"about_ca_system_score_gemma":0.0003409131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007790512,"about_ca_topic_score_gemma":0.000005270299,"domain_scores_codex":[0.9977018,0.0001392357,0.0005326729,0.000488681,0.0007284912,0.0004091089],"domain_scores_gemma":[0.998073,0.00007579362,0.0002193965,0.0009915966,0.0003199846,0.0003202657],"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.00009877497,0.0009771383,0.003193251,0.0002890817,0.0002997757,0.0002133392,0.005996618,0.6237305,0.07319118,0.227209,0.008544838,0.0562565],"study_design_scores_gemma":[0.001105248,0.0001736141,0.0008507081,0.0001088387,0.00001533375,0.0001155878,0.000429199,0.9669164,0.02825067,0.001397052,0.0001651368,0.0004721757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3571155,0.0001296729,0.4469291,0.0002834516,0.0006925555,0.0002910703,0.000002507189,0.0004684358,0.1940877],"genre_scores_gemma":[0.7765485,0.000001361531,0.2227821,0.00003672182,0.00008472135,0.000005423537,0.000001295641,0.000009376269,0.000530449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.419433,"threshold_uncertainty_score":0.8692615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604079157","doi":"10.4271/2017-01-1659","title":"Hardware/Software Co-Design of an Automotive Embedded Firewall","year":2017,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Firewall (physics); Computer science; Embedded system; Automotive industry; Software; Operating system; Co-design; Computer architecture; Engineering; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.0256239308304009,"gpt":0.2869912638162117,"spread":0.2613673329858108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002216714,0.001109547,0.001730109,0.0003227826,0.001203669,0.0008256858,0.007808792,0.001167765,0.0002179039],"category_scores_gemma":[0.003788064,0.0009794489,0.0006447599,0.0005697734,0.001760864,0.003323608,0.001600378,0.001443104,0.0002620037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003590299,"about_ca_system_score_gemma":0.0003978117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001593521,"about_ca_topic_score_gemma":0.007488762,"domain_scores_codex":[0.9920323,0.0006207409,0.00176232,0.00231686,0.001852064,0.001415657],"domain_scores_gemma":[0.9896668,0.001003384,0.001191408,0.006890699,0.0004750202,0.0007726509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0002049609,0.0005733282,0.0001695609,0.00009305758,0.00008992007,0.0001992787,0.0002839018,0.0001173802,0.9781082,0.008596936,0.002113717,0.009449792],"study_design_scores_gemma":[0.001199485,0.002862552,0.981882,0.0005907946,0.00006935422,0.0002300628,0.00009744834,0.00001095779,0.002326916,0.005287247,0.0041766,0.00126663],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.790893,0.001131307,0.004186544,0.01494022,0.003571901,0.01250754,0.0004114434,0.03074184,0.1416162],"genre_scores_gemma":[0.889765,0.00006680443,0.1083968,0.000673843,0.0001768785,0.0002768128,0.00002372656,0.0001352226,0.0004848497],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9817124,"threshold_uncertainty_score":0.9992656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966746281","doi":"10.5555/2485288.2485324","title":"PT-AMC: integrating preemption thresholds into mixed-criticality scheduling","year":2013,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Real-Time Systems Scheduling","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":"McGill University","funders":"","keywords":"Preemption; Computer science; Mixed criticality; Scheduling (production processes); Distributed computing; Fixed-priority pre-emptive scheduling; Criticality; Dynamic priority scheduling; Embedded system; Rate-monotonic scheduling; Computer network; Operating system; Quality of service; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01807556073586558,"gpt":0.2490464834342238,"spread":0.2309709226983583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001544512,0.000232342,0.0002574167,0.0002054215,0.0002352767,0.0008602192,0.0005077378,0.0001017471,0.0000182702],"category_scores_gemma":[0.002266165,0.0002097841,0.00003190184,0.0008362919,0.0000792971,0.002221324,0.0001681895,0.000228933,0.0002058929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006220473,"about_ca_system_score_gemma":0.000102091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003804665,"about_ca_topic_score_gemma":0.0000268827,"domain_scores_codex":[0.9976363,0.000462258,0.0006697666,0.000554318,0.00032454,0.0003528018],"domain_scores_gemma":[0.9977638,0.0009729381,0.0001658447,0.0005150984,0.0004406752,0.0001417045],"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.00001275772,0.0009422452,0.3251925,0.001091257,0.00007472077,0.0001023267,0.02070545,0.009705152,0.1218344,0.2874944,0.001378592,0.2314662],"study_design_scores_gemma":[0.0003044422,0.00009654256,0.1286164,0.0002563633,0.000005537958,0.00005268508,0.0001324458,0.8588868,0.002262748,0.008989057,0.00008118273,0.0003157448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.303171,0.0001480691,0.6942098,0.000471225,0.0002081654,0.000445278,4.41284e-7,0.0003779421,0.0009681184],"genre_scores_gemma":[0.7372848,0.00001526756,0.2624276,0.00008906081,0.00007210657,0.00004780247,0.000003827457,0.0000168929,0.00004264181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8491817,"threshold_uncertainty_score":0.8554745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983910579","doi":"10.1145/378420.378836","title":"Online prediction of the running time of tasks","year":2001,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","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":"Science North","funders":"","keywords":"Computer science; Running time; Artificial intelligence; Machine learning; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01738991443887199,"gpt":0.2314508185196056,"spread":0.2140609040807336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002521932,0.00005174257,0.0001088713,0.00004087871,0.00002870088,0.00001297549,0.0005014295,0.00003296412,0.00004172761],"category_scores_gemma":[0.00002676546,0.00003326648,0.00005070304,0.0003260796,0.00002522826,0.0002070104,0.0001454351,0.00005216588,0.00001398288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001228726,"about_ca_system_score_gemma":0.00003423019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001252453,"about_ca_topic_score_gemma":0.000003887455,"domain_scores_codex":[0.9992561,0.0000343047,0.0002607797,0.0001250454,0.0002272749,0.00009652067],"domain_scores_gemma":[0.9992706,0.00003466474,0.0001418776,0.0004563018,0.00007443081,0.00002218061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002391041,0.000890734,0.1599167,0.0001891279,0.0001930425,0.00001124814,0.006009213,0.02264947,0.7207633,0.03989509,0.006246311,0.04321187],"study_design_scores_gemma":[0.0003732849,0.00009601172,0.1050534,0.0001634144,0.00001006345,0.00005838954,0.00009634716,0.8524777,0.04026108,0.0003965379,0.0009138258,0.00009998986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.717221,0.00004956722,0.25432,0.0004399874,0.0003199811,0.0001866563,0.000003757344,0.0001101842,0.02734891],"genre_scores_gemma":[0.975354,0.000002150009,0.02249008,0.00002759668,0.00004633082,0.000001068106,9.258671e-7,0.000003599494,0.002074261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8298282,"threshold_uncertainty_score":0.1356568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105700497","doi":"10.1109/cacsd.2000.900188","title":"Computer automated multi-paradigm modeling in control system design","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","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":"McGill University","funders":"","keywords":"Computer science; Rotation formalisms in three dimensions; Modeling language; Variety (cybernetics); Systems modeling; Software engineering; Model-based design; Control (management); Programming language; Systems engineering; Distributed computing; Artificial intelligence; Simulation; Software; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.06099595997479199,"gpt":0.2446365361502962,"spread":0.1836405761755042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007967581,0.0002370658,0.0004117981,0.0002509941,0.00008974618,0.0003423098,0.0008992171,0.0001221139,0.00001096333],"category_scores_gemma":[0.00001380658,0.0002085294,0.00007516262,0.0004799468,0.00001436705,0.0007651346,0.0001053061,0.000153256,0.000592889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001810873,"about_ca_system_score_gemma":0.00002703111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002644807,"about_ca_topic_score_gemma":0.000008860463,"domain_scores_codex":[0.9975635,0.0003690175,0.0006480583,0.000583791,0.0003113874,0.0005242628],"domain_scores_gemma":[0.9988427,0.0001617357,0.0001098071,0.0006798426,0.0000617779,0.0001441936],"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.000002459691,0.00006527157,0.0001183157,0.00003852213,0.00002032863,0.00008613024,0.0005143977,0.9903914,0.0002619047,0.006638108,0.0002545138,0.001608701],"study_design_scores_gemma":[0.001444342,0.00003380779,0.00006177408,0.0001242222,0.000003313085,0.00009061043,0.00002402552,0.9978763,0.00006848196,0.000018572,0.000007556892,0.0002469719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002975969,0.0001451229,0.9922749,0.0001848198,0.0004192552,0.0006041898,4.142833e-7,0.002500453,0.0008948238],"genre_scores_gemma":[0.6372229,0.000001062414,0.3625559,0.00007881134,0.0000463649,0.00002585653,2.272851e-7,0.00001296327,0.00005586937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6342469,"threshold_uncertainty_score":0.8503582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1673553675","doi":"10.1109/taes.2015.140063","title":"Scheduling periodic task graphs for safety-critical time-triggered avionic systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Backtracking; Avionics; Computer science; Scheduling (production processes); Job shop scheduling; Distributed computing; FlexRay; Aerospace; Automotive industry; Embedded system; Real-time computing; Engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0166470590640317,"gpt":0.2538805904351192,"spread":0.2372335313710875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001816212,0.0005092438,0.0008026324,0.0003549081,0.0007198813,0.001041875,0.0006777882,0.0003347707,0.000003127197],"category_scores_gemma":[0.00004970239,0.0004863098,0.0002528665,0.0007464657,0.0001311679,0.0007506571,0.000007571499,0.0005670606,0.0001719261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006144118,"about_ca_system_score_gemma":0.0007344508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003365992,"about_ca_topic_score_gemma":0.00002886433,"domain_scores_codex":[0.9957734,0.0003871006,0.0007370248,0.001052728,0.0007028274,0.001346919],"domain_scores_gemma":[0.9973782,0.0005211027,0.0002127424,0.0009438044,0.0003772552,0.0005669321],"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.001489293,0.001594878,0.0001296489,0.003221054,0.00206012,0.0001011993,0.008476875,0.5752566,0.08407491,0.305386,0.005357202,0.01285218],"study_design_scores_gemma":[0.00395039,0.001886608,0.000007458213,0.0008153567,0.0001914867,0.001033456,0.001436642,0.9772083,0.002193498,0.0005226285,0.009419224,0.001334938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01649949,0.006088257,0.9715196,0.0007094396,0.002831781,0.001580508,0.00002516539,0.0004754019,0.0002702885],"genre_scores_gemma":[0.9951616,0.0001727028,0.00194922,0.00004228365,0.000202842,0.0005211172,0.000004824758,0.00007077944,0.00187466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9786621,"threshold_uncertainty_score":0.9999951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2763046940","doi":"10.1109/tc.2017.2762293","title":"Mapping and Scheduling Mixed-Criticality Systems with On-Demand Redundancy","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":31,"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; Avionics; Mixed criticality; Fault tolerance; Redundancy (engineering); Quality of service; Distributed computing; Scheduling (production processes); Criticality; Certification; Reliability engineering; Embedded system; Automotive industry; Software quality; Software; Computer network; Operating system; Software development; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0250169637153714,"gpt":0.2542686612242818,"spread":0.2292516975089104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005853655,0.000316381,0.0004023852,0.0002212328,0.001369451,0.001722234,0.0009812481,0.0001157561,0.000001587984],"category_scores_gemma":[0.00001207377,0.000281547,0.00009168503,0.0001621603,0.0001990259,0.001017007,0.00001390024,0.0004055853,0.00004462829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009091172,"about_ca_system_score_gemma":0.0000771778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001744146,"about_ca_topic_score_gemma":0.00001169929,"domain_scores_codex":[0.9976691,0.0001724799,0.0003994746,0.0008242489,0.0004676835,0.0004670364],"domain_scores_gemma":[0.9975721,0.0003215983,0.0001992688,0.001514273,0.000116365,0.0002763469],"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.0001807977,0.0008083386,0.0006621515,0.001003585,0.0007908476,0.0005296065,0.00388338,0.8043774,0.002514158,0.02145596,0.0002890702,0.1635047],"study_design_scores_gemma":[0.001449879,0.0004043271,0.001945017,0.001884402,0.00002737922,0.0003335012,0.000221832,0.9895646,0.003021658,0.0002179705,0.0002171813,0.0007122657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07922988,0.00005360905,0.9159198,0.0008536594,0.002653111,0.0003627889,0.000004456174,0.000267356,0.0006553676],"genre_scores_gemma":[0.9319461,0.00001343521,0.06768934,0.0001016729,0.0001249007,0.00003347808,3.660165e-7,0.00002487978,0.00006582167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8527162,"threshold_uncertainty_score":0.9999636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118021850","doi":"10.1109/real.1998.739734","title":"Schedulability analysis for automated implementations of real-time object-oriented models","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","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":"Computer Research Institute of Montréal; Concordia University","funders":"","keywords":"Computer science; Implementation; Object-oriented programming; Modeling language; Programming language; A priori and a posteriori; Software; Semantics (computer science); Code generation; Embedded software; Real-time computing; Key (lock); Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03742572420501637,"gpt":0.2977489612383571,"spread":0.2603232370333408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007158805,0.000174955,0.000454068,0.000396443,0.0001374203,0.00008860027,0.0006034995,0.0000706053,0.0002850914],"category_scores_gemma":[0.00008224837,0.0001609906,0.0003072582,0.002351657,0.00004271819,0.0008796502,0.0001413757,0.00004679098,0.00004386665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008744527,"about_ca_system_score_gemma":0.00004918386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008294862,"about_ca_topic_score_gemma":0.00005916866,"domain_scores_codex":[0.9977739,0.0001358831,0.0007916679,0.0005576977,0.0003701995,0.0003705918],"domain_scores_gemma":[0.9977705,0.0002881482,0.0002820695,0.001070846,0.0004647581,0.0001237032],"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.00003641036,0.001539526,0.02137426,0.00035515,0.00483368,0.000006524053,0.009806577,0.4643129,0.08031872,0.4047992,0.006875036,0.005741985],"study_design_scores_gemma":[0.0004115406,0.00006196383,0.002015232,0.00000608465,0.0001147469,0.00000153352,0.00009470518,0.9930443,0.003173175,0.0008964988,0.00001936379,0.0001608593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1125273,0.00001406956,0.8794283,0.000188009,0.00006507795,0.0006201782,0.00002911311,0.000869525,0.00625837],"genre_scores_gemma":[0.6501135,0.000002812445,0.3493784,0.00001400366,0.00001118589,0.00006056324,0.00002004865,0.000008011427,0.0003914878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5375862,"threshold_uncertainty_score":0.6565008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144856846","doi":"10.1109/ecrts.2013.28","title":"A Dynamic Scratchpad Memory Unit for Predictable Real-Time Embedded Systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","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 Waterloo","funders":"","keywords":"Computer science; Embedded system; Human multitasking; Memory management; Latency (audio); Power consumption; Worst-case execution time; Execution time; Parallel computing; Operating system; Power (physics); Semiconductor memory","retraction":null,"screen_n_in":null,"score":{"opus":0.01128893809735728,"gpt":0.2394008627762568,"spread":0.2281119246788995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001085654,0.0003116361,0.0004870842,0.0002036086,0.000221577,0.0009215348,0.001434401,0.0001717615,0.0001577692],"category_scores_gemma":[0.00009824783,0.000263366,0.000133342,0.0005130511,0.000045803,0.001861771,0.0002788127,0.0001258477,0.002239253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001133751,"about_ca_system_score_gemma":0.0002084707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002648577,"about_ca_topic_score_gemma":0.00001789798,"domain_scores_codex":[0.9971573,0.0002059403,0.0006628783,0.0007430004,0.0004671774,0.0007636719],"domain_scores_gemma":[0.9972628,0.000386383,0.0002401716,0.00138503,0.0004316259,0.0002939741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007076943,0.0008037172,0.0007977659,0.002702672,0.001014208,0.00007715172,0.007927876,0.0421548,0.4852678,0.1764388,0.2618151,0.02092928],"study_design_scores_gemma":[0.0005793713,0.0001124315,0.0001473113,0.0001049634,0.00001187072,0.00004368729,0.0004110731,0.9957053,0.000695798,0.001377896,0.0004619576,0.0003483111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04398048,0.0001475646,0.8602928,0.0005072764,0.001208403,0.003399735,0.000009025266,0.001557069,0.08889766],"genre_scores_gemma":[0.5630391,0.00001729329,0.2901977,0.0001541137,0.0002424308,0.001505114,0.00003111466,0.00009941086,0.1447137],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9535505,"threshold_uncertainty_score":0.9999819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138536237","doi":"10.1007/s11241-007-9024-3","title":"Scoped types and aspects for real-time Java memory management","year":2007,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java; Memory model; Programming language; Real time Java; Operating system; Shared memory","retraction":null,"screen_n_in":null,"score":{"opus":0.01158233253263627,"gpt":0.2500236681188539,"spread":0.2384413355862176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003939285,0.0005535854,0.0009107079,0.0004971884,0.0003499689,0.000655754,0.001156209,0.0002640073,0.000034144],"category_scores_gemma":[0.00006672757,0.000520171,0.0001858343,0.000689776,0.00009186271,0.0007905567,0.0004422541,0.0001529554,0.001142126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002804296,"about_ca_system_score_gemma":0.0001148662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001165492,"about_ca_topic_score_gemma":0.00001820732,"domain_scores_codex":[0.9953048,0.0002429201,0.00115011,0.001297374,0.0008248786,0.001179882],"domain_scores_gemma":[0.9965733,0.0005702013,0.0005314464,0.001581976,0.0002683804,0.0004747418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005869966,0.0008831461,0.000834642,0.009746946,0.002847254,0.001987951,0.006671641,0.003759275,0.4666275,0.3621392,0.06755287,0.07636252],"study_design_scores_gemma":[0.02046659,0.003615581,0.01679492,0.009709426,0.001150229,0.003953311,0.003787449,0.8101223,0.04407159,0.006668299,0.06788635,0.01177397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08513961,0.001542391,0.1445085,0.000361527,0.003032789,0.00770021,0.00003012512,0.00246235,0.7552225],"genre_scores_gemma":[0.7918983,0.0004943209,0.1272933,0.00009909285,0.002141029,0.0004768262,0.00006294553,0.0003238992,0.07721023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.806363,"threshold_uncertainty_score":0.999725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2622064324","doi":"10.1109/rtas.2017.13","title":"Predictable Cache Coherence for Multi-core Real-Time Systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":29,"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":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache coherence; MESI protocol; Predictability; Latency (audio); MESIF protocol; Multi-core processor; Coherence (philosophical gambling strategy); Parallel computing; Cache; Distributed computing; CPU cache; Cache algorithms","retraction":null,"screen_n_in":null,"score":{"opus":0.08792575374304948,"gpt":0.3202627539257511,"spread":0.2323370001827016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001056408,0.0002400634,0.000396824,0.00006755062,0.0007328112,0.001493832,0.002575922,0.0001513931,0.00001919157],"category_scores_gemma":[0.0002823979,0.0001993286,0.0001085118,0.00008250658,0.00007376499,0.001484693,0.0004655802,0.0001062145,0.0004042708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007878181,"about_ca_system_score_gemma":0.0001670177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003390498,"about_ca_topic_score_gemma":0.0000436219,"domain_scores_codex":[0.9978538,0.00005514446,0.0004487925,0.0007026682,0.0003603747,0.0005791822],"domain_scores_gemma":[0.9964991,0.0001625979,0.0004236067,0.002425844,0.000272257,0.0002166411],"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.0001477882,0.001241805,0.0634974,0.003009945,0.0009491895,0.0002651223,0.006591162,0.01467432,0.3521034,0.3856446,0.1407009,0.03117427],"study_design_scores_gemma":[0.0008264128,0.00008673517,0.002468971,0.0001399204,0.00001054808,0.00003450391,0.00005089871,0.9925582,0.001905113,0.0001559949,0.00146089,0.0003018395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01502545,0.0001035036,0.9372241,0.0002160629,0.001567588,0.001748558,0.00001622269,0.0007284454,0.04337008],"genre_scores_gemma":[0.6875816,0.000008605113,0.2703425,0.00002647612,0.0003160701,0.0003264583,0.000006181312,0.00003522797,0.04135694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778839,"threshold_uncertainty_score":0.9995427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1678112703","doi":"10.1109/wpdrts.1996.557688","title":"An engineering approach to decomposing end-to-end delays on a distributed real-time system","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","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":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; End-to-end principle; Processor scheduling; Metric (unit); Scaling; Process (computing); Real-time computing; Mathematical optimization; Parallel computing; Engineering; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0151988964282292,"gpt":0.2196722264267368,"spread":0.2044733299985076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006504763,0.000371642,0.0004514343,0.0003693745,0.0001826781,0.0006788521,0.001411585,0.0001185821,0.00002271454],"category_scores_gemma":[0.00004321067,0.0003486841,0.00009970213,0.001122422,0.000009177932,0.0006536071,0.0002426059,0.0001732284,0.001123376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003985211,"about_ca_system_score_gemma":0.00002284921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002548352,"about_ca_topic_score_gemma":0.000003278829,"domain_scores_codex":[0.9969458,0.0001334627,0.0005647691,0.0009903189,0.0006018627,0.0007637693],"domain_scores_gemma":[0.9975297,0.0001273551,0.00009536806,0.001437851,0.0001029581,0.0007067839],"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.00002203232,0.0005740254,0.000176555,0.0002972463,0.0001365632,0.0001441383,0.004817251,0.7358168,0.137251,0.1007299,0.002394977,0.01763944],"study_design_scores_gemma":[0.0001987036,0.0002059634,0.0003706536,0.000155453,0.000007444112,0.0001412973,0.00007672838,0.9948627,0.003239169,0.000003856564,0.0003228885,0.0004151743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07567664,0.000008493215,0.89601,0.0001668663,0.000271824,0.0006173721,0.00001020364,0.001437643,0.02580098],"genre_scores_gemma":[0.7091194,4.035816e-7,0.2904568,0.00005422815,0.000136047,0.00005180727,0.00001057824,0.00003409336,0.0001366764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6334427,"threshold_uncertainty_score":0.9998965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136605427","doi":"10.1109/rttas.1997.601321","title":"Performance-based design of distributed real-time systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Pipeline (software); Task (project management); Computation; Time constraint; Set (abstract data type); Resource (disambiguation); Mathematical optimization; Real-time computing; Resource constraints; Distributed computing; Algorithm; Mathematics; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03078824080446908,"gpt":0.2123311340090287,"spread":0.1815428932045596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480623,0.0001775304,0.0003354498,0.0001318937,0.00008209555,0.0001313405,0.0008746703,0.00008788087,0.0001148069],"category_scores_gemma":[0.00003649371,0.0001476579,0.0000682939,0.0005919472,0.00004032509,0.0005179514,0.00008119928,0.000074108,0.000596321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007142035,"about_ca_system_score_gemma":0.00005154261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001497579,"about_ca_topic_score_gemma":2.057281e-7,"domain_scores_codex":[0.9981319,0.000192691,0.0005226572,0.0003534183,0.0004435923,0.000355727],"domain_scores_gemma":[0.9983842,0.0002197299,0.0002243079,0.0008807731,0.0001692259,0.0001217646],"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.0000403999,0.0005777245,0.005638737,0.0008434897,0.0001658174,0.00006264208,0.0007910642,0.8296004,0.1144471,0.01320188,0.02505027,0.009580444],"study_design_scores_gemma":[0.0003318226,0.0001322187,0.0004117356,0.00009031066,0.00000548766,0.0000159534,0.00001002924,0.9919307,0.006779091,0.000006955179,0.0001117185,0.0001740329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0256204,0.00006290593,0.9606358,0.0001071434,0.0002440622,0.0004297119,0.00000402931,0.0004010398,0.01249489],"genre_scores_gemma":[0.9419305,0.0000145726,0.05689726,0.00001121447,0.00004431794,0.0000258747,0.000004188671,0.00001306578,0.001059053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9163101,"threshold_uncertainty_score":0.7664699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043233377","doi":"10.1109/rtas.2007.17","title":"Minimising Task Migration and Priority Changes in Mode Transitions","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Mode (computer interface); Task (project management); Set (abstract data type); Software; Distributed computing; Real-time computing; Systems engineering; Engineering; Operating system; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.01606054278886137,"gpt":0.2685032422818099,"spread":0.2524426994929486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004568456,0.00006394956,0.00008565281,0.0001280885,0.00005379408,0.00009338732,0.0001142456,0.00004539064,0.000002022421],"category_scores_gemma":[0.00001185322,0.00006055842,0.00001278306,0.0002364141,0.00001381935,0.0003946384,0.00002336904,0.00005830162,0.000004198131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002857852,"about_ca_system_score_gemma":0.00001823888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007738432,"about_ca_topic_score_gemma":0.01250946,"domain_scores_codex":[0.9993296,0.00003010528,0.0001472966,0.000206576,0.0001182639,0.0001681665],"domain_scores_gemma":[0.9996738,0.00005403646,0.00002866221,0.0001643651,0.00002548673,0.00005364934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002955913,0.0002765456,0.02304023,0.0001873798,0.00002876391,0.0001187604,0.06804574,0.001328334,0.5911826,0.09334905,0.0002123045,0.2222007],"study_design_scores_gemma":[0.0009933384,0.0001134403,0.1043712,0.0001673557,0.000008297743,0.0001184106,0.001458026,0.8324431,0.05559919,0.003461591,0.0007215107,0.0005445664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4461337,0.00004053575,0.550929,0.001366472,0.00005264065,0.00008908033,3.071807e-7,0.00005282602,0.001335536],"genre_scores_gemma":[0.9088888,0.000006387801,0.09093029,0.00007802653,0.00003425998,0.000002501745,8.798398e-7,0.000002792065,0.00005603042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8311147,"threshold_uncertainty_score":0.6980573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2786904362","doi":"10.1145/3158208","title":"A Comparative Study of Predictable DRAM Controllers","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":28,"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; CMC Microsystems","keywords":"Dram; Computer science; Latency (audio); Memory controller; Bridge (graph theory); Controller (irrigation); State (computer science); Dynamic random-access memory; Arbitration; Embedded system; Distributed computing; Computer hardware; Telecommunications; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03247365803851394,"gpt":0.299995266139455,"spread":0.2675216081009411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103742,0.0003604428,0.0009374535,0.0004043566,0.0005548661,0.0003067738,0.001906225,0.0001260448,0.000009585289],"category_scores_gemma":[0.00004689636,0.0003359579,0.0001535235,0.001119369,0.0001234302,0.000486999,0.00005339881,0.0003234683,0.0001121327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001354938,"about_ca_system_score_gemma":0.0001375175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006629152,"about_ca_topic_score_gemma":0.00004071416,"domain_scores_codex":[0.9960267,0.0006905132,0.001111613,0.000826195,0.0008020861,0.0005428683],"domain_scores_gemma":[0.995914,0.0007177684,0.0005659472,0.002080854,0.0005457916,0.0001756459],"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.000366652,0.005184901,0.000856953,0.0003303112,0.00249302,0.00004641731,0.1918999,0.7772082,0.006892154,0.003108983,0.0009020868,0.01071044],"study_design_scores_gemma":[0.003717354,0.002803151,0.0003197722,0.00038109,0.00007058666,0.00007119773,0.01889194,0.9706736,0.002400937,0.00009226107,0.0001276565,0.0004504678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3098284,0.00004802249,0.6845538,0.00003479351,0.001840068,0.001258236,0.000003872735,0.0003918935,0.002040963],"genre_scores_gemma":[0.9862,7.828968e-7,0.01326861,0.00002317043,0.0002173591,0.00005944605,9.128463e-7,0.00002569521,0.0002040484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6763716,"threshold_uncertainty_score":0.9999092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056047125","doi":"10.1145/2744196","title":"Runtime Monitoring of Cyber-Physical Systems Under Timing and Memory Constraints","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","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":"McMaster University; University of Waterloo","funders":"","keywords":"Computer science; Cyber-physical system; Embedded system; Runtime verification; Jitter; Memory footprint; Real-time computing; Distributed computing; Operating system; Formal verification","retraction":null,"screen_n_in":null,"score":{"opus":0.0513958623455601,"gpt":0.2936989394645004,"spread":0.2423030771189403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00133252,0.0004050498,0.0008253619,0.0003576351,0.0002878836,0.0004600964,0.001117694,0.0001803813,8.829699e-7],"category_scores_gemma":[0.00007680258,0.0003996559,0.0001490811,0.0006153918,0.0001759157,0.0005911121,0.00007524704,0.0004167315,0.00004778635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002124368,"about_ca_system_score_gemma":0.0001945144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000431357,"about_ca_topic_score_gemma":8.009334e-7,"domain_scores_codex":[0.9963766,0.000466227,0.0009097045,0.0008014648,0.000876796,0.0005691504],"domain_scores_gemma":[0.9965824,0.0007939583,0.0004752672,0.001422491,0.0003629026,0.0003629757],"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.00002718837,0.0003244045,0.0004234136,0.0005722874,0.0004604567,0.0000452659,0.01511823,0.9484011,0.005974669,0.006349716,0.00005324301,0.02225002],"study_design_scores_gemma":[0.00178285,0.0003135508,0.0002998071,0.001829341,0.00008927326,0.0006790534,0.01567008,0.9736325,0.004616831,0.0002806739,0.00003101682,0.0007749833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2995161,0.0002935133,0.6953893,0.00005248986,0.002940828,0.0005009756,0.000004141166,0.0003636402,0.0009389151],"genre_scores_gemma":[0.9793345,0.000003285431,0.02008301,0.000008945337,0.0003685757,0.0000243742,0.000001094307,0.00004372164,0.000132514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6798183,"threshold_uncertainty_score":0.9998455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066719875","doi":"10.1145/2656045.2656070","title":"Schedulability analysis of global memory-predictable scheduling","year":2014,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","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":"University of Waterloo","funders":"King Saud University","keywords":"Computer science; Correctness; Multi-core processor; Scheduling (production processes); Schedule; Parallel computing; Worst-case execution time; Execution time; Processor scheduling; Distributed computing; Embedded system; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01003870821449935,"gpt":0.2506189776658906,"spread":0.2405802694513913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002044069,0.0001988749,0.0006340952,0.0001835188,0.00009533051,0.0001577046,0.001411556,0.0001172378,0.00008982395],"category_scores_gemma":[0.0004912959,0.000175765,0.0003117267,0.0034353,0.00007950092,0.0007448699,0.000449549,0.0001087582,0.00006179212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001165694,"about_ca_system_score_gemma":0.0001157858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008863859,"about_ca_topic_score_gemma":0.0001132645,"domain_scores_codex":[0.9973506,0.000251569,0.0006894979,0.0006808064,0.0006106463,0.0004169262],"domain_scores_gemma":[0.997287,0.0002024832,0.0002626931,0.001756979,0.0002936631,0.0001972295],"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.00001476643,0.0002729261,0.3367902,0.0001425824,0.001736682,0.000003657464,0.0003881883,0.2066281,0.00611148,0.4267311,0.00009670346,0.02108361],"study_design_scores_gemma":[0.0002425904,0.00004265652,0.03691613,0.00001586139,0.0001703803,0.000003169722,0.00006196043,0.9577358,0.002628936,0.001946822,0.00004644247,0.0001892963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3561916,0.00003955836,0.6250882,0.0001624068,0.0001844004,0.00009792967,0.000002176851,0.0001958903,0.01803782],"genre_scores_gemma":[0.7476352,7.370991e-7,0.2521851,0.0000606889,0.00004236378,0.000005469168,0.000002177175,0.000004768769,0.00006350433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7511077,"threshold_uncertainty_score":0.7167489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164688727","doi":"10.1109/sies.2012.6356578","title":"Efficient implementation of AUTOSAR components with minimal memory usage","year":2012,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":26,"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":"AUTOSAR; Computer science; Software portability; Reuse; Semantics (computer science); Embedded system; Set (abstract data type); Automotive industry; Component (thermodynamics); Shared memory; Memory management; Distributed computing; Programming language; Operating system; Software; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02121168392165691,"gpt":0.2740264301753342,"spread":0.2528147462536773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062538,0.0001001668,0.0001468908,0.00008414001,0.00004912165,0.00003729273,0.0003391708,0.00002368116,0.00006110185],"category_scores_gemma":[0.000003682689,0.00007500983,0.00003288571,0.0002097864,0.00002582276,0.0002880928,0.0001195513,0.00004144261,0.00006259908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003531897,"about_ca_system_score_gemma":0.00003857785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003554982,"about_ca_topic_score_gemma":0.000008405611,"domain_scores_codex":[0.9987873,0.00007251024,0.0002733487,0.0001835819,0.0003902361,0.0002930067],"domain_scores_gemma":[0.9992922,0.00004775066,0.0001537982,0.0003523255,0.00005386607,0.0001000908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00007150955,0.001394673,0.2747096,0.0003998761,0.0003295364,0.0000241284,0.03408551,0.01230291,0.5557847,0.0704997,0.001430739,0.0489672],"study_design_scores_gemma":[0.002287844,0.0003698287,0.5227177,0.00008323702,0.00003076715,0.00009860661,0.002648466,0.192832,0.2780548,0.00002079998,0.0002953205,0.0005605982],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7992827,0.0000296521,0.1966935,0.0000552017,0.0001664575,0.0001961325,8.954933e-7,0.00006526391,0.003510215],"genre_scores_gemma":[0.9128624,1.393821e-7,0.08697003,0.0000273879,0.00003689496,0.000007728553,0.000001758595,0.000006139114,0.00008748331],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2777299,"threshold_uncertainty_score":0.3058812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}