{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"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","author_layer_release":"2026-06-26"},"query_hash":"3eab624c381f","filters":{"venue":"Real-Time Systems"}},"results":[{"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","authors":[{"name":"Jia Xu","is_ca":true},{"name":"David Lorge Parnas","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004254058,0.0008604652,0.0009944058,0.0007539636,0.0006948019,0.002051648,0.001516219,0.000765302,0.006540018],"category_scores_gemma":[0.009615004,0.0003623985,0.0004641716,0.00103978,0.0006805666,0.00347255,0.0006550758,0.001869934,0.001140579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000985028,"about_ca_system_score_gemma":0.001819699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219646,"about_ca_topic_score_gemma":0.0015863,"domain_scores_codex":[0.9977744,0.0007801366,0.0001336229,0.0003297081,0.0006438642,0.0003383415],"domain_scores_gemma":[0.9929613,0.00400498,0.000426516,0.001073168,0.001049885,0.0004840705],"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.004205397,0.000364725,0.001710358,0.0009895812,0.0001473465,0.0001742882,0.0002822104,0.08311053,0.02509933,0.3560785,0.008889387,0.5189483],"study_design_scores_gemma":[0.0005136819,0.002608976,0.002032287,0.0001687066,0.0004176456,0.0006078814,0.0003331706,0.6632813,0.03883616,0.2492545,0.04183663,0.0001090855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0483123,0.009277089,0.9135572,0.001776078,0.002800219,0.0001639192,0.0001257933,0.001257519,0.02272992],"genre_scores_gemma":[0.7923431,0.004141996,0.1896237,0.0004960855,0.001958281,0.00009990291,0.0001583463,0.0004815435,0.01069722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006540018,"threshold_uncertainty_score":0.02249789,"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","authors":[{"name":"Gang Yao","is_ca":false},{"name":"Rodolfo Pellizzoni","is_ca":true},{"name":"Stanley Bak","is_ca":false},{"name":"Emiliano Betti","is_ca":false},{"name":"Marco Caccamo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146821,0.0004926933,0.0004674593,0.0004707398,0.0009654082,0.001065072,0.001414243,0.0003432455,0.002181214],"category_scores_gemma":[0.001960117,0.00033359,0.0002553497,0.0008029738,0.0003446433,0.0008712386,0.0008630884,0.0007149067,0.0002613986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009160378,"about_ca_system_score_gemma":0.002128448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002747298,"about_ca_topic_score_gemma":0.009052997,"domain_scores_codex":[0.9994741,0.0001276922,0.00003605704,0.00007909294,0.0001376977,0.0001453265],"domain_scores_gemma":[0.9990298,0.000256134,0.0001254384,0.0002339081,0.0002294988,0.0001253696],"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.001864232,0.0003926082,0.002667347,0.0004629089,0.0001419147,0.0002454917,0.0003454072,0.6576437,0.04157452,0.03309243,0.01324835,0.248321],"study_design_scores_gemma":[0.00008176418,0.0002375285,0.0007435671,0.00001801932,0.00005019895,0.00007488756,0.00007501494,0.9704769,0.0120109,0.0108872,0.0053266,0.00001750581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3481851,0.00521723,0.6251531,0.0009452576,0.0006996056,0.000194805,0.0002251183,0.001974127,0.01740562],"genre_scores_gemma":[0.9265469,0.0003727366,0.06964372,0.0001240025,0.00009472391,0.00005894872,0.000117213,0.0001079032,0.002933838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002747298,"threshold_uncertainty_score":0.00729686,"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","authors":[{"name":"Giovani Gracioli","is_ca":false},{"name":"Antônio Augusto Fröhlich","is_ca":false},{"name":"Rodolfo Pellizzoni","is_ca":true},{"name":"Sebastian Fischmeister","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931436,0.00101222,0.0005949319,0.0005387854,0.0004810124,0.001158055,0.002314578,0.0005274028,0.004607857],"category_scores_gemma":[0.005291624,0.0005464179,0.0003806503,0.0005199215,0.0008444215,0.001290762,0.0007633279,0.0009280434,0.0006680774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008711275,"about_ca_system_score_gemma":0.002097672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006217067,"about_ca_topic_score_gemma":0.005648014,"domain_scores_codex":[0.9987215,0.0003249727,0.00009849381,0.0001968465,0.0003645257,0.0002935993],"domain_scores_gemma":[0.9960154,0.001204717,0.0002015859,0.000975779,0.001220542,0.0003819052],"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.0127964,0.003360653,0.02118206,0.00123189,0.0004414857,0.0009087051,0.001627238,0.3693329,0.1743056,0.01151936,0.01144869,0.391845],"study_design_scores_gemma":[0.001349441,0.003672515,0.005607101,0.00004519933,0.000257448,0.0002050361,0.0005171252,0.8380983,0.1380814,0.002025727,0.01006314,0.00007756479],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7837619,0.0006366347,0.18582,0.0003343886,0.0003811382,0.0004252156,0.0003473406,0.01581743,0.01247594],"genre_scores_gemma":[0.9002195,0.0001656128,0.09560745,0.00009366587,0.00002144699,0.0000911752,0.0003683409,0.0006631411,0.002769682],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006217067,"threshold_uncertainty_score":0.01541483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562548608","doi":"10.1023/a:1020207328508","title":"Real-Time Supervisory Control of a Processor for Non-Preemptive Execution of Periodic Tasks","year":2002,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Versa; Dual (grammatical number); Task (project management); Computational complexity theory; Execution time; Parallel computing; Algorithm; Mathematical optimization; Mathematics","authors":[{"name":"Peter C. Y. Chen","is_ca":false},{"name":"W.M. Wonham","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0261588559585239,"gpt":0.2431467582058805,"spread":0.2169879022473566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004384426,0.0002605645,0.0003043927,0.0002644816,0.0004506888,0.0006024934,0.000755994,0.000273274,0.002186597],"category_scores_gemma":[0.001099352,0.0001399581,0.0002057811,0.0001244632,0.0004343801,0.0003732759,0.0003371403,0.0004024419,0.000223345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002662988,"about_ca_system_score_gemma":0.0008349412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001172033,"about_ca_topic_score_gemma":0.002041747,"domain_scores_codex":[0.9998597,0.00002486005,0.000009516767,0.00004334624,0.00003539211,0.00002714661],"domain_scores_gemma":[0.9994698,0.0002098587,0.00007607583,0.00007458389,0.0001106705,0.00005891536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002538892,0.000566127,0.003389521,0.0004373401,0.0001016488,0.001371688,0.001111588,0.4192704,0.29697,0.05068261,0.005166708,0.2183936],"study_design_scores_gemma":[0.00009639038,0.0002519872,0.0007416515,0.00001169717,0.00003204721,0.0000939555,0.00003327089,0.9629825,0.02771425,0.005994312,0.002032423,0.00001548161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3203056,0.0003641401,0.6693825,0.0002141658,0.0002453393,0.0001042943,0.00005115391,0.002595689,0.006737223],"genre_scores_gemma":[0.9815425,0.00005257286,0.0172723,0.00001908457,0.0000245043,0.00004605611,0.00001738016,0.00002599286,0.0009996337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002186597,"threshold_uncertainty_score":0.00731492,"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","authors":[{"name":"Chris Andreae","is_ca":false},{"name":"Yvonne Coady","is_ca":true},{"name":"Celina Gibbs","is_ca":true},{"name":"James Noble","is_ca":false},{"name":"Jan Vítek","is_ca":false},{"name":"Zhao Tian","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005197397,0.001253451,0.001203083,0.001608345,0.001049202,0.004212941,0.004325791,0.00213204,0.007925758],"category_scores_gemma":[0.01315006,0.002649964,0.002155178,0.002032918,0.002719719,0.01196189,0.004718199,0.004993401,0.002086571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144301,"about_ca_system_score_gemma":0.001545393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001334117,"about_ca_topic_score_gemma":0.002118221,"domain_scores_codex":[0.9958649,0.0008396092,0.0008679457,0.000505455,0.001507087,0.0004150816],"domain_scores_gemma":[0.9909719,0.003126546,0.000742922,0.003828619,0.000910392,0.0004196689],"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.001107696,0.0001712124,0.003483852,0.001052586,0.0001393087,0.0006761046,0.002225569,0.008948551,0.02132514,0.6795813,0.02201211,0.2592766],"study_design_scores_gemma":[0.0002699412,0.0002130991,0.001300454,0.0005840778,0.0003950079,0.001428067,0.0003707082,0.1054436,0.03631587,0.6562755,0.1971386,0.0002651452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007885411,0.0007047957,0.9740556,0.000372777,0.0003126525,0.0001105441,0.0002193835,0.01140099,0.004937897],"genre_scores_gemma":[0.2053722,0.001166165,0.769851,0.0009715185,0.0004920833,0.000428318,0.0009684765,0.01158115,0.009169132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007925758,"threshold_uncertainty_score":0.02748674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1563308903","doi":"10.1023/a:1008150426963","title":"A Network Time Interface M-Module for Distributing GPS-Time over LANs","year":2000,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Ethernet; Computer science; Interface (matter); Synchronization (alternating current); Embedded system; Clock synchronization; Local area network; Network interface; Global Positioning System; Very-large-scale integration; Controller (irrigation); Real-time computing; State (computer science); Clock drift; Computer hardware; Operating system; Computer network","authors":[{"name":"Ulrich Schmid","is_ca":true},{"name":"Johann Klasek","is_ca":true},{"name":"Thomas Mandl","is_ca":false},{"name":"Herbert Nachtnebel","is_ca":false},{"name":"Gerhard Cadek","is_ca":false},{"name":"Nikolaus Kerö","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007299551411717456,"gpt":0.2279022945298835,"spread":0.2206027431181661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091309,0.0009685899,0.0006929045,0.001765785,0.0006257384,0.0009274941,0.002588666,0.0007990352,0.03835375],"category_scores_gemma":[0.002896464,0.0006394223,0.0004506409,0.00109523,0.0003258804,0.001163132,0.001046115,0.0009272718,0.01274667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006589059,"about_ca_system_score_gemma":0.0006563569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001409737,"about_ca_topic_score_gemma":0.001040963,"domain_scores_codex":[0.999391,0.0001106102,0.00005879801,0.0001162582,0.0002225316,0.0001008102],"domain_scores_gemma":[0.9982855,0.0003577545,0.0001322152,0.0005437502,0.0004972683,0.0001835189],"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.003825848,0.0007431897,0.008835358,0.0009642404,0.0002264129,0.0005680036,0.0006166238,0.004728385,0.3401512,0.02251055,0.07158946,0.5452406],"study_design_scores_gemma":[0.0008823472,0.001794585,0.008553351,0.0001382998,0.00055686,0.002011048,0.000129879,0.1427463,0.5505701,0.004109722,0.2882986,0.0002089175],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02811278,0.0002186948,0.8857873,0.0001316568,0.0002423089,0.0006793645,0.0008703523,0.06696925,0.01698824],"genre_scores_gemma":[0.3327428,0.0003362072,0.5712851,0.0008436907,0.0005210598,0.001367404,0.003172562,0.009801905,0.07992933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03835375,"threshold_uncertainty_score":0.128306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155277639","doi":"10.1007/s11241-015-9239-7","title":"Response time analysis for fixed priority real-time systems with energy-harvesting","year":2015,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Computation; Energy consumption; Energy (signal processing); Response time; Task (project management); Earliest deadline first scheduling; Monotonic function; Real-time computing; Mathematical optimization; Set (abstract data type); Dynamic priority scheduling; Algorithm; Mathematics; Rate-monotonic scheduling; Schedule; Engineering; Statistics; Operating system","authors":[{"name":"Yasmina Abdeddaïm","is_ca":false},{"name":"Younès Chandarli","is_ca":false},{"name":"Robert I. Davis","is_ca":true},{"name":"Damien Masson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02365917445607611,"gpt":0.2518750639337293,"spread":0.2282158894776532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003640581,0.001250113,0.001213236,0.001008801,0.0005322534,0.001561441,0.001688263,0.0008706321,0.005825049],"category_scores_gemma":[0.01210692,0.0004758539,0.0007860516,0.001050124,0.001050114,0.001482314,0.0008157647,0.001555535,0.0005187787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002377153,"about_ca_system_score_gemma":0.001814315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006603728,"about_ca_topic_score_gemma":0.002741642,"domain_scores_codex":[0.9980308,0.0005028126,0.00005879543,0.0002672178,0.0005164752,0.0006238635],"domain_scores_gemma":[0.9917818,0.006094747,0.0005679767,0.0003066678,0.0009519306,0.0002967383],"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.0007467523,0.0001261563,0.0008606492,0.0002828897,0.00008703703,0.0001647476,0.0001596847,0.9398724,0.008495725,0.03049451,0.001595811,0.01711356],"study_design_scores_gemma":[0.000007639777,0.00002725651,0.0001516697,0.000004366278,0.0000104646,0.00001442021,0.00002393982,0.996256,0.0004160445,0.002984618,0.00009918135,0.000004418369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1503077,0.002070983,0.8359314,0.00112658,0.0002511468,0.0001295727,0.0001601409,0.0005078951,0.00951455],"genre_scores_gemma":[0.9822104,0.0004520669,0.01281182,0.0001251125,0.0001039842,0.00005184401,0.00006393027,0.0001251501,0.004055762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006603728,"threshold_uncertainty_score":0.01948673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2973123143","doi":"10.1007/s11241-019-09338-8","title":"Reduced latency DRAM for multi-core safety-critical real-time systems","year":2019,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Memory controller; Computer science; Dram; CAS latency; Latency (audio); Embedded system; Registered memory; Interleaved memory; Multi-core processor; Dynamic random-access memory; Static random-access memory; Parallel computing; Memory management; Semiconductor memory; Operating system; Computer hardware; Telecommunications","authors":[{"name":"Mohamed Hassan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0304387482999133,"gpt":0.2935015980062963,"spread":0.2630628497063831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000323845,0.0006289653,0.0004069702,0.0006175066,0.0005234628,0.0006583582,0.001355858,0.0002670718,0.007108534],"category_scores_gemma":[0.001068924,0.0001902564,0.000199181,0.0004681866,0.0002488056,0.0008598263,0.0006555867,0.0005960543,0.0008462339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006605441,"about_ca_system_score_gemma":0.001209306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00158675,"about_ca_topic_score_gemma":0.00467346,"domain_scores_codex":[0.9996156,0.00007145564,0.00002331057,0.00005390515,0.0001062033,0.0001295852],"domain_scores_gemma":[0.9994854,0.0001232131,0.00005039713,0.0001502109,0.0001461016,0.00004474598],"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.004463124,0.0005783059,0.002979746,0.001140057,0.0002116022,0.0004995365,0.000294028,0.2214494,0.2805093,0.04139864,0.03308623,0.41339],"study_design_scores_gemma":[0.000242119,0.001450102,0.001924849,0.00005837005,0.0001964801,0.0003700157,0.0002348321,0.7883924,0.172129,0.01234043,0.02260359,0.00005787611],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5281897,0.01340098,0.4089808,0.001495894,0.00144641,0.000168875,0.00078743,0.01258686,0.03294302],"genre_scores_gemma":[0.9633884,0.0004891854,0.03013868,0.0001448692,0.00008212374,0.00003137702,0.0002061551,0.0001383416,0.00538084],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007108534,"threshold_uncertainty_score":0.02378041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1744407750","doi":"10.1023/a:1011199405471","title":"Object Caching and Prefetching in Distributed Virtual Walkthrough","year":2001,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","authors":[{"name":"Rynson W. H. Lau","is_ca":false},{"name":"Jimmy H. P. Chim","is_ca":false},{"name":"Mark Green","is_ca":true},{"name":"Hong Va Leong","is_ca":false},{"name":"Antonio Si","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01363695135265794,"gpt":0.2673937596894742,"spread":0.2537568083368163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149213,0.0005851915,0.0009816085,0.00109672,0.001642071,0.002071945,0.001702744,0.001256048,0.003722985],"category_scores_gemma":[0.01183658,0.0009213305,0.0002666528,0.002374361,0.001125845,0.003264134,0.001692148,0.0007805962,0.0004574184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00129532,"about_ca_system_score_gemma":0.001507866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01163968,"about_ca_topic_score_gemma":0.01745358,"domain_scores_codex":[0.9986455,0.0004092747,0.0000924381,0.0001735891,0.0004075077,0.0002718335],"domain_scores_gemma":[0.9914573,0.004718761,0.0005045778,0.001891767,0.0009007184,0.0005269459],"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.01004987,0.001007863,0.02775013,0.0004815014,0.0001955866,0.001653093,0.002447499,0.4633168,0.05895862,0.0587592,0.01700431,0.3583756],"study_design_scores_gemma":[0.0001150991,0.000163045,0.002228691,0.00002631024,0.0000659264,0.0002783895,0.0002757598,0.9629872,0.01420341,0.01721845,0.002399732,0.00003789274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6795397,0.00350627,0.302743,0.0005316443,0.0002910089,0.00010965,0.0002561111,0.005752147,0.007270615],"genre_scores_gemma":[0.9685896,0.000291835,0.0270267,0.00005332495,0.00003691986,0.00003327711,0.0001198045,0.0001929541,0.003655534],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01163968,"threshold_uncertainty_score":0.02314389,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2775713557","doi":"10.1007/s11241-017-9297-0","title":"Delay-dependent partial order reduction technique for real time systems","year":2017,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reachability; Partial order reduction; Convex hull; Reduction (mathematics); Petri net; Regular polygon; Context (archaeology); Set (abstract data type); Computer science; State space; Automaton; State (computer science); Hull; Identity (music); Order (exchange); Mathematics; Model checking; Algorithm; Theoretical computer science; Geometry; Physics","authors":[{"name":"Hanifa Boucheneb","is_ca":true},{"name":"Kamel Barkaoui","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03138281613212452,"gpt":0.3137023800549307,"spread":0.2823195639228062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008267337,0.00067441,0.0006985661,0.0008739654,0.0005754763,0.0007983655,0.001108065,0.0003758409,0.004357256],"category_scores_gemma":[0.001377102,0.0004736346,0.001610318,0.0005813487,0.0008387575,0.001298313,0.0009184728,0.002087096,0.0009615115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006922639,"about_ca_system_score_gemma":0.001276162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001510791,"about_ca_topic_score_gemma":0.00236941,"domain_scores_codex":[0.9991652,0.0001643691,0.00005153247,0.0001237995,0.0004044434,0.00009056849],"domain_scores_gemma":[0.9991601,0.0003680901,0.00004281755,0.0002698524,0.0001373985,0.0000217757],"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.0003460918,0.0002266285,0.0004447919,0.0008504934,0.0001684166,0.0006029254,0.0004943637,0.1208492,0.1004451,0.5110803,0.005434636,0.259057],"study_design_scores_gemma":[0.0001614823,0.0003373817,0.0004827378,0.00009871536,0.0002707063,0.000719944,0.0001017072,0.5127249,0.1317428,0.3123645,0.04088997,0.0001051108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005325642,0.0002495243,0.9901945,0.00009187963,0.00007738686,0.00005617571,0.00005993896,0.0006634132,0.003281596],"genre_scores_gemma":[0.3701069,0.0008939705,0.6152006,0.0002152869,0.0001368628,0.0002359993,0.000362008,0.0004298322,0.01241852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004357256,"threshold_uncertainty_score":0.01457644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006984763","doi":"10.1007/s11241-010-9103-8","title":"SetExp: a method of transformation of timed automata into finite state automata","year":2010,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Université de Sherbrooke","funders":"","keywords":"Timed automaton; Automaton; Quantum finite automata; ω-automaton; Computer science; Continuous spatial automaton; Finite-state machine; Discrete event dynamic system; Event (particle physics); State space; Automata theory; Supervisory control; Theoretical computer science; Transformation (genetics); Nondeterministic finite automaton; Algorithm; Discrete system; Mathematics; Control (management); Artificial intelligence","authors":[{"name":"Lucien Ouédraogo","is_ca":true},{"name":"Ahmed Khoumsi","is_ca":true},{"name":"Mustapha Nourelfath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01358559386440762,"gpt":0.2798338881276556,"spread":0.266248294263248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000887309,0.001199394,0.0007984103,0.001191084,0.0006394751,0.001656885,0.001575936,0.0007920536,0.01441776],"category_scores_gemma":[0.002610761,0.0008575222,0.002744331,0.0008209766,0.0007727812,0.001686748,0.001897951,0.002193857,0.005094926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004399312,"about_ca_system_score_gemma":0.0009320355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006894285,"about_ca_topic_score_gemma":0.0007054691,"domain_scores_codex":[0.9985916,0.0002856581,0.0001184724,0.0003357584,0.0005782918,0.00009026668],"domain_scores_gemma":[0.9991137,0.0004192372,0.00003990366,0.0002441754,0.0001565343,0.00002641645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007063535,0.0003883587,0.001485258,0.001678799,0.0004316486,0.00140804,0.00100721,0.04050696,0.07641722,0.214285,0.03311598,0.6285691],"study_design_scores_gemma":[0.000246906,0.0002734588,0.0006922273,0.0002489203,0.0003421496,0.001799359,0.0001697565,0.3043228,0.2350821,0.1742671,0.2823614,0.000193832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009310525,0.00004346735,0.9885847,0.00002431966,0.00009196483,0.00005956128,0.0002200322,0.008155924,0.001889068],"genre_scores_gemma":[0.05990761,0.0003010437,0.9208201,0.0001545941,0.00008944106,0.000516901,0.00179997,0.00617493,0.01023544],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01441776,"threshold_uncertainty_score":0.04823226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107330110","doi":"10.1007/s11241-012-9151-3","title":"State-based scheduling with tree schedules: analysis and evaluation","year":2012,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"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; Arbitration; Distributed computing; Scheduling (production processes); Stateless protocol; Tree (set theory); Bounded function; Flexibility (engineering); State (computer science); Mathematical optimization; Algorithm","authors":[{"name":"Madhukar Anand","is_ca":false},{"name":"Sebastian Fischmeister","is_ca":true},{"name":"Insup Lee","is_ca":false},{"name":"Linh Thi Xuan Phan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01754041747987675,"gpt":0.2605352374045286,"spread":0.2429948199246518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005533947,0.0008637094,0.001018658,0.00140474,0.000530574,0.0008485707,0.00136691,0.0006861764,0.00240964],"category_scores_gemma":[0.0127104,0.0003921698,0.0006602171,0.001757625,0.0007341663,0.001957834,0.0006342947,0.0006609761,0.0002120693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002163293,"about_ca_system_score_gemma":0.002554934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007935148,"about_ca_topic_score_gemma":0.005814188,"domain_scores_codex":[0.9979284,0.0008662295,0.00008637675,0.0001336743,0.0007853334,0.0001999672],"domain_scores_gemma":[0.9850557,0.01154259,0.0008314954,0.0008875931,0.001320772,0.0003617641],"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.0009185657,0.000261625,0.001061008,0.000138432,0.00005580691,0.00002146371,0.00005786764,0.941886,0.00181421,0.00646563,0.0008078546,0.04651164],"study_design_scores_gemma":[0.00003400595,0.0001918283,0.0002233265,0.000003846137,0.00002132274,0.000007387637,0.0000106129,0.997006,0.000613923,0.001757867,0.0001253571,0.000004530466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4894238,0.001754831,0.4973191,0.0003556659,0.0001820537,0.0003549398,0.0004038129,0.002611526,0.007594381],"genre_scores_gemma":[0.9347498,0.0004500889,0.06359716,0.00003636985,0.00003213919,0.00009702077,0.0002672852,0.0001240711,0.0006461312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007935148,"threshold_uncertainty_score":0.02926666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}